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

DOI10.1137/S106482759426715XzbMATH Open0853.65038MaRDI QIDQ4883665FDOQ4883665

Authors: Edward Rothberg 

Publication date: 8 December 1996

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

Recommendations

• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• scientific article; zbMATH DE number 434521
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers

zbMATH Keywords

performanceparallel sparse Cholesky factorizationblock fan-out methodpanel multifrontal method

Mathematics Subject Classification ID

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

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883665)