Content deleted Content added
→Background: Added more information, with a source Tag: Disambiguation links added |
→Background: Improved a citation |
||
Line 12:
== Background ==
A [[system of linear equations]] <math>A{\bold x} = {\bold b}</math> consists of a known [[Matrix (mathematics)|matrix]] <math>A</math> and a known [[Vector (mathematics)|vector]] <math>{\bold b}</math>. To solve the system is to find the value of the unknown vector <math>{\bold x}</math>.<ref name="vorst03" /><ref>{{Citation |title=Matrix Analysis and Applied Linear Algebra |url=https://web.archive.org/web/20040610221137/http://www.matrixanalysis.com/Chapter1.pdf |work= |pages=1{{endash}}40 |access-date=2023-12-18 |archive-url= |chapter=Linear equations |chapter-url=https://web.archive.org/web/20040610221137/http://www.matrixanalysis.com/Chapter1.pdf |place=3600 Market Street, 6th Floor Philadelphia, PA 19104-2688 |publisher=SIAM |doi=10.1137/1.9780898719512.ch1}}</ref> A direct method for solving a system of linear equations is to take the inverse of the matrix <math>A</math>, then calculate <math>\bold x = A^{-1}\bold b</math>. However, computing the inverse is computationally expensive. Hence, iterative methods are commonly used. Iterative methods begin with a guess <math>\bold x^{(0)}</math>, and on each iteration the guess is improved. Once the difference between successive guesses is sufficiently small, the method has converged to a solution.<ref>{{cite web|title=Iterative Methods for Linear Systems|publisher=[[Mathworks]]|url=https://au.mathworks.com/help/matlab/math/iterative-methods-for-linear-systems.html}}</ref><ref>https://www.cis.upenn.edu/~cis5150/cis515-12-sl5.pdf</ref>
As with other methods for solving matrix-vector equations, the CGS method can be used to find solutions to multi-variable [[optimisation problems]], such as [[power-flow study|power-flow analysis]], [[hyperparameter optimisation]], and [[facial recognition]].<ref>https://optimization.cbe.cornell.edu/index.php?title=Conjugate_gradient_methods</ref>
| |||