scholarly journals Rational interpolation to |x| at the Chebyshev nodes

1997 ◽  
Vol 56 (1) ◽  
pp. 81-86 ◽  
Author(s):  
Lev Brutman ◽  
Eli Passow

Recently the authors considered Newman-type rational interpolation to |x| induced by arbitrary sets of interpolation nodes and showed that under mild restrictions on the location of the interpolation nodes, the corresponding sequence of rational interpolants converges to |x|. In the present paper we consider the special case of the Chebyshev nodes which are known to be very efficient for polynomial interpolation. It is shown that, in contrast to the polynomial case, the approximation of |x| induced by rational interpolation at the Chebyshev nodes has the same order as rational interpolation at equidistant points.

Author(s):  
С.В. Идимешев

Предложен спектральный метод на основе дробно-рациональной аппроксимации. На примере решений уравнения Бюргерса с особенностями в виде фронтов показано, что дробно-рациональное приближение решений имеет существенные преимущества перед полиномиальным. Для эффективной реализации дробно- рациональной аппроксимации в работе использована барицентрическая интерполяционная формула Лагранжа, обеспечивающая быстроту вычислений и численную устойчивость. Для адаптации узлов интерполяции использован метод, основанный на аппроксимации положения особенности аналитического продолжения решения в комплексной плоскость. Предложено обобщение метода на случай нескольких особенностей. Описано построение спектрального метода и проведены расчеты на модельных задачах, в т. ч. с двумя фронтами. A spectral method with adaptive rational approximation is proposed. In traditional spectral polynomial interpolation, the interpolation points are fixed, usually at the roots or extrema of orthogonal polynomials. Free selection of interpolation points is impossible due to the effect described in the Runge example. The key feature of rational interpolation is the free distribution of interpolation nodes without the occurrence of the Runge phenomenon. Nevertheless, in practice it is very important to implement rational approximation effectively. Here rational approximation is implemented using the barycentric Lagrange form. This leads to fast computations and numerical stability comparable with the polynomial interpolation. It is shown that rational interpolation has significant advantages over polynomial on functions that have singularities in the form of fronts. The key idea is that rational interpolation allows adapting interpolation points according to function singularities. An effective method of grid adaptation that accounts for singularity location was used. Method was generalized to the case of several singularities, for example, for solutions with several fronts. For the solutions of the Burgers equation with singularities in the form of fronts, it is shown that rational interpolation has significant advantages over polynomial. The implementation of spectral method is described, and calculations results on model problems, including problems with two fronts, are presented.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Xinru Liu ◽  
Yuanpeng Zhu ◽  
Shengjun Liu

A biquartic rational interpolation spline surface over rectangular domain is constructed in this paper, which includes the classical bicubic Coons surface as a special case. Sufficient conditions for generating shape preserving interpolation splines for positive or monotonic surface data are deduced. The given numeric experiments show our method can deal with surface construction from positive or monotonic data effectively.


2017 ◽  
Vol 43 ◽  
pp. 1-27 ◽  
Author(s):  
Peter Dencker ◽  
Wolfgang Erb ◽  
Yurii Kolomoitsev ◽  
Tetiana Lomako

Author(s):  
E. A. Rovba ◽  
V. Yu. Medvedeva

In this paper, we study the approximations of a function |x|α, α > 0 by interpolation rational Lagrange functions on a segment [–1,1]. The zeros of the even Chebyshev – Markov rational functions and a point x = 0 are chosen as the interpolation nodes. An integral representation of an interpolation remainder and an upper bound for the considered uniform approximations are obtained. Based on them, a detailed study is made:a) the polynomial case. Here, the authors come to the famous asymptotic equality of M. N. Hanzburg;b) at a fixed number of geometrically different poles, the upper estimate is obtained for the corresponding uniform approximations, which improves the well-known result of K. N. Lungu;c) when approximating by general Lagrange rational interpolation functions, the estimate of uniform approximations is found and it is shown that at the ends of the segment [–1,1] it can be improved.The results can be applied in theoretical research and numerical methods. 


Mathematics ◽  
2021 ◽  
Vol 9 (19) ◽  
pp. 2481
Author(s):  
Len Bos ◽  
Stefano De Marchi

We discuss a generalization of Berrut’s first and second rational interpolants to the case of equally spaced points on a triangle in R2.


Author(s):  
Ali IBRAHIMOGLU

Polynomial interpolation with equidistant nodes is notoriously unreliable due to the Runge phenomenon, and is also numerically ill-conditioned. By taking advantage of the optimality of the interpolation processes on Chebyshev nodes, one of the best strategies to defeat the Runge phenomenon is to use the mock-Chebyshev points, which are selected from a satisfactory uniform grid, for polynomial interpolation. Yet, little literature exists on the computation of these points. In this study, we investigate the properties of the mock-Chebyshev nodes and propose a subsetting method for constructing mock-Chebyshev grids. Moreover, we provide a precise formula for the cardinality of a satisfactory uniform grid. Some numerical experiments using the points obtained by the method are given to show the effectiveness of the proposed method and numerical results are also provided.


Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 751
Author(s):  
Jiří Hrivnák ◽  
Jiří Patera ◽  
Marzena Szajewska

We develop discrete orthogonality relations on the finite sets of the generalized Chebyshev nodes related to the root systems A 2 , C 2 and G 2 . The orthogonality relations are consequences of orthogonality of four types of Weyl orbit functions on the fragments of the dual weight lattices. A uniform recursive construction of the polynomials as well as explicit presentation of all data needed for the discrete orthogonality relations allow practical implementation of the related Fourier methods. The polynomial interpolation method is developed and exemplified.


2012 ◽  
Vol 546-547 ◽  
pp. 570-575 ◽  
Author(s):  
Le Zou ◽  
Jin Xie ◽  
Chang Wen Li

The advantages of barycentric interpolation formulations in computation are small number of floating points operations and good numerical stability. Adding a new data pair, the barycentric interpolation formula don’t require to renew computation of all basis functions. Thiele-type continued fractions interpolation and Newton interpolation may be the favoured nonlinear and linear interpolation. A new kind of trivariate blending rational interpolants were constructed by combining barycentric interpolation, Thiele continued fractions and Newton interpolation. We discussed the interpolation theorem, dual interpolation, no poles of the property and error estimation.


Author(s):  
Robert J Marks II

There have been numerous interesting and useful generalizations of the sampling theorem. Some are straightforward variations on the fundamental cardinal series. Oversampling, for example, results in dependent samples and allows much greater flexibility in the choice of interpolation functions. In Chapter 7, we will see that it can also result in better performance in the presence of sample data noise. Bandlimited signal restoration from samples of various filtered versions of the signal is the topic addressed in Papoulis’ generalization [1086, 1087] of the sampling theorem. Included as special cases are recurrent nonuniform sampling and simultaneously sampling a signal and one or more of its derivatives. Kramer [772] generalized the sampling theorem to signals that were bandlimited in other than the Fourier sense. We also demonstrate that the cardinal series is a special case of Lagrangian polynomial interpolation. Sampling in two or more dimensions is the topic of Section 8.9. There are a number of functions other than the sinc which can be used to weight a signal’s samples in such a manner as to uniquely characterize the signal. Use of these generalized interpolation functions allows greater flexibility in dealing with sampling theorem type characterizations. If a bandlimited signal has bandwidth B, then it can also be considered to have bandwidthW ≥ B.


Sign in / Sign up

Export Citation Format

Share Document