Overall Algorithm and Definitions Currently:direct method only (later:iterative methods) ●General idea: Generate upper triangular system("forward elimination") Easily calculate unknowns in reverse order ("backward substitution") ."Pivot row"=current one being processed "pivot"=diagonal element of pivot row Steps applied to RHS as well.(RHS:Right hand side vector. Copyright©2011，NA⊙Yin Last Modification:Oct.2011 5Overall Algorithm and Definitions • Currently: direct method only (later: iterative methods) • General idea: ∗ Generate upper triangular system (”forward elimination”) ∗ Easily calculate unknowns in reverse order (”backward substitution”) • ”Pivot row” = current one being processed ”pivot” = diagonal element of pivot row • Steps applied to RHS as well. (RHS: Right hand side vector.) Copyright c 2011, NAYin Last Modification: Oct. 2011 5