• DOI:10.1145/356004.356009
• Corpus ID: 5163165

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}
}

• D. Kincaid, J. Respess, +1 author Rober R. Grimes
• Published 1 September 1982
• Computer Science
• ACM Trans. Math. Softw.

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 acceleration parameters and the use of accurate stopping criteria are major features of this software package. While the ITPACK routines can be called with any linear system containing positive diagonal elements, they are the most successful in solving systems with symmetric positive definite or mildly nonsymmetric coefficient matrices.