No label defined (Q3344637)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3877720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3877720 |
Statements
1984
0 references
gliding hump method
0 references
uniform boundedness
0 references
0 references
0.82340646
0 references
0.82055795
0 references
0.82000846
0 references
0.8154447
0 references
0.81486833
0 references
0.8034587
0 references
0 references
[For the entire collection see Zbl 0537.00009.] The usual gliding hump method consists in a successive selection of a subsequence \(\{n_ k\}\) of indices, to obtain e.g. uniform boundedness and condensation principles or generally counterexamples for the (rates of) convergence of approximation processes [see the author and \textit{R. J. Nessel}, J. Approximation Theory 31, 161-174 (1981; Zbl 0473.41029); Stud. Math. 75, 55-68 (1982; Zbl 0452.41028); Math. Nachr. 117, 263-272 (1984); Numer. Math. 43, 249-263 (1984)]. In this note it is shown that under appropriate additional assumptions one may even select a geometrical subsequence, i.e., \(n_ k=M^ k\) for some well-determined natural M. Thus, in contrast to a successive selection, this method has the advantages of a constructive approach.
0 references