Best piecewise constant approximation of a function of single variable

Authors:
Hiroshi Konno;Takahito Kuno
Affiliations:
Institute of Human and Social Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku Tokyo, 152 Japan;Department of Social Engineering, Tokyo Institute of Technology, Tokyo, Japan
Venue:
Operations Research Letters
Year:
1988

Citing 2
Cited 1

On the approximation of curves by line segments using dynamic programming

Communications of the ACM
Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable

IEEE Transactions on Computers

On the minimax approximation in the class of the univariate piecewise constant functions

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the best piecewise constant approximation of a function f of single variable. Polynomial time algorithms are derived by using shortest path and dynamic programming techniques. Several applications of this class of problems will be briefly touched upon.