Practical improvement of the divide-and-conquer eigenvalue algorithms
From MaRDI portal
Publication:1192014
DOI10.1007/BF02241709zbMath0756.65053MaRDI QIDQ1192014
Pan, Victor Y., Dario Andrea Bini
Publication date: 27 September 1992
Published in: Computing (Search for Journal in Brave)
clustering; eigenvalues; numerical experiments; numerical stability; effectiveness; symmetric tridiagonal matrix; computational cost; divide-and-conquer algorithms
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65Y20: Complexity and performance of numerical algorithms
Related Items
Improving the solution of the symmetric eigenvalue problem and an extension, Computations with quasiseparable polynomials and matrices, Efficient parallel factorization and solution of structured and unstructured linear systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple algorithms for approximating all roots of a polynomial with real roots
- Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- Rank-one modification of the symmetric eigenproblem
- Iteration schemes for the divide-and-conquer eigenvalue solver
- An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- Eigenvalues of Symmetric Tridiagonal Matrices: A Fast, Accurate and Reliable Algorithm
