Abstract
We present and study a homographic best approximation problem, which arises in the analysis of waveform relaxation algorithms with optimized transmission conditions. Its solution characterizes in each class of transmission conditions the one with the best performance of the associated waveform relaxation algorithm. We present the particular class of first order transmission conditions in detail and show that the new waveform relaxation algorithms are well posed and converge much faster than the classical one: the number of iterations to reach a certain accuracy can be orders of magnitudes smaller. We illustrate our analysis with numerical experiments. © 2008 American Mathematical Society.
Cite
CITATION STYLE
Bennequin, D., Gander, M. J., & Halpern, L. (2009). A homographic best approximation problem with application to optimized Schwarz waveform relaxation. Mathematics of Computation, 78(265), 185–185. https://doi.org/10.1090/s0025-5718-08-02145-5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.