Divide and conquer algorithms for the bandsymmetric eigenvalue problem

DOI10.1016/0167-8191(92)90059-GMaRDI QIDQ1201941zbMATH OpenFDO

Authors Peter Arbenz

Publication date 17 January 1993

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(92)90059-G

zbMATH Keywords

bandwidth reductioncomparison of algorithmsdivide and conquer algorithmEISPACKshared memory computersymmetric eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Review text

A block version of the divide and conquer algorithm of \textit{J. J. M. Cuppen} [Numer. Math. 36, 177-195 (1981; Zbl 0431.65022)] for the symmetric eigenvalue problem is derived. Tests on a shared memory computer are reported, where the new algorithm is compared to the bandwidth reduction and full matrix algorithms of EISPACK.

Recommendations

• scientific article; zbMATH DE number 278836
• Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem
• An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
• Publication:4493228
• scientific article; zbMATH DE number 4155755

Cited in

(13)

• On multisplitting methods for band matrices
• Gaussian quadrature for matrix valued functions on the real line
• Orthogonal matrix polynomials and applications
• An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
• Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications
• scientific article; zbMATH DE number 176408 (Why is no real title available?)
• scientific article; zbMATH DE number 2067006 (Why is no real title available?)
• A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
• A fast spectral divide‐and‐conquer method for banded matrices
• SuperDC: superfast divide-and-conquer eigenvalue decomposition with improved stability for rank-structured matrices
• scientific article; zbMATH DE number 278836 (Why is no real title available?)
• Fast computation of spectral projectors of banded matrices
• Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points

Describes a project that uses

Uses Software

• EISPACK

This page was built for publication: Divide and conquer algorithms for the bandsymmetric eigenvalue problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201941)