Algorithmic optimizations of a conjugate gradient solver on shared memory architectures

DOI10.1080/17445760600568139zbMath1098.68514OpenAlexW2013926070MaRDI QIDQ5481727

Henrik Löf, Jarmo Rantakokko

Publication date: 10 August 2006

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760600568139

zbMATH Keywords

conjugate gradientsiterative solversOpenMPbandwidth minimizationshared memory programmingreversed Cuthill-McKee

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Uses Software

• LAPACK

Cites Work

• s-step iterative methods for symmetric linear systems
• Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

This page was built for publication: Algorithmic optimizations of a conjugate gradient solver on shared memory architectures