Average complexity for linear operators over bounded domains

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

Henryk Woźniakowski

Publication date: 1987

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

zbMATH Keywords

Wiener measure; average complexity; worst case complexity; approximation of functions; integration of functions

Mathematics Subject Classification ID

65J05: General theory of numerical analysis in abstract spaces

41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)

47A50: Equations and inequalities involving linear operators, with vector unknowns

Related Items

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

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