Probabilistic complexity analysis for linear problems in bounded domains

DOI10.1016/0885-064X(90)90021-5zbMath0723.68049MaRDI QIDQ757053

Stefan Heinrich

Publication date: 1990

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

zbMATH Keywords

Banach spaceinformation-based complexitylinear problems

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (6)

The average case complexity of the Fredholm equation of second kind with free term in \(H^ r(\Gamma)\) ⋮ Corrections to Probabilistic analysis of numerical methods for integral equations ⋮ Lower bounds for the complexity of Monte Carlo function approximation ⋮ The worst case complexity of the fredholm equation with periodic free term and noisy information^∗ ⋮ Average approximations and moments of measures ⋮ Probabilistic analysis of numerical methods for integral equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average complexity for linear operators over bounded domains
• Approximation of linear functionals on a Banach space with a Gaussian measure
• Convex measures on locally convex spaces
• Gaussian measures in Banach spaces
• Gaussian characterizations of certain Banach spaces
• Invertibility of random fredholm operators
• Mappings of Gaussian Cylindrical Measures in Banach Spaces

This page was built for publication: Probabilistic complexity analysis for linear problems in bounded domains