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)
- Polya's characterization theorem for complex random variables
- On applicability of the sparse grid method in the worst case setting
- Complexity of operators on compact sets
- Simple characterizations of exponential tractability for linear multivariate problems
- Tractability of quasilinear problems II: Second-order elliptic problems
- Robust approximate modelling of stable linear systems†
- Tractability of the Fredholm problem of the second kind
- Near-optimality of linear recovery from indirect observations
- Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information
- Quadrature Formulas for Monotone Functions
- Nonlinear system identification in Sobolev spaces
- Nonparametric estimation of probability density functions for irregularly observed spatial data
- Complexity of stochastic integration in Sobolev classes
- Complexity of Monte Carlo integration for Besov classes on the unit sphere
- Worst-case optimality of smoothing algorithms for parametric system identification
- Efficient finite-dimensional solution of initial value problems in infinite-dimensional Banach spaces
- A study on the average case error of composite Newton-Cotes quadratures.
- Optimal quadrature formulas for the Sobolev space \(H^1\)
- Multivariate integration for analytic functions with Gaussian kernels
- A quasi-fast solver for weakly singular integral equations of the second kind
- Fast solvers of weakly singular integral equations of the second kind
- Worst case identification of continuous time systems via interpolation
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Tractability of \(L_2\)-approximation and integration in weighted Hermite spaces of finite smoothness
- Complexity of parametric initial value problems in Banach spaces
- ABC on IBC
- An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals
- On optimal allocations for estimating the surface of a random field
- Efficient solution of IVPs with right-hand sides having discontinuities on an unknown hypersurface
- Tractability of \(\mathbb{L}_2\)-approximation in hybrid function spaces
- Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
- Quasi-Monte Carlo image synthesis in a nutshell
- Optimal recovery on the classes of functions with bounded mixed derivative
- On the power of standard information for \(L_{\infty}\) approximation in the randomized setting
- Identification in \({\mathcal H}_ \infty\) using Pick's interpolation
- An efficient primal dual prox method for non-smooth optimization
- Tractability of multivariate approximation over weighted standard Sobolev spaces
- Optimal stochastic quadrature formulas for convex functions
- Numerical integration in log-Korobov and log-cosine spaces
- Corrections to Probabilistic analysis of numerical methods for integral equations
- Complexity of approximating Hölder classes from information with varying Gaussian noise
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
- Linear ill-posed problems are solvable on the average for all Gaussian measures
- Sampling discretization and related problems
- Measures of uncertainty and information in computation
- On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation
- Computability of solutions of operator equations
- \((s, t)\)-weak tractability of multivariate linear problems in the average case setting
- Some basic information on information-based complexity theory
- Randomized Runge-Kutta method -- stability and convergence under inexact information
- Average errors for zero finding: Lower bounds
- On the power of standard information for tractability for \(L_2\)-approximation in the average case setting
- Order-free Recursion on the Real Numbers
- The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods
- Tractability of multivariate integration in hybrid function spaces
- On the power of standard information for \(\mathbb{L}_2\)-approximation in the average case setting
- Average case complexity of elliptic partial differential equations
- Some results on the complexity of numerical integration
- Efficient approximate solution of jump-diffusion SDEs via path-dependent adaptive step-size control
- Disintegration of Gaussian measures and average-case optimal algorithms
- Testing linear operators
- 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
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)
