Abstract:
One gives a survey of methods and programs for solving large sparse spectral problems based on the Lanczos algorithm. Practically all the important works on this topic are reflected in this survey. One also considers applications of the variants of the Lanczos method to the solution of symmetric indefinite systems of linear equations and to a series of other problems of linear algebra.
This publication is cited in the following 6 articles:
Tatiana Martynova, Galina Muratova, Pavel Oganesyan, Olga Shtein, “The Numerical Solution of Large-Scale Generalized Eigenvalue Problems Arising from Finite-Element Modeling of Electroelastic Materials”, Symmetry, 15:1 (2023), 171
Zhanshan Yang, Xilan Liu, “Roundoff Error Analysis of an Algorithm Based on Householder Bidiagonalization for Total Least Squares Problems”, Mathematics, 9:20 (2021), 2550
M. F. Sukhinin, “On the calculation of eigenvalues of a symmetric matrix”, Comput. Math. Math. Phys., 45:2 (2005), 189–193
M. F. Sukhinin, “Calculation of bounds for the spectrum of a symmetric matrix”, Comput. Math. Math. Phys., 42:11 (2002), 1555–1559
Kh. D. Ikramov, “Tridiagonal forms of complex symmetric and persymmetric matrices”, Comput. Math. Math. Phys., 34:11 (1994), 1463–1467
V. L. Druskin, L. A. Knizhnerman, “Error bounds in the simple Lanczos procedure for computing functions of
symmetric matrices and eigenvalues”, U.S.S.R. Comput. Math. Math. Phys., 31:7 (1991), 20–30
Citation in format AMSBIB
Contact us: