Divide and conquer algorithms for the bandsymmetric eigenvalue problem
From MaRDI portal
Publication:1201941
DOI10.1016/0167-8191(92)90059-GzbMath0761.65025MaRDI QIDQ1201941
Publication date: 17 January 1993
Published in: Parallel Computing (Search for Journal in Brave)
symmetric eigenvalue problemcomparison of algorithmsbandwidth reductionEISPACKdivide and conquer algorithmshared memory computer
Related Items (7)
SuperDC: Superfast Divide-And-Conquer Eigenvalue Decomposition With Improved Stability for Rank-Structured Matrices ⋮ Gaussian quadrature for matrix valued functions on the real line ⋮ Orthogonal matrix polynomials and applications ⋮ Fast Computation of Spectral Projectors of Banded Matrices ⋮ Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points ⋮ Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications ⋮ An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
Uses Software
This page was built for publication: Divide and conquer algorithms for the bandsymmetric eigenvalue problem
