The real number model in numerical analysis
From MaRDI portal
Publication:1346593
DOI10.1006/jcom.1995.1002zbMath0822.68053OpenAlexW2002937509MaRDI QIDQ1346593
Publication date: 5 April 1995
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1995.1002
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (27)
Topological complexity of zero finding with algebraic operations ⋮ On the computing power of fuzzy Turing machines ⋮ A lower bound on complexity of optimization on the Wiener space ⋮ On a problem in quantum summation. ⋮ Multilevel Monte Carlo algorithms for Lévy-driven SDEs with Gaussian correction ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ A local refinement strategy for constructive quantization of scalar SDEs ⋮ On the complexity of computing quadrature formulas for marginal distributions of SDEs ⋮ Complexity of linear problems with a fixed output basis ⋮ Simple Monte Carlo and the Metropolis algorithm ⋮ Are unbounded linear operators computable on the average for Gaussian measures? ⋮ Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms ⋮ Deterministic quadrature formulas for SDEs based on simplified weak Itô-Taylor steps ⋮ The randomized complexity of indefinite integration ⋮ Optimal algorithms for global optimization in case of unknown Lipschitz constant ⋮ On the complexity of parabolic initial-value problems with variable drift ⋮ Quantum complexity of integration ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. II ⋮ On the complexity of computing the \(L_q\) norm ⋮ A refined model of computation for continuous problems ⋮ Feasible real random access machines ⋮ What Monte Carlo models can do and cannot do efficiently? ⋮ On the cost of uniform and nonuniform algorithms ⋮ Why does information-based complexity use the real number model? ⋮ Some aspects of studying an optimization or decision problem in different computational models ⋮ Real computations with fake numbers ⋮ Exact Image Reconstruction from a Single Projection through Real Computation
This page was built for publication: The real number model in numerical analysis
