Pages that link to "Item:Q2365417"
From MaRDI portal
The following pages link to The complexity of definite elliptic problems with noisy data (Q2365417):
Displaying 14 items.
- On the optimal robust solution of IVPs with noisy information (Q261847) (← links)
- The quantum query complexity of elliptic PDE (Q855898) (← links)
- The complexity of indefinite elliptic problems with noisy data (Q1383441) (← links)
- Where does smoothness count the most for two-point boundary-value problems? (Q1961052) (← links)
- Optimal approximation of stochastic integrals in analytic noise model (Q2009523) (← links)
- Randomized Runge-Kutta method -- stability and convergence under inexact information (Q2041068) (← links)
- On the randomized Euler schemes for ODEs under inexact information (Q2084257) (← links)
- Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information (Q2199772) (← links)
- Optimal pointwise approximation of SDE's from inexact information (Q2360711) (← links)
- The randomized information complexity of elliptic PDE (Q2489143) (← links)
- The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information (Q4400144) (← links)
- The worst case complexity of the fredholm equation with periodic free term and noisy information<sup>∗</sup> (Q4935386) (← links)
- Bayesian Probabilistic Numerical Methods in Time-Dependent State Estimation for Industrial Hydrocyclone Equipment (Q5208054) (← links)
- Euler scheme for approximation of solution of nonlinear ODEs under inexact information (Q6064949) (← links)