A COMPLEX HOMOGRAPHIC BEST APPROXIMATION PROBLEM. APPLICATION TO OPTIMIZED ROBIN-SCHWARZ ALGORITHMS, AND OPTIMAL CONTROL PROBLEMS

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.

Automated summary

Homographic complex best approximation is a crucial tool for designing high-performance domain decomposition Robin-Schwarz algorithms, with the introduction of a new alternation property to solve complex problems and apply them to control issues.