Noisy information for linear problems in the asymptotic setting
From MaRDI portal
Publication:806961
DOI10.1016/0885-064X(91)90043-WzbMath0729.65036MaRDI QIDQ806961
Leszek Plaskota, Bolesław Kacewicz
Publication date: 1991
Published in: Journal of Complexity (Search for Journal in Brave)
asymptotic behavior; optimal information; optimal convergence; linear problems; worst case performance of algorithms
65J10: Numerical solutions to equations with linear operators
65Y20: Complexity and performance of numerical algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal Bayesian experimental design for linear models
- Asymptotic near optimality of the bisection method
- Optimality of central and projection algorithms for bounded uncertainty
- Optimal solution of ordinary differential equations
- A note on the trade-off between sampling and quantization in signal processing
- Asymptotic error of algorithms for solving nonlinear problems
- On adaption with noisy information
- Best approximation of functions specified with an error at a finite number of points
- Asymptotic error for the global maximum of functions in s dimensions
- On average case complexity of linear problems with noisy information
- On Optimal Algorithms in an Asymptotic Model with Gaussian Measure
- Optimal Estimation of Linear Operators in Hilbert Spaces from Inaccurate Data
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- Smoothing noisy data with spline functions
