Abstract
Simple and robust formulas of the conjugate direction method for symmetric matrices and of the symmetrized conjugate gradient method for nonsymmetric matrices have been constructed. These methods were compared with robust forms of the conjugate gradient method and the Craig method using test problems. It is shown that stability for the round-off error can be attained when recurrent variants of the methods are used. The most reliable and efficient method for symmetric signdefinite and indefinite matrices appears to be the method of conjugate residuals. For nonsymmetric matrices, the best results have been obtained by the method of symmetrized conjugate gradients. These two methods are recommended for writing standard programs. A reliable criterion has also been constructed for the termination of the calculation on reaching background values due to the round-off errors.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. A. Samarskii and E. S. Nikolaev, Numerical Methods for Grid Equations (Nauka, Fizmatlit, Moscow, 1978; Birkhäuser, Basel, 1989).
A. A. Boltnev, N. N. Kalitkin, and O. A. Kacher, “Logarithmically convergent relaxation count,” Dokl. Math. 72, 806–809 (2005).
N. N. Kalitkin and A. A. Belov, “Analogue of the Richardson method for logarithmically converging time marching,” Dokl. Math. 88, 596–600 (2013).
D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra (Fizmatlit, Moscow, 1960; W. H. Freeman, San Francisco, 1963).
N. S. Bakhvalov, N. P. Zhidkov, and G. M. Kobel’kov, Numerical Methods (Nauka, Moscow, 1987) [in Russian].
A. A. Samarskii and A. V. Gulin, Numerical Methods (Nauka, Moscow, 1989) [in Russian].
E. Craig, “The N-step iteration procedures,” J. Math. Phys. 34, 64–73 (1955).
A. A. Abramov, V. I. Ul’yanova, and L. F. Yukhno, “On the application of Craig’s method to the solution of linear equations with inexact initial data,” Comput. Math. Math. Phys. 42, 1693–1700 (2002).
N. N. Kalitkin and L. V. Kuz’mina, “Improved form of the conjugate gradient method,” Math. Models Comput. Simul. 4, 68–81 (2012).
N. N. Kalitkin and L. V. Kuz’mina, “On the Craig method convergence for linear algebraic systems,” Math. Models Comput. Simul. 4, 509–526 (2012).
N. N. Kalitkin and L. V. Kuz’mina, “Improved forms of iterative methods for systems of linear algebraic equations,” Dokl. Math. 88, 489–494 (2013).
N. N. Kalitkin and L. V. Kuz’mina, “One-step truncated gradient descents,” Math. Models Comput. Simul. 7, 13–23 (2015).
Y. Saad, Iterative Methods for Sparse Linear Systems (SIAM, 2003).
Matlab Documentation Center. http://www.mathworks.com/help/matlab/index.html
G. Korn and T. Korn, Mathematical Handbook for Scientists and Engineers (McGraw-Hill, New York, 1968).
E. A. Alshina, A. A. Boltnev, and O. A. Kacher, “Empirical improvement of elementary gradient methods,” Mat. Model. 17 (6), 43–57 (2005).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.A. Belov, N.N. Kalitkin, L.V. Kuzmina, 2015, published in Matematicheskoe Modelirovanie, 2015, Vol. 27, No. 9, pp. 110–136.
Rights and permissions
About this article
Cite this article
Belov, A.A., Kalitkin, N.N. & Kuzmina, L.V. Comparing robust forms of iterative methods of conjugate directions. Math Models Comput Simul 8, 155–174 (2016). https://doi.org/10.1134/S2070048216020046
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S2070048216020046