A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
type: Item
instance of: scholarly article
title: A simultaneous coordinate relaxation algorithm for large, sparse matrix eigenvalue problems
zbMATH Open document ID: 0447.65014
DOI: 10.1016/0021-9991(79)90152-9
author: Richard C. Raffenetti
published in: Journal of Computational Physics
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 3700112
zbMATH Keywords: large, sparse matrix eigenvalue problems
zbMATH Keywords: simultaneous coordinate relaxation
zbMATH Keywords: test matrices
zbMATH Keywords: several most dominant eigenvectors
MaRDI profile type: Publication
full work available at URL: 0021-9991(79)90152-9
OpenAlex ID: W1983537157
cites work: Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices
cites work: The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
cites work: Computational aspects of F. L. Bauer's simultaneous iteration method
cites work: The eigenvalue problem \((A-\lambda B)x = 0\) for symmetric matrices of high order
cites work: 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices
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 3700112