Abstract
A new optimization algorithm for computing the largest eigenvalue of a real symmetric matrix is considered. The algorithm is based on a sequence of plane rotations increasing the sum of the matrix entries. It is proved that the algorithm converges linearly and it is shown that it may be regarded as a relaxation method for the Rayleigh quotient. Bibliography: 6 titles.
Similar content being viewed by others
References
J. H. Wilkinson, The Algebraic Eigenvalue Problem [Russian translation], Nauka, Moscow (1970).
D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra, Lan’, St.Petersburg (2002).
B. N. Parlett, The Symmetric Eigenvalue Problem [Russian translation], Mir, Moscow (1983).
Kh. D. Ikramov, The Nonsymmetric Eigenvalue Problem, Nauka, Moscow (1991).
J. Demmel, Applied Numerical Linear Algebra [Russian translation], Mir, Moscow (2001).
A. N. Borzykh, “Efficient localization of eigenvalues of symmetric matrices of high order,” in: Scientific Session of MIFI-2006, Vol. 7, Moscow (2000), pp. 159–160.
Author information
Authors and Affiliations
Corresponding author
Additional information
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 346, 2007, pp. 5–20.
Rights and permissions
About this article
Cite this article
Borzykh, A.N. Convergence analysis of an optimization algorithm for computing the largest eigenvalue of a symmetric matrix. J Math Sci 150, 1917–1925 (2008). https://doi.org/10.1007/s10958-008-0105-1
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10958-008-0105-1