Accession Number:

ADA167513

Title:

The Computational Cost of Simplex Spline Functions.

Descriptive Note:

Technical summary rept.,

Corporate Author:

WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER

Personal Author(s):

Report Date:

1986-03-01

Pagination or Media Count:

12.0

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.

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE