Abstract
Suppose that \(\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(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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cullinan, M.P.: Data smoothing by adjustment of divided differences. Ph.D. dissertation, Department of Applied Mathematics and Theoretical Physics, University of Cambridge (1986)
Cullinan, M.P.: Data smoothing using non-negative divided differences and ℓ 2 approximation. IMA J. Numer. Anal. 10, 583–608 (1990)
Cullinan, M.P., Powell, M.J.D.: Data smoothing by divided differences. In: Watson, G.A. (ed.) Numerical Analysis Proceedings, Dundee 1981. Lecture Notes in Mathematics, vol. 912, pp. 26–37. Springer, Berlin (1982)
Demetriou, I.C.: Signs of divided differences yield least squares data fitting with constrained monotonicity or convexity. J. Comput. Appl. Math. 146(2), 179–211 (2002)
Demetriou, I.C. Powell, M.J.D.: Least squares fitting to univariate data subject to restrictions on the signs of the second differences. In: Iserles, A. Buhmann, M.D. (eds.) Approximation Theory and Optimization. Tributes to M. J. D. Powell, pp. 109–132. Cambridge University Press, Cambridge (1997)
Graham, R.L.: An efficient algorithm for determining the convex hull of a finite point set. Inform. Proc. Lett. 1, 132–133 (1972)
Hildebrand, F.B.: Introduction to Numerical Analysis. McGraw Hill, New York (1956)
Kruskal, J.B.: Non-metric multidimensional scaling: a numerical method. Psychometrika 29, 115–129 (1964)
Miles, R.E.: The complete amalgamation into blocks, by weighted means, of a finite set of real numbers. Biometrika 46, 317–327 (1959)
Petit, J.R., et al.: Vostok Ice Core Data for 420,000 Years, IGBP PAGES/World Data Center for Paleoclimatology Data Contribution Series #2001-076. NOAA/NGDC Paleoclimatology Program, Boulder (2001)
Ubhaya, V.A.: An O(n) algorithm for discrete n-point convex approximation with applications to continuous case. J. Math. Anal. Appl. 72(1), 338–354 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Cullinan, M.P. (2019). Piecewise Convex–Concave Approximation in the Minimax Norm. In: Demetriou, I., Pardalos, P. (eds) Approximation and Optimization . Springer Optimization and Its Applications, vol 145. Springer, Cham. https://doi.org/10.1007/978-3-030-12767-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-12767-1_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12766-4
Online ISBN: 978-3-030-12767-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)