The Computational Cost of Simplex Spline Functions.

Abstract

All computational schemes for simplex spline functions to date rely both on the recurrence relation for these functions and the standard construction of the simplex spline basis. Under these conditions, for numerical methods for computing simplex spline functions to be a useful as possible, it is necessary to find ways of implementing the recurrence relation as efficiently as possible. This paper shows that 'as efficiently as possible' is still not very efficient. This implies that truly fast algorithms (which have not yet been developed) will have to either abandon the recurrence relation or the standard construction of the simplex spline basis. Keywords: B splines; Multivariate analysis.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1986
Accession Number
ADA167513

Entities

People

  • Thomas A. Grandine

Organizations

  • University of Wisconsin–Madison

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Construction
  • Continents
  • Geographic Regions
  • Mathematics
  • Military Research
  • Multivariate Analysis
  • North America
  • North Carolina
  • Numerical Analysis
  • Security
  • Standards
  • United States
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Educational Psychology