中文摘要：

利用Lyapunov矩阵方程和Riccati矩阵方程解的理论,对迭代动力缩聚法的收敛性进行了分析证明,并给出了迭代收敛的充分条件。揭示了动力缩聚法与经典的子空间迭代法的内在关系,阐明了各自的优缺点。迭代动力缩聚法实质上是子空间迭代法的变形,它需要人为选择主辅自由度,而子空间迭代法需要人为选定初始迭代向量。从理论上讲,只有主辅自由度选择满足收敛的充分条件要求,才能保证迭代结果收敛到理论上的精确解。给出了一个数值算例,对几种算法进行了对比,并验证了本文的论点。

英文摘要：

Based on the theory of solution to the Lyapunov and Riccati matrix equations,in this paper an in-depth analysis of the convergence of iterative dynamic condensation methods is provided and the sufficient conditions for their convergence are introduced.The relationship between the iterative dynamic condensation methods and the classical subspace iterative method is uncovered.In fact,the iterative dynamic condensation methods are a transformed kind of the subspace iterative method.One must select the master and slave degrees of freedom in the iterative dynamic condensation algorithms or the initial iterative vectors in the subspace iterative algrithm.Theoretically,if the selection of the master and slave degrees of freedom meet the demand of the sufficient conditions,the iterative dynamic condensation algorithms will obtain an accurate result.A numerical example is presented in the end of the paper.The results by the various algorithms are compared,and the idea of the paper is verified.