Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications
From MaRDI portal
Publication:2218929
Recommendations
- scientific article; zbMATH DE number 3844934
- scientific article; zbMATH DE number 3843059
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
- scientific article; zbMATH DE number 554763
- Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
Cites work
- scientific article; zbMATH DE number 3144516 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- Computing the Minimum Fill-In is NP-Complete
- Direct Methods for Sparse Linear Systems
- Divide and conquer algorithms for the bandsymmetric eigenvalue problem
- LAPACK Users' Guide
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- Rank-one modification of the symmetric eigenproblem
- Some Modified Matrix Eigenvalue Problems
- The behavior of eigenvalues and singular values under perturbations of restricted rank
This page was built for publication: Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218929)