Estimates of Eigenvalues for Iterative Methods

DOI10.2307/2008724zbMath0675.65021OpenAlexW4243969409MaRDI QIDQ3830410

Gene H. Golub, Mark Kent

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2008724

zbMATH Keywords

Lanczos methoditerative methodsNumerical resultseigenvalue estimationChebyshev algorithmModified momentspreconditioned Chebyshev semi-iterative method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items

Estimates in quadratic formulas, A hybrid iterative method for symmetric positive definite linear systems, Adaptive Richardson iteration based on Leja points, An adaptive Richardson iteration method for indefinite linear systems, Estimating the largest singular values of large sparse matrices via modified moments, A condition for the superiority of the (2, 2)-step methods over the related Chebyshev method, The superiority of a new type (2,2)-step iterative method over the related Chebyshev method, Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?, Adaptive polynomial preconditioning for Hermitian indefinite linear systems, Modified moments for indefinite weight functions, Approximating dominant singular triplets of large sparse matrices via modified moments

Cites Work

• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• Modified moments and Gaussian quadratures
• An algorithm for Gaussian quadrature given modified moments
• Bounds for the error of linear systems of equations using the theory of moments
• On Generating Orthogonal Polynomials
• Some Modified Matrix Eigenvalue Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item