Splines and Efficiency in Dynamic Programming,

Abstract

It is shown how one can use splines, represented in the B-spline basis, to reduce the difficulties of large storage requirements in dynamic programming via approximations to the minimum-return function without the inefficiency associated with using polynomials to the same end. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1973
Accession Number
AD0767382

Entities

People

  • James W. Daniel

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Dynamic Programming
  • Efficiency
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Polynomials

Fields of Study

  • Computer science

Readers

  • Approximation Theory.
  • Operations Research