Iterative solution of linear systems in the 20th century

被引:277
作者
Saad, Y
van der Vorst, HA
机构
[1] Univ Utrecht, Dept Math, NL-3508 TA Utrecht, Netherlands
[2] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN USA
关键词
ADI; Krylov subspace methods; multigrid; polynomial acceleration; preconditioning; relaxation methods; SOR; sparse approximate inverse;
D O I
10.1016/S0377-0427(00)00412-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:1 / 33
页数:33
相关论文
共 208 条
[1]  
Anderson E., 1989, International Journal of High Speed Computing, V1, P73, DOI 10.1142/S0129053389000056
[2]  
[Anonymous], NUMERICAL LINEAR ALG
[3]  
[Anonymous], 1960, SBORNIK
[4]  
[Anonymous], 1958, THESIS U TORONTO
[5]  
[Anonymous], 1935, P ROYAL SOC LONDON S
[6]  
[Anonymous], 1955, MTAC
[7]  
[Anonymous], 1981, APPL ITERATIVE METHO
[9]  
Axelsson O., 1972, BIT (Nordisk Tidskrift for Informationsbehandling), V12, P443, DOI 10.1007/BF01932955
[10]   A GENERAL INCOMPLETE BLOCK-MATRIX FACTORIZATION METHOD [J].
AXELSSON, O .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1986, 74 :179-190