A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data

DOI10.1137/090769077zbMath1217.65111OpenAlexW2037058319MaRDI QIDQ3006132

Emily K. Szusz, Allan R. Willms

Publication date: 10 June 2011

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/038cc186b9ed28b910f8608c2336626702a12a80

zbMATH Keywords

parameter estimationnumerical examplesRemez algorithmminimax approximationpiecewise linear representations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47)

Related Items (2)

An algorithm for continuous piecewise linear bounding of discrete time series data ⋮ Parameter range reduction in ordinary differential equation models

Uses Software

• L2WPMA

This page was built for publication: A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data