arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.00451math.NAcs.NA
收藏

随机Lyapunov矩阵方程的最优参数内外迭代算法

An Inner-Outer Iteration Algorithm with Optimal Parameters for Stochastic Lyapunov Matrix Equation

School of Mathematics and Statistics, Guangdong University of Technology(广东工业大学数学与统计学院)

Donghuan He, Xiaowen Su, Feng Wang, Xuesong Chen

AI总结:

针对离散时间随机线性系统关联的随机Lyapunov矩阵方程,提出一种带最优参数的内外迭代算法,分析收敛性并给出最优参数选择策略,数值实验验证算法优势。

摘要:

本文提出了一种带最优参数的内外迭代算法,用于求解与离散时间随机线性系统相关的随机Lyapunov矩阵方程。首先,在底层随机线性系统渐近均方稳定的假设下,分析了所提算法生成的迭代序列的单调性和有界性。在此基础上,针对零初始条件建立了充分收敛结果。其次,通过推导相应迭代矩阵的谱半径,获得了任意初始条件下的若干充要收敛条件。此外,开发了最优参数选择策略以提高算法的收敛性能。最后,通过数值算例验证了理论结果,并展示了所提算法相对于几种现有迭代方法的优势。

英文摘要:

This paper proposes an inner--outer (IO) iterative algorithm with optimal parameters for solving stochastic Lyapunov matrix equation associated with discrete-time stochastic linear system. First, under the assumption that the underlying stochastic linear system is asymptotically mean-square stable, the monotonicity and boundedness of the iterative sequence generated by the proposed algorithm are analyzed. On this basis, a sufficient convergence result is established for the zero initial condition. Second, by deriving the spectral radius of the corresponding iteration matrix, several necessary and sufficient convergence conditions are obtained for arbitrary initial conditions. In addition, the optimal parameter-selection strategies are developed to improve the convergence performance of the algorithm. Finally, numerical examples are presented to verify the theoretical results and demonstrate the advantages of the proposed algorithm over several existing iterative methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑