Parallel sparse matrix computations using the PINEAPL library: A performance study

DOI10.1007/BFB0057934MaRDI QIDQ4251974zbMATH OpenFDO

Authors Arnold R. Krommer

Publication date 13 January 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0057934

zbMATH Keywords

industrial applicationsiterative solvermatrix-vector multiplicationnumerical algorithms groupparallel computationsparallel industrial mumerical applications and portable librariesparallel sparse linear algebra modulesperformancePINEAPLpreconditioner

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• scientific article; zbMATH DE number 1760157
• Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)
• scientific article; zbMATH DE number 671788
• scientific article; zbMATH DE number 833704

Cited in

(4)

• PINEAPL
• scientific article; zbMATH DE number 671788 (Why is no real title available?)
• scientific article; zbMATH DE number 1760157 (Why is no real title available?)
• A parallel iterative method with a factorized preconditioning matrix for elliptic equations

Describes a project that uses

Uses Software

• NAG

This page was built for publication: Parallel sparse matrix computations using the PINEAPL library: A performance study

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