On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
From MaRDI portal
Publication:4889928
Recommendations
- A new method for accelerating Arnoldi algorithms for large scale eigenproblems
- A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- scientific article; zbMATH DE number 991429
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A Restarted GMRES Method Augmented with Eigenvectors
- A Simultaneous Iteration Algorithm for Real Matrices
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- Complex shift and invert strategies for real matrices
- Computing interior eigenvalues of large matrices
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Lanczos versus subspace iteration for solution of eigenvalue problems
- Numerical methods for large eigenvalue problems
- Numerical solution of large nonsymmetric eigenvalue problems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Sparse matrix test problems
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(67)- Thick-restart Lanczos method for electronic structure calculations
- A numerical method for determining monotonicity and convergence rate in iterative learning control
- Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
- Two-grid and multiple-grid Arnoldi for eigenvalues
- A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems
- Restarting the nonsymmetric Lanczos algorithm for eigenvalues and linear equations including multiple right-hand sides
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- On restarting the tensor infinite Arnoldi method
- A preconditioned Krylov technique for global hydrodynamic stability analysis of large-scale compressible flows
- Composite Arnoldi-Newton methods for large nonsymmetric eigenvalue problems
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- The Arnoldi eigenvalue iteration with exact shifts can fail
- Krylov-Schur-type restarts for the two-sided Arnoldi method
- A sketch-and-select Arnoldi process
- Alternative correction equations in the Jacobi-Davidson method
- Computing the smallest singular triplets of a large matrix
- A compact heart iteration for low-rank approximations of large matrices
- FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B)
- Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices
- Implicitly restarted Arnoldi methods and subspace iteration
- Restarted block-GMRES with deflation of eigenvalues
- A thick-restarted block Arnoldi algorithm with modified Ritz vectors for large eigenproblems
- The implicit application of a rational filter in the RKS method
- An Arnoldi-Inout algorithm for computing PageRank problems
- A reformulated Arnoldi algorithm for non-classically damped eigenvalue problems
- Arnoldi method for large quaternion right eigenvalue problem
- A key to choose subspace size in implicitly restarted Arnoldi method
- Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations
- Further analysis of the Arnoldi process for eigenvalue problems
- Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- A cross-product approach for low-rank approximations of large matrices
- The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
- A new method for accelerating Arnoldi algorithms for large scale eigenproblems
- A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices
- Augmented block Householder Arnoldi method
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- An implicit filter for rational Krylov using core transformations
- Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm
- Multiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems
- Convergence of Arnoldi's method for generalized eigenvalue problems
- Polynomial preconditioned Arnoldi with stability control
- A new algorithm for computing eigenpairs of matrices
- A global Arnoldi method for large non-Hermitian eigenproblems with special applications to multiple eigenproblems
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- A preprocessed multi-step splitting iteration for computing PageRank
- Global linear instability analysis of thermal convective flow using the linearized lattice Boltzmann method
- A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
- A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- Bifurcation analysis of steady Rayleigh–Bénard convection in a cubical cavity with conducting sidewalls
- A new restarting method in the Lanczos algorithm for generalized eigenvalue problem
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- Computing interior eigenvalues of large sparse symmetric matrices
- Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B)
- Deflated GMRES for systems with multiple shifts and multiple right-hand sides
- A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
- Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems
- An inexact Krylov-Schur algorithm for the unitary eigenvalue problem
- Compact rational Krylov methods for nonlinear eigenvalue problems
- Efficient Arnoldi-type algorithms for rational eigenvalue problems arising in fluid-solid systems
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
- Harmonic projection methods for large non-symmetric eigenvalue problems
This page was built for publication: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889928)
