Noisy information for linear problems in the asymptotic setting

DOI10.1016/0885-064X(91)90043-WMaRDI QIDQ806961zbMATH OpenOpenAlexFDO

Authors Bolesław Kacewicz, Leszek Plaskota

Publication date 1991

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

Full work available at URL https://doi.org/10.1016/0885-064x(91)90043-w

zbMATH Keywords

asymptotic behavioroptimal convergencelinear problemsoptimal informationworst case performance of algorithms

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical solutions to equations with linear operators (65J10)

Recommendations

• Average case optimality for linear problems
• Noisy information: optimality, complexity, tractability
• On the minimal cost of approximating linear problems based on information with deterministic noise
• On Optimal Algorithms in an Asymptotic Model with Gaussian Measure
• scientific article; zbMATH DE number 139625

Cites work

• scientific article; zbMATH DE number 44104 (Why is no real title available?)
• scientific article; zbMATH DE number 3601500 (Why is no real title available?)
• A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
• A note on the trade-off between sampling and quantization in signal processing
• Asymptotic error for the global maximum of functions in s dimensions
• Asymptotic error of algorithms for solving nonlinear problems
• Asymptotic near optimality of the bisection method
• Best approximation of functions specified with an error at a finite number of points
• On Optimal Algorithms in an Asymptotic Model with Gaussian Measure
• On adaption with noisy information
• On average case complexity of linear problems with noisy information
• Optimal Bayesian experimental design for linear models
• Optimal Estimation of Linear Operators in Hilbert Spaces from Inaccurate Data
• Optimal solution of ordinary differential equations
• Optimality of central and projection algorithms for bounded uncertainty
• Smoothing noisy data with spline functions

Cited in

(6)

• On information sets for linear nonstationary systems with noise having wave structure
• On the minimal cost of approximating linear problems based on information with deterministic noise
• Termination Conditions for Approximating Linear Problems with Noisy Information
• Bounds from noisy linear measurements
• Informativity of noisy data for structural properties of linear systems
• The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting

This page was built for publication: Noisy information for linear problems in the asymptotic setting

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