Accession Number : AD0731229

Title :   Best Summation Formulae and Discrete Splines,

Corporate Author : TEXAS UNIV AUSTIN CENTER FOR NUMERICAL ANALYSIS

Personal Author(s) : Mangasarian,O. L. ; Schumaker,L. L.

Report Date : AUG 1971

Pagination or Media Count : 23

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)

Descriptors :   (*SEQUENCES, MATHEMATICAL PROGRAMMING), (*APPROXIMATION(MATHEMATICS), FUNCTIONS), POLYNOMIALS, VECTOR SPACES, LINEAR PROGRAMMING, QUADRATIC PROGRAMMING, THEOREMS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE