Keywords
- Optimal Vector
- Quadratic Programming Problem
- Divided Difference
- Require Approximation
- Minimization Calculation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hildebrand, F.B. (1956), Introduction to numerical analysis, McGraw-Hill (New York).
Kruskal, J.B. (1964), “Nonmetric multidimensional scaling: a numerical method”, Psychometrika, Vol. 29, pp. 115–129.
Powell, M.J.D. (1981), Approximation theory and methods, Cambridge University Press (Cambridge).
Ubhaya, V.A. (1977), “An O(n) algorithm for discrete n-point convex approximation with applications to continuous case”, Technical Memorandum No. 434 (Operations Research Dept., Case Western Reserve University).
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag
About this paper
Cite this paper
Cullinan, M.P., Powell, M.J.D. (1982). Data smoothing by divided differences. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0093146
Download citation
DOI: https://doi.org/10.1007/BFb0093146
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11199-3
Online ISBN: 978-3-540-39009-1
eBook Packages: Springer Book Archive
