An efficient algorithm for generating univariate cubic L₁ splines
From MaRDI portal
An efficient algorithm for generating univariate cubic \(L 1\) splines
Recommendations
- Univariate cubic \(L_1\) splines -- a geometric programming approach
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
- A geometric programming approach for bivariate cubic \(L_{1}\) splines
- Univariate cubic \(L _{1}\) interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties
- A geometric programming framework for univariate cubic L₁ smoothing splines
Cited in
(11)- A geometric programming framework for univariate cubic \(L_1\) smoothing splines
- Univariate cubic \(L_1\) interpolating splines: analytical results for linearity, convexity and oscillation on 5-pointwindows
- Univariate cubic \(L_1\) interpolating splines: spline functional, window size and analysis-based algorithm
- Univariate cubic \(L _{1}\) interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties
- A POLYNOMIAL ALGORITHM ON COMPUTING LAG SPLINE
- A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines
- Shape-preserving univariate cubic and higher-degree \(L_{1}\) splines with function-value-based and multistep minimization principles
- Fast \(L_1^kC^k\) polynomial spline interpolation algorithm with shape-preserving properties
- Geometric dual formulation for first-derivative-based univariate cubic \(L_{1}\) splines
- \(L_1C^1\) polynomial spline approximation algorithms for large data sets
- A geometric programming approach for bivariate cubic \(L_{1}\) splines
This page was built for publication: An efficient algorithm for generating univariate cubic \(L_1\) splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702483)
