Iterative eigenvalue algorithms based on convergent splittings

DOI10.1016/0021-9991(75)90119-9zbMath0324.65014OpenAlexW2163865753MaRDI QIDQ1224853

Axel Ruhe

Publication date: 1975

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9991(75)90119-9

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Super-matrix methods, An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Preconditioned iterative methods for the large sparse symmetric eigenvalue problem, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Relaxation techniques in the iterative '2\(\times 2'\) algorithm, A new splitting to solve a large Hermitian eigenproblem, On preconditionad iterative methods for solving (A-lambdaB)x=0, Preconditioning eigenvalues and some comparison of solvers, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
• 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
• The Direct Solution of the Discrete Poisson Equation on a Rectangle
• Use of Fast Direct Methods for the Efficient Numerical Solution of Nonseparable Elliptic Equations
• Computational Variants of the Lanczos Method for the Eigenproblem
• The method of conjugate gradients used in inverse iteration