Part of the Lecture Notes in Mathematics book series (LNM, volume 912)
Data smoothing by divided differences
KeywordsOptimal 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.
Unable to display preview. Download preview PDF.
- 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).Google Scholar
© Springer-Verlag 1982