A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems

DOI10.1016/0898-1221(93)90057-3zbMath0792.65025OpenAlexW2066862117WikidataQ126743306 ScholiaQ126743306MaRDI QIDQ1324370

Zhenyue Zhang

Publication date: 31 July 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90057-3

zbMATH Keywords

convergencenumerical experimentsparallel algorithmrank-one modificationparallel iterative methodextreme eigenpairlarge symmetric tridiagonal matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• The QR and QL algorithms for symmetric matrices
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem

This page was built for publication: A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems