Jean-Paul Berrut,
Giacomo Elefante
S. 726 - 743
doi:
10.1553/etna_vol55s726
Verlag der Österreichischen Akademie der Wissenschaften
doi:
10.1553/etna_vol55s726
Abstract:
When an approximant is accurate on an interval, it is only natural to try to extend it to multi-dimensional domains. In the present article we make use of the fact that linear rational barycentric interpolants converge rapidly toward analytic and several-times differentiable functions to interpolate them on two-dimensional starlike domains parametrized in polar coordinates. In the radial direction, we engage interpolants at conformally shifted Chebyshev nodes, which converge exponentially for analytic functions. In the circular direction, we deploy linear rational trigonometric barycentric interpolants, which converge similarly rapidly for periodic functions but now for conformally shifted equispaced nodes. We introduce a variant of a tensor-product interpolant of the above two schemes and prove that it converges exponentially for two-dimensional analytic functions–up to a logarithmic factor–and with an order limited only by the order of differentiability for real functions (provided that the boundary enjoys the same order of differentiability). Numerical examples confirm that the shifts permit one to reach a much higher accuracy with significantly fewer nodes, a property which is especially important in several dimensions.
barycentric rational interpolation, trigonometric interpolation, Lebesgue constant, conformal maps, starlike domains
Published Online:
2022/09/01 12:28:25
Object Identifier:
0xc1aa5576 0x003da93b
Rights:All rights reserved.For questions regarding copyright and copies please contact us by email.
Electronic Transactions on Numerical Analysis (ETNA) is an electronic journal for the publication of significant new developments in numerical analysis and scientific computing. Papers of the highest quality that deal with the analysis of algorithms for the solution of continuous models and numerical linear algebra are appropriate for ETNA, as are papers of similar quality that discuss implementation and performance of such algorithms. New algorithms for current or new computer architectures are appropriate provided that they are numerically sound. However, the focus of the publication should be on the algorithm rather than on the architecture. The journal is published by the Kent State University Library in conjunction with the Institute of Computational Mathematics at Kent State University, and in cooperation with the Johann Radon Institute for Computational and Applied Mathematics of the Austrian Academy of Sciences (RICAM). Reviews of all ETNA papers appear in Mathematical Reviews and Zentralblatt für Mathematik. Reference information for ETNA papers also appears in the expanded Science Citation Index. ETNA is registered with the Library of Congress and has ISSN 1068-9613.
…
Home
Order
Print
References
Share
