Functions with prescribed best linear approximations
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3919670 (Why is no real title available?)
- scientific article; zbMATH DE number 3942286 (Why is no real title available?)
- scientific article; zbMATH DE number 3948706 (Why is no real title available?)
- scientific article; zbMATH DE number 4021000 (Why is no real title available?)
- scientific article; zbMATH DE number 692336 (Why is no real title available?)
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 3806227 (Why is no real title available?)
- scientific article; zbMATH DE number 2204771 (Why is no real title available?)
- scientific article; zbMATH DE number 3230744 (Why is no real title available?)
- scientific article; zbMATH DE number 3230748 (Why is no real title available?)
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- scientific article; zbMATH DE number 3367521 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Accelerating the convergence of the method of alternating projections
- Best approximation in inner product spaces
- Characterizing arbitrarily slow convergence in the method of alternating projections
- Convex functions, monotone operators and differentiability.
- Error bounds for the method of alternating projections
- Extrapolation algorithm for affine-convex feasibility problems
- Frames, Riesz bases, and discrete Gabor/wavelet expansions
- Functions with time and frequency gaps
- Generalized Image Restoration by the Method of Alternating Orthogonal Projections
- Hilbertian convex feasibility problem: Convergence of projection methods
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
- Moment problems and stability results for frames with applications to irregular sampling and Gabor frames
- Nazarov's uncertainty principles in higher dimension
- On Fourier transforms of functions supported on sets of finite Lebesgue measure
- On Projection Algorithms for Solving Convex Feasibility Problems
- On rings of operators. Reduction theory
- On support properties of Lsup(p)-functions and their Fourier transforms
- Riesz-Fischer sequences and lower frame bounds
- Ten Lectures on Wavelets
- The product of affine orthogonal projections
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- The uncertainty principle: A mathematical survey
- Uncertainty Principles and Signal Recovery
Cited in
(7)- On the closedness of the sum of ranges of operators A_k with almost compact products A_i^ 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)
