4.7 Review

Iterative solution of linear systems in the 20th century

Journal

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
Volume 123, Issue 1-2, Pages 1-33

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-0427(00)00412-X

Keywords

ADI; Krylov subspace methods; multigrid; polynomial acceleration; preconditioning; relaxation methods; SOR; sparse approximate inverse

Ask authors/readers for more resources

This paper sketches the main research developments in the area of iterative methods for solving linear systems during the 20th century. Although iterative methods for solving linear systems find their origin in the early 19th century (work by Gauss), the field has seen an explosion of activity spurred by demand due to extraordinary technological advances in engineering and sciences. The past five decades have been particularly rich in new developments, ending with the availability of large toolbox of specialized algorithms for solving the very large problems which arise in scientific and industrial computational models. As in any other scientific area, research in iterative methods has been a journey characterized by a chain of contributions building on each other. It is the aim of this paper not only to sketch the most significant of these contributions during the past century, but also to relate them to one another. (C) 2000 Elsevier Science B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available