Sparse Cholesky Factorization on FPGA Using Parameterized Model
Cholesky factorization is a fundamental problem in most engineering and science computation applications. When dealing with a large sparse matrix, numerical decomposition consumes the most time. We present a vector architecture to parallelize numerical decomposition of Cholesky factorization. We con...
Main Authors: | Yichun Sun, Hengzhu Liu, Tong Zhou |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2017-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2017/3021591 |
Similar Items
-
Communication-Efficient Parallel Sparse Cholesky Factorization /
by: Eswar, Kalluri
Published: (1995) -
Reorderings of Sparse Matrices for Parallel Cholesky Factorization
by: Lin,Wen-Yang, et al.
Published: (1994) -
Improving the performance of sparse cholesky factorization with fine grain synchronization
by: Tuteja, Manish Kumar
Published: (2007) -
The Processor Allocation and Task Scheduling for Sparse Multifrontal Cholesky Factorization
by: Tsung-Tso Kan, et al.
Published: (2000) -
Sparse Cholesky Covariance Parametrization for Recovering Latent Structure in Ordered Data
by: Irene Cordoba, et al.
Published: (2020-01-01)