4 Direct Methods for Solving Linear Systems
Linear systems are the commonest problem of scientific computation; most of the later methods of this course (interpolation, splines, least squares, implicit methods for differential equations) end by solving one. This section treats direct methods, which give the exact solution in a finite number of steps if the arithmetic is exact. Their accuracy in finite-digit arithmetic depends on how they are organized, and the main practical lesson is the need for pivoting.
4.1 Linear systems and matrices
4.2 Gaussian elimination and backward substitution
4.3 Pivoting strategies
4.4 Matrix factorization
4.5 Special types of matrices
4.6 Practice Problems
4.2 Gaussian elimination and backward substitution
4.3 Pivoting strategies
4.4 Matrix factorization
4.5 Special types of matrices
4.6 Practice Problems
Questions on this section
Stuck on something here? Ask below and it stays attached to this topic.