Scalable iterative solution of sparse linear systems

DOI10.1016/0167-8191(94)90004-3zbMath0802.65034OpenAlexW1982182559MaRDI QIDQ1323641

Paul E. Plassmann, Mark T. Jones

Publication date: 11 December 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(94)90004-3

zbMATH Keywords

performanceconjugate gradient methodgraph coloringparallel algorithmssparse linear systemsincomplete Cholesky factorizationfinite element matricescoloring orderings

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items (6)

A framework for scalable greedy coloring on distributed-memory parallel computers ⋮ Graph Coloring Using GPUs ⋮ Exploiting thread-level parallelism in the iterative solution of sparse linear systems ⋮ Parallel implementation of the finite element method using compressed data structures ⋮ Fine-Grained Parallel Incomplete LU Factorization ⋮ Preconditioning techniques for large linear systems: A survey

This page was built for publication: Scalable iterative solution of sparse linear systems