On the von Neumann alternating algorithm in Hilbert space

DOI10.1016/0022-247X(86)90085-5zbMath0617.65049MaRDI QIDQ1822209

Carlo Franchetti, William A. Light

Publication date: 1986

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

zbMATH Keywords

Hilbert spaceconvergence ratebest approximationsDiliberto-Strauss algorithmperformance of an algorithmvon Neumann alternating algorithm

Mathematics Subject Classification ID

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

Related Items

Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems, The rate of convergence for the method of alternating projections. II, Finding best approximation pairs relative to two closed convex sets in Hilbert spaces, Error bounds for the method of alternating projections, The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case, Polynomial estimates for the method of cyclic projections in Hilbert spaces, On weak * closedness, coerciveness, and inf-sup theorems, A variational approach to the alternating projections method, Characterizing arbitrarily slow convergence in the method of alternating projections, Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains. III., Where there's a Will there's a way -- the research of Will Light, Accelerating the convergence of the method of alternating projections, Unnamed Item, A learning-enhanced projection method for solving convex feasibility problems, On the rate of convergence of the alternating projection method in finite dimensional spaces, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections, On the convergence of von Neumann's alternating projection algorithm for two sets, Two extensions of the alternating algorithm of von Neumann

Cites Work

• Two extensions of the alternating algorithm of von Neumann
• 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
• Convergence of the diliberto-straus algorithm in L₁(XxY)
• Functional Operators (AM-22), Volume 2
• The L₁-version of the Diliberto–Straus algorithm in C(T × S)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item