scientific article

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

Publication date: 17 September 1992

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 (only showing first 100 items - show all)

A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications ⋮ New lower bound estimates for quadratures of bounded analytic functions ⋮ Optimal sampling points in reproducing kernel Hilbert spaces ⋮ Very low truncation dimension for high dimensional integration under modest error demand ⋮ Average sampling numbers of multivariate periodic function spaces with a Gaussian measure ⋮ Randomly shifted lattice rules for unbounded integrands ⋮ The quantum query complexity of elliptic PDE ⋮ Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions ⋮ Product rules are optimal for numerical integration in classical smoothness spaces ⋮ Complexity of linear ill-posed problems in Hilbert space ⋮ Identification error bounds and asymptotic distributions for systems with structural uncertainties ⋮ Learning smooth shapes by probing ⋮ Tractability of quasilinear problems. I: General results ⋮ Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information ⋮ Optimal recovery of isotropic classes of twice-differentiable multivariate functions ⋮ Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements ⋮ Lower bounds for the complexity of linear functionals in the randomized setting ⋮ Liberating the dimension for function approximation ⋮ Direct data-driven filter design for uncertain LTI systems with bounded noise ⋮ Optimal recovery of Besov classes of generalized smoothness and Sobolev classes on the sphere ⋮ Optimal recovery of operators and multidimensional Carlson type inequalities ⋮ Approximation of piecewise Hölder functions from inexact information ⋮ Liberating the dimension for \(L_2\)-approximation ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Ultrastability of \(n\)th minimal errors ⋮ On sequential and parallel solution of initial value problems ⋮ An optimal multivariate spline method of recovery of twice differentiable functions ⋮ Joint spectra of Toeplitz operators and optimal recovery of analytic functions ⋮ Unified set membership theory for identification, prediction and filtering of nonlinear systems ⋮ On approximation of band-limited signals ⋮ Adaptive parameter choice for one-sided finite difference schemes and its application in diabetes technology ⋮ Average case tractability of non-homogeneous tensor product problems ⋮ Tractability of infinite-dimensional integration in the worst case and randomized settings ⋮ Optimal cubature formulas for tensor products of certain classes of functions ⋮ Integration error for multivariate functions from anisotropic classes ⋮ Cloud computing in cryptography and steganography ⋮ Tractability results for weighted Banach spaces of smooth functions ⋮ Complexity of functions: Some questions, conjectures, and results ⋮ Complexity of multilinear problems in the average case setting ⋮ Optimal residual algorithms for linear operator equations ⋮ Linearity of algorithms and a result of Ando ⋮ On the average case solvability of ill-posed problems ⋮ Gaussian mean boundedness of densely defined linear operators ⋮ Random approximation of Sobolev embeddings ⋮ Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces ⋮ Linear information versus function evaluations for \(L_2\)-approximation ⋮ Approximation of multivariate periodic functions on the space with a Gaussian measure ⋮ Approximation of additive random fields based on standard information: average case and probabilistic settings ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Parallel information-based complexity ⋮ Statistical complexity of dominant eigenvector calculation ⋮ Notes on \((s,t)\)-weak tractability: a refined classification of problems with (sub)exponential information complexity ⋮ Optimal adaptive solution of initial-value problems with unknown singularities ⋮ Are unbounded linear operators computable on the average for Gaussian measures? ⋮ Optimal linear randomized methods for linear operators in Hilbert spaces ⋮ Measures of uncertainty and information in computation ⋮ Complexity of verification and computation for IBC problems ⋮ Gamblets for opening the complexity-bottleneck of implicit schemes for hyperbolic and parabolic ODEs/PDEs with rough coefficients ⋮ Lower bounds for the complexity of Monte Carlo function approximation ⋮ Function approximation and integration on the Wiener space with noisy data ⋮ Average case complexity of linear multivariate problems. I: Theory ⋮ Approximation of functions on the Sobolev space with a Gaussian measure ⋮ Linear vs standard information for scalar stochastic differential equations ⋮ Tractability of integration in non-periodic and periodic weighted tensor product Hilbert spaces ⋮ Direct estimation of linear functionals from indirect noisy observations ⋮ Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\) ⋮ What is the complexity of volume calculation? ⋮ Tractability of tensor product problems in the average case setting ⋮ On the randomized solution of initial value problems ⋮ Quasi-polynomial tractability ⋮ The randomized complexity of indefinite integration ⋮ Liberating the dimension for function approximation: standard information ⋮ Linear vs. nonlinear algorithms for linear problems ⋮ Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure ⋮ Tractability through increasing smoothness ⋮ Liberating the dimension ⋮ A note on level-2 condition numbers ⋮ Best approximation of functions on the ball on the weighted Sobolev space equipped with a Gaussian measure ⋮ Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions ⋮ Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\) ⋮ Average-case results for zero finding ⋮ On the information-based complexity of optimal reconstruction for nonlinear systems ⋮ The approximation characteristic of diagonal matrix in probabilistic setting ⋮ On the tractability of linear tensor product problems in the worst case ⋮ Randomized approximation of Sobolev embeddings. II ⋮ Randomized approximation of Sobolev embeddings. III ⋮ Complexity of multilinear problems in the worst case setting ⋮ Computing topological degree using noisy information ⋮ On the power of standard information for multivariate approximation in the worst case setting ⋮ New averaging technique for approximating weighted integrals ⋮ s-numbers in information-based complexity ⋮ Probabilistic complexity analysis for linear problems in bounded domains ⋮ Minimax quadratic estimation of a quadratic functional ⋮ What Monte Carlo models can do and cannot do efficiently? ⋮ The average errors for the Grünwald interpolation in the Wiener space ⋮ Linear average and stochastic \(n\)-widths of Besov embeddings on Lipschitz domains ⋮ The filter design from data (FD2) problem: nonlinear set membership approach ⋮ On the approximation of smooth functions using generalized digital nets ⋮ Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: the relation to the \(L_{2}\)-approximation ⋮ Noisy information for linear problems in the asymptotic setting

This page was built for publication: