Divide and conquer algorithms for the bandsymmetric eigenvalue problem

DOI10.1016/0167-8191(92)90059-GzbMATH Open0761.65025MaRDI QIDQ1201941FDOQ1201941

Authors: Peter Arbenz 

Publication date: 17 January 1993

Published in: Parallel Computing (Search for Journal in Brave)

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
• Publication:3484260

zbMATH Keywords

symmetric eigenvalue problembandwidth reductioncomparison of algorithmsEISPACKdivide and conquer algorithmshared memory computer

Mathematics Subject Classification ID

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

Cited In (12)

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

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)