# Algorithm 586: ITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods

@article{Kincaid1982Algorithm5I, title={Algorithm 586: ITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods}, author={David R. Kincaid and John R. Respess and David M. Young and Rober R. Grimes}, journal={ACM Trans. Math. Softw.}, year={1982}, volume={8}, pages={302-322} }

ITPACK 2C is a collection of seven FORTRAN subroutines for solving large sparse linear systems by adaptive accelerated iterative algorithms. Basic iterative procedures, such as the Jacobi method, the Successive Overrelaxation method, the Symmetric Successive Overrelaxation method, and the RS method for the reduced system are combined, where possible, with acceleration procedures such as Chebyshev (Semi-Iteration) and Conjugate Gradient for rapid convergence. Automatic selection of the…

## 168 Citations

Iterative algorithms and software for solving large sparse linear systems

- Computer Science
- 1988

The paper is concerned with iterative algorithms for solving systems of linear algebraic equations where the coefficient matrix is large and sparse, and several software packages are described which have been developed as part of the ITPACK project.

PCG reference manual: A package for the iterative solution of large sparse linear systems on parallel computers. Version 1.0

- Computer Science
- 1995

This manual is intended to be the general-purpose reference describing all features of the PCG package accessible to the user, and suggestions are also given regarding which methods to use for a given problem.

Conjugate-Gradient Subroutines for the IBM 3090 Vector Facility

- Computer ScienceIBM J. Res. Dev.
- 1989

A set of optimized subroutines for use in solving sparse, symmetric, positive definite linear systems of equations using iterative algorithms that make use of storage representations of sparse matrices that are optimal for vector implementation.

An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package

- Computer Science
- 1989

NSPCG (Nonsymmetric Preconditioned Conjugate Gradient) user's guide: Version 1. 0: A package for solving large sparse linear systems by various iterative methods

- Computer Science
- 1988

NSPCG (or Nonsymmetric Preconditioned Conjugate Gradient) is a computer package to solve the linear system Au = b by various iterative methods. The coefficient matrix A is assumed to be large and…

PCG: a software package for the iterative solution of linear systems on scalar, vector and parallel computers

- Computer ScienceProceedings of IEEE Scalable High Performance Computing Conference
- 1994

The PCG package is a software system for solving systems of linear equations by means of preconditioned conjugate gradient (PCG)-type iterative methods on a variety of computer architectures. The…

JTpack90: A Parallel, Object-Based, Fortran 90 Linear Algebra Package

- Computer SciencePPSC
- 1997

The authors describe the object-based Fortran 90 approach, which enhances maintainability, performance, and extensibility, the parallelization approach using a new portable gather/scatter library (PGSLib), current capabilities and future plans, and present preliminary performance results on a variety of platforms.

## References

SHOWING 1-10 OF 62 REFERENCES

ITPACK Report: Numerical Studies of Several Adaptive Iterative Algorithms,

- Physics
- 1977

Six adaptive iterative algorithms are studied for six elliptic partial differential equations on six regions compatible with subroutine REGION to make the resulting preliminary ITPACK code conform to the 'ELLPACK Contributor's Guide--Initial Version'.

Basic Linear Algebra Subprograms for Fortran Usage

- Computer ScienceTOMS
- 1979

A package of 38 low level subprograms for many of the basic operations of numerical linear algebra is presented, intended to be used with FORTRAN.

The use of iterative methods for solving large sparse PDE-related linear systems

- Computer Science
- 1979

The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”

- Computer Science
- 1972

It is shown that for systems possessing Young’s “Property A” [7] the work in applying the conjugate gradients algorithm [3] may be approximately halved and a vector of storage may be saved by using a…

Iterative Solution of Large Linear Systems.

- Mathematics
- 1971

The ASM preconditioner B is characterized by three parameters: C0, ρ(E) , and ω , which enter via assumptions on the subspaces Vi and the bilinear forms ai(·, ·) (the approximate local problems).

ITPACK 2A: A FORTRAN Implementation of Adaptive Accelerated Iterative Methods for Solving Large Sparse Linear Systems

- CNA-164, Center for Numerical Analysis, University of Texas, Austin, Texas, 78712, October 1980.
- 1980

ITPACK 2.0 User's Guide," CNA-150, Center for Numerical Analysis, University of Texas

- Austin, Texas,
- 1979