Sparse Cholesky factorization on FPGA using parameterized model
From MaRDI portal
Publication:1992573
DOI10.1155/2017/3021591zbMath1426.65042OpenAlexW2765589278MaRDI QIDQ1992573
Hengzhu Liu, Yichun Sun, Tong Zhou
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/3021591
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)
Uses Software
Cites Work
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Multifrontal Computations on GPUs and Their Multi-core Hosts
- Parallel Algorithms for Dense Linear Algebra Computations
- The Role of Elimination Trees in Sparse Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Parallel Algorithms for Sparse Linear Systems
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture
- Design of a Multicore Sparse Cholesky Factorization Using DAGs
This page was built for publication: Sparse Cholesky factorization on FPGA using parameterized model