Conjugate-gradient subroutines for the IBM 3090 Vector Facility

DOI10.1147/RD.332.0125MaRDI QIDQ3833503zbMATH OpenOpenAlexFDO

Authors Marcello Vitaletti, Giuseppe Radicati di Brozolo

Publication date 1989

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.332.0125

zbMATH Keywords

preconditioningconjugate gradient methoditerative algorithmsincomplete factorizationIBM 3090 Vector FacilityEngineering and Scientific Subroutine Libraryoptimized subroutinessparse, symmetric, positive definite linear systems

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computer aspects of numerical algorithms (65Yxx) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Recommendations

• scientific article; zbMATH DE number 4064358
• scientific article; zbMATH DE number 4205870
• Vector Computations for Sparse Linear Systems
• Data structures to vectorize CG algorithms for general sparsity patterns
• Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor

Cited in

(6)

• Vector Computations for Sparse Linear Systems
• scientific article; zbMATH DE number 4064358 (Why is no real title available?)
• scientific article; zbMATH DE number 926693 (Why is no real title available?)
• Polynomial preconditioning on vector computers
• Algorithm 818
• Data structures to vectorize CG algorithms for general sparsity patterns

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: Conjugate-gradient subroutines for the IBM 3090 Vector Facility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833503)