Abstract
It is shown that the optimal piecewise mth degree polynomial L1-approximation of a generalized convex function f(f(m+1) positive) is unique, if log f(m+1) is concave.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Meinardus, G., Approximation of Functions: Theory and Numerical Methods. Springer, New York 1967.
Barrow, D.L.-Chui, C.K.-Smith, P.W.-Ward, J.D., Unicity of best mean approximation by second order splines with variable knots. Math. Comp. 32 (1978), 1131–1143.
Chow, J., Uniqueness of best L2[0,1] approximation by piecewise polynomials with variable breakpoints. Dissertation, Texas A&M University 1978.
Kioustelidis, J.B., Optimal segmented approximations. Computing 24 (1980), 1–8.
Kioustelidis, J.B., The distinctness of the knots of optimal segmented approximations. Submitted for publication in Computing.
Kioustelidis, J.B., Optimal segmented polynomial L s -approximations. To be published in Computing.
Ortega, J.M.-Rheinhold, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York/London 1970.
Stummel, F.-Hainer, K., Praktische Mathematik. Teubner, Stuttgart 1971.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Birkhäuser Verlag Basel
About this chapter
Cite this chapter
Kioustelidis, J.B. (1981). Uniqueness of Optimal Piecewise Polynomial L1 Approximations for Generalized Convex Functions. In: Butzer, P.L., Sz.-Nagy, B., Görlich, E. (eds) Functional Analysis and Approximation. ISNM 60: International Series of Numerical Mathematics / ISNM 60: Internationale Schriftenreihe zur Numerischen Mathematik / ISNM 60: Série internationale d’Analyse numérique, vol 60. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-9369-5_38
Download citation
DOI: https://doi.org/10.1007/978-3-0348-9369-5_38
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-0348-9371-8
Online ISBN: 978-3-0348-9369-5
eBook Packages: Springer Book Archive