Best L1 piecewise monotonic data modelling
From MaRDI portal
Recommendations
- Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
- Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity
- A decomposition theorem for the least squares piecewise monotonic data approximation problem
- A characterization theorem for the best \(L_1\) piecewise monotonic data approximation problem
- An adaptive algorithm for least squares piecewise monotonic data fitting
Cited in
(12)- CXFTV2: A Fortran subroutine for the discrete least squares convex approximation
- A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints
- An example of nondecomposition in data fitting by piecewise monotonic divided differences of order higher than two
- A decomposition theorem for the least squares piecewise monotonic data approximation problem
- Least Squares Smoothing of Univariate Data to achieve Piecewise Monotonicity
- Monotonic smoothing of visual acuity measurements in diabetics
- Discrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
- Fluctuated fitting under the \(\ell _1\)-metric
- A dynamic programming method for matching rail-track monitoring data
- Separation theorems for the extrema of best piecewise monotonic approximations to successive data
- An optimal linear time algorithm for quasi-monotonic segmentation1
- A characterization theorem for the best \(L_1\) piecewise monotonic data approximation problem
This page was built for publication: Best L1 piecewise monotonic data modelling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888230)
