scientific article; zbMATH DE number 833696
From MaRDI portal
zbMATH Open0836.65033MaRDI QIDQ4860184FDOQ4860184
Edward Rothberg, Robert Schreiber
Publication date: 14 January 1996
Title of this publication is not available (Why is that?)
Recommendations
- Two-dimensional block partitionings for the parallel sparse Cholesky factorization
- Task scheduling for parallel sparse Cholesky factorization
- Publication:4860191
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
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)
Cited In (21)
- A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
- Efficient implementation of a generalized Cholesky factorization for symmetric Galerkin boundary element methods
- Title not available (Why is that?)
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- 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
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
- A note on communication analysis of parallel sparse Cholesky factorization on a hypercube
- Computational models and task scheduling for parallel sparse Cholesky factorization
- Multiple-rank modifications of a sparse Cholesky factorization
- Title not available (Why is that?)
- Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
- Computational Science – ICCS 2005
- Task scheduling for parallel sparse Cholesky factorization
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
