A new splitting to solve a large Hermitian eigenproblem

DOI10.1016/0021-9991(87)90005-2zbMath0617.65029OpenAlexW2067738445MaRDI QIDQ1822204

C. M. M. Nex

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0021-9991(87)90005-2

zbMATH Keywords

Lanczos methodpreconditionerinverse iterationiteration processsmallest eigenvalueslarge Hermitian eigenproblemLarge symmetric eigenvalue problems

Mathematics Subject Classification ID

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

Related Items (2)

A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices ⋮ Large-scale complex eigenvalue problems

Uses Software

• HSL
• nag

Cites Work

• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Iterative eigenvalue algorithms based on convergent splittings
• Lanczos versus subspace iteration for solution of eigenvalue problems

This page was built for publication: A new splitting to solve a large Hermitian eigenproblem