Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4642250 | Journal of Computational and Applied Mathematics | 2009 | 14 Pages |
Abstract
A non-uniform, variational refinement scheme is presented for computing piecewise linear curves that minimize a certain discrete energy functional subject to convex constraints on the error from interpolation. Optimality conditions are derived for both the fixed and free-knot problems. These conditions are expressed in terms of jumps in certain (discrete) derivatives. A computational algorithm is given that applies to constraints whose boundaries are either piecewise linear or spherical. The results are applied to closed periodic curves, open curves with various boundary conditions, and (approximate) Hermite interpolation.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Scott N. Kersey,