Why does information-based complexity use the real number model?
From MaRDI portal
Recommendations
Cites work
- A refined model of computation for continuous problems
- An efficient algorithm for the complex roots problem
- Asymptotic near optimality of the bisection method
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Average-Case Optimality of a Hybrid Secant-Bisection Method
- Bisection is optimal
- Computation of π Using Arithmetic-Geometric Mean
- Computational Complexity and Numerical Stability
- Computing convex hull in a floating point arithmetic
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Fast Multiple-Precision Evaluation of Elementary Functions
- Gaussian elimination is not optimal
- How to multiply matrices faster
- scientific article; zbMATH DE number 4146016 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3533996 (Why is no real title available?)
- scientific article; zbMATH DE number 3537171 (Why is no real title available?)
- scientific article; zbMATH DE number 641702 (Why is no real title available?)
- scientific article; zbMATH DE number 1153816 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 862514 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3090508 (Why is no real title available?)
- Matrix multiplication via arithmetic progressions
- Numerical stability for solving nonlinear equations
- Numerical stability of a convex hull algorithm for simple polygons
- Numerical stability of descent methods for solving linear equations
- Numerical stability of the Chebyshev method for the solution of large linear systems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the topology of algorithms. I
- Optimal solution of nonlinear equations
- Round-off error analysis of iterations for large linear systems
- Roundoff-error analysis of a new class of conjugate-gradient algorithms
- Schemes using preliminary treatment of coefficients for polynomial calculation. A program for automatic determination of parameters
- The computable multi-functions on multi-represented sets are closed under programming
- The real number model in numerical analysis
- Theory of Multivariate Secant Methods
- Topological complexity of zero-finding
- Topological complexity with continuous operations
Cited in
(6)- The real number model in numerical analysis
- Complexity of linear problems with a fixed output basis
- scientific article; zbMATH DE number 1859211 (Why is no real title available?)
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Approximation of functions: optimal sampling and complexity
This page was built for publication: Why does information-based complexity use the real number model?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292417)
