Best convex interpolationIn this paper we discuss the general convex interpolation problem (k ≥ 3): minimize ∫|D{sup}k f|{sup}2dt(t from a to b), subject to f(t{sub}i) = y{sub}i, i = 1, ..., n. f is on a closed convex set K {is contained in} (L{sub}2){sup}k...
Linear interpolation method (LI.m): This function consists of the same parts as the two previous functions. The number of input arguments is one more than that of XGX.m because the linear interpolation method needs two starting points. Special care should be taken to introduce two starting val...