Mathematical Sciences: Faculty Presentations (1991-2022)

Constrained L2 Degree Reduction by Spline Functions

Document Type

Presentation

Presentation Date

10-11-2008

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Abstract or Description

Let S0 and S1 be two spaces of polynomial spline curves s : [a,b] → IRd, of order k0 and k1 with k1< k0, defined over knot sequences (ξ0/i) and (ξ1/i), respectively. Fix s0 € S0, and corresponding to each knot ξ 0/I assign a tolerance ǫi ≥ 0. In this paper we present an algorithm for computing the best convex constrained L2 approximant s1 := argmin {││s ─s0 ││ 2: s € S1 ∩ K} with K := ∩ {s : │s(t0/i) ─ s0 (t 0/i)│ ≤€j}, by the method of alternating projections.

Sponsorship/Conference/Institution

Applied Mathematics and Approximation Theory (AMAT)

Location

Memphis, TN

This document is currently not available here.

Share

COinS