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

大规模微分李雅普诺夫矩阵方程的数值解法

Numerical solutions to large-scale differential Lyapunov matrix equations

Université des Sciences et Technologies de Lille(里尔科学技术大学);Université du Littoral Côte d’Opale(加来海峡沿岸大学)

M. Hached, K. Jbilou

AI总结:

本文提出两种新方法求解大规模低秩常数项微分李雅普诺夫矩阵方程,通过积分表达式和矩阵指数近似,以及投影到块Krylov子空间后利用BDF方法求解,最终得到低秩近似解。

摘要:

本文考虑具有低秩常数项的大规模微分李雅普诺夫矩阵方程,提出两种数值求解方法。第一种方法基于精确解的积分表达式和矩阵指数与向量块的近似计算。第二种方法首先将初始问题投影到块(或扩展块)Krylov子空间,得到低维微分李雅普诺夫矩阵方程,然后通过BDF方法求解,并将得到的解用于构建原问题的低秩近似解。该过程重复直到达到预定精度。本文给出了一些新的理论结果并展示了数值实验。

英文摘要:

In the present paper, we consider large-scale differential Lyapunov matrix equations having a low rank constant term. We present two new approaches for the numerical resolution of such differential matrix equations. The first approach is based on the integral expression of the exact solution and an approximation method for the computation of the exponential of a matrix times a block of vectors. In the second approach, we first project the initial problem onto a block (or extended block) Krylov subspace and get a low-dimensional differential Lyapunov matrix equation. The latter differential matrix problem is then solved by the Backward Differentiation Formula method (BDF) and the obtained solution is used to build the low rank approximate solution of the original problem. The process being repeated until some prescribed accuracy is achieved. We give some new theoretical results and present some numerical experiments.

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

↑