scientific article; zbMATH DE number 833696

MaRDI QIDQ4860184zbMATH OpenFDO

Authors Edward Rothberg, Robert Schreiber

Publication date 14 January 1996

zbMATH Keywords

performanceparallel computationsparse Cholesky factorizationcyclic mappings

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

• Two-dimensional block partitionings for the parallel sparse Cholesky factorization
• Task scheduling for parallel sparse Cholesky factorization
• scientific article; zbMATH DE number 833702
• Parallel sparse Cholesky factorization on a shared memory multiprocessor
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization

Cited in

(23)

• Sparse hypermatrix Cholesky: customization for high performance
• A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
• Efficient implementation of a generalized Cholesky factorization for symmetric Galerkin boundary element methods
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• scientific article; zbMATH DE number 2087095 (Why is no real title available?)
• Locality of reference in sparse Cholesky factorization methods
• Parallel Cholesky-based reduction for the weighted integer least squares problem
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• A note on communication analysis of parallel sparse Cholesky factorization on a hypercube
• Computational models and task scheduling for parallel sparse Cholesky factorization
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Multiple-rank modifications of a sparse Cholesky factorization
• scientific article; zbMATH DE number 720649 (Why is no real title available?)
• Distributed SBP Cholesky factorization algorithms with near-optimal scheduling
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• Computational Science – ICCS 2005
• Task scheduling for parallel sparse Cholesky factorization
• scientific article; zbMATH DE number 1760069 (Why is no real title available?)
• scientific article; zbMATH DE number 833702 (Why is no real title available?)
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
• On evaluating elimination tree based parallel sparse cholesky factorizations

This page was built for publication:

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