Effect of the CYBER 205 on the choice of method for solving the eigenvalue problem \((A-\lambda M)x=0\)

DOI10.1016/0377-0427(86)90023-3zbMath0635.65032OpenAlexW1997217764MaRDI QIDQ1097638

Bahram Nour-Omid, Beresford N. Parlett, Jostein Roald Natvig

Publication date: 1986

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(86)90023-3

zbMATH Keywords

comparison of methodseigenvalue problemLanczos methodvectorizationvector computersubspace iterationlarge, sparse, symmetric matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (1)

Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:

Cites Work

• The use of a refined error bound when updating eigenvalues of tridiagonals
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Matrix eigensystem routines. EISPACK guide extension
• Lanczos versus subspace iteration for solution of eigenvalue problems
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• The Lanczos Algorithm with Selective Orthogonalization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Effect of the CYBER 205 on the choice of method for solving the eigenvalue problem \((A-\lambda M)x=0\)