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

大规模低秩耦合广义西尔维斯特方程的数值解

Numerical Solution of Large-Scale Low-Rank Coupled Generalized Sylvester Equations

School of Electronic Information and Electrical Engineering, Yangtze University(长江大学电子信息与电气工程学院)

Umair Zulfiqar

AI总结:

本文针对大规模耦合广义西尔维斯特方程,提出两种基于不同克里洛夫子空间的投影算法,经数值实验验证其精度高、收敛快,为该类方程的低秩求解提供了有效方法。

摘要:

本文开发了用于计算大规模耦合广义西尔维斯特方程低秩解的投影方法。这些解的主导子空间由特定预解方向张成,这一特性催生了佩特罗夫-伽辽金(Petrov--Galerkin)投影框架。本文还讨论了投影后耦合广义西尔维斯特方程唯一可解的条件。基于这些主导子空间,提出了两种算法:基于扩展克里洛夫(extended Krylov)的投影算法和基于有理克里洛夫(rational Krylov)的投影算法,前者使用固定位移,后者使用自适应位移。在大规模基准问题上的数值实验表明,所提方法具有高精度和快速收敛性。

英文摘要:

This paper develops projection methods for computing low-rank solutions to large-scale coupled generalized Sylvester equations. The dominant subspaces of these solutions are shown to be spanned by specific resolvent directions, motivating a Petrov--Galerkin projection framework. Conditions for the unique solvability of the projected coupled generalized Sylvester equations are also discussed. Based on these dominant subspaces, two algorithms are proposed: an extended Krylov-based projection algorithm and a rational Krylov-based projection algorithm. The former uses fixed shifts, whereas the latter uses adaptive shifts. Numerical experiments on large-scale benchmark problems demonstrate that the proposed methods achieve high accuracy and fast convergence.

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

↑