Best Summation Formulae and Discrete Splines,

Abstract

The problem of obtaining a best summation formula for a finite sequence of real numbers in terms of a fixed number of terms of the sequence is reduced to a solvable linear or quadratic programming problem. This is done by developing the appropriate discrete Taylor and Peano theorems. The best summation formulae are related to discrete splines studied earlier. Discrete monosplines are introduced here and related to best summation formulae. Some numerical results are given. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1971
Accession Number
AD0731229

Entities

People

  • L. L. Schumaker
  • O. L. Mangasarian

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Cooperation
  • Mathematics
  • Numbers
  • Quadratic Programming
  • Real Numbers
  • Sequences
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Calculus or Mathematical Analysis