Results 1  10
of
1,899
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 380 (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.
A Flexible InnerOuter Preconditioned GMRES Algorithm
, 1993
"... We present a variant of the GMRES lgorithm which l]ows changes in the prcconditioning at every step. There arc many possible applications o the new lgorithm some o which arc briefly discussed. In particular, a result o the flexibility o the new variant is that any iterative method can bc used as a p ..."
Abstract

Cited by 341 (31 self)
 Add to MetaCart
We present a variant of the GMRES lgorithm which l]ows changes in the prcconditioning at every step. There arc many possible applications o the new lgorithm some o which arc briefly discussed. In particular, a result o the flexibility o the new variant is that any iterative method can bc used as a prcconditioncr. For example, the standard GMRES lgorithm itself can bc used as a prcconditioncr, as can CGNR (or CGNE) the conjugate gradient method applied to the normal equations. However, the more appealing utilization o the method is in conjunction with relaxation techniques, possibly multilevel techniques. The possibility o changing prcconditioncrs may bc exploited to develop efficient iterative methods and to enhance robustness. A cw numcricM experiments arc reported to illustrate this act.
PETSc users manual
 ANL95/11  Revision 2.1.0, Argonne National Laboratory
, 2001
"... tract W31109Eng38. 2 This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on highperformance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provid ..."
Abstract

Cited by 237 (18 self)
 Add to MetaCart
(Show Context)
tract W31109Eng38. 2 This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on highperformance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of largescale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all messagepassing communication. PETSc includes an expanding suite of parallel linear, nonlinear equation solvers and time integrators that may be used in application codes written in Fortran, C, and C++. PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of objectoriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper
FastHenry: A MultipoleAccelerated 3D Inductance Extraction Program
, 1993
"... ... based on mesh analysis can be combined with a GMRESstyle iterative matrix solution technique to make a reasonably fast 3D frequency dependent inductance and resistance extraction algorithm. Unfortunately, both the computation time and memory re quired for that approach grow faster than n 2, w ..."
Abstract

Cited by 196 (44 self)
 Add to MetaCart
(Show Context)
... based on mesh analysis can be combined with a GMRESstyle iterative matrix solution technique to make a reasonably fast 3D frequency dependent inductance and resistance extraction algorithm. Unfortunately, both the computation time and memory re quired for that approach grow faster than n 2, where n is the number of volumefilaments. In this paper, we show that it is possible to use multipoleacceleration to reduce both required memory and computation time to nearly order n. Results from examples are given to demonstrate that the multipole acceleration can reduce required computation time and memory by more than an order of magnitude for realistic packaging problems.
ARPACK Users Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods.
, 1997
"... this document is intended to provide a cursory overview of the Implicitly Restarted Arnoldi/Lanczos Method that this software is based upon. The goal is to provide some understanding of the underlying algorithm, expected behavior, additional references, and capabilities as well as limitations of the ..."
Abstract

Cited by 195 (18 self)
 Add to MetaCart
(Show Context)
this document is intended to provide a cursory overview of the Implicitly Restarted Arnoldi/Lanczos Method that this software is based upon. The goal is to provide some understanding of the underlying algorithm, expected behavior, additional references, and capabilities as well as limitations of the software. 1.7 Dependence on LAPACK and BLAS
Preconditioning techniques for large linear systems: A survey
 J. COMPUT. PHYS
, 2002
"... This article surveys preconditioning techniques for the iterative solution of large linear systems, with a focus on algebraic methods suitable for general sparse matrices. Covered topics include progress in incomplete factorization methods, sparse approximate inverses, reorderings, parallelization i ..."
Abstract

Cited by 164 (5 self)
 Add to MetaCart
(Show Context)
This article surveys preconditioning techniques for the iterative solution of large linear systems, with a focus on algebraic methods suitable for general sparse matrices. Covered topics include progress in incomplete factorization methods, sparse approximate inverses, reorderings, parallelization issues, and block and multilevel extensions. Some of the challenges ahead are also discussed. An extensive bibliography completes the paper.
Jacobianfree NewtonKrylov methods: a survey of approaches and applications
 J. Comput. Phys
"... Jacobianfree NewtonKrylov (JFNK) methods are synergistic combinations of Newtontype methods for superlinearly convergent solution of nonlinear equations and Krylov subspace methods for solving the Newton correction equations. The link between the two methods is the Jacobianvector product, which ..."
Abstract

Cited by 162 (6 self)
 Add to MetaCart
(Show Context)
Jacobianfree NewtonKrylov (JFNK) methods are synergistic combinations of Newtontype methods for superlinearly convergent solution of nonlinear equations and Krylov subspace methods for solving the Newton correction equations. The link between the two methods is the Jacobianvector product, which may be probed approximately without forming and storing the elements of the true Jacobian, through a variety of means. Various approximations to the Jacobian matrix may still be required for preconditioning the resulting Krylov iteration. As with Krylov methods for linear problems, successful application of the JFNK method to any given problem is dependent on adequate preconditioning. JFNK has potential for application throughout problems governed by nonlinear partial dierential equations and integrodierential equations. In this survey article we place JFNK in context with other nonlinear solution algorithms for both boundary value problems (BVPs) and initial value problems (IVPs). We provide an overview of the mechanics of JFNK and attempt to illustrate the wide variety of preconditioning options available. It is emphasized that JFNK can be wrapped (as an accelerator) around another nonlinear xed point method (interpreted as a preconditioning process, potentially with signicant code reuse). The aim of this article is not to trace fully the evolution of JFNK, nor to provide proofs of accuracy or optimal convergence for all of the constituent methods, but rather to present the reader with a perspective on how JFNK may be applicable to problems of physical interest and to provide sources of further practical information. A review paper solicited by the EditorinChief of the Journal of Computational
SuperLU DIST: A scalable distributedmemory sparse direct solver for unsymmetric linear systems
 ACM Trans. Mathematical Software
, 2003
"... We present the main algorithmic features in the software package SuperLU DIST, a distributedmemory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with a focus on scalability issues, and demonstrate the software’s parallel performance and sc ..."
Abstract

Cited by 132 (19 self)
 Add to MetaCart
(Show Context)
We present the main algorithmic features in the software package SuperLU DIST, a distributedmemory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with a focus on scalability issues, and demonstrate the software’s parallel performance and scalability on current machines. The solver is based on sparse Gaussian elimination, with an innovative static pivoting strategy proposed earlier by the authors. The main advantage of static pivoting over classical partial pivoting is that it permits a priori determination of data structures and communication patterns, which lets us exploit techniques used in parallel sparse Cholesky algorithms to better parallelize both LU decomposition and triangular solution on largescale distributed machines.
Aerodynamic Design Optimization on Unstructured Grids with a Continuous Adjoint Formulation
, 1997
"... A continuous adjoint approach for obtaining sensitivity derivatives on unstructured grids is developed and analyzed. The derivation of the costate equations is presented, and a secondorder accurate discretization method is described. The relationship between the continuous formulation and a discret ..."
Abstract

Cited by 132 (4 self)
 Add to MetaCart
A continuous adjoint approach for obtaining sensitivity derivatives on unstructured grids is developed and analyzed. The derivation of the costate equations is presented, and a secondorder accurate discretization method is described. The relationship between the continuous formulation and a discrete formulation is explored for inviscid, as well as for viscous flow. Several limitations in a strict adherence to the continuous approach are uncovered, and an approach that circumvents these difficulties is presented. The issue of grid sensitivities, which do not arise naturally in the continuous formulation, is investigated and is observed to be of importance when dealing with geometric singularities. A method is described for modifying inviscid and viscous meshes during the design cycle to accommodate changes in the surface shape. The accuracy of the sensitivity derivatives is established by comparing with finitedifference gradients and several design examples are presented.
A restricted additive Schwarz preconditioner for general sparse linear systems
 SIAM J. Sci. Comput
, 1999
"... Abstract. We introduce some cheaper and faster variants of the classical additive Schwarz preconditioner (AS) for general sparse linear systems and show, by numerical examples, that the new methods are superior to AS in terms of both iteration counts and CPU time, as well as the communication cost w ..."
Abstract

Cited by 120 (23 self)
 Add to MetaCart
Abstract. We introduce some cheaper and faster variants of the classical additive Schwarz preconditioner (AS) for general sparse linear systems and show, by numerical examples, that the new methods are superior to AS in terms of both iteration counts and CPU time, as well as the communication cost when implemented on distributed memory computers. This is especially true for harder problems such as indefinite complex linear systems and systems of convectiondiffusion equations from threedimensional compressible flows. Both sequential and parallel results are reported. Key words. Overlapping domain decomposition, preconditioner, iterative method, sparse matrix AMS(MOS) subject classifications. 65N30, 65F10