节点文献

一种LU分解与迭代法的结合策略及算法实现

A combination strategy of LU factorization and iterative method and its implementation

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 李滨郑赟叶以正肖立伊黄国勇

【Author】 LI Bin,ZHENG Yun,YE Yi-zheng,XIAO Li-yi,HUANG Guo-yong (Microelectronics Center,Harbin Institute of Technology,Harbin 150001; CAD Department,China Huada Integrated Circuit Design Center,Beijing 100015)

【机构】 哈尔滨工业大学微电子中心中国华大集成电路设计中心CAD部中国华大集成电路设计中心CAD部 哈尔滨 150001北京 100015哈尔滨 150001北京 100015

【摘要】 在矩阵求解算法中,直接法或迭代法都不能有效地求解大规模稀疏或病态矩阵,因此提出一种LU分解与迭代法结合的策略。采用LU分解对矩阵进行预处理,以提高迭代法的收敛性,并采用一种判断策略使矩阵的LU分解结果可最大限度地重复利用。此结合策略应用于两种共轭梯度(CG)法,得到CLUCG和CLUTCG两种算法。它们已应用于模拟和混合信号电路模拟器ZeniVDE中。大量实验结果表明此结合策略是很有效的,得到的两种算法具有较快的速度和较好的收敛性。

【Abstract】 In matrix solution algorithms,direct methods and iterative methods cannot efficiently solve large-scale sparse or ill matrix. This paper presents a strategy that combines LU factorization and iterative methods. In the strategy,LU factorization is used to precondition on matrix before iterative methods are used for matrix solution,which is to accelerate the convergence of the iterative methods. Furthermore,an effective judgment method is presented for re-factorization of matrix in preconditioning,by which the LU factorization result can be used furthest. The strategy has been used on two conjugate gradient(CG) methods,which generate two algorithms: CLUCG and CLUTCG. They have been used in an analog and mixed-signal circuit simulator ZeniVDE. Large numbers of experiments show that the combination strategy is effective,and the two algorithms have better performance and convergence than LU factorization and conjugate gradient method.

【基金】 国家“九五”重点科技攻关项目(96-738-01-02-06); 哈尔滨工业大学校基金项目(HIT.2000.33)
  • 【文献出处】 计算机工程与设计 ,Computer Engineering and Design , 编辑部邮箱 ,2002年03期
  • 【分类号】TN702
  • 【被引频次】11
  • 【下载频次】402
节点文献中: