E-Books →Greenbaum A Iterative methods for solving linear systems 1997
Published by: Emperor2011 on 11-01-2023, 18:39 | 0
Greenbaum A Iterative methods for solving linear systems 1997 | 10.78 MB
English | 236 Pages
Title: Iterative Methods for Solving Linear Systems (Frontiers in Applied Mathematics, Series Number 17)
Author: Anne Greenbaum
Year: 1987
Description:
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.
DOWNLOAD:
https://rapidgator.net/file/5feb09a46e17f8657a6800e04f8689c0/Greenbaum_A._Iterative_methods_for_solving_linear_systems_1997.rar
https://uploadgig.com/file/download/41F1B8bbe0F0d840/Greenbaum_A._Iterative_methods_for_solving_linear_systems_1997.rar
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.
DOWNLOAD:
https://rapidgator.net/file/5feb09a46e17f8657a6800e04f8689c0/Greenbaum_A._Iterative_methods_for_solving_linear_systems_1997.rar
https://uploadgig.com/file/download/41F1B8bbe0F0d840/Greenbaum_A._Iterative_methods_for_solving_linear_systems_1997.rar
Related News
-
{related-news}