Approximation of linear functionals on a Banach space with a Gaussian measure
The paper is a study of linear functionals on a Banach space illustrated by the integration example \(Sf=\int^{1}_{0}f(t)dt.\) The problem considered is to find an optimal algorithm with respect to 3 criteria (i) it has the minimal average error, i.e. \(\int_{F_ 1}E(Sf-\phi)\mu df\) is a minimum where E denotes the error in Sf using the algorithm \(\phi\) and \(\mu\) is a probability measure on the \(\sigma\)-field \(B(F_ 1)\) of Borel sets from the Banach space \(F_ 1\); (ii) it has maximal probability of not exceeding a given error bound so that given \(\epsilon >0\) \[ \Pr ob \{E(Sf-\phi)\leq \epsilon \}=_{u} \Pr ob \{E(Sf-u)\leq \epsilon \}; \] and (iii) if \(\phi_ n\) denotes the algorithm that depends on the cardinality of the information (such as the number of integration points) then \(| Sf-\phi_ n|\) has the best rate of convergence as \(n\to \infty\) for almost all functions. Thus optimality is defined in the average, probabilistic and asymptotic senses. It is shown that the \(\mu\)-spline algorithms are optimal in all senses and that adaptive information does not improve the algorithms. Applications are considered and the results are derived using a Wiener measure for the space \(C^ r[0,1]\).
- A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
- Average case optimality
- Can adaption help on the average?
- Gaussian measure in Hilbert space and applications in numerical analysis
- Gaussian measures in Banach spaces
- scientific article; zbMATH DE number 3174587 (Why is no real title available?)
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 3913429 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3755545 (Why is no real title available?)
- scientific article; zbMATH DE number 3456359 (Why is no real title available?)
- scientific article; zbMATH DE number 3497277 (Why is no real title available?)
- scientific article; zbMATH DE number 3633568 (Why is no real title available?)
- scientific article; zbMATH DE number 3245885 (Why is no real title available?)
- scientific article; zbMATH DE number 3359503 (Why is no real title available?)
- Information of varying cardinality
- On Optimal Algorithms in an Asymptotic Model with Gaussian Measure
- Optimal algorithms for linear problems with Gaussian measures
- Average case optimality
- A survey of information-based complexity
- Parallel and sequential computation: A statistician's view
- 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
- 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
- Randomization for continuous problems
- Complexity of multilinear problems in the average case setting
- Corrections to Probabilistic analysis of numerical methods for integral equations
- Measures of uncertainty and information in computation
- 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
- On adaptive information with varying cardinality for linear problems with elliptically contoured measures
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Information of varying cardinality
- Average error bounds of trigonometric approximation on periodic Wiener spaces
- Approximation of functions on the Sobolev space on the sphere in the average case setting
- Disintegration of Gaussian measures and average-case optimal algorithms
- Approximation and optimization on the Wiener space
- The average error of quadrature formulas for functions of bounded variation
- An Application of Gaussian Measures to Functional Analysis
- Average case complexity of multivariate integration
- Invertibility of random fredholm operators
- Recent developments in information-based complexity
- Quadrature Formulas for Monotone Functions
- Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
- An optimal polynomial approximation of Brownian motion
- Bayesian Probabilistic Numerical Methods
- Average complexity for linear operators over bounded domains
- Approximation of multivariate periodic functions on the space with a Gaussian measure
- On average complexity of global optimization problems
- Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure
- s-numbers in information-based complexity
- Probabilistic complexity analysis for linear problems in bounded domains
- On the average complexity of multivariate problems
- Probabilistic analysis of numerical methods for integral equations
- Orthogonally invariant measures and best approximation of linear operators
- Approximation of functions on the Sobolev space with a Gaussian measure
- Best approximation of functions on the ball on the weighted Sobolev space equipped with a Gaussian measure
This page was built for publication: Approximation of linear functionals on a Banach space with a Gaussian measure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082039)