scientific article; zbMATH DE number 193625
From MaRDI portal
Publication:4040428
zbMATH Open0654.94004MaRDI QIDQ4040428FDOQ4040428
Authors: J. F. Traub, Grzegorz W. Wasilkowski, H. Woźniakowski 
Publication date: 5 June 1993
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Cited In (only showing first 100 items - show all)
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Optimal recovery of multivariate functions restricted by second-order differential operator
- Integral equations and machine learning
- Perspectives on information-based complexity
- A new approximate algorithm for the Chebyshev center
- In Praise of Numerical Computation
- Recovering signals from inner products involving prolate spheroidals in the presence of jitter
- On linear versus nonlinear approximation in the average case setting
- The difficulty of Monte Carlo approximation of multivariate monotone functions
- The size of the membership-set in a probabilistic framework.
- Rounding on the standard simplex: regular grids for global optimization
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- Invertibility of random fredholm operators
- On the quantum and randomized approximation of linear functionals on function spaces
- On average complexity of global optimization problems
- Estimation of model quality
- Optimal order of convergence and (in)tractability of multivariate approximation of smooth functions
- Spline methods using integration lattices and digital nets
- Recent developments in information-based complexity
- Parameter choice methods using minimization schemes
- The curse of dimensionality for numerical integration on general domains
- The quantum setting with randomized queries for continuous problems
- Exponential Tractability of Linear Tensor Product Problems
- Information distance and conditional complexities
- An intractability result for multiple integration
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
- Optimal recovery of three times differentiable functions on a convex polytope inscribed in a sphere
- On the minimal cost of approximating linear problems based on information with deterministic noise
- Central configurations in planar \(n\)-body problem with equal masses for \(n=5,6,7\)
- Mixed settings for linear problems
- Model quality evaluation in set membership identification
- Average optimization of the approximate solution of operator equations and its application
- Average case complexity of linear multivariate problems
- Tractability of multivariate problems for standard and linear information in the worst case setting. II
- The worst case complexity of the fredholm equation with periodic free term and noisy information∗
- Approximation of infinitely differentiable multivariate functions is not strongly tractable
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- Structural and Quantitative Characteristics of Complexity in Terms of Information
- Recursive characterization of computable real-valued functions and relations
- Title not available (Why is that?)
- The complexity of Fredholm equations of the second kind: noisy information about everything
- Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness
- Bernstein numbers and lower bounds for the Monte Carlo error
- Probabilistic analysis of numerical methods for integral equations
- Complexity of oscillatory integration for univariate Sobolev spaces
- Optimal Monte Carlo methods for \(L^2\)-approximation
- On the optimal recovery of integrals of set-valued functions
- Bayesian Probabilistic Numerical Methods
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
- OPTIMAL POINTWISE APPROXIMATION OF INFINITE-DIMENSIONAL ORNSTEIN–UHLENBECK PROCESSES
- Worst-case input-output identification
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence
- The complexity of some topological inference problems
- Optimal recovery of isotropic classes of twice-differentiable functions defined on \(d\)-dimensional Euclidean space
- The information-based complexity of approximation problem by adaptive Monte Carlo methods
- Optimality properties in finite sample li identification with bounded noise
- Automatic integration using asymptotically optimal adaptive simpson quadrature
- The average errors for Hermite-Fejér interpolation on the Wiener space
- Average case tractability of non-homogeneous tensor product problems with the absolute error criterion
- Bounded-error parameter estimation: Noise models and recursive algorithms
- Adaptive approximation of the minimum of Brownian motion
- Average case optimality
- Determining zeroes of increasing Lipschitz functions
- Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions
- The Monte Carlo Complexity of Fredholm Integral Equations
- The Monte Carlo Algorithm with a Pseudorandom Generator
- Convergence analysis of central and minimax algorithms in scalar regressor models
- Real computations with fake numbers
- Compressive Sensing
- Complexity of parametric initial value problems for systems of odes
- The adaption problem for approximating linear operators
- Optimal recovery of isotropic classes of \(r\)th differentiable multivariate functions
- On the optimal robust solution of IVPs with noisy information
- Optimality of Euler-type algorithms for approximation of stochastic differential equations with discontinuous coefficients
- Efficient Monte Carlo for high excursions of Gaussian random fields
- Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface
- Notions of Probabilistic Computability on Represented Spaces
- Tractability of multivariate approximation defined over Hilbert spaces with exponential weights
- Multivariate integration of infinitely many times differentiable functions in weighted Korobov spaces
- On strong tractability of weighted multivariate integration
- Learning non-parametric basis independent models from point queries via low-rank methods
- Good lattice rules in weighted Korobov spaces with general weights
- Infinite-dimensional quadrature and approximation of distributions
- Approximation in Hermite spaces of smooth functions
- On tensor product approximation of analytic functions
- Tractability of multivariate problems for standard and linear information in the worst case setting. I.
- Probabilistic integration: a role in statistical computation?
- The optimal uniform approximation of systems of stochastic differential equations
- Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\)
- Step size control for the uniform approximation of systems of stochastic differential equations with additive noise.
- On the Power of Adaptive Information for Functions with Singularities
- MACRODYNAMIC COOPERATIVE COMPLEXITY OF BIOSYSTEMS
- Worst-case control-relevant identification
- Optimal solution of a class of non-autonomous initial-value problems with unknown singularities
- Uniform reconstruction of Gaussian processes
- Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods
- A survey of average case complexity for linear multivariate problems
- The curse of dimensionality for numerical integration of smooth functions
- Interactive Information Complexity
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 Q4040428)
