Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/15724
Title: Finite termination of a dual Newton method for convex best C1 interpolation and smoothing
Authors: Qi, H
Qi, L 
Issue Date: 2003
Source: Numerische mathematik, 2003, v. 96, no. 2, p. 317-337 How to cite?
Journal: Numerische Mathematik 
Abstract: Given the data (xi, yi) ∈ ℜ2, i = 0, 1,..., n which are in convex position, the problem is to choose the convex best C1 interpolant with the smallest mean square second derivative among all admissible cubic C1-splines on the grid. This problem can be efficiently solved by its dual program, developed by Schmdit and his collaborators in a series of papers. The Newton method remains the core of their suggested numerical scheme. It is observed through numerical experiments that the method terminates in a small number of steps and its total computational complexity is only of O (n). The purpose of this paper is to establish theoretical justification for the Newton method. In fact, we are able to prove its finite termination under a mild condition, and on the other hand, we illustrate that the Newton method may fail if the condition is violated, consistent with what is numerically observed for the Newton method. Corresponding results are also obtained for convex smoothing.
URI: http://hdl.handle.net/10397/15724
ISSN: 0029-599X
DOI: 10.1007/s00211-003-0471-z
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Jun 23, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Jun 22, 2017

Page view(s)

28
Last Week
0
Last month
Checked on Jun 25, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.