Parallel Cholesky factorization on a shared-memory multiprocessor
From MaRDI portal
Recommendations
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- A parallel Cholesky algorithm for the solution of symmetric linear systems
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
- Parallel Cholesky factorization on orthogonal multiprocessors
- scientific article; zbMATH DE number 18296
Cites work
- A collection of parallel linear equations routines for the Denelcor HEP
- Basic Linear Algebra Subprograms for Fortran Usage
- Data-flow algorithms for parallel matrix computation
- scientific article; zbMATH DE number 3848585 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
Cited in
(29)- Assignment and scheduling in parallel matrix factorization
- Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer
- Torus data flow for parallel computation of missized matrix problems
- Solution of sparse positive definite systems on a shared-memory multiprocessor
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
- Experiments with an ordinary differential equation solver in the parallel solution of method of lines problems on a shared-memory parallel computer
- Parallel Cholesky factorization on orthogonal multiprocessors
- Block-Cholesky for parallel processing
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
- Near optimal Cholesky factorization on orthogonal multiprocessors.
- Explicit parallel block Cholesky algorithms on the CRAY APP
- Sparse Cholesky factorization on FPGA using parameterized model
- A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
- Sparse Cholesky Factorization on a Local-Memory Multiprocessor
- A parallel algorithm for the general LU factorization
- scientific article; zbMATH DE number 17454 (Why is no real title available?)
- scientific article; zbMATH DE number 18296 (Why is no real title available?)
- scientific article; zbMATH DE number 1302627 (Why is no real title available?)
- scientific article; zbMATH DE number 554769 (Why is no real title available?)
- scientific article; zbMATH DE number 1134607 (Why is no real title available?)
- FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture
- scientific article; zbMATH DE number 1424208 (Why is no real title available?)
- On evaluating elimination tree based parallel sparse cholesky factorizations
- Exact sampling of determinantal point processes without eigendecomposition
- Mixed-Precision Cholesky QR Factorization and Its Case Studies on Multicore CPU with Multiple GPUs
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers
- Sparse QR factorization on a massively parallel computer
This page was built for publication: Parallel Cholesky factorization on a shared-memory multiprocessor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072332)
