L1PMA: A Fortran 77 package for best L 1 piecewise monotonic data smoothing
Abstract Fortran 77 software is presented for the calculation of a best L_1approximation to n measurements that include random errors by requiring k-1 sign changes in the first divided differences of the approximation or equivalently k monotonic sections, alternately increasing and decreasing. A dyn...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Dataset |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Abstract Fortran 77 software is presented for the calculation of a best L_1approximation to n measurements that include random errors by requiring k-1 sign changes in the first divided differences of the approximation or equivalently k monotonic sections, alternately increasing and decreasing. A dynamic programming algorithm separates the measurements into optimal disjoint sections of adjacent data and applies to each section a single L_1monotonic calculation. The most distinctive feature of the a... Title of program: L1PMA Catalogue Id: ADRF_v1_0 Nature of problem Univariate measurements of an unknown function that contains random errors. Identifying turning points (peakfinding) of a univariate function from noisy measurements of its values. Versions of this program held in the CPC repository in Mendeley Data ADRF_v1_0; L1PMA; 10.1016/S0010-4655(02)00739-7 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019) |
---|---|
DOI: | 10.17632/xmxbnk63sy |