\(L_1\) spline fits via sliding window process: continuous and discrete cases
From MaRDI portal
Publication:1646667
DOI10.1007/s11075-017-0383-0zbMath1421.65005arXiv1510.07557OpenAlexW1882486051MaRDI QIDQ1646667
Olivier Gibaru, Eric Nyiri, Laurent Gajny
Publication date: 25 June 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.07557
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(L_1C^1\) polynomial spline approximation algorithms for large data sets
- Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties
- \(C^1\) and \(C^2\)-continuous polynomial parametric \(L_p\) splines (\(p\geq 1\))
- Shape-preserving, multiscale fitting of univariate data by cubic \(L_1\) smoothing splines
- On shape-preserving capability of cubic \(L^1\) spline fits
- The Gibbs phenomenon for best \(L_ 1\)-trigonometric polynomial approximation
- Univariate cubic \(L_{p}\) splines and shape-preserving, multiscale interpolation by univariate cubic \(L_{1}\) splines
- Shape-preserving approximation of multiscale univariate data by cubic \(L_1\) spline fits
- Best \(L_{1}\) approximation of Heaviside-type functions from Chebyshev and weak-Chebyshev spaces
- On the cubic \(L_{1}\) spline interpolant to the Heaviside function
- Surface Reconstruction and Image Enhancement via $L^1$-Minimization
- Fast Polynomial Spline Approximation for Large Scattered Data Sets via L 1 Minimization
