The complexity of definite elliptic problems with noisy data
From MaRDI portal
Publication:2365417
DOI10.1006/jcom.1996.0027zbMath0862.68066OpenAlexW2059522711MaRDI QIDQ2365417
Publication date: 25 May 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/81fbb3e448a878096955923af3d82198175a6fd8
Related Items (14)
Optimal pointwise approximation of SDE's from inexact information ⋮ The quantum query complexity of elliptic PDE ⋮ The complexity of indefinite elliptic problems with noisy data ⋮ Euler scheme for approximation of solution of nonlinear ODEs under inexact information ⋮ Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information ⋮ Where does smoothness count the most for two-point boundary-value problems? ⋮ Optimal approximation of stochastic integrals in analytic noise model ⋮ The randomized information complexity of elliptic PDE ⋮ The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information ⋮ The worst case complexity of the fredholm equation with periodic free term and noisy information∗ ⋮ Bayesian Probabilistic Numerical Methods in Time-Dependent State Estimation for Industrial Hydrocyclone Equipment ⋮ Randomized Runge-Kutta method -- stability and convergence under inexact information ⋮ On the randomized Euler schemes for ODEs under inexact information ⋮ On the optimal robust solution of IVPs with noisy information
This page was built for publication: The complexity of definite elliptic problems with noisy data
