On linearity of spline algorithms (Q1823607)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4115815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On linearity of spline algorithms |
scientific article; zbMATH DE number 4115815 |
Statements
On linearity of spline algorithms (English)
0 references
1989
0 references
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.
0 references
optimal recovery
0 references
Banach spaces
0 references
Hilbert space
0 references
linear spline algorithm
0 references
linear interpolatory algorithm
0 references
linear strongly optimal algorithm
0 references
linear almost strongly optimal algorithm
0 references
information-based complexity
0 references
0.8611005544662476
0 references
0.8083755970001221
0 references
0.7918602824211121
0 references
