𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Asymptotic Formula in Best Approximation

✍ Scribed by N.N. Reyes

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
351 KB
Volume
80
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Asymptotic Formula for the Commutator
An Asymptotic Formula for the Commutators
✍ Daniel Beltita; Mihai Sabac πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 245 KB

In what follows we shall describe some asymptotic formulas for the commutators defined by the values of the analytic functional calculus of some commuting n-tuple of bounded operators in a complex Banach space. 1998 Academic Press Let B(X) be the algebra of all bounded linear operators on a complex

An Asymptotic Formula for Binomial Sums
An Asymptotic Formula for Binomial Sums
✍ Richard J. McIntosh πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 460 KB

We obtain complete asymptotic expansions for certain binomial sums, including the Ape ry numbers. In general, binomial sums cannot be expressed by closed formulae, but they do satisfy polynomial recurrence relations. We use the asymptotic expansion of a binomial sum to calculate a lower bound for th

Asymptotic Behaviour of Best lp-Approxim
Asymptotic Behaviour of Best lp-Approximations from Affi ne Subspaces
✍ J.M. Quesada; J. Martinez-Moreno; J. Navas πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 158 KB

In this paper we consider the problem of best approximation in ' n p ; 15p41: If h p ; 15p51; denotes the best ' p -approximation of the element h 2 R n from a proper affine subspace where h n 1 is a best uniform approximation of h from K; the so-called strict uniform approximation. Our aim is to p

An Asymptotic Formula for a Trigonometri
An Asymptotic Formula for a Trigonometric Sum of Vinogradov
✍ Todd Cochrane; J.C Peral πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 189 KB

We obtain a representation formula for the trigonometric sum f (m, n) and deduce from it the upper bound f(m, n) < (4/p 2 ) m log m+ (4/p 2 )(c -log(p/2)+2C G ) m+O(m/`log m), where C G is the supremum of the function G(t) :=; . k=1 log |2 sin pkt|/(4k 2 -1), over the set of irrationals. The coeffi