摘要
将递归方法引入稠密线性代数的计算,能产生自动的矩阵分块,使算法适合于当今分级存储高性能计算机的结构,提高运算速度。文章对求解线性代数方程组的矩阵三角分解递归算法进行了研究,给出了算法的详细推导过程。
Introducing the recursion to the computation of the dense linear algebra brings about the automation of the matrix blocking, and makes the algorithm well fit the structure of today's memory tiered high - performance computers so as to speed up computation. This paper studies the recursive algorithm for matrix triangular factorization that is used to solve linear algebra eo,ua-tions. It also proposes a detai led derivation of the recursive algorithm.
基金
江苏省教育厅留学回国人员科研启动经费资助项目
