Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems

Journal Article · · Numerical Linear Algebra with Applications
DOI:https://doi.org/10.1002/nla.2215· OSTI ID:1475222
 [1];  [1];  [1]
  1. Department of Applied Mathematics &, Statistics Stony Brook University Stony Brook New York, Institute for Advanced Computational Science Stony Brook University Stony Brook New York

Summary

Preconditioned Krylov subspace (KSP) methods are widely used for solving large‐scale sparse linear systems arising from numerical solutions of partial differential equations (PDEs). These linear systems are often nonsymmetric due to the nature of the PDEs, boundary or jump conditions, or discretization methods. While implementations of preconditioned KSP methods are usually readily available, it is unclear to users which methods are the best for different classes of problems. In this work, we present a comparison of some KSP methods, including GMRES, TFQMR, BiCGSTAB, and QMRCGSTAB, coupled with three classes of preconditioners, namely, Gauss–Seidel, incomplete LU factorization (including ILUT, ILUTP, and multilevel ILU), and algebraic multigrid (including BoomerAMG and ML). Theoretically, we compare the mathematical formulations and operation counts of these methods. Empirically, we compare the convergence and serial performance for a range of benchmark problems from numerical PDEs in two and three dimensions with up to millions of unknowns and also assess the asymptotic complexity of the methods as the number of unknowns increases. Our results show that GMRES tends to deliver better performance when coupled with an effective multigrid preconditioner, but it is less competitive with an ineffective preconditioner due to restarts. BoomerAMG with a proper choice of coarsening and interpolation techniques typically converges faster than ML, but both may fail for ill‐conditioned or saddle‐point problems, whereas multilevel ILU tends to succeed. We also show that right preconditioning is more desirable. This study helps establish some practical guidelines for choosing preconditioned KSP methods and motivates the development of more effective preconditioners.

Sponsoring Organization:
USDOE
Grant/Contract Number:
AC02-06CH11357
OSTI ID:
1475222
Journal Information:
Numerical Linear Algebra with Applications, Journal Name: Numerical Linear Algebra with Applications Journal Issue: 1 Vol. 26; ISSN 1070-5325
Publisher:
Wiley Blackwell (John Wiley & Sons)Copyright Statement
Country of Publication:
United Kingdom
Language:
English

References (43)

ILUT: A dual threshold incomplete LU factorization journal July 1994
A hybrid geometric + algebraic multigrid method with semi-iterative smoothers: A HYBRID GEOMETRIC+ALGEBRAIC MULTIGRID METHOD journal February 2014
Algebraic multigrid methods for constrained linear systems with applications to contact problems in solid mechanics journal March 2004
Distance-two interpolation for parallel algebraic multigrid journal January 2008
Improving algebraic multigrid interpolation operators for linear elasticity problems journal January 2009
Overcoming element quality dependence of finite elements with adaptive extended stencil FEM (AES-FEM): OVERCOMING ELEMENT QUALITY DEPENDENCE OF FINITE ELEMENTS WITH AES-FEM
  • Conley, Rebecca; Delaney, Tristan J.; Jiao, Xiangmin
  • International Journal for Numerical Methods in Engineering, Vol. 108, Issue 9 https://doi.org/10.1002/nme.5246
journal March 2016
Comparison of Different Krylov Subspace Methods Embedded in an Implicit Finite Volume Scheme for the Computation of Viscous and Inviscid Flow Fields on Unstructured Grids journal March 1998
Accurate Projection Methods for the Incompressible Navier–Stokes Equations journal April 2001
Preconditioning Techniques for Large Linear Systems: A Survey journal November 2002
hypre: A Library of High Performance Preconditioners
  • Falgout, Robert D.; Yang, Ulrike Meier; Goos, Gerhard
  • Computational Science — ICCS 2002: International Conference Amsterdam, The Netherlands, April 21–24, 2002 Proceedings, Part III https://doi.org/10.1007/3-540-47789-6_66
book April 2002
Benchmark Computations of Laminar Flow Around a Cylinder book January 1996
Mixed Finite Element Methods and Applications book January 2013
QMR: a quasi-minimal residual method for non-Hermitian linear systems journal December 1991
Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems journal September 1996
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator book January 1996
Conjugate gradient methods for indefinite systems book January 1976
Geometric multigrid with applications to computational fluid dynamics book January 2001
A comparative study of sparse approximate inverse preconditioners journal June 1999
The principle of minimized iterations in the solution of the matrix eigenvalue problem journal January 1951
A Simple Parallel Algorithm for the Maximal Independent Set Problem journal November 1986
Multilevel Preconditioners Constructed From Inverse-Based ILUs journal January 2006
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners journal January 2006
How Fast are Nonsymmetric Matrix Iterations?
  • Nachtigal, Noël M.; Reddy, Satish C.; Trefethen, Lloyd N.
  • SIAM Journal on Matrix Analysis and Applications, Vol. 13, Issue 3 https://doi.org/10.1137/0613049
journal July 1992
Solution of Sparse Indefinite Systems of Linear Equations journal September 1975
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems journal July 1986
CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems journal January 1989
Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems journal March 1992
A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems journal March 1993
A Parallel Graph Coloring Heuristic journal May 1993
A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems journal March 1994
Iterative Methods for Sparse Linear Systems book January 2003
Numerical Linear Algebra book January 1997
Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods book January 1994
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems journal January 2011
Fine-Grained Parallel Incomplete LU Factorization journal January 2015
A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting journal February 2011
Algorithm 915, SuiteSparseQR journal November 2011
An extreme-scale implicit solver for complex PDEs: highly heterogeneous flow in earth's mantle
  • Rudi, Johann; Ghattas, Omar; Malossi, A. Cristiano I.
  • Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '15 https://doi.org/10.1145/2807591.2807675
conference January 2015
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares journal March 1982
Symmetric Successive Overrelaxation In Solving Diffusion Difference Equations journal October 1961
CG Versus MINRES: An Empirical Comparison journal April 2012
An iteration method for the solution of the eigenvalue problem of linear differential and integral operators journal October 1950
Methods of conjugate gradients for solving linear systems journal December 1952

Similar Records

AZTEC: A parallel iterative package for the solving linear systems
Conference · Mon Dec 30 23:00:00 EST 1996 · OSTI ID:433374

A comparison of preconditioned nonsymmetric Krylov methods on a large-scale MIMD machine
Conference · Wed Jan 01 23:00:00 EST 1992 · OSTI ID:10119471

A Comparison of Preconditioned Nonsymmetric Krylov Methods on a Large-Scale MIMD Machine
Conference · Wed Jan 01 19:00:00 EST 1992 · SIAM Journal on Scientific Computing · OSTI ID:6014096

Related Subjects