Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices

DOI10.1016/0168-9274(93)90100-6zbMath0782.65058OpenAlexW2019610696MaRDI QIDQ685967

Brigitte Vital, Bernard Philippe

Publication date: 6 October 1993

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(93)90100-6

zbMATH Keywords

algorithmLanczos methodgeneralized eigenvalue problemReductionParallel implementationssymmetric sparse matricesGivens transformationHarwell-Boeing set of test matricesmultisectioning

Mathematics Subject Classification ID

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

Related Items (2)

An algorithm for the generalized symmetric tridiagonal eigenvalue problem ⋮ Linear parameterized inverse eigenvalue problem of bisymmetric matrices

Uses Software

• zeroin

Cites Work

• Unnamed Item
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• Tridiagonalization of a symmetric band matrix
• Banded Eigenvalue Solvers on Vector Machines
• How to Implement the Spectral Transformation
• A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
• The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
• Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
• Solution of Sparse Indefinite Systems of Linear Equations

This page was built for publication: Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices