๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bounding the Lebesgue function for Lagrange interpolation in a simplex

โœ Scribed by L.P Bos

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
729 KB
Volume
38
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Lebesgue Function and Lebesgue Const
The Lebesgue Function and Lebesgue Constant of Lagrange Interpolation for Erdoős Weights
โœ S.B. Damelin ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 399 KB

We establish pointwise as well as uniform estimates for Lebesgue functions associated with a large class of Erdo s weights on the real line. An Erdo s weight is of the form W :=exp(&Q), where Q : R ร„ R is even and is of faster than polynomial growth at infinity. The archetypal examples are where Q

Lower Bounds for the Complexity of Funct
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
โœ Nader H. Bshouty ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic ร„ 4 operations q, y, = , the standard bit operation Shift, Ro