Back Substitution

Pronunciation: /bæk ˈsʌb.stɪˌtut.ʃən/ Explain

Back substitution is an algorithm for solving a linear system that has been reduced to row-eschelon form, which is an upper triangular matrix:

Since the rows in a matrix represent equations, and the columns represent variables in those equations, the matrix
can be expressed as the linear system
The value of z is known, so 3 can be substituted into the equation just above it:
Now that the values of y and z are known, these two values can be substituted into the first equation:
So the solution to the linear system is:

References

1. McAdams, David E.. All Math Words Dictionary, back substitution. 2nd Classroom edition 20150108-4799968. pg 23. Life is a Story Problem LLC. January 8, 2015. Buy the book

McAdams, David E. Back Substitution. 1/25/2019. All Math Words Encyclopedia. Life is a Story Problem LLC. http://www.allmathwords.org/en/b/backsubstitution.html.

Revision History

12/21/2018: Reviewed and corrected IPA pronunication. (McAdams, David E.)
6/19/2018: Removed broken links, updated license, implemented new markup. (McAdams, David E.)
11/20/2008: Initial version. (McAdams, David E.)

All Math Words Encyclopedia is a service of Life is a Story Problem LLC.