Iterative methods for solving linear systems [ Livre] / Anne, Greenbaum
Langue: Anglais ; de l'oeuvre originale, Anglais.Publication : SIAM, 1997, PhiladelphiaDescription : 1 vol. (XV-220 p.)ISBN: 089871396X.Collection: Frontiers in applied mathematicsClassification: 518 Analyse numérique, modélisation et calcul scientifiqueRésumé: Much recent research has concentrated on the efficient solution of large sparse or structured linear systems using iterative methods. A language loaded with acronyms for a thousand different algorithms has developed, and it is often difficult even for specialists to identify the basic principles involved. Here is a book that focuses on the analysis of iterative methods. The author includes the most useful algorithms from a practical point of view and discusses the mathematical principles behind their derivation and analysis. Several questions are emphasized throughout: Does the method converge? If so, how fast? Is it optimal, among a certain class? If not, can it be shown to be near-optimal? The answers are presented clearly, when they are known, and remaining important open questions are laid out for further study..Sujet - Nom commun: Itération (mathématiques) | Equations, Systèmes d' -- Solutions numériques| Current location | Call number | Status | Notes | Date due | Barcode |
|---|---|---|---|---|---|
| ENS Rennes - Bibliothèque Mathématiques | 518 GRE (Browse shelf) | Available | 518 Analyse numérique, modélisation et calcul scientifique | 00003305 |
Much recent research has concentrated on the efficient solution of large sparse or structured linear systems using iterative methods. A language loaded with acronyms for a thousand different algorithms has developed, and it is often difficult even for specialists to identify the basic principles involved. Here is a book that focuses on the analysis of iterative methods. The author includes the most useful algorithms from a practical point of view and discusses the mathematical principles behind their derivation and analysis. Several questions are emphasized throughout: Does the method converge? If so, how fast? Is it optimal, among a certain class? If not, can it be shown to be near-optimal? The answers are presented clearly, when they are known, and remaining important open questions are laid out for further study.