scientific article; zbMATH DE number 4039146
[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.
- The L1-version of the Diliberto–Straus algorithm in C(T × S)
- The Diliberto-Straus algorithm in \(L_ 1(X\times Y)\)
- scientific article; zbMATH DE number 1464691
- Some algorithms based on the dual of Dilworth's theorem
- scientific article; zbMATH DE number 2109496
- Diliberto-Straus algorithm for the uniform approximation by a sum of two algebras
- An acceleration property of the \(E\)-algorithm for alternate sequences
- On the asymptotic behavior of some algorithms
- Algorithms, complexity and discreteness criteria in PSL(2,C)
- On the von Neumann alternating algorithm in Hilbert space
- Diliberto-Straus algorithm for the uniform approximation by a sum of two algebras
- The Behavior of Differential Correction in Difficult Situations
- The L1-version of the Diliberto–Straus algorithm in C(T × S)
- The Diliberto-Straus algorithm in \(L_ 1(X\times Y)\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777338)