On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
From MaRDI portal
Publication:3984476
DOI10.1137/0728087zbMath0743.65039OpenAlexW2091859203MaRDI QIDQ3984476
Ping Tak Peter Tang, Danny C. Sorensen
Publication date: 27 June 1992
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0728087
algorithmsymmetric eigenvalue problemdivide-and-conquer strategyNumerical examplesorthogonality of eigenvectorsrank one updatesimulated extra precision
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50) Parallel numerical computation (65Y05)
Related Items (16)
On computing accurate singular values and eigenvalues of matrices with acyclic graphs ⋮ The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I ⋮ The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices ⋮ A numerical comparison of methods for solving secular equations ⋮ Note on a rank-one modification of the singular value decomposition ⋮ A mathematical biography of Danny C. Sorensen ⋮ A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix ⋮ Circumscribed ellipsoid algorithm for fixed-point problems ⋮ A case against a divide and conquer approach to the nonsymmetric eigenvalue problem ⋮ A homotopy algorithm for a symmetric generalized eigenproblem ⋮ The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II ⋮ An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures ⋮ Superfast Divide-and-Conquer Method and Perturbation Analysis for Structured Eigenvalue Solutions ⋮ On the Lambert \(w\) function ⋮ A divide-and-conquer implementation of the discrete variational DFT method for large molecular and solid systems ⋮ Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems
Uses Software
This page was built for publication: On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
