Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
From MaRDI portal
(Redirected from Publication:4389239)
Recommendations
Cited in
(57)- A numerical solution using an adaptively preconditioned Lanczos method for a class of linear systems related with the fractional Poisson equation
- A new method for accelerating Arnoldi algorithms for large scale eigenproblems
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
- Preconditioning eigenvalues and some comparison of solvers
- On restarting the tensor infinite Arnoldi method
- Thick-restart Lanczos method for electronic structure calculations
- A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations
- A vertex-centred finite volume method for the 3D multi-term time and space fractional Bloch-Torrey equation with fractional Laplacian
- Parametric dominant pole algorithm for parametric model order reduction
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B)
- Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices
- Convergence of Arnoldi's method for generalized eigenvalue problems
- A short note on a generalization of the Givens transformation
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair
- Alternative correction equations in the Jacobi-Davidson method
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- A Jacobi-Davidson method for two-real-parameter nonlinear eigenvalue problems arising from delay-differential equations.
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- Parallel solution of large-scale eigenvalue problem for master equation in protein folding dynamics
- Fast iterative interior eigensolver for millions of atoms
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- Two-grid and multiple-grid Arnoldi for eigenvalues
- Efficient parallel solution to large-size sparse eigenproblems with block FSAI preconditioning.
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- The eigenvalues slicing library (EVSL): algorithms, implementation, and software
- A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides.
- Polynomial preconditioned Arnoldi with stability control
- Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel
- An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems
- Limited‐memory polynomial methods for large‐scale matrix functions
- A new algorithm for computing eigenpairs of matrices
- A sketch-and-select Arnoldi process
- A subspace method for large-scale trace ratio problems
- Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair
- On deflated CGW methods for solving nonsymmetric positive definite linear systems
- On a shrink-and-expand technique for symmetric block eigensolvers
- EigenWave: an optimal O(N) method for computing eigenvalues and eigenvectors by time-filtering the wave equation
- Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation
- A key to choose subspace size in implicitly restarted Arnoldi method
- An iterative method for single and vertically stacked semiconductor quantum dots simulation
- A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
- A new restarting method in the Lanczos algorithm for generalized eigenvalue problem
- Block Krylov-Schur method for large symmetric eigenvalue problems
- An inexact Krylov-Schur algorithm for the unitary eigenvalue problem
- A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix
- Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B)
This page was built for publication: Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389239)
