Approximation of linear functionals on a Banach space with a Gaussian measure
From MaRDI portal
Publication:1082039
DOI10.1016/0885-064X(86)90021-XzbMath0602.65036MaRDI QIDQ1082039
Publication date: 1986
Published in: Journal of Complexity (Search for Journal in Brave)
rate of convergenceWiener measureerror boundBanach spacelinear functionalsGaussian measureminimal average errorspline algorithms
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Numerical solutions to equations with linear operators (65J10) Set functions and measures and integrals in infinite-dimensional spaces (Wiener measure, Gaussian measure, etc.) (28C20)
Related Items
A survey of information-based complexity, Parallel and sequential computation: A statistician's view, Average errors for zero finding: Lower bounds for smooth or monotone functions, Probabilistic setting of information-based complexity, Complexity of approximation with relative error criterion in worst, average, and probabilistic settings, The algorithm designer versus nature: A game-theoretic approach to information-based complexity, Approximation and optimization on the Wiener space, The average error of quadrature formulas for functions of bounded variation, Stochastic properties of quadrature formulas, On adaption with noisy information, A probabilistic theory for error estimation in automatic integration, A stochastic analog to Chebyshev centers and optimal average case algorithms, Invertibility of random fredholm operators, Randomization for continuous problems, Average error bounds of trigonometric approximation on periodic Wiener spaces, An Optimal Polynomial Approximation of Brownian Motion, Recent developments in information-based complexity, Orthogonally invariant measures and best approximation of linear operators, Complexity of multilinear problems in the average case setting, Approximation of multivariate periodic functions on the space with a Gaussian measure, Corrections to Probabilistic analysis of numerical methods for integral equations, Disintegration of Gaussian measures and average-case optimal algorithms, Measures of uncertainty and information in computation, On average complexity of global optimization problems, Function approximation and integration on the Wiener space with noisy data, Average case complexity of linear multivariate problems. II: Applications, On a posteriori upper bounds for approximating linear functionals in a probabilistic setting, Approximation of functions on the Sobolev space with a Gaussian measure, Quadrature Formulas for Monotone Functions, Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure, Best approximation of functions on the ball on the weighted Sobolev space equipped with a Gaussian measure, Approximation of functions on the Sobolev space on the sphere in the average case setting, Average complexity for linear operators over bounded domains, Average case complexity of multivariate integration, Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure, On adaptive information with varying cardinality for linear problems with elliptically contoured measures, s-numbers in information-based complexity, Probabilistic complexity analysis for linear problems in bounded domains, On the average complexity of multivariate problems, Information of varying cardinality, Bayesian Probabilistic Numerical Methods, Probabilistic analysis of numerical methods for integral equations, Average case optimality
Cites Work
- Can adaption help on the average?
- Average case optimality
- Optimal algorithms for linear problems with Gaussian measures
- Gaussian measures in Banach spaces
- Information of varying cardinality
- Gaussian measure in Hilbert space and applications in numerical analysis
- On Optimal Algorithms in an Asymptotic Model with Gaussian Measure
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
