Difference between revisions of "Dictionary:Back substitution"

From SEG Wiki
Jump to: navigation, search
(Prepared the page for translation)
(Marked this version for translation)
 
Line 3: Line 3:
 
</translate>
 
</translate>
 
{{lowercase}}
 
{{lowercase}}
<translate>{{#category_index:B|back substitution}}
+
<translate><!--T:1-->
 +
{{#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>
 
</translate>

Latest revision as of 07:05, 24 January 2017

Other languages:
English • ‎español • ‎русский • ‎中文


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.