Pages that link to "Item:Q4671846"

The following pages link to The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors (Q4671846):

Displaying 31 items.

• A generalization of Saad's bound on harmonic Ritz vectors of Hermitian matrices (Q252619) (← links)
• The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems (Q286164) (← links)
• A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems (Q351474) (← links)
• A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices (Q433291) (← links)
• Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method (Q477157) (← links)
• The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs (Q629534) (← links)
• Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces (Q729850) (← links)
• A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm (Q814247) (← links)
• A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems (Q966098) (← links)
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm (Q1301301) (← links)
• A new shift strategy for the implicitly restarted refined harmonic Lanczos method (Q1696462) (← links)
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices (Q1862016) (← links)
• A refined Arnoldi type method for large scale eigenvalue problems (Q1943090) (← links)
• Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems (Q2174791) (← links)
• Computing the smallest singular triplets of a large matrix (Q2211056) (← links)
• The least squares and line search in extracting eigenpairs in Jacobi-Davidson method (Q2216482) (← links)
• Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems (Q2255719) (← links)
• Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems (Q2306411) (← links)
• A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems (Q2372934) (← links)
• On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems (Q2434933) (← links)
• Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils (Q2450893) (← links)
• An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets (Q2511197) (← links)
• Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair (Q2676809) (← links)
• Hybrid iterative refined restarted Lanczos bidiagonalization methods (Q2679823) (← links)
• Total and selective reuse of Krylov subspaces for the resolution of sequences of nonlinear structural problems (Q2952230) (← links)
• A note on harmonic Ritz values and their reciprocals (Q3090783) (← links)
• Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems (Q5071436) (← links)
• Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning (Q5161770) (← links)
• On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations (Q5230610) (← links)
• An invert-free Arnoldi method for computing interior eigenpairs of large matrices (Q5297939) (← links)
• The Convergence of Harmonic Ritz Vectors and Harmonic Ritz Values, Revisited (Q5346746) (← links)