Related papers: Classical multivariate Hermite coordinate interpol…
The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…
We present a PDE-based approach for the multidimensional extrapolation of smooth scalar quantities across interfaces with kinks and regions of high curvature. Unlike the commonly used method of [2] in which normal derivatives are…
We formulate a simple algorithm for computing global exact symmetries of closed discrete curves in plane. The method is based on a suitable trigonometric interpolation of vertices of the given polyline and consequent computation of the…
A numerical scheme is described for accurately accommodating oblique, non-aligned, boundaries, on a three-dimensional cartesian grid. The scheme gives second-order accuracy in the solution for potential of Poisson's equation using compact…
Orthogonal polynomials are of fundamental importance in many fields of mathematics and science, therefore the study of a particular family is always relevant. In this manuscript, we present a survey of some general results of the Hermite…
We propose a multi-moment method for one-dimensional hyperbolic equations with smooth coefficient and piecewise constant coefficient. The method is entirely based on the backward characteristic method and uses the solution and its…
Let $\mathcal{R}:=\mathbb{F}[{\bf x};\sigma,\delta]$ be a multivariate skew polynomial ring over a division ring $\mathbb{F}$. In this paper, we introduce the notion of right and left $(\sigma,\delta)$-partial derivatives of polynomials in…
In simulation technology, computationally expensive objective functions are often replaced by cheap surrogates, which can be obtained by interpolation. Full grid interpolation methods suffer from the so-called curse of dimensionality,…
A class of trigonometric interpolation splines depending on parameter vectors, selected convergence factors and interpolation factors is considered. The concept of crosslink grids and interpolation grids is introduced; these grids can match…
Various algebraic multigrid algorithms have been developed for solving problems in scientific and engineering computation over the past decades. They have been shown to be well-suited for solving discretized partial differential equations…
Mean value interpolation is a method for fitting a smooth function to piecewise-linear data prescribed on the boundary of a polygon of arbitrary shape, and has applications in computer graphics and curve and surface modelling. The method…
The multigrid algorithm is a multilevel approach to accelerate the numerical solution of discretized differential equations in physical problems involving long-range interactions. Multiresolution analysis of wavelet theory provides an…
In this paper are discussed the results of new numerical experiments on zero distribution of type I Hermite-Pad\'e polynomials of order $n=200$ for three different collections of three functions $[1,f_1,f_2]$. These results are obtained by…
Hermite interpolation property is desired in applied and computational mathematics. Hermite and vector subdivision schemes are of interest in CAGD for generating subdivision curves and in computational mathematics for building Hermite…
It has been known for over 70 years that there is an asymptotic transition of Charlier polynomials to Hermite polynomials. This transition, which is still presented in its classical form in modern reference works, is valid if and only if a…
We propose a polynomial preserving recovery method for PHT-splines within isogeometric analysis to obtain more accurate gradient approximations. The method fully exploits the local interpolation properties of PHT-splines and avoids the need…
In this paper we present an estimate of accuracy for a piecewise polynomial approximation of a classical numerical solution to a non linear differential problem. We suppose the numerical solution U is computed using a grid with a small…
A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…
It is shown that if a non-zero function $f\in B_\sigma$ has infinitely many double zeros on the real axis, then there exists at least one pair of consecutive zeros whose distance apart is greater than $\dfrac{\pi}{\sigma}\tau^{1/4}$,…
The aim of this work is to show how symbolic computation can be used to perform multivariate Lagrange, Hermite and Birkhoff interpolation and help us to build more realistic interpolating functions. After a theoretical introduction in which…