scientific article; zbMATH DE number 833702

zbMATH Open0836.65038MaRDI QIDQ4860191FDOQ4860191

Authors: Anshul Gupta, Vipin Kumar 

Publication date: 14 January 1996

Title of this publication is not available (Why is that?)

Recommendations

• Limiting Communication in Parallel Sparse Cholesky Factorization
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Publication:4860184
• scientific article; zbMATH DE number 1163095
• scientific article; zbMATH DE number 1760069

zbMATH Keywords

parallel algorithmsparse Cholesky factorizationsparse matrix factorizationoptimal scalability

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cited In (21)

• Parallel symbolic factorization of sparse linear systems
• A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Locality of reference in sparse Cholesky factorization methods
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• A note on communication analysis of parallel sparse Cholesky factorization on a hypercube
• Title not available (Why is that?)
• Multiple-rank modifications of a sparse Cholesky factorization
• Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
• Task scheduling for parallel sparse Cholesky factorization
• Title not available (Why is that?)
• A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
• The two-level FETI method for static and dynamic plate problems I: An optimal iterative solver for biharmonic systems
• Communication results for parallel sparse Cholesky factorization on a hypercube
• Minimum communication cost reordering for parallel sparse Cholesky factorization
• 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 Q4860191)