L Infinity-Lower Bound of L2-Projections onto Splines on a Geometric Mesh.

Abstract

Least-squares approximation by polynomial splines is a very effective means of approximation, particularly when the knots are appropriately nonuniformly spaced to adapt to the particular behavior of the function being approximated. Unfortunately, the stability of this process has been established only for nearly uniform knot sequences. The stability can be linked to the norm of the inverse of the Gram matrix of a (appropriately scaled) B-spline basis. In an earlier report, we studied an important special case, that of a geometric knot sequence and there showed the norm of the inverse of that Gramian to be bounded independent of the mesh ratio. In the present report, we continue these investigations and show, in particular, the surprising fact that the norm of the inverse of the Gramian is least (i.e., the stability is greatest) when the mesh is most nonuniform. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1981
Accession Number
ADA099366

Entities

People

  • Feng Yuan
  • Joseph P. Kozak

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Approximation (Mathematics)
  • Classification
  • Coefficients
  • Computer Science
  • Computers
  • Contracts
  • Inequalities
  • Mathematical Analysis
  • Mathematics
  • Military Research
  • North Carolina
  • Numerical Analysis
  • Polynomials
  • Sequences
  • United States
  • Universities
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)

Technology Areas

  • Space