Conjugate-gradient subroutines for the IBM 3090 Vector Facility

Journal Article · Tue Feb 28 23:00:00 EST 1989 · IBM J. Res. Dev.; (United States)

DOI:https://doi.org/10.1147/rd.332.0125· OSTI ID:5871884

DiBrozolo, G R; Vitaletti, M

This paper describes a set of optimized subroutines for use in solving sparse, symmetric, positive definite linear systems of equations using iterative algorithms. The set has been included in the Engineering and Scientific Subroutine Library (ESSL) for the IBM 3090 Vector Facility (VF). The subroutines are based on the conjugate-gradient method, preconditioned by the diagonal or by an incomplete factorization. They make use of storage representations of sparse matrices that are optimal for vector implementation. The ESSL vector subroutines are up to six times faster than a scalar implementation of the same algorithm.

• Research Organization: IBM Italy, European Center for Scientific and Engineering Computing, Rome (IT)
• OSTI ID: 5871884
• Journal Information: IBM J. Res. Dev.; (United States), Journal Name: IBM J. Res. Dev.; (United States) Vol. 33:2; ISSN IBMJA
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
990230 -- Mathematics & Mathematical Models-- (1987-1989)
ALGORITHMS
CALCULATION METHODS
COMPUTERS
ENGINEERING
EQUATIONS
IBM COMPUTERS
ITERATIVE METHODS
LINEAR PROGRAMMING
MATHEMATICAL LOGIC
MATRICES
OPTIMIZATION
PROGRAMMING
VECTOR PROCESSING