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

一种用于Sylvester型方程的低秩BUG方法

A Low-Rank BUG Method for Sylvester-Type Equations

Georgios Vretinaris

AI总结:

本文提出一种受BUG积分器启发的低秩算法,通过利用解的低秩结构与稀疏性高效逼近Sylvester型方程,将构建和求解线性系统的计算复杂度降至O(kr(n^2+m^2+mn+r^2))。

摘要:

我们提出了一种受基更新与Galerkin(BUG)积分器启发的低秩算法,以高效逼近Sylvester型方程的解。该算法能够利用解的低秩结构以及存在的任何稀疏性来降低计算复杂度。即使使用标准稠密求解器(如Bartels-Stewart算法)来求解我们方法生成的降阶Sylvester方程,构建和求解相关线性系统的整体计算复杂度也降至O(kr(n^2+m^2+mn+r^2)),其中X属于R^{m×n},k为迭代次数,r为逼近的秩。

英文摘要:

We introduce a low-rank algorithm inspired by the Basis-Update and Galerkin (BUG) integrator to efficiently approximate solutions to Sylvester-type equations. The algorithm can exploit both the low-rank structure of the solution as well as any sparsity present to reduce computational complexity. In the worst case scenario, i.e. even when a standard dense solver, such as the Bartels-Stewart algorithm, is used for the reduced Sylvester equations generated by our approach, the overall computational complexity for constructing and solving the associated linear systems reduces to $\mathcal{O}\left(kr(n^2+m^2 +mn + r^2)\right)$, for $X\in \mathbb{R}^{m \times n}$, where $k$ is the number of iterations and $r$ the rank of the approximation, but any method can be used to exploit existing structure to optimize the solution even further.

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

↑