On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
From MaRDI portal
Publication:3984476
Recommendations
Cited in
(26)- On the Lambert \(w\) function
- Minisymposium 4 : Parallele Algorithmen in Der Numerischen Algebra
- A homotopy algorithm for a symmetric generalized eigenproblem
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values.
- A Parallel Algorithm for the Nonsymmetric Eigenvalue Problem
- A numerical comparison of methods for solving secular equations
- scientific article; zbMATH DE number 4155755 (Why is no real title available?)
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
- A mathematical biography of Danny C. Sorensen
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- Note on a rank-one modification of the singular value decomposition
- On computer-algebra procedures that check for common eigenvectors or invariant subspaces
- Circumscribed ellipsoid algorithm for fixed-point problems
- A case against a divide and conquer approach to the nonsymmetric eigenvalue problem
- The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices
- A Stable Divide and Conquer Algorithm for the Unitary Eigenproblem
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I
- Convergence of algorithms for finding eigenvectors
- An Orthogonal High Relative Accuracy Algorithm for the Symmetric Eigenproblem
- Iteration schemes for the divide-and-conquer eigenvalue solver
- The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II
- A divide-and-conquer implementation of the discrete variational DFT method for large molecular and solid systems
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- A divide and conquer method for unitary and orthogonal eigenproblems
This page was built for publication: On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984476)
