For Hermitian matrices, the optimal block subspace expansion that minimizes all principal angles to a target invariant subspace is explicitly characterized, with convergence bounds and computable Rayleigh-Ritz versions.
Jia, Refined iterative algorithms based on Arnoldi’s process for unsymmetric eigenproblems, Linear Algebra Appl., 259 (1997), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Block subspace expansions for eigenvalues and eigenvectors approximation
For Hermitian matrices, the optimal block subspace expansion that minimizes all principal angles to a target invariant subspace is explicitly characterized, with convergence bounds and computable Rayleigh-Ritz versions.