arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.08201math.NAcs.NA
收藏

参数化Lyapunov方程序列的高效求解及其应用

Efficient solution of sequences of parametrized Lyapunov equations with applications

Davide Palitta, Zoran Tomljanović, Ivica Nakić, Jens Saak

AI总结:

针对参数化Lyapunov方程序列,提出两种利用低秩修正结构的高效算法,分别基于SMW公式和扩展Krylov子空间,在阻尼振动与多智能体同步问题中显著加速求解。

摘要:

在许多应用场景中会遇到参数化Lyapunov方程序列。此外,此类方程的解通常是整体过程的中间步骤,该过程的主要目标是计算$\ ext{trace}(EX)$,其中$X$表示Lyapunov方程的解,$E$为给定矩阵。我们关注系数矩阵的参数依赖性被编码为对固定矩阵(种子矩阵)的低秩修正的问题。我们提出了两种充分利用这种常见结构的新数值方法。第一种方法基于Sherman-Morrison-Woodbury(SMW)公式和回收Krylov技术,适用于小规模问题,因为它使用了稠密数值线性代数工具。第二种算法则通过基于扩展Krylov子空间的最新投影技术来处理大规模问题。我们在阻尼振动系统研究和多智能体系统输出同步问题分析中测试了新算法。结果表明,我们提出的算法优于现有技术,能够显著加速精确解的计算。

英文摘要:

Sequences of parametrized Lyapunov equations can be encountered in many application settings. Moreover, solutions of such equations are often intermediate steps of an overall procedure whose main goal is the computation of $\text{trace}(EX)$ where $X$ denotes the solution of a Lyapunov equation and $E$ is a given matrix. We are interested in addressing problems where the parameter dependency of the coefficient matrix is encoded as a low-rank modification to a \emph{seed}, fixed matrix. We propose two novel numerical procedures that fully exploit such a common structure. The first one builds upon the Sherman-Morrison-Woodbury (SMW) formula and recycling Krylov techniques, and it is well-suited for small dimensional problems as it makes use of dense numerical linear algebra tools. The second algorithm can instead address large-scale problems by relying on state-of-the-art projection techniques based on the extended Krylov subspace. We test the new algorithms on several problems arising in the study of damped vibrational systems and the analyses of output synchronization problems for multi-agent systems. Our results show that the algorithms we propose are superior to state-of-the-art techniques as they are able to remarkably speed up the computation of accurate solutions.

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

↑