scientific article

J. F. Traub, Grzegorz W. Wasilkowski, Henryk Woźniakowski

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

uncertainty decision theory applications approximate solution information theory optimal algorithms solution operator worst case analysis linear and nonlinear equations algebraic coding theory distributed computation bin- packing discrete and continuous binary search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Iterative numerical methods for linear systems (65F10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatorial codes (94B25) Algorithms in computer science (68W99)

Related Items (59)

Two schemes for information acquisition: An entropic assessment ⋮ On the complexity of linear quadratic control ⋮ A survey of information-based complexity ⋮ Approximation of linear functionals on a Banach space with a Gaussian measure ⋮ Complexity of differential and integral equations ⋮ For which error criteria can we solve nonlinear equations? ⋮ Optimal solution of nonlinear equations ⋮ Worst-case errors for some spatial approximations to a model problem in two-dimensional transport theory ⋮ Optimality of central and projection algorithms for bounded uncertainty ⋮ Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape ⋮ Some basic information on information-based complexity theory ⋮ Perspectives on information-based complexity ⋮ Maximum likelihood estimators and worst case optimal algorithms for system identification ⋮ Algorithmic and complexity issues of robot motion in an uncertain environment ⋮ Engineering control systems and computing in the 90s ⋮ Conditionally optimal algorithms and estimation of reduced order models ⋮ Average complexity of divide-and-conquer algorithms ⋮ On the minimal cost of approximating linear problems based on information with deterministic noise ⋮ Surrogates for numerical simulations; optimization of eddy-promoter heat exchangers ⋮ Optimal search algorithm for extrema of a discrete periodic bimodal function ⋮ Errors and optimality for spatial approximations in one-dimensional transport ⋮ Approximation, solution operators and quantale-valued metrics ⋮ Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements ⋮ Complexity of optimizing over the integers ⋮ Using CAPTCHA in computer steganography ⋮ Exponential lower bounds for finding Brouwer fixed points ⋮ Optimal error predictors for economic models ⋮ Optimal cubature formulas for tensor products of certain classes of functions ⋮ Complexity of functions: Some questions, conjectures, and results ⋮ Complexity of weighted approximation over \(\mathbb{R}\) ⋮ Near-optimality of linear recovery from indirect observations ⋮ Complexity of Operators on Compact Sets ⋮ On the computational complexity of integral equations ⋮ Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\) ⋮ Some nonlinear problems are as easy as the approximation problem ⋮ Necessary and sufficient conditions for robust identification of uncertain LTIstems ⋮ Optimal approximation of elliptic problems by linear and nonlinear mappings. II ⋮ On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits ⋮ Strong convergence rates of probabilistic integrators for ordinary differential equations ⋮ A modern retrospective on probabilistic numerics ⋮ Information based complexity for high dimensional sparse functions ⋮ Shape from shadows. A Hilbert space setting ⋮ Probabilistic complexity analysis for linear problems in bounded domains ⋮ Minimax quadratic estimation of a quadratic functional ⋮ Counterexamples in optimal quadrature ⋮ Information of varying cardinality ⋮ On average case errors in numerical analysis ⋮ How powerful is continuous nonlinear information for linear problems? ⋮ On linearity of spline algorithms ⋮ On optimal algorithms for problems defined on groups ⋮ Efficient iterative methods with and without memory possessing high efficiency indices ⋮ Optimal solution of nonlinear equations satisfying a Lipschitz condition ⋮ Measuring uncertainty without a norm ⋮ Risk, uncertainty, and complexity ⋮ Basic principles of feedback and adaptive approaches in the finite element method ⋮ Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\) ⋮ Optimal algorithms for image understanding: Current status and future plans ⋮ An approach to the physics of complexity ⋮ Average case optimal algorithms in Hilbert spaces

This page was built for publication: