Results 1  10
of
22
GMRES with deflated restarting
 SIAM J. Sci. Comput
"... Abstract. A modification is given of the GMRES iterative method for nonsymmetric systems of linear equations. The new method deflates eigenvalues using Wu and Simon’s thick restarting approach. It has the efficiency of implicit restarting, but is simpler and does not have the same numerical concerns ..."
Abstract

Cited by 38 (7 self)
 Add to MetaCart
Abstract. A modification is given of the GMRES iterative method for nonsymmetric systems of linear equations. The new method deflates eigenvalues using Wu and Simon’s thick restarting approach. It has the efficiency of implicit restarting, but is simpler and does not have the same numerical concerns. The deflation of small eigenvalues can greatly improve the convergence of restarted GMRES. Also, it is demonstrated that using harmonic Ritz vectors is important, because then the whole subspace is a Krylov subspace that contains certain important smaller subspaces.
An ArnoldiSchur Algorithm for Large Eigenproblems
, 2000
"... Sorensen's iteratively restarted Arnoldi algorithm is one of the most successful and flexible methods for finding a few eigenpairs of a large matrix. However, the need to preserve structure of the Arnoldi decomposition, on which the algorithm is based, restricts the range of transformations that ..."
Abstract

Cited by 36 (2 self)
 Add to MetaCart
Sorensen's iteratively restarted Arnoldi algorithm is one of the most successful and flexible methods for finding a few eigenpairs of a large matrix. However, the need to preserve structure of the Arnoldi decomposition, on which the algorithm is based, restricts the range of transformations that can be performed on it. In consequence, it is difficult to deflate converged Ritz vectors from the decomposition. Moreover, the potential forward instability of the implicit QR algorithm can cause unwanted Ritz vectors to persist in the computation. In this paper we introduce a generalized Arnoldi decomposition that solves both problems in a natural and efficient manner.
Deflated iterative methods for linear equations with multiple righthand sides
, 2004
"... Abstract. A new approach is discussed for solving large nonsymmetric systems of linear equations with multiple righthand sides. The first system is solved with a deflated GMRES method that generates eigenvector information at the same time that the linear equations are solved. Subsequent systems ar ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
Abstract. A new approach is discussed for solving large nonsymmetric systems of linear equations with multiple righthand sides. The first system is solved with a deflated GMRES method that generates eigenvector information at the same time that the linear equations are solved. Subsequent systems are solved by combining restarted GMRES with a projection over the previously determined eigenvectors. This approach offers an alternative to block methods, and it can also be combined with a block method. It is useful when there are a limited number of small eigenvalues that slow the convergence. An example is given showing significant improvement for a problem from quantum chromodynamics. The second and subsequent righthand sides are solved much quicker than without the deflation. This new approach is relatively simple to implement and is very efficient compared to other deflation methods.
PRIMME: PReconditioned Iterative Multimethod Eigensolver. http://www.cs.wm.edu/∼andreas/software
, 2006
"... This paper describes the PRIMME software package for solving large, sparse Hermitian standard eigenvalue problems. The difficulty and importance of these problems have increased over the years, necessitating the use of preconditioning and near optimally converging iterative methods. However, the com ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
This paper describes the PRIMME software package for solving large, sparse Hermitian standard eigenvalue problems. The difficulty and importance of these problems have increased over the years, necessitating the use of preconditioning and near optimally converging iterative methods. However, the complexity of tuning or even using such methods has kept them outside the reach of many users. Responding to this problem we have developed PRIMME, a comprehensive package that brings stateoftheart methods from “bleeding edge ” to production, with the best possible robustness, efficiency, and a flexible, yet highly usable interface that requires minimal or no tuning. We describe: (1) the PRIMME multimethod framework that implements a variety of algorithms, including the near optimal methods GD+k and JDQMR; (2) a host of algorithmic innovations and implementation techniques that endow the software with its robustness and efficiency; (3) a multilayer interface that captures our experience and addresses the needs of both expert and end users.
DEFLATED AND RESTARTED SYMMETRIC LANCZOS METHODS FOR EIGENVALUES AND LINEAR EQUATIONS WITH MULTIPLE Righthand Sides
, 2008
"... A deflated restarted Lanczos algorithm is given for both solving symmetric linear equations and computing eigenvalues and eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Meanwhile, the deflating from the presence of the eigenvectors allows the linear equat ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
A deflated restarted Lanczos algorithm is given for both solving symmetric linear equations and computing eigenvalues and eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Meanwhile, the deflating from the presence of the eigenvectors allows the linear equations to generally have good convergence in spite of the restarting. Some reorthogonalization is necessary to control roundoff error, and several approaches are discussed. The eigenvectors generated while solving the linear equations can be used to help solve systems with multiple righthand sides. Experiments are given with large matrices from quantum chromodynamics that have many righthand sides.
Multiple explicitly restarted Arnoldi method for solving large eigenproblems
 SIAM Journal on scientific computing SJSC, Volume 27, Number
, 2005
"... In this paper we propose a new approach for calculating some eigenpairs of large sparse nonHermitian matrices. This method, called Multiple Explicitly Restarted Arnoldi (MERAM), is particularly well suited for environments that combine different parallel programming paradigms. This technique is bas ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
In this paper we propose a new approach for calculating some eigenpairs of large sparse nonHermitian matrices. This method, called Multiple Explicitly Restarted Arnoldi (MERAM), is particularly well suited for environments that combine different parallel programming paradigms. This technique is based on a multiple use of Explicitly Restarted Arnoldi method and improves its convergence. This technique is implemented and tested on a distributed enviromnment consisting of two interconnected parallel machines. MERAM technique is compared to Explicitly Restarted Arnoldi (ERAM) method, and one can notice that the accelaration of convergence is improved effectively. In some cases, more than one twofold improvement can be seen in MERAM results. We also implemented MERAM on a cluster of workstations. According to our experiments, MERAM converges better than Explicitly Restarted Block Arnoldi method and, for some matrices, more quickly than PARPACK package which implements Implicitly Restarted Arnoldi Method. Key words. Large eigenproblem, Arnoldi method, explicit restarting, parallel programming, asynchronous communication, heterogeneous environment.
Thickrestart Lanczos method for electronic structure calculations
 J. Comput. Phys
, 1999
"... This paper describes two recent innovations related to the classic Lanczos method for eigenvalue problems, namely the thickrestart technique and dynamic restarting schemes. Combining these two new techniques we are able to implement an ecient eigenvalue problem solver. This paper will demonstrat ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper describes two recent innovations related to the classic Lanczos method for eigenvalue problems, namely the thickrestart technique and dynamic restarting schemes. Combining these two new techniques we are able to implement an ecient eigenvalue problem solver. This paper will demonstrate its eectiveness on one particular class of problems for which this method is well suited: linear eigenvalue problems generated from nonselfconsistent electronic structure calculations. 1 Introduction The Lanczos method is a very simple and yet eective algorithm for nding extreme eigenvalues of large matrices. Since it only needs to access the matrix through matrixvector multiplications, the user has the exibility of choosing the most appropriate matrixvector multiplication scheme to reduce computer memory usage and the computation time. There is never any need to explicitly store the full matrix which can be prohibitively large in many electronic structure calculations. There ar...
Deflated GMRES for systems with multiple shifts and multiple righthand sides
, 2007
"... Abstract. We consider solution of multiply shifted systems of nonsymmetric linear equations, possibly also with multiple righthand sides. First, for a single righthand side, the matrix is shifted by several multiples of the identity. Such problems arise in a number of applications, including latti ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We consider solution of multiply shifted systems of nonsymmetric linear equations, possibly also with multiple righthand sides. First, for a single righthand side, the matrix is shifted by several multiples of the identity. Such problems arise in a number of applications, including lattice quantum chromodynamics where the matrices are complex and nonHermitian. Some Krylov iterative methods such as GMRES and BiCGStab have been used to solve multiply shifted systems for about the cost of solving just one system. Restarted GMRES can be improved by deflating eigenvalues for matrices that have a few small eigenvalues. We show that a particular deflated method, GMRESDR, can be applied to multiply shifted systems. In quantum chromodynamics, it is common to have multiple righthand sides with multiple shifts for each righthand side. We develop a method that efficiently solves the multiple righthand sides by using a deflated version of GMRES and yet keeps costs for all of the multiply shifted systems close to those for one shift. An example is given showing this can be extremely effective with a quantum chromodynamics matrix.