Fast numerical derivatives of univariate functions on non-uniform grids

An algorithm for computing the derivative of a function, starting from its values at randomly chosen points is presented. This algorithm uses the singular value expansion of the derivative operator and the discrete Fourier transformations. The convergence of the numerical discretization scheme is analyzed in a simplified case, while the order of convergence and the stability are evaluated by numerical simulations. • A new spectral method for the numerical derivatives of a function sampled at scattered points. • Proof of convergence of the proposed method in a simplified version. • A fast algorithm exploiting fast Discrete Fourier transformations. • Preliminary stability tests including noisy data.

Authors

Institutions

Publication Details

Journal
Journal of Computational and Applied Mathematics
Published
2025-03-08
DOI
https://doi.org/10.1016/j.cam.2025.116619
Citations
2
Primary Topic
Mathematical and Theoretical Analysis
Type
article
Field-Weighted Citation Impact
7.38

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast numerical derivatives of univariate functions on non-uniform grids

Pierluigi Maponi, Nadaniela Egidi, Josephin Giacomini
2 citations
Journal of Computational and Applied Mathematics
Mathematical and Theoretical Analysis
7.38
article

Fast numerical derivatives of univariate functions on non-uniform grids

Pierluigi Maponi, Nadaniela Egidi, Josephin Giacomini
article en
2 citations

Abstract

An algorithm for computing the derivative of a function, starting from its values at randomly chosen points is presented. This algorithm uses the singular value expansion of the derivative operator and the discrete Fourier transformations. The convergence of the numerical discretization scheme is analyzed in a simplified case, while the order of convergence and the stability are evaluated by numerical simulations. • A new spectral method for the numerical derivatives of a function sampled at scattered points. • Proof of convergence of the proposed method in a simplified version. • A fast algorithm exploiting fast Discrete Fourier transformations. • Preliminary stability tests including noisy data.

Journal of Computational and Applied MathematicsVol. 467
Università di Camerino (IT)
Ministero dell’Istruzione, dell’Università e della Ricerca, Faculty of Science and Engineering, University of Manchester
Openalex Percentile: Top 4%
Mathematical and Theoretical Analysis
7.38
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.