Searcharxiv⌕ Search

arXiv subjects

Francesco Dell'Accio

Publications and source records attributed to Francesco Dell'Accio.

At least 19 recordsLinked to original sources

Polynomial interpolation--regression on the sphere

We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed subset of nodes and uses the remaining sampling nodes to minimize the residual in a least squares sense. Under natural rank assumptions on the associated Vandermonde matrices, the approximant is unique and is characterized by an orthogonality condition with respect to the discrete inner product on the sampling set. We then focus on the case in which the sampling and interpolation nodes are antipodally symmetric. In this setting, when the polynomial is expressed in real spherical harmonics, the constrained problem can be decomposed into independent even and odd components. In the same framework, we prove equivariance under the antipodal map and, more generally, under orthogonal transformations preserving the node sets. We also consider spherical designs. In this case, the normal matrix is a scalar matrix. Consequently, the spectral condition number of the associated KKT matrix can be written explicitly. Numerical experiments in both antipodal and non-antipodal settings illustrate the effectiveness of the proposed method.

math.NA↗

A General Probability Density Framework for Local Histopolation and Weighted Function Reconstruction from Mesh Line Integrals

In this paper, we study the reconstruction of a bivariate function from weighted integrals along the edges of a triangular mesh, a problem of central importance in tomography, computer vision, and numerical approximation. Our approach relies on local histopolation methods defined through unisolvent triples, where the edge weights are induced by suitable probability densities. In particular, we introduce two new two-parameter families of generalized truncated normal distributions, which extend classical exponential-type laws and provide additional flexibility in capturing local features of the target function. These distributions give rise to new quadratic reconstruction operators that generalize the standard linear histopolation scheme, while retaining its simplicity and locality. We establish their theoretical foundations, proving unisolvency and deriving explicit basis functions, and we demonstrate their improved accuracy through extensive numerical tests. Moreover, we design an algorithm for the optimal selection of the distribution parameters, ensuring robustness and adaptivity of the reconstruction. Finally, we show that the proposed framework naturally extends to any bivariate function whose restriction to the edges defines a valid probability density, thus highlighting its generality and broad applicability.

math.NA↗

A $C^{\infty}$ rational quasi-interpolation operator for functions with jumps without the Gibbs phenomenon

The study of quasi-interpolation has gained significant importance in numerical analysis and approximation theory due to its versatile applications in scientific and engineering fields. This technique provides a flexible and efficient alternative to traditional interpolation methods by approximating data points without requiring the approximated function to pass exactly through them. This approach is particularly valuable for handling jump discontinuities, where classical interpolation methods often fail due to the Gibbs phenomenon. These discontinuities are common in practical scenarios such as signal processing and computational physics. In this paper, we present a $C^{\infty}$ rational quasi-interpolation operator designed to effectively approximate functions with jump discontinuities while minimizing the issues typically associated with traditional interpolation methods.

math.NA↗

Multinode Shepard Functions and Tensor Product Polynomial Interpolation: Applications to Digital Elevation Models

The paper presents an in-depth exploration of the multinode Shepard interpolant on a regular rectangular grid, demonstrating its efficacy in reconstructing surfaces from DEM data. Additionally, we study the approximation order associated to this interpolant and present a detailed algorithm for reconstructing surfaces. Numerical tests showcase the effectiveness of the proposed algorithm.

math.NA↗

Multinode Shepard collocation method for pricing of financial derivatives

This paper explores the use of the multinode Shepard method for the numerical solution of the two-dimensional Black-Scholes equation. The proposed approach integrates a spatial approximation via the multinode Shepard operator with a temporal discretization based on the Backward Difference Formula. Numerical experiments are presented to demonstrate the accuracy and effectiveness of the method.

math.NA↗

The univariate multinode Shepard method for the Caputo fractional derivatives: from Approximation to the solution of Bagley-Torvik equation

In this paper, we approximate the fractional derivative of a given function using the univariate multinode Shepard method through the Gauss-Jacobi quadrature formula. Subsequently, the proposed method is applied to the numerical solution of boundary value problems (BVPs) and initial value problems (IVPs), specifically addressing the Bagley-Torvik equations. Experimental results confirm the method's effectiveness, particularly in accurately approximating the Bagley-Torvik equation for both BVPs and IVPs.

math.NA↗

Weighted and unweighted enrichment strategies for solving the Poisson problem with Dirichlet boundary conditions

In this paper, we propose weighted and unweighted enrichment strategies to enhance the accuracy of the linear lagrangian finite element for solving the Poisson problem with Dirichlet boundary conditions. We first recall key examples of admissible enrichment functions, specifically designed to overcome the limitations of the linear lagrangian finite element in capturing solution features such as sharp gradients and boundary-layer phenomena. We then introduce two novel three-parameter families of weighted enrichment functions and derive an explicit error bound in $L^2$-norm. Numerical experiments confirm the effectiveness of the proposed approach in improving approximation accuracy, demonstrating its potential for a wide range of applications.

math.NA↗

Nonconforming approximation methods for function reconstruction on general polygonal meshes via orthogonal polynomials

In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials and can reproduce higher-degree polynomials. This setting naturally arises in applications where pointwise evaluations are unavailable and only integral measurements over subdomains are accessible. We develop a unisolvence theory and derive necessary and sufficient conditions for the associated approximation spaces to be unisolvent. Specifically, it is shown that unisolvence depends on the parity of the product of the polynomial degree~$m$ and the number of polygon edges~$N$. When this condition is not satisfied, we introduce an enrichment strategy involving an additional linear functional and a suitably designed enrichment function to ensure unisolvence. Numerical experiments confirm the accuracy of the proposed method.

math.NA↗

A novel interpolation-regression approach for function approximation on the disk and its application to cubature formulas

The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies in its ability to avoid the Runge phenomenon. In this paper, we present a polynomial approximation method based on an interpolation-regression approach for reconstructing functions defined on disk domains from their evaluations at a general set of sampling points. Special attention is devoted to the selection of interpolation nodes to ensure numerical stability, particularly in the context of Zernike polynomials. As an application, the proposed method is used to derive accurate cubature formulas for numerical integration over the disk.

math.NA↗

$C^{\infty}$ rational approximation and quasi-histopolation of functions with jumps through multinode Shepard functions

Histopolation, or interpolation on segments, is a mathematical technique used to approximate a function $f$ over a given interval $I=[a,b]$ by exploiting integral information over a set of subintervals of $I$. Unlike classical polynomial interpolation, which is based on pointwise function evaluations, histopolation reconstructs a function using integral data. However, similar to classical polynomial interpolation, histopolation suffers from the well-known Runge phenomenon when integral data are based on a grid with many equispaced nodes, as well as the Gibbs phenomenon when approximating discontinuous functions. In contrast, quasi-histopolation is designed to relax the strict requirement of passing through all the given data points. This inherent flexibility can reduce the likelihood of oscillatory behavior using, for example, rational approximation operators. In this work, we introduce a $C^{\infty}$ rational quasi-histopolation operator, for bounded (integrable) functions, which reconstruct a function by defeating both the Runge and Gibbs phenomena. A key element of our approach is to blend local histopolation polynomials on a few nodes using multinode Shepard functions as blending functions. Several numerical experiments demonstrate the accuracy of our method.

math.NA↗

Bivariate polynomial histopolation techniques on Padua, Fekete and Leja triangles

This paper explores the reconstruction of a real-valued function $f$ defined over a domain $Ω\subset \mathbb{R}^2$ using bivariate polynomials that satisfy triangular histopolation conditions. More precisely, we assume that only the averages of $f$ over a given triangulation $\mathcal{T}_N$ of $Ω$ are available and seek a bivariate polynomial that approximates $f$ using a histopolation approach, potentially flanked by an additional regression technique. This methodology relies on the selection of a subset of triangles $\mathcal{T}_M \subset \mathcal{T}_N$ for histopolation, ensuring both the solvability and the well-conditioning of the problem. The remaining triangles can potentially be used to enhance the accuracy of the polynomial approximation through a simultaneous regression. We will introduce histopolation and combined histopolation-regression methods using the Padua points, discrete Leja sequences, and approximate Fekete nodes. The proposed algorithms are implemented and evaluated through numerical experiments that demonstrate their effectiveness in function approximation.

math.NA↗

Constrained mock-Chebyshev least squares approximation for Hermite interpolation

This paper addresses the challenge of function approximation using Hermite interpolation on equally spaced nodes. In this setting, standard polynomial interpolation suffers from the Runge phenomenon. To mitigate this issue, we propose an extension of the constrained mock-Chebyshev least squares approximation technique to Hermite interpolation. This approach leverages both function and derivative evaluations, resulting in more accurate approximations. Numerical experiments are implemented in order to illustrate the effectiveness of the proposed method.

math.NA↗

Polynomial histopolation on mock-Chebyshev segments

In computational practice, we often encounter situations where only measurements at equally spaced points are available. Using standard polynomial interpolation in such cases can lead to highly inaccurate results due to numerical ill-conditioning of the problem. Several techniques have been developed to mitigate this issue, such as the mock-Chebyshev subset interpolation and the constrained mock-Chebyshev least-squares approximation. The high accuracy and the numerical stability achieved by these techniques motivate us to extend these methods to histopolation, a polynomial interpolation method based on segmental function averages. While classical polynomial interpolation relies on function evaluations at specific nodes, histopolation leverages averages of the function over subintervals. In this work, we introduce three types of mock-Chebyshev approaches for segmental interpolation and theoretically analyse the stability of their Lebesgue constants, which measure the numerical conditioning of the histopolation problem under small perturbations of the segments. We demonstrate that these segmental mock-Chebyshev approaches yield a quasi-optimal logarithmic growth of the Lebesgue constant in relevant scenarios. Additionally, we compare the performance of these new approximation techniques through various numerical experiments.

math.NA↗

Unisolvence of random Kansa collocation by Thin-Plate Splines for the Poisson equation

Existence of sufficient conditions for unisolvence of Kansa unsymmetric collocation for PDEs is still an open problem. In this paper we make a first step in this direction, proving that unsymmetric collocation matrices with Thin-Plate Splines for the 2D Poisson equation are almost surely nonsingular, when the discretization points are chosen randomly on domains with analytic boundary.

math.NA↗

A new quadratic and cubic polynomial enrichment of the Crouzeix-Raviart finite element

In this paper, we introduce quadratic and cubic polynomial enrichments of the classical Crouzeix--Raviart finite element, with the aim of constructing accurate approximations in such enriched elements. To achieve this goal, we respectively add three and seven weighted line integrals as enriched degrees of freedom. For each case, we present a necessary and sufficient condition under which these augmented elements are well-defined. For illustration purposes, we then use a general approach to define two-parameter families of admissible degrees of freedom. Additionally, we provide explicit expressions for the associated basis functions and subsequently introduce new quadratic and cubic approximation operators based on the proposed admissible elements. The efficiency of the enriched methods is compared to the triangular Crouzeix--Raviart element. As expected, the numerical results exhibit a significant improvement, confirming the effectiveness of the developed enrichment strategy.

math.NA↗

Polynomial approximation of derivatives by the constrained mock-Chebyshev least squares operator

The constrained mock-Chebyshev least squares operator is a linear approximation operator based on an equispaced grid of points. Like other polynomial or rational approximation methods, it was recently introduced in order to defeat the Runge phenomenon that occurs when using polynomial interpolation on large sets of equally spaced points. The idea is to improve the mock-Chebyshev subset interpolation, where the considered function $f$ is interpolated only on a proper subset of the uniform grid, formed by nodes that mimic the behavior of Chebyshev--Lobatto nodes. In the mock-Chebyshev subset interpolation all remaining nodes are discarded, while in the constrained mock-Chebyshev least squares interpolation they are used in a simultaneous regression, with the aim to further improving the accuracy of the approximation provided by the mock-Chebyshev subset interpolation. The goal of this paper is two-fold. We discuss some theoretical aspects of the constrained mock-Chebyshev least squares operator and present new results. In particular, we introduce explicit representations of the error and its derivatives. Moreover, for a sufficiently smooth function $f$ in $[-1,1]$, we present a method for approximating the successive derivatives of $f$ at a point $x\in [-1,1]$, based on the constrained mock-Chebyshev least squares operator and provide estimates for these approximations. Numerical tests demonstrate the effectiveness of the proposed method.

math.NA↗

Numerical differentiation on scattered data through multivariate polynomial interpolation

We discuss a pointwise numerical differentiation formula on multivariate scattered data, based on the coefficients of local polynomial interpolation at Discrete Leja Points, written in Taylor's formula monomial basis. Error bounds for the approximation of partial derivatives of any order compatible with the function regularity are provided, as well as sensitivity estimates to functional perturbations, in terms of the inverse Vandermonde coefficients that are active in the differentiation process. Several numerical tests are presented showing the accuracy of the approximation.

math.NA↗