首页 | 本学科首页   官方微博 | 高级检索  
     检索      

方程组系数矩阵的递归分块分解算法的设计实现
引用本文:汪先明,孙希平.方程组系数矩阵的递归分块分解算法的设计实现[J].湖北汽车工业学院学报,2005,19(3):62-63.
作者姓名:汪先明  孙希平
作者单位:湖北汽车工业学院,电气工程系,湖北,十堰,442002;湖北汽车工业学院,电气工程系,湖北,十堰,442002
摘    要:将方程组系数矩阵的LR分解算法过程加以改进,加入递归算法,使矩阵产生分块。用MATLAB和C语言对2种算法进行比较,发现递归分解法比LR分解算法速度快,占用内存少,适合当今分层多级存储的计算机结构。

关 键 词:矩阵  递归  分块  分解
文章编号:1008-5483-(2005)03-0062-02
收稿时间:2005-05-22
修稿时间:2005-05-22

Implementation of Factorization Algorithm for Matrix
Wang Xianming,Sun Xiping.Implementation of Factorization Algorithm for Matrix[J].Journal of Hubei Automotive Industries Institute,2005,19(3):62-63.
Authors:Wang Xianming  Sun Xiping
Institution:Dept. of Electrical Engineering, Hubei Automotive Industries Institute, Shiyan 442002, China
Abstract:This paper analyses the LR factorization of matrix,and improves the algorithm based on recursive algorithm and iteration,and brings forth the developed method of matrix factorization,which accelerates the convergence speed of the factorization.After comparing these two algorithms using MATLAB and C-program,it's found that the recursive algorithm is faster than the currently used algorithm,and it is fit to multiple level memories in the computer structure.
Keywords:matrix  recursion  blockade  factorization
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号