Giacomo Elefante
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Giacomo Elefante has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Stefano De Marchi
University of Padua
10 shared publications - Francesco Marchetti
Department of Mathematics "Tullio Levi-Civita" University of Padova Padova Italy
5 shared publications - Ludovico Bruni Bruno
Dipartimento di Scienze Matematiche “Giuseppe Luigi Lagrange”, Politecnico di Torino, Torino, Italia
5 shared publications - Andrea Bacigalupo
University of Genova
2 shared publications - Elisa Francomano
Department of Engineering, University of Palermo, Viale delle Scienze, 90128 Palermo, Italy
2 shared publications Francesco Marchetti
2 shared publications
Latest Publications
- Open Access
- 30 September 2026
- Published by Elsevier in Signal Processing
- Vol. 252
Bespoke multiresolution analysis of graph signals
- 30 September 2026
- Published by Elsevier in Signal Processing
- Vol. 252
Open AccessBespoke multiresolution analysis of graph signals
- Open Access
- 6 May 2026
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 66 (2) , 33
Polynomial approximation from diffused data: unisolvence and stability
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused problems are related by the mean value theorem, such an approach does not provide any concrete insights in terms of well-posedness and stability. We hence develop a different framework in which unisolvence can be again recovered from nodal results, for which a wide literature is available. To analyze the stability of the so-obtained diffused interpolation procedure, we characterize the norm of the interpolation operator in terms of a Lebesgue constant-like quantity. After analyzing some of its features, such as invariance properties and sensitivity to support overlapping, we numerically verify the theoretical findings.
- 6 May 2026
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 66 (2) , 33
Open AccessPolynomial approximation from diffused data: unisolvence and stability
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused problems are related by the mean value theorem, such an approach does not provide any concrete insights in terms of well-posedness and stability. We hence develop a different framework in which unisolvence can be again recovered from nodal results, for which a wide literature is available. To analyze the stability of the so-obtained diffused interpolation procedure, we characterize the norm of the interpolation operator in terms of a Lebesgue constant-like quantity. After analyzing some of its features, such as invariance properties and sensitivity to support overlapping, we numerically verify the theoretical findings.
- Open Access
- 19 March 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (2) , 35
Adaptive RBF Cubature by Scattered Data on Spherical Polygons
In this work, we introduce an adaptive radial basis function (RBF) algorithm for numerical cubature over scattered data in a spherical polygon. In particular, we focus on the families of radial-power and thin-plate spline basis functions and we perform interpolation with an exponent parameter near-optimal for integration and data-driven. A further key ingredient of the algorithm is a novel adaptive routine for computing integrals over these domains. We make numerical experiments over various spherical polygons, even intricate ones as approximations of the African and Australian continents, highlighting the qualities of our approach. All the MATLAB routines used for this task are available as open-source codes.
- 19 March 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (2) , 35
Open AccessAdaptive RBF Cubature by Scattered Data on Spherical Polygons
In this work, we introduce an adaptive radial basis function (RBF) algorithm for numerical cubature over scattered data in a spherical polygon. In particular, we focus on the families of radial-power and thin-plate spline basis functions and we perform interpolation with an exponent parameter near-optimal for integration and data-driven. A further key ingredient of the algorithm is a novel adaptive routine for computing integrals over these domains. We make numerical experiments over various spherical polygons, even intricate ones as approximations of the African and Australian continents, highlighting the qualities of our approach. All the MATLAB routines used for this task are available as open-source codes.
- Open Access
- 10 October 2025
- Published by Springer Nature in Research Square
Polynomial approximation from diffused data: unisolvence and stability
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused problems are related by the mean value theorem, such an approach does not provide any concrete insights in terms of well-posedness and stability. We hence develop a different framework in which {\it unisolvence} can be again recovered from nodal results, for which a wide literature is available. To analyze the stability of the so-obtained diffused interpolation procedure, we characterize the norm of the interpolation operator in terms of a Lebesgue constant-like quantity. After analyzing some of its features, such as invariance properties and sensitivity to support overlapping, we numerically verify the theoretical findings. Mathematics Subject Classification (2020) 65D05 · 65D30 · 41A35
- 10 October 2025
- Published by Springer Nature in Research Square
Open AccessPolynomial approximation from diffused data: unisolvence and stability
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused problems are related by the mean value theorem, such an approach does not provide any concrete insights in terms of well-posedness and stability. We hence develop a different framework in which {\it unisolvence} can be again recovered from nodal results, for which a wide literature is available. To analyze the stability of the so-obtained diffused interpolation procedure, we characterize the norm of the interpolation operator in terms of a Lebesgue constant-like quantity. After analyzing some of its features, such as invariance properties and sensitivity to support overlapping, we numerically verify the theoretical findings. Mathematics Subject Classification (2020) 65D05 · 65D30 · 41A35
- Open Access
Polynomial approximation from diffused data: unisolvence and stability
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused problems are related by the mean value theorem, such an approach does not provide any concrete insights in terms of well-posedness and stability. We hence develop a different framework in which {\it unisolvence} can be again recovered from nodal results, for which a wide literature is available. To analyze the stability of the so-obtained diffused interpolation procedure, we characterize the norm of the interpolation operator in terms of a Lebesgue constant-like quantity. After analyzing some of its features, such as invariance properties and sensitivity to support overlapping, we numerically verify the theoretical findings.
Open AccessPolynomial approximation from diffused data: unisolvence and stability
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused problems are related by the mean value theorem, such an approach does not provide any concrete insights in terms of well-posedness and stability. We hence develop a different framework in which {\it unisolvence} can be again recovered from nodal results, for which a wide literature is available. To analyze the stability of the so-obtained diffused interpolation procedure, we characterize the norm of the interpolation operator in terms of a Lebesgue constant-like quantity. After analyzing some of its features, such as invariance properties and sensitivity to support overlapping, we numerically verify the theoretical findings.
- Open Access
Bespoke multiresolution analysis of graph signals
We present a novel framework for discrete multiresolution analysis of graph signals. The main analytical tool is the samplet transform, originally defined in the Euclidean framework as a discrete wavelet-like construction, tailored to the analysis of scattered data. The first contribution of this work is defining samplets on graphs. To this end, we subdivide the graph into a fixed number of patches, embed each patch into a Euclidean space, where we construct samplets, and eventually pull the construction back to the graph. This ensures orthogonality, locality, and the vanishing moments property with respect to properly defined polynomial spaces on graphs. Compared to classical Haar wavelets, this framework broadens the class of graph signals that can efficiently be compressed and analyzed. Along this line, we provide a definition of a class of signals that can be compressed using our construction. We support our findings with different examples of signals defined on graphs whose vertices lie on smooth manifolds. For efficient numerical implementation, we combine heavy edge clustering, to partition the graph into meaningful patches, with landmark \texttt{Isomap}, which provides low-dimensional embeddings for each patch. Our results demonstrate the method's robustness, scalability, and ability to yield sparse representations with controllable approximation error, significantly outperforming traditional Haar wavelet approaches in terms of compression efficiency and multiresolution fidelity.
Open AccessBespoke multiresolution analysis of graph signals
We present a novel framework for discrete multiresolution analysis of graph signals. The main analytical tool is the samplet transform, originally defined in the Euclidean framework as a discrete wavelet-like construction, tailored to the analysis of scattered data. The first contribution of this work is defining samplets on graphs. To this end, we subdivide the graph into a fixed number of patches, embed each patch into a Euclidean space, where we construct samplets, and eventually pull the construction back to the graph. This ensures orthogonality, locality, and the vanishing moments property with respect to properly defined polynomial spaces on graphs. Compared to classical Haar wavelets, this framework broadens the class of graph signals that can efficiently be compressed and analyzed. Along this line, we provide a definition of a class of signals that can be compressed using our construction. We support our findings with different examples of signals defined on graphs whose vertices lie on smooth manifolds. For efficient numerical implementation, we combine heavy edge clustering, to partition the graph into meaningful patches, with landmark \texttt{Isomap}, which provides low-dimensional embeddings for each patch. Our results demonstrate the method's robustness, scalability, and ability to yield sparse representations with controllable approximation error, significantly outperforming traditional Haar wavelet approaches in terms of compression efficiency and multiresolution fidelity.
- Open Access
A least squares approach to Whitney forms
In this work we describe and test the construction of least squares Whitney forms based on weights. If, on the one hand, the relevance of such a family of differential forms is nowadays clear in numerical analysis, on the other hand the selection of performing sets of supports (hence of weights) for projecting onto high order Whitney forms turns often to be a rough task. As an account of this, it is worth mentioning that Runge-like phenomena have been observed but still not resolved completely. We hence move away from sharp results on unisolvence and consider a least squares approach, obtaining results that are consistent with the nodal literature and making some steps towards the resolution of the aforementioned Runge phenomenon for high order Whitney forms.
Open AccessA least squares approach to Whitney forms
In this work we describe and test the construction of least squares Whitney forms based on weights. If, on the one hand, the relevance of such a family of differential forms is nowadays clear in numerical analysis, on the other hand the selection of performing sets of supports (hence of weights) for projecting onto high order Whitney forms turns often to be a rough task. As an account of this, it is worth mentioning that Runge-like phenomena have been observed but still not resolved completely. We hence move away from sharp results on unisolvence and consider a least squares approach, obtaining results that are consistent with the nodal literature and making some steps towards the resolution of the aforementioned Runge phenomenon for high order Whitney forms.
- Open Access
Interpolation by integrals on balls
In this work we blend interpolation theory with numerical integration, constructing an interpolator based on integrals over $n$-dimensional balls. We show that, under hypotheses on the radius of the $n$-balls, the problem can be treated as an interpolation problem both on a collection of $(n-1)$-spheres $ S^{n-1} $ and multivariate point sets, for which a wide literature is available. With the aim of exact quadrature and cubature formulae, we offer a neat strategy for the exact computation of the Vandermonde matrix of the problem and propose a meaningful Lebesgue constant. Problematic situations are evidenced and a charming aspect is enlightened: the majority of the theoretical results only deal with the centre of the domains of integration and are not really sensitive to their radius. We flank our theoretical results by a large amount of comprehensive numerical examples.Open AccessInterpolation by integrals on balls
In this work we blend interpolation theory with numerical integration, constructing an interpolator based on integrals over $n$-dimensional balls. We show that, under hypotheses on the radius of the $n$-balls, the problem can be treated as an interpolation problem both on a collection of $(n-1)$-spheres $ S^{n-1} $ and multivariate point sets, for which a wide literature is available. With the aim of exact quadrature and cubature formulae, we offer a neat strategy for the exact computation of the Vandermonde matrix of the problem and propose a meaningful Lebesgue constant. Problematic situations are evidenced and a charming aspect is enlightened: the majority of the theoretical results only deal with the centre of the domains of integration and are not really sensitive to their radius. We flank our theoretical results by a large amount of comprehensive numerical examples. - Open Access
- 4 October 2023
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 439
A barycentric trigonometric Hermite interpolant via an iterative approach
- 4 October 2023
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 439
Open AccessA barycentric trigonometric Hermite interpolant via an iterative approach