Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
From MaRDI portal
Recommendations
- An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
- Block tridiagonalization of "effectively" sparse symmetric matrices
- An O(N^2 ) Method for Computing the Eigensystem of N \times N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach
- Parallel block tridiagonalization of real symmetric matrices
- Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
Cited in
(12)- Block reduction of matrices to condensed forms for eigenvalue computations
- Equivalence of fourth order boundary value problems and matrix eigenvalue problems
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- Improving formulas for the eigenvalues of finite block-Toeplitz tridiagonal matrices
- Block eigenvectors obtained by block Hotelling deflation
- Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations
- Parallel block tridiagonalization of real symmetric matrices
- Matrix representations of fourth-order boundary value problems with coupled or mixed boundary conditions
- An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
- Block tridiagonalization of "effectively" sparse symmetric matrices
- Graph signal processing on dynamic graphs based on temporal-attention product
- On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix
This page was built for publication: Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4442472)
