求解李雅普诺夫方程的U—D分解算法

SOLVING LYAPUNOV MATRIX EQUATION BY USING U-D FACTORIZATION METHOD

  • 摘要: 本文提出了一种新的求解李雅普诺夫方程的数值解法——U-D分解法.其基本思想是将解矩阵P分解为单位上三角阵U和非负定对角阵D,因此将P的迭代求解化为其因子U和D的迭代.这样,在计算量基本不变的情况下,提高了解的精度.本文还对1中的加速收敛二步迭代法应用了U-D分解,使得该算法具有收敛快和精度高的双重优点.

     

    Abstract: In this paper,a new solution method for the Lyapunov matrix equation by using U-D factorization method is proposed.The matrix factors Uand D are iterated instead of the iteration of solution matrix P.This new method can improve the accuracy of solution matrix P,while the amount of computation remains the same as the conventional algorithm.The U-D factorization method is also applied to he two step accelerated convergent iterative method"in1.This makes the new method both accurate and fast convergent.

     

/

返回文章
返回