Abstract
In this section we consider a variant of Gaussian elimination in which the coefficient matrix A is written as a product of a lower triangular matrix L and an upper triangular or echelon matrix U. The main advantage of this method over the straightforward algorithm is that it is considerably more economical when we need to solve several systems of the form Ax = b with the same A but different right-hand sides b. An additional, though less practical, advantage is that we gain some insight into the structure of Gaussian elimination in terms of matrix products.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
The original version of this chapter was revised. An erratum can be found at https://doi.org/10.1007/978-0-8176-8325-2_9
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Schay, G. (2012). Numerical Methods. In: A Concise Introduction to Linear Algebra. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8325-2_8
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8325-2_8
Published:
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-8324-5
Online ISBN: 978-0-8176-8325-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)