On a Bivariate Generalization of Berrut’s Barycentric Rational Interpolation to a Triangle

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

Rational Interpolation: Jacobi’s Approach Reminiscence

We treat the interpolation problem {f(xj)=yj}j=1N for polynomial and rational functions. Developing the approach originated by C. Jacobi, we represent the interpolants by virtue of the Hankel polynomials generated by the sequences of special symmetric functions of the data set like {∑j=1Nxjkyj/W′(xj)}k∈N and {∑j=1Nxjk/(yjW′(xj))}k∈N; here, W(x)=∏j=1N(x−xj). We also review the results by Jacobi, Joachimsthal, Kronecker and Frobenius on the recursive procedure for computation of the sequence of Hankel polynomials. The problem of evaluation of the resultant of polynomials p(x) and q(x) given a set of values {p(xj)/q(xj)}j=1N is also tackled within the framework of this approach. An effective procedure is suggested for recomputation of rational interpolants in case of extension of the data set by an extra point.

Enhanced numerical integration scheme based on image compression techniques: Application to rational polygonal interpolants

Polygonal finite elements offer an increased freedom in terms of mesh generation at the price of more complex, often rational, shape functions. Thus, the numerical integration of rational interpolants over polygonal domains is one of the challenges that needs to be solved. If, additionally, strong discontinuities are present in the integrand, e.g., when employing fictitious domain methods, special integration procedures must be developed. Therefore, we propose to extend the conventional quadtree-decomposition-based integration approach by image compression techniques. In this context, our focus is on unfitted polygonal elements using Wachspress shape functions. In order to assess the performance of the novel integration scheme, we investigate the integration error and the compression rate being related to the reduction in integration points. To this end, the area and the stiffness matrix of a single element are computed using different formulations of the shape functions, i.e., global and local, and partitioning schemes. Finally, the performance of the proposed integration scheme is evaluated by investigating two problems of linear elasticity.

On the approximation of $ \ exp (-x) $ on the half-axis by spline functions in three-point rational interpolants

For the function $f(x)=\exp(-x)$, $x\in [0,+\infty)$ on grids of nodes $\Delta: 0=x_0<x_1<\dots $ with $x_n\to +\infty$ we construct rational spline-functions such that $R_k(x,f, \Delta)=R_i(x,f)A_{i,k}(x)\linebreak+R_{i-1}(x, f)B_{i,k}(x)$ for $x\in[x_{i-1}, x_i]$ $(i=1,2,\dots)$ and $k=1,2,\dots$ Here $A_{i,k}(x)=(x-x_{i-1})^k/((x-x_{i-1})^k+(x_i-x)^k)$, $B_{i,k}(x)=1-A_{i,k}(x)$, $R_j(x,f)=\alpha_j+\beta_j(x-x_j)+\gamma_j/(x+1)$ $(j=1,2,\dots)$, $R_j(x_m,f)=f(x_m)$ при $m=j-1,j,j+1$; we take $R_0(x,f)\equiv R_1(x,f)$. Bounds for the convergence rate of $R_k(x,f, \Delta)$ with $f(x)=\exp(-x)$, $x\in [0,+\infty)$, are found.