Difference between revisions of "Dictionary:Back substitution"

From SEG Wiki
Jump to: navigation, search
m
Line 1: Line 1:
 
{{lowercase}}{{#category_index:B|back substitution}}
 
{{lowercase}}{{#category_index:B|back substitution}}
When simultaneous equations can be expressed as <b>A</b>[[File:Middot.gif]]<b>X</b>=<b>B</b>, where <b>A</b> is a triangular matrix and <b>X</b> and <b>B</b> 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.
  
 
[[Category:Pages with unformatted equations]]
 
[[Category:Pages with unformatted equations]]

Revision as of 15:31, 28 October 2015

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.