Fast numerical derivatives based on multi-interval Fourier extension
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908508597780480 |
|---|---|
| author | Zhao, Zhenyu Wang, Yanfei Liu, Xinran |
| author_facet | Zhao, Zhenyu Wang, Yanfei Liu, Xinran |
| contents | We present a computationally efficient algorithm for stable numerical differentiation from noisy, uniformly-sampled data on a bounded interval. The method combines multi-interval Fourier extension approximations with an adaptive domain partitioning strategy: a global precomputation of local Fourier sampling matrices and their thin SVDs is reused throughout a recursive bisection procedure that selects locally-resolved Fourier fits. Each accepted subinterval stores a compact set of Fourier coefficients that are subsequently used to reconstruct the derivative via a precomputed differentiation operator. The stopping criterion balances fitting error and an explicit noise-level bound, and the algorithm automatically refines the partition where the function exhibits rapid oscillations or boundary activity. Numerical experiments demonstrate significant improvements over existing methods, achieving accurate derivative reconstruction for challenging functions. The approach provides a robust framework for ill-posed differentiation problems while maintaining computational efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_20876 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fast numerical derivatives based on multi-interval Fourier extension Zhao, Zhenyu Wang, Yanfei Liu, Xinran Numerical Analysis We present a computationally efficient algorithm for stable numerical differentiation from noisy, uniformly-sampled data on a bounded interval. The method combines multi-interval Fourier extension approximations with an adaptive domain partitioning strategy: a global precomputation of local Fourier sampling matrices and their thin SVDs is reused throughout a recursive bisection procedure that selects locally-resolved Fourier fits. Each accepted subinterval stores a compact set of Fourier coefficients that are subsequently used to reconstruct the derivative via a precomputed differentiation operator. The stopping criterion balances fitting error and an explicit noise-level bound, and the algorithm automatically refines the partition where the function exhibits rapid oscillations or boundary activity. Numerical experiments demonstrate significant improvements over existing methods, achieving accurate derivative reconstruction for challenging functions. The approach provides a robust framework for ill-posed differentiation problems while maintaining computational efficiency. |
| title | Fast numerical derivatives based on multi-interval Fourier extension |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2508.20876 |