The constrained mock-Chebyshev least squares interpolation is a univariate polynomial
interpolation technique exploited to cut-down the Runge phenomenon. It takes advantage of …

This work is concerned with the interpolation of a function f when using a low number of
interpolation points, as required by the finite element method for solving PDEs numerically …

The mapped bases or Fake Nodes Approach (FNA), introduced in De Marchi et al.(J Comput
Appl Math 364: 112347, 2020c), allows to change the set of nodes without the need of …

In this paper, we introduce the class of (β, γ)-Chebyshev functions and corresponding points,
which can be seen as a family of generalized Chebyshev polynomials and points. For the (β …

In this paper, we collect the basic theory and the most important applications of a novel
technique that has shown to be suitable for scattered data interpolation, quadrature, bio …

In several applications, ranging from computational geometry and finite element analysis to
computer graphics, there is a need to approximate functions defined on triangular domains …

To analyze multimodal three-dimensional medical images, interpolation is required for
resampling which—unavoidably—introduces an interpolation error. In this work we describe …

This paper proposes a new numerical approach useful in dealing with nearly singular
integrals, specifically, the integral of the first order polarization tensor (PT). Polarization …

When an approximant is accurate on the interval, it is only natural to try to extend it to several-
dimensional domains. In the present article, we make use of the fact that linear rational …

In this work, we study a global quadrature scheme for analytic functions on compact intervals
based on function values on quasi-uniform grids of quadrature nodes. In practice it is not …