scientific article; zbMATH DE number 1246413

zbMATH Open0917.68094MaRDI QIDQ4226567FDOQ4226567

Authors: J. F. Traub, A. G. Werschulz 

Publication date: 27 January 1999

Title of this publication is not available (Why is that?)

Recommendations

• Perspectives on information-based complexity
• Information-based complexity: New questions for mathematicians
• Continuous problems: optimality, complexity, tractability (invited talk)
• scientific article; zbMATH DE number 953052

zbMATH Keywords

informationcomputational complexitynumerical algorithmsinformation-based complexitycomplexity of continuous problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (89)

• Perspectives on information-based complexity
• Title not available (Why is that?)
• Strong tractability of multivariate integration using quasi–Monte Carlo algorithms
• Tractability of quasilinear problems II: Second-order elliptic problems
• What is the complexity of volume calculation?
• The cost of deterministic, adaptive, automatic algorithms: cones, not balls
• Improved particle filters for multi-target tracking
• Recent developments in information-based complexity
• Generalized tractability for multivariate problems. II: Linear tensor product problems, linear information, and unrestricted tractability
• Suboptimal solutions to dynamic optimization problems via approximations of the policy functions
• The quantum setting with randomized queries for continuous problems
• Tractability of quasilinear problems. I: General results
• Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements
• Fast convergence of quasi-Monte Carlo for a class of isotropic integrals
• On the power of standard information for multivariate approximation in the worst case setting
• Delayed curse of dimension for Gaussian integration
• Quantum complexity of integration
• Intractability results for integration and discrepancy
• Interactive Information Complexity
• Tsallis entropy measure of noise-aided information transmission in a binary channel
• \(I\)-binomial scrambling of digital nets and sequences
• Complexity of Gaussian-radial-basis networks approximating smooth functions
• Approximation of infinitely differentiable multivariate functions is not strongly tractable
• A fast algorithm to compute \(L(1/2, f\times \chi_q)\)
• Sufficient conditions for fast quasi-Monte Carlo convergence
• On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
• Black-Box and Data-Driven Computation
• The Brownian bridge does not offer a consistent advantage in quasi-Monte Carlo integration
• Tractability of multivariate integration for periodic functions
• Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation
• Structural and Quantitative Characteristics of Complexity in Terms of Information
• Intractability results for positive quadrature formulas and extremal problems for trigonometric polynomials
• Algorithmic analysis of irrational rotations in a single neuron model
• Title not available (Why is that?)
• A new conceptual framework for analog computation
• What is the complexity of surface integration?
• On the tractability of linear tensor product problems in the worst case
• Information-based complexity: New questions for mathematicians
• Learning smooth shapes by probing
• Continuous-time computation with restricted integration capabilities
• Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
• The power of adaption for approximating functions with singularities
• Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting
• Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
• On the necessity of low-effective dimension
• The complexity of some topological inference problems
• The power of various real-valued quantum queries
• Stochastic finite element methods for partial differential equations with random input data
• Tight tractability results for a model second-order Neumann problem
• Lattice rule algorithms for multivariate approximation in the average case setting
• There exists a problem whose computational complexity is any given function of the information complexity
• Introduction to convex optimization in financial markets
• Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information
• Stochastic computation based on orthogonal expansion of random fields
• Measures of uncertainty and information in computation
• Finite-order weights imply tractability of linear multivariate problems
• A survey of randomized algorithms for control synthesis and performance verification
• The power of standard information for multivariate approximation in the randomized setting
• Efficient approximation schemes for economic lot-sizing in continuous time
• The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
• The effective dimension and quasi-Monte Carlo integration
• Open problems for tractability of multivariate integration.
• Finite-order weights imply tractability of multivariate integration
• Quadrature formulas for the Wiener measure
• Are unbounded linear operators computable on the average for Gaussian measures?
• What is the complexity of Stieltjes integration?
• Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
• Title not available (Why is that?)
• A constructive approach to strong tractability using quasi-Monte Carlo algorithms
• Real computations with fake numbers
• Title not available (Why is that?)
• On the information-based complexity of stochastic programming
• Gaussian Quadrature and Polynomial Approximation for One-Dimensional Ridge Functions
• Inverse regression for spatially distributed functional data
• Complexity of neural network approximation with limited information: A worst case approach
• On Conjugate Gradient Algorithms as Objects of Scientific Study
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Lipschitz Matrix for Parameter Reduction in Computational Science
• Inverse regression for ridge recovery: a data-driven approach for parameter reduction in computer experiments
• Gauss-Christoffel quadrature for inverse regression: applications to computer experiments
• Computational complexity of the integration problem for anisotropic classes
• An optimal Monte Carlo algorithm for multivariate Feynman–Kac path integrals
• Computability of Solutions of Operator Equations
• Weaker convergence criteria for Traub's method
• A near-stationary subspace for ridge approximation
• Title not available (Why is that?)
• Complexity of linear problems with a fixed output basis
• Complexity of general continuous minimization problems: a survey

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 Q4226567)