A refined subspace iteration algorithm for large sparse eigenproblems
From MaRDI portal
Publication:1964385
Recommendations
- scientific article; zbMATH DE number 2069268
- A subspace method for large-scale eigenvalue optimization
- Subspace iteration methods with preconditioning for eigenvalues of very large matrices
- Approximating matrix eigenvalues by subspace iteration with repeated random sparsification
- Subspace iterative methods for eigenvalue problems
- scientific article; zbMATH DE number 997682
- A variant of the subspace iteration algorithm for generalized eigenproblems
- scientific article; zbMATH DE number 1138094
- scientific article; zbMATH DE number 3992791
- Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
Cited in
(32)- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Subspace and Lanczos sparse eigen-solvers for finite element structural and electromagnetic applications
- scientific article; zbMATH DE number 1138094 (Why is no real title available?)
- A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems.
- Orthogonal iterations on companion-like pencils
- A Hessenberg-type algorithm for computing PageRank problems
- Residuals of refined projection methods for large matrix eigenproblems
- Inverse subspace bi-iteration and bi-Newton methods for computing spectral projectors
- scientific article; zbMATH DE number 2069268 (Why is no real title available?)
- On expansion of search subspaces for large non-Hermitian eigenproblems
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- A refined Jacobi-Davidson method and its correction equation
- Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- scientific article; zbMATH DE number 1894984 (Why is no real title available?)
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- A simple iterative algorithm for generating selected eigenspaces of large matrices
- On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems
- Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems
- Using cross-product matrices to compute the SVD
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- scientific article; zbMATH DE number 3868501 (Why is no real title available?)
- Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
- Corrigendum: Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
- A new shift strategy for the implicitly restarted refined harmonic Lanczos method
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- scientific article; zbMATH DE number 1819977 (Why is no real title available?)
- Acceleration of the subspace iteration method by selective repeated inverse iteration
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
This page was built for publication: A refined subspace iteration algorithm for large sparse eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964385)
