Recursive approximation of the dominant eigenspace of an indefinite matrix
From MaRDI portal
Recommendations
- Recursive Calculation of Dominant Singular Subspaces
- scientific article; zbMATH DE number 3985949
- A note on the recursive calculation of dominant singular subspaces
- Recursive approach to assigning eigenstructure in linear systems
- A recursive algorithm of estimating the bounds of the eigenvalues of a symmetric matrix
- Eigenvalue approximation
- scientific article; zbMATH DE number 3934320
- scientific article; zbMATH DE number 69567
- scientific article; zbMATH DE number 1559276
- On a recursive inverse eigenvalue problem
Cites work
- A fast algorithm for updating and downsizing the dominant kernel principal components
- Matrix algorithms. Vol. 2: Eigensystems
- Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- The numerically stable reconstruction of Jacobi matrices from spectral data
- Two-way bidiagonalization scheme for downdating the singular-value decomposition
Cited in
(4)- Rank-revealing decomposition of symmetric indefinite matrices via block anti-triangular factorization
- A block algorithm for computing antitriangular factorizations of symmetric matrices
- Numerical issues in computing the antitriangular factorization of symmetric indefinite matrices
- An algorithm for solving the indefinite least squares problem with equality constraints
This page was built for publication: Recursive approximation of the dominant eigenspace of an indefinite matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433957)
