On linearity of spline algorithms

DOI10.1016/0885-064X(89)90007-1zbMath0681.65005MaRDI QIDQ1823607

Mark A. Kon, Roberto Tempo

Publication date: 1989

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

Banach spacesHilbert spaceinformation-based complexityoptimal recoverylinear almost strongly optimal algorithmlinear interpolatory algorithmlinear spline algorithmlinear strongly optimal algorithm

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Spline approximation (41A15)

Related Items (3)

Linearity of algorithms and a result of Ando ⋮ Linear algorithms with finite deviation ⋮ \(H_{\infty}\) set membership identification: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Are linear algorithms always good for linear problems?
• Linear problems (with extended range) have linear optimal algorithms
• Invariant subspaces of completely continuous operators
• Optimal algorithms theory for robust estimation and prediction
• Recent developments in information-based complexity
• Robust estimation and filtering in the presence of bounded noise
• Optimal Estimation of Linear Operators in Hilbert Spaces from Inaccurate Data

This page was built for publication: On linearity of spline algorithms