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

Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations

Davide Palitta, Valeria Simoncini

英文摘要:

Galerkin and Petrov-Galerkin methods are some of the most successful solution procedures in numerical analysis. Their popularity is mainly due to the optimality properties of their approximate solution. We show that these features carry over to the (Petrov-)Galerkin methods applied for the solution of linear matrix equations. Some novel considerations about the use of Galerkin and Petrov-Galerkin schemes in the numerical treatment of general linear matrix equations are expounded and the use of constrained minimization techniques in the Petrov-Galerkin framework is proposed.

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

↑