Alvise Sommariva
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Alvise Sommariva has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Marco Vianello
University of Padova Italy
12 shared publications Marco Vianello
8 shared publications- Francesco Dell’aCcio
Department of Mathematics and Computer Science, University of Calabria, Rende, Italy
3 shared publications M. Vianello
3 shared publications- Roberto Cavoretto
Department of Mathematics “Giuseppe Peano”, University of Torino, via Carlo Alberto 10, 10123 Torino, Italy
3 shared publications - Alessandra De Rossi
Department of Mathematics “Giuseppe Peano”, University of Torino, via Carlo Alberto 10, 10123 Torino, Italy
2 shared publications
Latest Publications
- 9 November 2026
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 66 (4)
On modified anti-Gaussian rules for Jacobi weight functions
- 9 November 2026
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 66 (4)
On modified anti-Gaussian rules for Jacobi weight functions
- 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
ORTHOCUB: integral and differential cubature rules by orthogonal moments
We discuss a numerical package, named ORTHOCUB, for the computation of linear functionals of both integral and differential type on multivariate polynomial spaces. The weighted sums corresponding to such integral and differential cubatures are implemented via orthogonal polynomial moments and auxiliary near-minimal algebraic cubature in a bounding box, with no conditioning issue since no matrix inversion or factorization is needed. The whole computational process indeed reduces to moment computation and dense matrix-vector products of relatively small size. The Matlab and Python codes are freely available, to be used as building blocks for integral and differential problems.
Open AccessORTHOCUB: integral and differential cubature rules by orthogonal moments
We discuss a numerical package, named ORTHOCUB, for the computation of linear functionals of both integral and differential type on multivariate polynomial spaces. The weighted sums corresponding to such integral and differential cubatures are implemented via orthogonal polynomial moments and auxiliary near-minimal algebraic cubature in a bounding box, with no conditioning issue since no matrix inversion or factorization is needed. The whole computational process indeed reduces to moment computation and dense matrix-vector products of relatively small size. The Matlab and Python codes are freely available, to be used as building blocks for integral and differential problems.
- 2 July 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 473
Polynomial meshes on algebraic sets
- 2 July 2025
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 473
Polynomial meshes on algebraic sets
- 12 April 2025
- Published by Elsevier in Applied Mathematics Letters
- Vol. 168
Unisolvence of Kansa collocation for elliptic equations by polyharmonic splines with random fictitious centers
- 12 April 2025
- Published by Elsevier in Applied Mathematics Letters
- Vol. 168
Unisolvence of Kansa collocation for elliptic equations by polyharmonic splines with random fictitious centers
- Open Access
- 19 March 2025
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 234, 390-395
Nonsingularity of unsymmetric Kansa matrices: Random collocation by MultiQuadrics and Inverse MultiQuadrics
- 19 March 2025
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 234, 390-395
Open AccessNonsingularity of unsymmetric Kansa matrices: Random collocation by MultiQuadrics and Inverse MultiQuadrics
- 3 February 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 495
Numerical cubature and hyperinterpolation over spherical polygons
- 3 February 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 495
Numerical cubature and hyperinterpolation over spherical polygons
- Open Access
Polynomial meshes on algebraic sets
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on compact subsets of arbitrary algebraic hypersurfaces in C^{N+1}. They are preimages by a projection of meshes on compacts in C^N. The meshes constructed in this way are optimal in some cases. Our method can be useful also for certain algebraic sets of codimension greater than one. To illustrate applications of the obtained theorems, we first give a few examples and finally report some numerical results. In particular, we present numerical tests (implemented in Matlab), concerning the use of such optimal polynomial meshes for interpolation and least-squares approximation, as well as for the evaluation of the corresponding Lebesgue constants.
Open AccessPolynomial meshes on algebraic sets
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on compact subsets of arbitrary algebraic hypersurfaces in C^{N+1}. They are preimages by a projection of meshes on compacts in C^N. The meshes constructed in this way are optimal in some cases. Our method can be useful also for certain algebraic sets of codimension greater than one. To illustrate applications of the obtained theorems, we first give a few examples and finally report some numerical results. In particular, we present numerical tests (implemented in Matlab), concerning the use of such optimal polynomial meshes for interpolation and least-squares approximation, as well as for the evaluation of the corresponding Lebesgue constants.
- 29 November 2024
- Published by Springer Nature in Calcolo
- Vol. 62 (1) , 1-23
Hybrid hyperinterpolation over general regions
- 29 November 2024
- Published by Springer Nature in Calcolo
- Vol. 62 (1) , 1-23
Hybrid hyperinterpolation over general regions