Morph-fitting: An effective technique of approximation

Nicholas V. Findler and Ernesto Morgado

Mathematics and Computers in Simulation (MATCOM), 1983, vol. 25, issue 5, 417-429

Abstract: 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.

Date: 1983
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475483901404
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:25:y:1983:i:5:p:417-429

DOI: 10.1016/0378-4754(83)90140-4

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().