On linearity of spline algorithms
Year: 1989
Type: article
Abstract: In this paper we prove that a Hilbert structure is necessary as well as sufficient for linearity of the following classes of Banach space approximation algorithms: spline, interpolatory, strongly optimal, and almost strongly optimal. 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.
Source: Journal of Complexity
Institutions: Boston University, Columbia University, Politecnico di Torino
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,680
OpenAlex ID: W1990800089