The complexity of definite elliptic problems with noisy data

DOI10.1006/JCOM.1996.0027MaRDI QIDQ2365417zbMATH OpenOpenAlexFDO

Authors A. G. Werschulz

Publication date 25 May 1997

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://semanticscholar.org/paper/81fbb3e448a878096955923af3d82198175a6fd8

zbMATH Keywords

information-based complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The complexity of indefinite elliptic problems with noisy data
• Complexity of Indefinite Elliptic Problems
• Where does smoothness count the most for two-point boundary-value problems?

Cited in

(16)

• On the optimal robust solution of IVPs with noisy information
• Optimal pointwise approximation of SDE's from inexact information
• Where does smoothness count the most for two-point boundary-value problems?
• Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information
• Optimal approximation of stochastic integrals in analytic noise model
• The quantum query complexity of elliptic PDE
• The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
• Complexity of Indefinite Elliptic Problems
• The complexity of indefinite elliptic problems with noisy data
• The worst case complexity of the fredholm equation with periodic free term and noisy information^∗
• Euler scheme for approximation of solution of nonlinear ODEs under inexact information
• Bayesian probabilistic numerical methods in time-dependent state estimation for industrial hydrocyclone equipment
• The complexity of multivariate elliptic problems with analytic data
• Randomized Runge-Kutta method -- stability and convergence under inexact information
• On the randomized Euler schemes for ODEs under inexact information
• The randomized information complexity of elliptic PDE

This page was built for publication: The complexity of definite elliptic problems with noisy data

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