Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations

DOI10.1137/S00361445003820zbMath1006.65028OpenAlexW1971343078MaRDI QIDQ3151330

Parry Husbands, Leonid Oliker, Xiaoye Li, Rupak Biswas

Publication date: 15 October 2002

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s00361445003820

zbMATH Keywords

performancealgorithmorderingpreconditioningparallel computationself-avoiding walkssparse linear systemsgraph partitioningpreconditioned conjugate gradient methodmultithreadingmessage passinghybrid programmingpartitioning strategiesreverse Cuthill-McKee methodshared-memory directives

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items (7)

A massive MPI parallel framework of smoothed particle hydrodynamics with optimized memory management for extreme mechanics problems ⋮ Three-level hybrid vs. flat MPI on the Earth simulator: parallel iterative solvers for finite-element method ⋮ Parallel finite element simulations of incompressible viscous fluid flow by domain decomposition with Lagrange multipliers ⋮ Parallel symmetric sparse matrix-vector product on scalar multi-core CPUs ⋮ Parallel implementations of streamline simulators ⋮ Algorithmic optimizations of a conjugate gradient solver on shared memory architectures ⋮ A Multi-Stage Preconditioner for the Black Oil Model and Its OpenMP Implementation

Uses Software

• AztecOO
• BlockSolve95
• Triangle
• Aztec

This page was built for publication: Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations