# Difference between revisions of "Dictionary:Back substitution"

(removed cat) |
Juanseb0219 (talk | contribs) (Prepared the page for translation) |
||

Line 1: | Line 1: | ||

− | {{lowercase}}{{#category_index:B|back substitution}} | + | <languages/> |

+ | <translate> | ||

+ | </translate> | ||

+ | {{lowercase}} | ||

+ | <translate>{{#category_index:B|back substitution}} | ||

When simultaneous equations can be expressed as <math> A\cdot X=B </math>, where <math> A </math> is a triangular matrix and <math> X </math> and <math> B </math> are vectors, the solution for the last (or first) value becomes trivial. Back-substitution then involves successively replacing the last (or first) value in the equations for the other elements so that their solutions also become trivial. | When simultaneous equations can be expressed as <math> A\cdot X=B </math>, where <math> A </math> is a triangular matrix and <math> X </math> and <math> B </math> are vectors, the solution for the last (or first) value becomes trivial. Back-substitution then involves successively replacing the last (or first) value in the equations for the other elements so that their solutions also become trivial. | ||

+ | </translate> |

## Revision as of 07:05, 24 January 2017

When simultaneous equations can be expressed as , where is a triangular matrix and and are vectors, the solution for the last (or first) value becomes trivial. Back-substitution then involves successively replacing the last (or first) value in the equations for the other elements so that their solutions also become trivial.