No label defined (Q3777338)
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 4039146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4039146 |
Statements
1987
0 references
compact Hausdorff spaces
0 references
Hilbert space
0 references
Diliberto-Straus algorithm
0 references
best uniform approximation
0 references
slow convergence
0 references
metric projection
0 references
0.8911174
0 references
0.8422227
0 references
0.83204234
0 references
0.8244329
0 references
0.8231145
0 references
0.8204459
0 references
[For the entire collection see Zbl 0611.00017.] Given \(f\in C(S\times T)\), the Diliberto-Straus algorithm [cf. \textit{S. P. Diliberto} and \textit{E. G. Straus}, Pac. J. Math. 1, 195-210 (1951; Zbl 0043.068)] produces an element \(w\in C(S)+C(T)\) which is a best uniform approximation to f from \(C(S)+C(T)\). The algorithm uses alternatingly mean values of the error in the horizontal and the vertical direction, respectively. The extrema on the horizontal and the vertical lines define a path. These paths are considered for a demonstration of the possibly slow convergence of the algorithm. Moreover, it is shown that in some sense the algorithm is ``robust''. The metric projection is discontinuous in quite a strong sense. Nevertheless the algorithm can still cope with these discontinuities and produce a best approximation.
0 references