An algorithm for continuous piecewise linear bounding of discrete time series data
From MaRDI portal
Publication:486719
DOI10.1007/s10543-014-0492-2zbMath1306.65161OpenAlexW2092048620MaRDI QIDQ486719
Andrew Skelton, Allan R. Willms
Publication date: 16 January 2015
Published in: BIT (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10214/9508
algorithmparameter estimationnumerical examplestime seriescontinuous representationpiecewise linear representation
Related Items (3)
Parameter Range Reduction in ODE Models in the Presence of Partial Data Sets ⋮ Parameter range reduction in ordinary differential equation models ⋮ Parameter range reduction from partial data in systems of differential algebraic equations
Uses Software
Cites Work
- Unnamed Item
- Parameter range reduction for ODE models using cumulative backward differentiation formulas
- Parameter identifiability and estimation of HIV/AIDS dynamic models
- Rigorous parameter reconstruction for differential equations with noisy data
- Another efficient algorithm for convex hulls in two dimensions
- Parameter range reduction for ODE models using monotonic discretizations
- Estimating parameters for generalized mass action models using constraint propagation
- Parameter reconstruction for biochemical networks using interval analysis
- A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data
- On the approximation of curves by line segments using dynamic programming
- Parameter Estimation Using Interval Computations
- A Survey of Methods of Computing Minimax and Near-Minimax Polynomial Approximations for Functions of a Single Independent Variable
- Estimate of the maximum error in best polynomial approximations
- Further remarks on line segment curve-fitting using dynamic programming
This page was built for publication: An algorithm for continuous piecewise linear bounding of discrete time series data
