An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization

DOI10.1137/0915085MaRDI QIDQ4316313zbMATH OpenOpenAlexFDO

Authors Edward Rothberg, A. K. 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

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

Recommendations

• scientific article; zbMATH DE number 833696
• scientific article; zbMATH DE number 833702
• Two-dimensional block partitionings for the parallel sparse Cholesky factorization
• Highly Parallel Sparse Cholesky Factorization
• scientific article; zbMATH DE number 1760069
• scientific article; zbMATH DE number 833700
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• scientific article; zbMATH DE number 1302627
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• Parallel sparse Cholesky factorization on a shared memory multiprocessor

Cited in

(24)

• Sparse matrix tools for Gaussian models on lattices
• A survey of direct methods for sparse linear systems
• Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity
• Data-Parallel Sparse Factorization
• An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization
• Efficient implementation of a generalized Cholesky factorization for symmetric Galerkin boundary element methods
• scientific article; zbMATH DE number 833696 (Why is no real title available?)
• Parallel Algorithms for Sparse Linear Systems
• Financial planning via multi-stage stochastic optimization.
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• Hypermatrix oriented supernode amalgamation
• scientific article; zbMATH DE number 833700 (Why is no real title available?)
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• scientific article; zbMATH DE number 434523 (Why is no real title available?)
• The choleski Q.I.F. algorithm for solving symmetric linear systems
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• scientific article; zbMATH DE number 833702 (Why is no real title available?)
• IPM based sparse LP solver on a heterogeneous processor
• Communication results for parallel sparse Cholesky factorization on a hypercube
• Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
• scientific article; zbMATH DE number 434528 (Why is no real title available?)
• On evaluating elimination tree based parallel sparse cholesky factorizations
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• Near optimal Cholesky factorization on orthogonal multiprocessors.

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection

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

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