Piecewise Convex–Concave Approximation in the Minimax Norm

Michael P. Cullinan
Additional contact information
Michael P. Cullinan: Maryvale Institute

A chapter in Approximation and Optimization, 2019, pp 83-118 from Springer

Abstract: Abstract Suppose that f ∈ ℝ n $$\mathbf {f} \in \mathbb {R}^{n}$$ is a vector of n error-contaminated measurements of n smooth function values measured at distinct, strictly ascending abscissæ. The following projective technique is proposed for obtaining a vector of smooth approximations to these values. Find y minimizing ∥y −f∥∞ subject to the constraints that the consecutive second-order divided differences of the components of y change sign at most q times. This optimization problem (which is also of general geometrical interest) does not suffer from the disadvantage of the existence of purely local minima and allows a solution to be constructed in only O ( n q log n ) $$O(nq \log n)$$ operations. A new algorithm for doing this is developed and its effectiveness is proved. Some results of applying it to undulating and peaky data are presented, showing that it is fast and can give very good results, particularly for large densely packed data, even when the errors are quite large.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:spochp:978-3-030-12767-1_6

Ordering information: This item can be ordered from
http://www.springer.com/9783030127671

DOI: 10.1007/978-3-030-12767-1_6

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().