A new splitting to solve a large Hermitian eigenproblem
type: Item
instance of: scholarly article
title: A new splitting to solve a large Hermitian eigenproblem
zbMATH Open document ID: 0617.65029
DOI: 10.1016/0021-9991(87)90005-2
author: C. M. M. Nex
published in: Journal of Computational Physics
publication date: 1987-01-01T00:00:00Z
review text: Large symmetric eigenvalue problems where a principal minor can be found whose smallest eigenvalues are good approximations to the smallest eigenvalues of the large problem are considered. Some experiments are performed with an iteration process where this principal minor is a preconditioner, and they indicate that this type of iterations may be faster than either inverse iteration or Lanczos.
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 4001316
zbMATH Keywords: large Hermitian eigenproblem
zbMATH Keywords: Lanczos method
zbMATH Keywords: Large symmetric eigenvalue problems
zbMATH Keywords: smallest eigenvalues
zbMATH Keywords: iteration process
zbMATH Keywords: preconditioner
zbMATH Keywords: inverse iteration
reviewed by: Axel Ruhe
describes a project that uses: HSL
describes a project that uses: nag
MaRDI profile type: Publication
full work available at URL: 0021-9991(87)90005-2
OpenAlex ID: W2067738445
cites work: Iterative eigenvalue algorithms based on convergent splittings
cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations
cites work: Q5564283
cites work: Lanczos versus subspace iteration for solution of eigenvalue problems
cites work: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
description: scientific article; zbMATH DE number 4001316