Stefano De Marchi

Prof. Dr. Stefano De Marchi

Mathematics, University of Padua, Padua, Italy
orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2005 in Advances in Computational Mathematics
Verified
Journal Article
Closed access
PDF file
Stefano De MarchiStefano De Marchi
Stefano De Marchi
RSRobert Schaback
Robert Schaback
HWHolger Wendland
Holger Wendland

1 November 2006 in Journal of Approximation Theory
Verified
Journal Article
Closed access
LBLen Bos
Len Bos
MCMarco Caliari
Marco Caliari
Stefano De MarchiStefano De Marchi
Stefano De Marchi
MVMarco Vianello
Marco Vianello
YXYuan Xu
Yuan Xu

1 January 2010 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
LBL. Bos
L. Bos
Stefano De MarchiStefano De Marchi
Stefano De Marchi
ASA. Sommariva
A. Sommariva
MVM. Vianello
M. Vianello
We discuss and compare two greedy algorithms that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The first gives the so-called approximate Fekete points by QR factorization with column pivoting of Vandermonde-like matrices. The second computes discrete Leja points by LU factorization with row pivoting. Moreover, we study the asymptotic distribution of such points when they are extracted from weakly admissible meshes.

12 August 2008 in Advances in Computational Mathematics
Verified
Journal Article
Open access
PDF file
Stefano De MarchiStefano De Marchi
Stefano De Marchi
RSRobert Schaback
Robert Schaback
It is often observed that interpolation based on translates of radial basis functions or non-radial kernels is numerically unstable due to exceedingly large condition of the kernel matrix. But if stability is assessed in function space without considering special bases, this paper proves that kernel-based interpolation is stable. Provided that the data are not too wildly scattered, the L 2 or L  ∞  norms of interpolants can be bounded above by discrete ℓ2 and ℓ ∞  norms of the data. Furthermore, Lagrange basis functions are uniformly bounded and Lebesgue constants grow at most like the square root of the number of data points. However, this analysis applies only to kernels of limited smoothness. Numerical examples support our bounds, but also show that the case of infinitely smooth kernels must lead to worse bounds in future work, while the observed Lebesgue constants for kernels with limited smoothness even seem to be independent of the sample size and the fill distance.

1 June 2005 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
MCMarco Caliari
Marco Caliari
Stefano De MarchiStefano De Marchi
Stefano De Marchi
MVMarco Vianello
Marco Vianello

1 December 2013 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
Stefano De MarchiStefano De Marchi
Stefano De Marchi
GSGabriele Santin
Gabriele Santin