The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting

DOI10.1006/JCOM.1993.1008MaRDI QIDQ2365845zbMATH OpenOpenAlexFDO

Authors Bolesław Kacewicz, Leszek Plaskota

Publication date 29 June 1993

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

Full work available at URL https://doi.org/10.1006/jcom.1993.1008

zbMATH Keywords

worst case\(\varepsilon\)-approximation to linear continuous operatorsminimal information cost

Mathematics Subject Classification ID

Perturbation theory of linear operators (47A55) Problems with incomplete information (optimization) (49N30) Control/observation systems with incomplete information (93C41)

Recommendations

• On the minimal cost of approximating linear problems based on information with deterministic noise
• Average complexity for linear problems in a model with varying information noise
• How powerful is continuous nonlinear information for linear problems?
• scientific article; zbMATH DE number 1206797
• Noisy information for linear problems in the asymptotic setting

Cited in

(4)

• On the optimal robust solution of IVPs with noisy information
• How to minimize the cost of iterative methods in the presence of perturbations
• On the minimal cost of approximating linear problems based on information with deterministic noise
• scientific article; zbMATH DE number 926781 (Why is no real title available?)

This page was built for publication: The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365845)