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

一种用于在矩阵值指数积分器中求解Lyapunov算子$φ$-函数的低秩算法

A low-rank algorithm for solving Lyapunov operator $φ$-functions within the matrix-valued exponential integrators

Dongping Li, Xiuying Zhang, Hongjiong Tian

AI总结:

本文提出一种基于缩放递归和准向后误差分析的低秩算法,用于高效计算大规模Lyapunov算子$φ$-函数的低秩近似,为矩阵值指数积分器求解微分Lyapunov方程和Riccati方程提供基础工具。

摘要:

本文提出了一种低秩算法,用于计算大规模Lyapunov算子$φ$-函数的低秩近似。这些计算在实现大规模刚性矩阵微分方程的矩阵值指数积分器中起着关键作用,其中(近似)解具有低秩特性。所提方法采用缩放与递归过程,并辅以准向后误差分析来确定最优参数。计算成本主要由稀疏矩阵与块向量的乘法决定。数值实验验证了所提方法作为矩阵值指数积分器的基础工具在求解微分Lyapunov方程和Riccati方程中的有效性。

英文摘要:

In this work we present a low-rank algorithm for computing low-rank approximations of large-scale Lyapunov operator $φ$-functions. These computations play a crucial role in implementing of matrix-valued exponential integrators for large-scale stiff matrix differential equations, where the (approximate) solutions are of low rank.The proposed method employs a scaling and recursive procedure, complemented by a quasi-backward error analysis to determine the optimal parameters. The computational cost is primarily determined by the multiplication of sparse matrices with block vectors. Numerical experiments validate the effectiveness of the proposed method as a foundational tool for matrix-valued exponential integrators in solving differential Lyapunov equations and Riccati equations.

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

↑