乔莱斯基分解递归算法的研究

摘要：

Recursion is a new effective method for computing dense linear algebra. It allows for efficient utilization of memory hierarchies of today′s high-performance computers. The recursive algorithm for Cholesky factorization is studied in this paper. A detailed derivation of the recursive Cholesky algorithm is given. The algorithm is then implemented in FORTRAN90 that supports recursion as a language feature. The efficiency of the recursive algorithm is further improved by a method of matrix element reordering. The resulting algorithms are 15%-25% faster than the currently used block algorithm.

关键词：Numerical computation、Recursion、Matrix blocking、Memory hierarchy、FORTRAN90

所属期刊栏目：28

分类号：TP3(计算技术、计算机技术)

资助基金：江苏省教育厅留学回国人员科研启动基金

在线出版日期：2004-01-08（万方平台首次上网日期，不代表论文的发表时间）

页数：共3页

页码：127-129