Morph-fitting: An effective technique of approximation
An algorithm has been developed and programmed which fits a minimum number of basic patterns, morphs, to a sequence of data points. The dependent variable is given as a scalar value; the independent variable is ‘time-like’ and can represent continuous or discrete time or an event counter. The morphs fitted are an indefinite number of occurrences of trends (straight lines), step functions, and sudden changes (peaks of short time duration). Delay functions span over periods characterized by uninterpretable events.
Year of publication: |
1983
|
---|---|
Authors: | Findler, Nicholas V. ; Morgado, Ernesto |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 25.1983, 5, p. 417-429
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Pattern search for optimization
Findler, Nicholas V., (1987)
-
An Empirical Approach to a Theory of Coordination. Part 1: Design Principles and First Results
Findler, Nicholas V., (2000)
-
A heuristic approach to optimum experimental design
Findler, Nicholas V., (1984)
- More ...