scholarly journals A recurrence formula for generalized divided differences and some applications

1973 ◽  
Vol 9 (2) ◽  
pp. 165-172 ◽  
Author(s):  
G Mühlbach
2015 ◽  
Vol 98 (112) ◽  
pp. 147-151 ◽  
Author(s):  
Ioan Gavrea ◽  
Mircea Ivan

We obtain a new recurrence formula for sequences of divided differences. In a particular case, the recurrence formula simplifies the classical Newton-Girard identities relating power sums and elementary symmetric polynomials.


1936 ◽  
Vol 15 (1) ◽  
pp. 141-176
Author(s):  
Duncan C. Fraser

SynopsisThe paper is intended as an elementary introduction and companion to the paper on “Orthogonal Polynomials,” by G. J. Lidstone, J.I.A., vol. briv., p. 128, and the paper on the “Sum and Integral of the Product of Two Functions,” by A. W. Joseph, J.I.A., vol. lxiv., p. 329; and also to Dr. Aitken's paper on the “Graduation of Data by the Orthogonal Polynomials of Least Squares,” Proc. Roy. Soc. Edin., vol. liii., p. 54.Following Dr. Aitken Σux is defined for the immediate purpose to be u0+…+ux−1.The scheme of successive summations is set out in the form of a difference diagram and is extended to negative arguments. The special point to which attention is drawn is the existence of a wedge of zeros between the sums for positive arguments and those for negative arguments.The rest of the paper is for the greater part a study of the table of binomial coefficients for positive and for negative arguments. The Tchebychef polynomials are simple functions of the binomial coefficients, and after a description of a particular example and of its properties general methods are given of forming the polynomials by means of tables of differences. These tables furnish examples of simple, differences, of divided differences, of adjusted differences, and of a system of special adjusted differences which gives a very easy scheme for the formation of the Tchebychef polynomials.


2008 ◽  
Vol 51 (2) ◽  
pp. 236-248
Author(s):  
Victor N. Konovalov ◽  
Kirill A. Kopotun

AbstractLet Bp be the unit ball in 𝕃p, 0 < p < 1, and let , s ∈ ℕ, be the set of all s-monotone functions on a finite interval I, i.e., consists of all functions x : I ⟼ ℝ such that the divided differences [x; t0, … , ts] of order s are nonnegative for all choices of (s + 1) distinct points t0, … , ts ∈ I. For the classes Bp := ∩ Bp, we obtain exact orders of Kolmogorov, linear and pseudo-dimensional widths in the spaces , 0 < q < p < 1:


Sign in / Sign up

Export Citation Format

Share Document