Convergence of the diliberto-straus algorithm in L1(XxY)

DOI10.1080/01630568108816083zbMath0472.65011OpenAlexW2032303168MaRDI QIDQ3925786

William A. Light

Publication date: 1981

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568108816083

zbMATH Keywords

subspaceconvergenceiterative methodsclosest pointsDiliberto-Straus algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Related Items (3)

The Chebyshev solution of certain matrix equations ⋮ Where there's a Will there's a way -- the research of Will Light ⋮ On the von Neumann alternating algorithm in Hilbert space

Cites Work

• 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

This page was built for publication: Convergence of the diliberto-straus algorithm in L₁(XxY)