Perspectives on information-based complexity
From MaRDI portal
Abstract: The authors discuss information-based complexity theory, which is a model of finite-precision computations with real numbers, and its applications to numerical analysis.
Recommendations
Cites work
- A survey of information-based complexity
- Average case complexity of multivariate integration
- Average complexity for linear operators over bounded domains
- Best Approximate Integration Formulas; Best Approximation Formulas
- Complexity of Solving Linear Systems in Different Models of Computation
- Deterministic and stochastic error bounds in numerical analysis
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Families of rational maps and iterative root-finding algorithms
- How powerful is continuous nonlinear information for linear problems?
- scientific article; zbMATH DE number 3150148 (Why is no real title available?)
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 50734 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Information-based complexity: New questions for mathematicians
- Information-based numerical practice
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On detecting regularity of functions: A probabilistic analysis
- On irregularities of distribution
- On irregularities of distribution, IV
- On optimality of Krylov's information when solving linear operator equations
- On sequential and parallel solution of initial value problems
- On the existence of generally convergent algorithms
- On the minimal cost of approximating linear problems based on information with deterministic noise
- On the optimal solution of large eigenpair problems
- On the Optimal Solution of Large Linear Systems
- On the optimality of Krylov information
- On the Power of Adaptive Information for Functions with Singularities
- Recent developments in information-based complexity
- s-numbers in information-based complexity
- Sequential Minimax Search for a Maximum
- Some basic information on information-based complexity theory
- Spline interpolation and best quadrature formulae
Cited in
(21)- 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
- Optimal algorithms for a problem of optimal control
- Complexity of verification and computation for IBC problems
- Computational complexity of one-step methods for a scalar autonomous differential equation
- On the complexity of self-validating numerical integration and approximation of functions with singularities
- Information of varying cardinality
- Estimation of model quality
- A role for symmetry in the Bayesian solution of differential equations
- Absolute value information for IBC problems
- ABC on IBC
- Complexity measures in terms of general dynamics: the information capacitance
- Structural and Quantitative Characteristics of Complexity in Terms of Information
- scientific article; zbMATH DE number 446839 (Why is no real title available?)
- Some basic information on information-based complexity theory
- scientific article; zbMATH DE number 1246413 (Why is no real title available?)
- scientific article; zbMATH DE number 5583062 (Why is no real title available?)
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- Approximation of functions: optimal sampling and complexity
This page was built for publication: Perspectives on information-based complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992024)
