Algorithm 586: ITPACK 2C: A FORTRAN Package for Solving Large Sparse Linear Systems by Adaptive Accelerated Iterative Methods
David R. Kincaid, John R. Respess, David M. Young et al. · ACM Transactions on Mathematical Software · 1982
A matrix has Property A if and only if it is a diagonal matrix, or else there exists a rearrangement of the rows and corresponding columns of the matrix which corresponds to a red-black partitioning An L-matrix has positive diagonal elements and nonpositlve off-diagonal elements.
Cited by 130 works. doi:10.1145/356004.356009 Open-access PDF
Authors
References
- Basic Linear Algebra Subprograms for Fortran Usage
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods
- The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”
- THE ITPACK PACKAGE FOR LARGE SPARSE LINEAR SYSTEMS11The work was supported in part by the National Science Foundation through Grant No. MCS-7919828 with The University of Texas at Austin.
- ADAPTING ITERATIVE ALGORITHMS DEVELOPED FOR SYMMETRIC SYSTEMS TO NONSYMMETRIC SYSTEMS11Work was supported in part by National Science Foundation Grant MCS76-03141 at The University of Texas at Austin.
- The use of iterative methods for solving large sparse PDE-related linear systems
- ITPACK Report: Numerical Studies of Several Adaptive Iterative Algorithms,