Block tridiagonalization of "effectively" sparse symmetric matrices
From MaRDI portal
Recommendations
- Parallel block tridiagonalization of real symmetric matrices
- Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
- An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems
- A Hybrid Tridiagonalization Algorithm for Symmetric Sparse Matrices
- 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)- Optimal block-tridiagonalization of matrices for coherent charge transport
- Block triangularization of skew-symmetric matrices
- A Hybrid Tridiagonalization Algorithm for Symmetric Sparse Matrices
- Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations
- Parallel block tridiagonalization of real symmetric matrices
- Computing the block triangular form of a sparse matrix
- Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices
- Graph signal processing on dynamic graphs based on temporal-attention product
- A block diagonalization based algorithm for the determinants of block k-tridiagonal matrices
This page was built for publication: Block tridiagonalization of "effectively" sparse symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461203)