Results 1  10
of
110
QMR: a QuasiMinimal Residual Method for NonHermitian Linear Systems
, 1991
"... ... In this paper, we present a novel BCGlike approach, the quasiminimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a lookahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from t ..."
Abstract

Cited by 354 (26 self)
 Add to MetaCart
... In this paper, we present a novel BCGlike approach, the quasiminimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a lookahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported.
An Implementation of the LookAhead Lanczos Algorithm for NonHermitian Matrices Part I
, 1991
"... ..."
Krylov Projection Methods For Model Reduction
, 1997
"... This dissertation focuses on efficiently forming reducedorder models for large, linear dynamic systems. Projections onto unions of Krylov subspaces lead to a class of reducedorder models known as rational interpolants. The cornerstone of this dissertation is a collection of theory relating Krylov p ..."
Abstract

Cited by 149 (3 self)
 Add to MetaCart
(Show Context)
This dissertation focuses on efficiently forming reducedorder models for large, linear dynamic systems. Projections onto unions of Krylov subspaces lead to a class of reducedorder models known as rational interpolants. The cornerstone of this dissertation is a collection of theory relating Krylov projection to rational interpolation. Based on this theoretical framework, three algorithms for model reduction are proposed. The first algorithm, dual rational Arnoldi, is a numerically reliable approach involving orthogonal projection matrices. The second, rational Lanczos, is an efficient generalization of existing Lanczosbased methods. The third, rational power Krylov, avoids orthogonalization and is suited for parallel or approximate computations. The performance of the three algorithms is compared via a combination of theory and examples. Independent of the precise algorithm, a host of supporting tools are also developed to form a complete modelreduction package. Techniques for choosing the matching frequencies, estimating the modeling error, insuring the model's stability, treating multipleinput multipleoutput systems, implementing parallelism, and avoiding a need for exact factors of large matrix pencils are all examined to various degrees.
Iterative Solution of Linear Systems
 Acta Numerica
, 1992
"... this paper is as follows. In Section 2, we present some background material on general Krylov subspace methods, of which CGtype algorithms are a special case. We recall the outstanding properties of CG and discuss the issue of optimal extensions of CG to nonHermitian matrices. We also review GMRES ..."
Abstract

Cited by 108 (8 self)
 Add to MetaCart
this paper is as follows. In Section 2, we present some background material on general Krylov subspace methods, of which CGtype algorithms are a special case. We recall the outstanding properties of CG and discuss the issue of optimal extensions of CG to nonHermitian matrices. We also review GMRES and related methods, as well as CGlike algorithms for the special case of Hermitian indefinite linear systems. Finally, we briefly discuss the basic idea of preconditioning. In Section 3, we turn to Lanczosbased iterative methods for general nonHermitian linear systems. First, we consider the nonsymmetric Lanczos process, with particular emphasis on the possible breakdowns and potential instabilities in the classical algorithm. Then we describe recent advances in understanding these problems and overcoming them by using lookahead techniques. Moreover, we describe the quasiminimal residual algorithm (QMR) proposed by Freund and Nachtigal (1990), which uses the lookahead Lanczos process to obtain quasioptimal approximate solutions. Next, a survey of transposefree Lanczosbased methods is given. We conclude this section with comments on other related work and some historical remarks. In Section 4, we elaborate on CGNR and CGNE and we point out situations where these approaches are optimal. The general class of Krylov subspace methods also contains parameterdependent algorithms that, unlike CGtype schemes, require explicit information on the spectrum of the coefficient matrix. In Section 5, we discuss recent insights in obtaining appropriate spectral information for parameterdependent Krylov subspace methods. After that, 4 R.W. Freund, G.H. Golub and N.M. Nachtigal
A restarted GMRES method augmented with eigenvectors
 SIAM J. Matrix Anal. Appl
, 1995
"... Abstract. The GMRES method for solving nonsymmetric linear equations is generally used with restarting to reduce storage and orthogonalization costs. Restarting slows down the convergence. However, it is possible to save some important information at the time of the restart. It is proposed that appr ..."
Abstract

Cited by 86 (11 self)
 Add to MetaCart
(Show Context)
Abstract. The GMRES method for solving nonsymmetric linear equations is generally used with restarting to reduce storage and orthogonalization costs. Restarting slows down the convergence. However, it is possible to save some important information at the time of the restart. It is proposed that approximate eigenvectors corresponding to a few of the smallest eigenvalues be formed and added to the subspace for GMRES. The convergence can be much faster, and the minimum residual property is retained. Key words. GMRES, conjugate gradient, Krylov subspaces, iterative methods, nonsymmetric systems AMS subject classifications. 65F15, 15A18
An Implementation Of The Qmr Method Based On Coupled TwoTerm Recurrences
, 1992
"... . Recently, the authors have proposed a new Krylov subspace iteration, the quasiminimal residual algorithm (QMR), for solving nonHermitian linear systems. In the original implementation of the QMR method, the Lanczos process with lookahead is used to generate basis vectors for the underlying Kryl ..."
Abstract

Cited by 70 (14 self)
 Add to MetaCart
. Recently, the authors have proposed a new Krylov subspace iteration, the quasiminimal residual algorithm (QMR), for solving nonHermitian linear systems. In the original implementation of the QMR method, the Lanczos process with lookahead is used to generate basis vectors for the underlying Krylov subspaces. In the Lanczos algorithm, these basis vectors are computed by means of threeterm recurrences. It has been observed that, in finite precision arithmetic, vector iterations based on threeterm recursions are usually less robust than mathematically equivalent coupled twoterm vector recurrences. This paper presents a lookahead algorithm that constructs the Lanczos basis vectors by means of coupled twoterm recursions. Implementation details are given, and the lookahead strategy is described. A new implementation of the QMR method, based on this coupled twoterm algorithm, is proposed. A simplified version of the QMR algorithm without lookahead is also presented, and the specia...
Reducedorder modeling techniques based on Krylov subspaces and their use in circuit simulation
, 1998
"... ..."
(Show Context)
Recent computational developments in Krylov subspace methods for linear systems
 NUMER. LINEAR ALGEBRA APPL
, 2007
"... Many advances in the development of Krylov subspace methods for the iterative solution of linear systems during the last decade and a half are reviewed. These new developments include different versions of restarted, augmented, deflated, flexible, nested, and inexact methods. Also reviewed are metho ..."
Abstract

Cited by 51 (12 self)
 Add to MetaCart
Many advances in the development of Krylov subspace methods for the iterative solution of linear systems during the last decade and a half are reviewed. These new developments include different versions of restarted, augmented, deflated, flexible, nested, and inexact methods. Also reviewed are methods specifically tailored to systems with special properties such as special forms of symmetry and those depending on one or more parameters.
Krylov space methods on statespace control models
 Circuits, Systems, and Signal Processing
, 1994
"... We give an overview of various Lanczos/Krylov space methods and how they are being used for solving certain problems in Control Systems Theory based on statespace models. The matrix methods used are based on Krylov sequences and are closely related to modern iterative methods for standard matrix pr ..."
Abstract

Cited by 47 (4 self)
 Add to MetaCart
We give an overview of various Lanczos/Krylov space methods and how they are being used for solving certain problems in Control Systems Theory based on statespace models. The matrix methods used are based on Krylov sequences and are closely related to modern iterative methods for standard matrix problems such as sets of linear equations and eigenvalue calculations. We show how these methods can be applied to problems in Control Theory such as controllability, observability and model reduction. All the methods are based on the use of statespace models, which may be very sparse and of high dimensionality. For example, we show how one may compute an approximate solution to a Lyapunov equation arising from discretetime linear dynamic system with a large sparse system matrix by the use of the Arnoldi Algorithm, and so obtain an approximate Grammian matrix. This has applications in model reduction. The close relation between the matrix Lanczos algorithm and the algebraic structure of linear control systems is also explored. 1
ABLE: an adaptive block Lanczos method for nonHermitian eigenvalue problems
 SIAM Journal on Matrix Analysis and Applications
, 1999
"... Abstract. This work presents an adaptive block Lanczos method for largescale nonHermitian Eigenvalue problems (henceforth the ABLE method). The ABLE method is a block version of the nonHermitian Lanczos algorithm. There are three innovations. First, an adaptive blocksize scheme cures (near) break ..."
Abstract

Cited by 43 (4 self)
 Add to MetaCart
(Show Context)
Abstract. This work presents an adaptive block Lanczos method for largescale nonHermitian Eigenvalue problems (henceforth the ABLE method). The ABLE method is a block version of the nonHermitian Lanczos algorithm. There are three innovations. First, an adaptive blocksize scheme cures (near) breakdown and adapts the blocksize to the order of multiple or clustered eigenvalues. Second, stopping criteria are developed that exploit the semiquadratic convergence property of the method. Third, a wellknown technique from the Hermitian Lanczos algorithm is generalized to monitor the loss of biorthogonality and maintain semibiorthogonality among the computed Lanczos vectors. Each innovation is theoretically justified. Academic model problems and real application problems are solved to demonstrate the numerical behaviors of the method. Key words. method nonHermitian matrices, eigenvalue problem, spectral transformation, Lanczos AMS subject classifications. 65F15, 65F10 PII. S0895479897317806