Average complexity for linear operators over bounded domains

DOI10.1016/0885-064X(87)90005-7zbMath0625.65046OpenAlexW1586135907MaRDI QIDQ579854

Henryk Woźniakowski

Publication date: 1987

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(87)90005-7

zbMATH Keywords

Wiener measureaverage complexityworst case complexityapproximation of functionsintegration of functions

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Equations and inequalities involving linear operators, with vector unknowns (47A50)

Related Items (6)

Complexity of approximation with relative error criterion in worst, average, and probabilistic settings ⋮ Perspectives on information-based complexity ⋮ Testing linear operators -- an average case study ⋮ Randomization for continuous problems ⋮ Mixed settings for linear problems ⋮ Probabilistic complexity analysis for linear problems in bounded domains

Cites Work

• On the average complexity of multivariate problems
• Approximation of linear functionals on a Banach space with a Gaussian measure
• Probabilistic setting of information-based complexity
• Complexity of approximation with relative error criterion in worst, average, and probabilistic settings
• The Brunn-Minkowski inequality in Gauss space
• Gaussian measures in Banach spaces
• Information of varying cardinality
• Gaussian radon measures on locally convex spaces.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Average complexity for linear operators over bounded domains