How powerful is continuous nonlinear information for linear problems?

DOI10.1016/0885-064X(86)90008-7zbMath0618.65043MaRDI QIDQ1822461

Bolesław Kacewicz, Grzegorz W. Wasilkowski

Publication date: 1986

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

zbMATH Keywords

best approximationpartial informationinformation operatornonlinear informationworst case behaviour

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items

Optimal solution of ordinary differential equations ⋮ Perspectives on information-based complexity ⋮ Randomization for continuous problems ⋮ The adaption problem for approximating linear operators ⋮ What is the complexity of ill-posed problems? ⋮ On the adaptive and continuous information problems ⋮ s-numbers in information-based complexity

Cites Work

• Average case optimality for linear problems
• Optimality of Euler-integral information for solving a scalar autonomous ODE
• Average case optimal algorithms in Hilbert spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item