%0 Journal Article
%T Study of Recursive Algorithm for Cholesky Factorization<br>乔莱斯基分解递归算法的研究
%A Jerzy Wasniewski
%A <br>陈建平
%J 计算机科学
%D 2001
%I 
%X 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.
%K Numerical computation
%K Recursion
%K Matrix blocking
%K Memory hierarchy
%K FORTRAN90<br>乔莱斯基分解法
%K 递归算法
%K 线性代数
%K 数值计算
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=6D87F4CE34624923&yid=14E7EF987E4155E6&vid=D3E34374A0D77D7F&iid=DF92D298D3FF1E6E&sid=B344543C2864D684&eid=28F8B56DB6BEE30E&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=6