Iterative methods for linear systems: following the meandering way

Iterative methods for linear systems: following the meandering way

Solving a linear system of equations is one of the easiest computational tasks imaginable, but when the matrix is very large, the algorithms we learned in linear algebra class take too long, and we need to use a different type of method. In this homework assignment, we investigate these iterative me...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computing in science & engineering 2006-07, Vol.8 (4), p.74-80
1. Verfasser: O'Leary, D.P.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Computation
Convergence
Equations
Gaussian processes
Iterative algorithms
Iterative methods
Jacobian matrices
Linear algebra
Linear systems
Mathematical analysis
Mesh generation
PCG
Sparse matrices
Tasks
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Solving a linear system of equations is one of the easiest computational tasks imaginable, but when the matrix is very large, the algorithms we learned in linear algebra class take too long, and we need to use a different type of method. In this homework assignment, we investigate these iterative methods.
ISSN:1521-9615
1558-366X
DOI:10.1109/MCSE.2006.72