Numerical Solution of Systems of Algebraic Equations

Jean-Pierre Corriou
Additional contact information
Jean-Pierre Corriou: University of Lorraine

Chapter Chapter 5 in Numerical Methods and Optimization, 2021, pp 149-187 from Springer

Abstract: Abstract The solution of systems of linear or nonlinear equations is searched for by many different techniques. First, linear systems considered under matrix form are solved by Gauss and Gauss–Jordan algorithms. Then, techniques for particular matrices are exposed, such as LDL T factorization, Cholesky decomposition, and singular value decomposition. The case of least squares for linear overdetermined systems, iterative techniques for large systems such as Jacobi, Gauss–Seidel, and the case of tridiagonal systems are treated in detail. The solution of nonlinear systems is given by Newton–Raphson’s method and optimization techniques are mentioned. These latter occupy specific chapter 9 in the optimization part of the book. All the methods are illustrated by significant numerical examples.

Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-89366-8_5

Ordering information: This item can be ordered from
http://www.springer.com/9783030893668

DOI: 10.1007/978-3-030-89366-8_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().