Why does information-based complexity use the real number model?
type: Item
instance of: scholarly article
title: Why does information-based complexity use the real number model?
zbMATH Open document ID: 0916.68075
DOI: 10.1016/S0304-3975(98)00300-4
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1306144
zbMATH Keywords: real number model
zbMATH Keywords: floating point arithmetic
zbMATH Keywords: information-based complexity
zbMATH Keywords: nonlinear equations
zbMATH Keywords: bisection
author: H. Woźniakowski
describes a project that uses: mctoolbox
MaRDI profile type: Publication
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Numerical stability of descent methods for solving linear equations
cites work: Q3476890
cites work: Q4110543
cites work: Fast Multiple-Precision Evaluation of Elementary Functions
cites work: Matrix multiplication via arithmetic progressions
cites work: Topological complexity with continuous operations
cites work: Q4864704
cites work: Theory of Multivariate Secant Methods
cites work: Numerical stability of a convex hull algorithm for simple polygons
cites work: Computing convex hull in a floating point arithmetic
cites work: Q4002474
cites work: Q4113344
cites work: Computational Complexity and Numerical Stability
cites work: An efficient algorithm for the complex roots problem
cites work: The real number model in numerical analysis
cites work: Average-Case Optimality of a Hybrid Secant-Bisection Method
cites work: Topological complexity of zero-finding
cites work: Q5829318
cites work: Schemes using preliminary treatment of coefficients for polynomial calculation. A program for automatic determination of parameters
cites work: How to multiply matrices faster
cites work: Q4389411
cites work: Average errors for zero finding: Lower bounds for smooth or monotone functions
cites work: Computation of π Using Arithmetic-Geometric Mean
cites work: Q4306894
cites work: Bisection is optimal
cites work: Optimal solution of nonlinear equations
cites work: Asymptotic near optimality of the bisection method
cites work: On the topology of algorithms. I
cites work: Gaussian elimination is not optimal
cites work: Q3993279
cites work: Explicit cost bounds of algorithms for multivariate tensor product problems
cites work: Q3518432
cites work: A refined model of computation for continuous problems
cites work: Q4871634
cites work: Q5674306
cites work: Numerical stability for solving nonlinear equations
cites work: Numerical stability of the Chebyshev method for the solution of large linear systems
cites work: Round-off error analysis of iterations for large linear systems
cites work: Roundoff-error analysis of a new class of conjugate-gradient algorithms
full work available at URL: s0304-3975(98)00300-4
OpenAlex ID: W2135282115
description: scientific article; zbMATH DE number 1306144