In this paper we use the constrained mock-Chebyshev least squares interpolation to obtain
stable quadrature formulas with high degree of exactness and accuracy from equispaced …

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 this paper, we present recent solutions to the problem of approximating functions by
polynomials for reducing in a substantial manner two well-known phenomena: Runge and …

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 …

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 …

In this paper we develop an adaptive algorithm for determining the optimal degree of
regression in the constrained mock-Chebyshev least-squares interpolation of an analytic …

Abstract Recently,(β, γ)-Chebyshev functions, as well as the corresponding zeros, have
been introduced as a generalization of classical Chebyshev polynomials of the first kind and …

A very common problem in computational science is the determination of an approximation,
in a fixed interval, of a function whose evaluations are known only on a finite set of points. A …