An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization

DOI10.1137/0915085zbMath0813.65062OpenAlexW2025695688MaRDI QIDQ4316313

Edward Rothberg, Anoop Gupta

Publication date: 7 December 1994

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

Full work available at URL: https://doi.org/10.1137/0915085

zbMATH Keywords

performanceCholesky factorizationsparse symmetric positive definite systemsparallel block algorithm

Mathematics Subject Classification ID

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

Related Items (8)

Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking ⋮ IPM based sparse LP solver on a heterogeneous processor ⋮ Sparse matrix tools for Gaussian models on lattices ⋮ Financial planning via multi-stage stochastic optimization. ⋮ Data-Parallel Sparse Factorization ⋮ Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity ⋮ A survey of direct methods for sparse linear systems ⋮ Hypermatrix oriented supernode amalgamation

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization