Iterative solution of linear systems in the 20th century

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:123

Review

Saad, Y ; van der Vorst, HA

关键词: ADI;    Krylov subspace methods;    multigrid;    polynomial acceleration;    preconditioning;    relaxation methods;    SOR;    sparse approximate inverse;   

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

来源: Elsevier

【 摘 要 】

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.

【 授权许可】

Free