The real number model in numerical analysis

DOI10.1006/JCOM.1995.1002MaRDI QIDQ1346593zbMATH OpenOpenAlexFDO

Authors Erich Novak

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

zbMATH Keywords

information-based complexitystochastic algorithms

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Why does information-based complexity use the real number model?
• A refined model of computation for continuous problems
• Real computations with fake numbers
• On weak and weighted computations over the real closure of \(\mathbb{Q}\)
• Real number models under various sets of operations

Cited in

(31)

• What Monte Carlo models can do and cannot do efficiently?
• A refined model of computation for continuous problems
• Feasible real random access machines
• On the cost of uniform and nonuniform algorithms
• Why does information-based complexity use the real number model?
• On a problem in quantum summation.
• Real computations with fake numbers
• On the complexity of computing the \(L_q\) norm
• Some aspects of studying an optimization or decision problem in different computational models
• Topological complexity of zero finding with algebraic operations
• Complexity of linear problems with a fixed output basis
• A lower bound on complexity of optimization on the Wiener space
• A local refinement strategy for constructive quantization of scalar SDEs
• Simple Monte Carlo and the Metropolis algorithm
• Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
• Optimal algorithms for global optimization in case of unknown Lipschitz constant
• On the complexity of parabolic initial-value problems with variable drift
• Optimal approximation of elliptic problems by linear and nonlinear mappings. II
• Exact Image Reconstruction from a Single Projection through Real Computation
• On the complexity of computing quadrature formulas for marginal distributions of SDEs
• Deterministic quadrature formulas for SDEs based on simplified weak Itô-Taylor steps
• The randomized complexity of indefinite integration
• Quantum complexity of integration
• Numbers and models, standard and nonstandard
• Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
• Multilevel Monte Carlo algorithms for Lévy-driven SDEs with Gaussian correction
• Feasible real random access machines
• Approximation of functions: optimal sampling and complexity
• On the computing power of fuzzy Turing machines
• Are unbounded linear operators computable on the average for Gaussian measures?
• A concrete model of the real numbers

This page was built for publication: The real number model in numerical analysis

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