Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
From MaRDI portal
Publication:4389239
DOI10.1137/S1064827596304162zbMath0924.65028WikidataQ56457286 ScholiaQ56457286MaRDI QIDQ4389239
Andreas Stathopoulos, Yousef Saad, Kesheng Wu
Publication date: 12 May 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
eigenvaluenumerical examplesLanczos methodpreconditioningdeflationDavidson methodArnoldi methodimplicit restarting
Related Items (48)
A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity ⋮ A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices ⋮ A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix ⋮ FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B) ⋮ A short note on a generalization of the Givens transformation ⋮ A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix ⋮ A vertex-centred finite volume method for the 3D multi-term time and space fractional Bloch-Torrey equation with fractional Laplacian ⋮ A Jacobi-Davidson method for two-real-parameter nonlinear eigenvalue problems arising from delay-differential equations ⋮ A new restarting method in the Lanczos algorithm for generalized eigenvalue problem ⋮ Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair ⋮ Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices ⋮ Parallel solution of large-scale eigenvalue problem for master equation in protein folding dynamics ⋮ Fast iterative interior eigensolver for millions of atoms ⋮ A new algorithm for computing eigenpairs of matrices ⋮ Alternative correction equations in the Jacobi-Davidson method ⋮ Block Krylov-Schur method for large symmetric eigenvalue problems ⋮ Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems ⋮ TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems ⋮ An inexact Krylov-Schur algorithm for the unitary eigenvalue problem ⋮ Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Parametric dominant pole algorithm for parametric model order reduction ⋮ Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel ⋮ Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning ⋮ An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems ⋮ 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 ⋮ Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems ⋮ 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) ⋮ Two-Grid and Multiple-Grid Arnoldi for Eigenvalues ⋮ Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation ⋮ Convergence of Arnoldi's method for generalized eigenvalue problems ⋮ A numerical solution using an adaptively preconditioned Lanczos method for a class of linear systems related with the fractional Poisson equation ⋮ A key to choose subspace size in implicitly restarted Arnoldi method ⋮ A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems ⋮ Thick-restart Lanczos method for electronic structure calculations ⋮ The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software ⋮ A new method for accelerating Arnoldi algorithms for large scale eigenproblems ⋮ New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem ⋮ A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc ⋮ Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix ⋮ Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides ⋮ Polynomial Preconditioned Arnoldi with Stability Control ⋮ Preconditioning eigenvalues and some comparison of solvers ⋮ An iterative method for single and vertically stacked semiconductor quantum dots simulation
Uses Software
This page was built for publication: Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
