A case against a divide and conquer approach to the nonsymmetric eigenvalue problem

DOI10.1016/0168-9274(93)90101-VzbMath0782.65052OpenAlexW2098739181MaRDI QIDQ685968

E. R. Jessup

Publication date: 6 October 1993

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(93)90101-v

zbMATH Keywords

updatingStabilityparallel implementationsdivide and conquer methodHessenberg eigenproblemmatrix tearingnonsymmetric eigenvalue problemroots of a complex rational equationtridiagonal eigenproblem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05)

Related Items

Numerical reconstruction of spring-mass system from two nondisjoint spectra ⋮ On the inverse eigenproblem for symmetric and nonsymmetric arrowhead matrices ⋮ Additive preconditioning, eigenspaces, and the inverse iteration ⋮ General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗ ⋮ Extreme spectra realization by nonsymmetric tridiagonal and nonsymmetric arrow matrices

Uses Software

• Matlab
• EISPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential interpolation: Theory and numerical algorithms
• Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices
• Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2)
• Matrix eigensystem routines - EISPACK guide. 2nd ed
• Rank-one modification of the symmetric eigenproblem
• Block reduction of matrices to condensed forms for eigenvalue computations
• Solving the Symmetric Tridiagonal Eigenvalue Problem on the Hypercube
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• A Multiprocessor Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
• On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
• Solving Eigenvalue Problems of Real Nonsymmetric Matrices with Real Homotopies
• Improving the Accuracy of Inverse Iteration
• An implementation of a divide and conquer algorithm for the unitary eigen problem
• Algorithm 710: FORTRAN subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to general tridiagonal form
• A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
• Error Analysis of Update Methods for the Symmetric Eigenvalue Problem
• Some Modified Matrix Eigenvalue Problems