Investigation on the optimisation of Cholesky decomposition algorithm based on SIMD-DSP
Huixiang Li, Huifu Zhang, Anxing Xie, Yonghua Hu, Wei Liang · International Journal of Computational Science and Engineering · 2024
With the development of high-performance SIMD-DSP processors, corresponding highly efficient algorithms for matrix decomposition play an important role in the hardware performance of such processors.Cholesky decomposition is a fast decomposition method for symmetric positive definite matrices, which is widely used in matrix inversion and linear equation solving.According to the hardware characteristics of the FT-M7002 processors, in this paper, we optimise the algorithm in several ways.If hardware has on-chip double-buffered memory, the parallel process of DMA transmitting and calculating is specially designed, which can hide most of the time cost of data movement and further improve the algorithm's performance.The experimental results based on the FT-M7002 processor show that the performance of the optimised algorithm is 3.8~5.64times that of the serial algorithm, and 1.39~2.14times that of the TI library function.