The main result of this paper can be stated in a simple form as follows: Let F and Z be Banach spaces. Then, if the dimension of F is greater than 2, statements (a) through (e) are equivalent: (a) F is a Hilbert space. For every linear problem S with domain F and information operator N there exists (b) a linear spline algorithm. (c) a linear interpolatory algorithm, (d) a linear strongly optimal algorithm, (e) a linear almost strongly optimal algorithm. In the context of information-based complexity, this provides a converse to the well-known result that a Hilbert structure is sufficient for such linearity properties.
- Are linear algorithms always good for linear problems?
- scientific article; zbMATH DE number 3159722 (Why is no real title available?)
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3455838 (Why is no real title available?)
- scientific article; zbMATH DE number 3601500 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- scientific article; zbMATH DE number 3370999 (Why is no real title available?)
- Invariant subspaces of completely continuous operators
- Linear problems (with extended range) have linear optimal algorithms
- Optimal algorithms theory for robust estimation and prediction
- Optimal Estimation of Linear Operators in Hilbert Spaces from Inaccurate Data
- Recent developments in information-based complexity
- Robust estimation and filtering in the presence of bounded noise
This page was built for publication: On linearity of spline algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823607)
