scientific article; zbMATH DE number 3827201
zbMATH Open0522.68041MaRDI QIDQ3673103FDOQ3673103
Authors: J. F. Traub, Grzegorz W. Wasilkowski, H. Woźniakowski 
Publication date: 1983
Title of this publication is not available (Why is that?)
applicationsuncertaintydecision theoryapproximate solutioninformation theoryoptimal algorithmssolution operatorworst case analysislinear and nonlinear equationsalgebraic coding theorydistributed computationbin- packingdiscrete and continuous binary search
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10) Combinatorial codes (94B25) Algorithms in computer science (68W99)
Cited In (59)
- Errors and optimality for spatial approximations in one-dimensional transport
- Worst-case errors for some spatial approximations to a model problem in two-dimensional transport theory
- Necessary and sufficient conditions for robust identification of uncertain LTIstems
- Approximation, solution operators and quantale-valued metrics
- Algorithmic and complexity issues of robot motion in an uncertain environment
- An approach to the physics of complexity
- Perspectives on information-based complexity
- On average case errors in numerical analysis
- On the complexity of linear quadratic control
- A modern retrospective on probabilistic numerics
- Complexity of operators on compact sets
- Minimax quadratic estimation of a quadratic functional
- Some nonlinear problems are as easy as the approximation problem
- Basic principles of feedback and adaptive approaches in the finite element method
- Engineering control systems and computing in the 90s
- Near-optimality of linear recovery from indirect observations
- Probabilistic complexity analysis for linear problems in bounded domains
- Shape from shadows. A Hilbert space setting
- Average complexity of divide-and-conquer algorithms
- Conditionally optimal algorithms and estimation of reduced order models
- Optimal search algorithm for extrema of a discrete periodic bimodal function
- Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements
- Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\)
- Average case optimal algorithms in Hilbert spaces
- On the minimal cost of approximating linear problems based on information with deterministic noise
- Surrogates for numerical simulations; optimization of eddy-promoter heat exchangers
- Complexity of differential and integral equations
- Optimal algorithms for image understanding: Current status and future plans
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Risk, uncertainty, and complexity
- Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\)
- Complexity of weighted approximation over \(\mathbb{R}\)
- Exponential lower bounds for finding Brouwer fixed points
- Two schemes for information acquisition: An entropic assessment
- Optimal solution of nonlinear equations
- On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits
- Using CAPTCHA in computer steganography
- Optimal approximation of elliptic problems by linear and nonlinear mappings. II
- Maximum likelihood estimators and worst case optimal algorithms for system identification
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- For which error criteria can we solve nonlinear equations?
- Strong convergence rates of probabilistic integrators for ordinary differential equations
- Optimal solution of nonlinear equations satisfying a Lipschitz condition
- Optimal cubature formulas for tensor products of certain classes of functions
- Efficient iterative methods with and without memory possessing high efficiency indices
- Complexity of optimizing over the integers
- On linearity of spline algorithms
- Information of varying cardinality
- How powerful is continuous nonlinear information for linear problems?
- On the computational complexity of integral equations
- Some basic information on information-based complexity theory
- Measuring uncertainty without a norm
- Information based complexity for high dimensional sparse functions
- Optimality of central and projection algorithms for bounded uncertainty
- On optimal algorithms for problems defined on groups
- A survey of information-based complexity
- Optimal error predictors for economic models
- Counterexamples in optimal quadrature
- Complexity of functions: Some questions, conjectures, and results
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673103)
