Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
From MaRDI portal
Recommendations
- The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory
- Optimizing a Parallel Conjugate Gradient Solver
- A preconditioned conjugate gradient method on a distributed memory multiprocessor
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- scientific article; zbMATH DE number 671776
- Conjugate gradient and Lanczos methods for sparse matrices on distributed memory multiprocessors
- scientific article; zbMATH DE number 1322965
- Parallelizing preconditioned conjugate gradient algorithms
- scientific article; zbMATH DE number 878999
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- s-step iterative methods for symmetric linear systems
This page was built for publication: Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481727)