Shape preserving approximations by polynomials and splines

Citations of this article
Mendeley users who have this article in their library.


A review of shape preserving approximation methods and algorithms for approximating univariate functions or discrete data is given. The notion of 'shape' refers to the geometrical behavior of a function's or approximant's graph, and usually includes positivity, monotonicity, and/or convexity. But, in the recent literature, the broader concept of shape also includes symmetry, generalized convexity, unimodality, Lipschitz property, possessing peaks or discontinuities, etc. Special stress is put on shape preserving interpolation methods by polynomials and splines. Of course, this text has no pretensions to be complete.




Kocić, L. M., & Milovanović, G. V. (1997). Shape preserving approximations by polynomials and splines. Computers and Mathematics with Applications, 33(11), 59–97.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free