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

A Comparison of Preconditioned Nonsymmetric Krylov Methods on a Large-Scale MIMD Machine

Conference · · SIAM Journal on Scientific Computing
DOI:https://doi.org/10.1137/0915030· OSTI ID:6014096
 [1];  [1]
  1. Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)

Many complex physical processes are modeled by coupled systems of partial differential equations (PDEs). Often, the numerical approximation of these PDEs requires the solution of large sparse nonsymmetric systems of equations. In this paper we compare the parallel performance of a number of preconditioned Krylov subspace methods on a large-scale MIMD machine. These methods are among the most robust and efficient iterative algorithms for the solution of large sparse linear systems. They are easy to implement on various architectures and work well on a wide variety of important problems. In this comparison we focus on the parallel issues associated with both local preconditioners (those that combine information from the entire domain). The various preconditioners are applied to a variety of PDE problems within the GMRES, CCGS, BiCGSTAB, and QMRCGS methods. Conclusions are drawn on the effectiveness of the different schemes based on results obtained from a 1024 processor a nCUBE 2 hypercube.

Research Organization:
Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE Office of Energy Research (ER)
DOE Contract Number:
AC04-76DP00789
OSTI ID:
6014096
Report Number(s):
SAND--91-0333C; CONF-920472--1; ON: DE92006838
Journal Information:
SIAM Journal on Scientific Computing, Journal Name: SIAM Journal on Scientific Computing Journal Issue: 2 Vol. 15; ISSN 1064-8275; ISSN 1095-7197
Publisher:
Society for Industrial and Applied Mathematics (SIAM)
Country of Publication:
United States
Language:
English

References (17)

Sparse iterative algorithm software for large‐scale MIMD machines: An initial discussion and implementation journal September 1992
Approximate polynomial preconditionings applied to biharmonic equations journal July 1989
Approximating the inverse of a matrix for use in iterative algorithms on vector processors journal September 1979
Parallel elliptic preconditioners: Fourier analysis and performance on the connection machine journal May 1989
Iterative solution methods for certain sparse linear systems with a non-symmetric matrix arising from PDE-problems journal November 1981
A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP journal September 1991
Multi-level adaptive solutions to boundary-value problems journal May 1977
Parallel multilevel preconditioners journal September 1990
Multigrid Algorithms on the Hypercube Multiprocessor journal November 1986
Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems journal February 1987
Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method journal October 1985
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems journal July 1986
Solving Tridiagonal Systems on Ensemble Architectures journal May 1987
Development of Parallel Methods for a $1024$-Processor Hypercube
  • Gustafson, John L.; Montry, Gary R.; Benner, Robert E.
  • SIAM Journal on Scientific and Statistical Computing, Vol. 9, Issue 4 https://doi.org/10.1137/0909041
journal July 1988
CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems journal January 1989
A Domain Decomposition Algorithm Using a Hierarchical Basis journal November 1990
Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems journal March 1992