Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers

DOI10.1137/S106482759426715XzbMath0853.65038MaRDI QIDQ4883665

Edward Rothberg

Publication date: 8 December 1996

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

performanceparallel sparse Cholesky factorizationblock fan-out methodpanel multifrontal method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (7)

Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking ⋮ Gigaflops in linear programming ⋮ Financial planning via multi-stage stochastic optimization. ⋮ A survey of direct methods for sparse linear systems ⋮ On evaluating elimination tree based parallel sparse cholesky factorizations ⋮ Hypermatrix oriented supernode amalgamation ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems

Uses Software

• BLAS

This page was built for publication: Performance of Panel and Block Approaches to Sparse Cholesky Factorization on the iPSC/860 and Paragon Multicomputers