Perspectives on information-based complexity
From MaRDI portal
Publication:3992024
DOI10.1090/S0273-0979-1992-00240-9zbMath0766.68065arXivmath/9201269OpenAlexW2016764429MaRDI QIDQ3992024
J. F. Traub, Henryk Woźniakowski
Publication date: 28 June 1992
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9201269
Related Items
A survey of information-based complexity, Parallel and sequential computation: A statistician's view, Complexity of differential and integral equations, Optimal solution of nonlinear equations, Estimation of model quality, Optimal algorithms for a problem of optimal control, Complexity of computing topological degree of Lipschitz functions in n dimensions, Computational complexity of one-step methods for a scalar autonomous differential equation, A role for symmetry in the Bayesian solution of differential equations, On the complexity of self-validating numerical integration and approximation of functions with singularities, Information of varying cardinality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average complexity for linear operators over bounded domains
- On the optimality of Krylov information
- Information-based complexity: New questions for mathematicians
- s-numbers in information-based complexity
- On sequential and parallel solution of initial value problems
- On the existence of generally convergent algorithms
- On the optimal solution of large eigenpair problems
- A survey of information-based complexity
- Families of rational maps and iterative root-finding algorithms
- Information-based numerical practice
- On optimality of Krylov's information when solving linear operator equations
- Deterministic and stochastic error bounds in numerical analysis
- On detecting regularity of functions: A probabilistic analysis
- How powerful is continuous nonlinear information for linear problems?
- Average case complexity of multivariate integration
- On the minimal cost of approximating linear problems based on information with deterministic noise
- Complexity of Solving Linear Systems in Different Models of Computation
- On the Optimal Solution of Large Linear Systems
- Recent developments in information-based complexity
- On irregularities of distribution, IV
- On the Power of Adaptive Information for Functions with Singularities
- Some basic information on information-based complexity theory
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Spline interpolation and best quadrature formulae
- Best Approximate Integration Formulas; Best Approximation Formulas
- Sequential Minimax Search for a Maximum
- On irregularities of distribution
