Functions with prescribed best linear approximations
From MaRDI portal
Publication:976207
DOI10.1016/J.JAT.2009.12.007zbMATH Open1196.41016arXiv0905.3520OpenAlexW2072088597MaRDI QIDQ976207FDOQ976207
Noli N. Reyes, Patrick L. Combettes
Publication date: 17 June 2010
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Abstract: A common problem in applied mathematics is to find a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In the present paper we study the question of the existence of solutions to such problems. A finite family of subspaces is said to satisfy the emph{Inverse Best Approximation Property (IBAP)} if there exists a point that admits any selection of points from these subspaces as best approximations. We provide various characterizations of the IBAP in terms of the geometry of the subspaces. Connections between the IBAP and the linear convergence rate of the periodic projection algorithm for solving the underlying affine feasibility problem are also established. The results are applied to problems in harmonic analysis, integral equations, signal theory, and wavelet frames.
Full work available at URL: https://arxiv.org/abs/0905.3520
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Error bounds for the method of alternating projections
- On rings of operators. Reduction theory
- On Projection Algorithms for Solving Convex Feasibility Problems
- Ten Lectures on Wavelets
- The uncertainty principle: A mathematical survey
- Convex functions, monotone operators and differentiability.
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Best approximation in inner product spaces
- Uncertainty Principles and Signal Recovery
- Accelerating the convergence of the method of alternating projections
- Hilbertian convex feasibility problem: Convergence of projection methods
- On Fourier transforms of functions supported on sets of finite Lebesgue measure
- On support properties of Lsup(p)-functions and their Fourier transforms
- Nazarov's uncertainty principles in higher dimension
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- Extrapolation algorithm for affine-convex feasibility problems
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
- Frames, Riesz bases, and discrete Gabor/wavelet expansions
- Riesz-Fischer sequences and lower frame bounds
- Moment problems and stability results for frames with applications to irregular sampling and Gabor frames
- Generalized Image Restoration by the Method of Alternating Orthogonal Projections
- Functions with time and frequency gaps
- The product of affine orthogonal projections
Cited In (7)
- On the closedness of the sum of ranges of operators \(A_k\) with almost compact products \(A_i^\ast A_j\)
- On closedness of the sum of \(n\) subspaces of a Hilbert space
- Best linear and nonlinear approximations for smooth functions
- Reconstruction of functions from prescribed proximal points
- A new characterization of the generalized inverse using projections on level sets
- The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle
- Inverse best approximation property of convex sets
This page was built for publication: Functions with prescribed best linear approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976207)
