Practical improvement of the divide-and-conquer eigenvalue algorithms

DOI10.1007/BF02241709MaRDI QIDQ1192014zbMATH OpenOpenAlexFDO

Authors Dario A. Bini, Victor Y. Pan

Publication date 27 September 1992

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02241709

zbMATH Keywords

clusteringeigenvaluesnumerical experimentsnumerical stabilitycomputational costeffectivenesssymmetric tridiagonal matrixdivide-and-conquer algorithms

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Minisymposium 4 : Parallele Algorithmen in Der Numerischen Algebra
• Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem
• An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
• Publication:3484260
• scientific article; zbMATH DE number 741157

Cites work

• scientific article; zbMATH DE number 432841 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3942890 (Why is no real title available?)
• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
• Eigenvalues of Symmetric Tridiagonal Matrices: A Fast, Accurate and Reliable Algorithm
• Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
• Iteration schemes for the divide-and-conquer eigenvalue solver
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• Rank-one modification of the symmetric eigenproblem
• Simple algorithms for approximating all roots of a polynomial with real roots

Cited in

(9)

• A quasi-random approach to matrix spectral analysis
• Improving the solution of the symmetric eigenvalue problem and an extension
• Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
• Efficient parallel factorization and solution of structured and unstructured linear systems
• Improved global algorithms for maximal eigenpair
• Computations with quasiseparable polynomials and matrices
• Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem
• Nearly optimal refinement of real roots of a univariate polynomial
• Iteration schemes for the divide-and-conquer eigenvalue solver

This page was built for publication: Practical improvement of the divide-and-conquer eigenvalue algorithms

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