Reordering for parallelism

DOI10.1080/00207169808804670zbMath0899.65023OpenAlexW2037868567MaRDI QIDQ4392334

Bharat B. Madan, M. V. Padmini, Bijendra N. Jain

Publication date: 15 November 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Cholesky factorizationsparse matrixtest problemsparallel orderingBoling-Harwell sparse matrix collectionJess-Kees method

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A survey of direct methods for sparse linear systems

Uses Software

• symrcm

Cites Work

• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs
• A Data Structure for Parallel L/U Decomposition
• Parallel Algorithms for Sparse Linear Systems

This page was built for publication: Reordering for parallelism