Pages that link to "Item:Q1346593"
From MaRDI portal
The following pages link to The real number model in numerical analysis (Q1346593):
Displaying 27 items.
- On the complexity of computing quadrature formulas for marginal distributions of SDEs (Q479002) (← links)
- Deterministic quadrature formulas for SDEs based on simplified weak Itô-Taylor steps (Q515988) (← links)
- The randomized complexity of indefinite integration (Q544127) (← links)
- Multilevel Monte Carlo algorithms for Lévy-driven SDEs with Gaussian correction (Q627246) (← links)
- On the computing power of fuzzy Turing machines (Q835106) (← links)
- Are unbounded linear operators computable on the average for Gaussian measures? (Q945917) (← links)
- What Monte Carlo models can do and cannot do efficiently? (Q1031571) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- Feasible real random access machines (Q1279912) (← links)
- On the cost of uniform and nonuniform algorithms (Q1292410) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- On a problem in quantum summation. (Q1394934) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- On the complexity of computing the \(L_q\) norm (Q1791678) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Topological complexity of zero finding with algebraic operations (Q1872637) (← links)
- Complexity of linear problems with a fixed output basis (Q1977152) (← links)
- A lower bound on complexity of optimization on the Wiener space (Q2383590) (← links)
- A local refinement strategy for constructive quantization of scalar SDEs (Q2441421) (← links)
- Simple Monte Carlo and the Metropolis algorithm (Q2465298) (← links)
- Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms (Q2472367) (← links)
- Optimal algorithms for global optimization in case of unknown Lipschitz constant (Q2489149) (← links)
- On the complexity of parabolic initial-value problems with variable drift (Q2489153) (← links)
- Optimal approximation of elliptic problems by linear and nonlinear mappings. II (Q2507592) (← links)
- Exact Image Reconstruction from a Single Projection through Real Computation (Q3439189) (← links)
- Quantum complexity of integration (Q5938578) (← links)
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)
