Gallivan, Kyle A.; Sameh, Ahmed H.; Zlatev, Zahari Comparison of ten methods for the solution of large and sparse linear algebraic systems. (English) Zbl 1032.65030 Dimov, Ivan (ed.) et al., Numerical methods and applications. 5th international conference, NMA 2002, Borovets, Bulgaria, August 20-24, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2542, 24-35 (2003). Summary: The treatment of systems of linear algebraic equations is very often the most time-consuming part when large-scale applications arising in different fields of science and engineering are to be handled on computers. These systems can be very large, but in the most of the cases they are sparse (i.e. many of the elements in their coefficient matrices are zeros). Therefore, it is very important to select fast, robust and sufficiently accurate methods for the solution of large and sparse systems of linear algebraic equations. Tests with ten well-known methods have been carried out. Most of the methods are preconditioned conjugate gradient-type methods. Two important issues are mainly discussed: (i) the problem of finding automatically a good preconditioner and (ii) the development of robust and reliable stopping criteria. Numerical examples, which illustrate the efficiency of the developed algorithms for finding the preconditioner and for stopping the iterations when the required accuracy is achieved, are presented. The performance of the different methods for solving systems of linear algebraic equations is compared. Several conclusions are drawn, the main of them being the fact that it is necessary to include several different methods for the solution of large and sparse systems of linear algebraic equations in software designed to be used in the treatment of large-scale scientific and engineering problems.For the entire collection see [Zbl 1011.00035]. Cited in 3 Documents MSC: 65F10 Iterative numerical methods for linear systems 65F35 Numerical computation of matrix norms, conditioning, scaling 65F50 Computational methods for sparse matrices 65Y20 Complexity and performance of numerical algorithms Keywords:comparison of methods; numerical examples; large and sparse systems; conjugate gradient-type methods; preconditioner; stopping criteria; performance PDFBibTeX XMLCite \textit{K. A. Gallivan} et al., Lect. Notes Comput. Sci. 2542, 24--35 (2003; Zbl 1032.65030) Full Text: Link