当前位置: X-MOL 学术SIAM J. Numer. Anal. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Complex Homographic Best Approximation Problem. Application to Optimized Robin--Schwarz Algorithms, and Optimal Control Problems
SIAM Journal on Numerical Analysis ( IF 2.9 ) Pub Date : 2021-06-28 , DOI: 10.1137/20m1335789
Bérangère Delourme , Laurence Halpern

SIAM Journal on Numerical Analysis, Volume 59, Issue 3, Page 1769-1810, January 2021.
Homographic complex best approximation has emerged in recent years as an essential tool for the design of new, performant domain decomposition Robin--Schwarz algorithms. We present and analyze a fully complex problem, introducing a new alternation property. We give operational formulas for the solution and apply them to a control problem.


中文翻译:

一个复杂的单应最佳逼近问题。应用到优化的 Robin--Schwarz 算法和最优控制问题

SIAM 数值分析杂志,第 59 卷,第 3 期,第 1769-1810 页,2021 年 1 月
。 近年来,单应复数最佳逼近已成为设计新的高性能域分解 Robin-Schwarz 算法的重要工具。我们提出并分析了一个完全复杂的问题,引入了一个新的交替特性。我们给出了解决方案的操作公式并将它们应用于控制问题。
更新日期:2021-06-29
down
wechat
bug