Practical improvement of the divide-and-conquer eigenvalue algorithms
DOI10.1007/BF02241709zbMATH Open0756.65053OpenAlexW135489932MaRDI QIDQ1192014FDOQ1192014
Publication date: 27 September 1992
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02241709
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
clusteringeigenvaluesnumerical experimentsnumerical stabilitycomputational costeffectivenesssymmetric tridiagonal matrixdivide-and-conquer algorithms
Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Title not available (Why is that?)
- Rank-one modification of the symmetric eigenproblem
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
- Simple algorithms for approximating all roots of a polynomial with real roots
- Title not available (Why is that?)
- Iteration schemes for the divide-and-conquer eigenvalue solver
- Eigenvalues of Symmetric Tridiagonal Matrices: A Fast, Accurate and Reliable Algorithm
- An $O(N^2 )$ Method for Computing the Eigensystem of $N \times N$ Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
Cited In (9)
- Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem
- Title not available (Why is that?)
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Improved global algorithms for maximal eigenpair
- Iteration schemes for the divide-and-conquer eigenvalue solver
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Nearly optimal refinement of real roots of a univariate polynomial
- Improving the solution of the symmetric eigenvalue problem and an extension
- Computations with quasiseparable polynomials and matrices
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)
