scientific article; zbMATH DE number 1302627
From MaRDI portal
Publication:4249175
zbMATH Open0931.65027MaRDI QIDQ4249175FDOQ4249175
Authors: Eunice E. Santos, Pei-Yue Chu
Publication date: 13 September 1999
Title of this publication is not available (Why is that?)
Recommendations
gapparallel algorithmslatencyLogPoverheaddense Cholesky factorizationnumber of processor/memory pairs
Direct numerical methods for linear systems and matrix inversion (65F05) Parallel numerical computation (65Y05)
Cited In (10)
- A Scalable High Performant Cholesky Factorization for Multicore with GPU Accelerators
- Sparse Cholesky factorization on FPGA using parameterized model
- Parallel Cholesky-based reduction for the weighted integer least squares problem
- A Mapping Algorithm for Parallel Sparse Cholesky Factorization
- Performance evaluation of practical parallel computer model LogPQ
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
- Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
- Title not available (Why is that?)
- Task scheduling for parallel sparse Cholesky factorization
- A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices
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 Q4249175)