On the von Neumann alternating algorithm in Hilbert space

DOI10.1016/0022-247X(86)90085-5MaRDI QIDQ1822209zbMATH OpenFDO

Authors Carlo Franchetti, W. A. Light

Publication date 1986

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247X(86)90085-5

zbMATH Keywords

best approximationsconvergence rateDiliberto-Strauss algorithmHilbert spaceperformance of an algorithmvon Neumann alternating algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) General theory of numerical analysis in abstract spaces (65J05)

Review text

The performance of an algorithm is one of the most interesting problems concerning this one. In the work of \textit{J. von Neumann} [Functional Operators. II. (1950; Zbl 0039.117)] one finds an algorithm for computing best approximations to a given x in a Hilbert space X. More precisely, X being a Hilbert space and U and V any pair of closed subspaces with proximity maps \(P_ U\), \(P_ V\) respectively, the sequence \(\{[(I-P_ V)(I-P_ U)]^ nx\}\) converges to x-w, where w is a best approximation to x from \(\overline{U+V}.\) In this paper the authors study the performance of this algorithm in Hilbert space, particularly in the case when \(U+V\) is not closed. They establish that the convergence can be very slow, in opposite to the fact that if \(U+V\) is closed, the convergence rate is a geometric one. Showing off that the algorithm goes under the name of Diliberto-Strauss, when \(X=C(T\times S)\), \(U=C(T)\), \(U=C(S)\), with the usual uniform norm and S, T compact Hausdorff and the fact that in recent years many authors payed attention to it, the authors of this paper show that a detailed study of the Hilbert space can be expected to give some insight into the performance of the algorithm in these other cases.

Recommendations

• scientific article; zbMATH DE number 4039146
• The Diliberto-Straus algorithm in \(L_ 1(X\times Y)\)
• The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
• scientific article; zbMATH DE number 853813
• On the rate of convergence of greedy algorithms.
• Some remarks on greedy algorithms
• Rate of convergence of the discrete Pólya algorithm
• scientific article; zbMATH DE number 3919635
• scientific article; zbMATH DE number 6325423

Cites work

• Convergence of the diliberto-straus algorithm in L₁(XxY)
• Functional Operators (AM-22), Volume 2
• scientific article; zbMATH DE number 3160457 (Why is no real title available?)
• scientific article; zbMATH DE number 3671029 (Why is no real title available?)
• scientific article; zbMATH DE number 3507398 (Why is no real title available?)
• scientific article; zbMATH DE number 3222351 (Why is no real title available?)
• scientific article; zbMATH DE number 3421317 (Why is no real title available?)
• On the approximation of a bivariate function by the sum of univariate functions
• On the approximation of a function of several variables by the sum of functions of fewer variables
• The L₁-version of the Diliberto–Straus algorithm in C(T × S)
• Two extensions of the alternating algorithm of von Neumann

Cited in

(25)

• Eine Verallgemeinerung des Ritz-Prozesses
• Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
• Error bounds for the method of alternating projections
• The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
• On the convergence of von Neumann's alternating projection algorithm for two sets
• The rate of convergence for the method of alternating projections. II
• Where there's a Will there's a way -- the research of Will Light
• Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. III.
• A learning-enhanced projection method for solving convex feasibility problems
• A variational approach to the alternating projections method
• On the rate of convergence of the alternating projection method in finite dimensional spaces
• The Convergence of an Algorithm for Finding the Distance between a Ball in a Subspace and a Sum of Subspaces
• Characterizing arbitrarily slow convergence in the method of alternating projections
• The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
• Accelerating the convergence of the method of alternating projections
• Kaczmarz algorithm in Hilbert space
• Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
• The Alternating Algorithm in Uniformly Convex Spaces
• A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space
• Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• Polynomial estimates for the method of cyclic projections in Hilbert spaces
• On the boundedness of infinite products of relaxed projections: perturbations resilience and dynamic string-averaging
• Two extensions of the alternating algorithm of von Neumann
• On weak * closedness, coerciveness, and inf-sup theorems

This page was built for publication: On the von Neumann alternating algorithm in Hilbert space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822209)