1. Approximation of additive random fields based on standard information: Average case and probabilistic settings
- Author
-
Mikhail Lifshits, Marguerite Zani, Department of Mathematics and Mechanics, St Petersburg State University (SPbU), and Université d'Orléans (UO)
- Subjects
Statistics and Probability ,Control and Optimization ,Logarithm ,General Mathematics ,Randomization techniques ,Gaussian processes ,65Y20 ,symbols.namesake ,Approximation error ,FOS: Mathematics ,Applied mathematics ,Mathematics - Numerical Analysis ,Standard information ,Gaussian process ,Mathematics ,Numerical Analysis ,Algebra and Number Theory ,Random field ,Approximation complexity ,Applied Mathematics ,Probability (math.PR) ,Probabilistic logic ,Numerical Analysis (math.NA) ,16. Peace & justice ,Additive random fields ,Power (physics) ,Algebra ,[MATH.MATH-PR]Mathematics [math]/Probability [math.PR] ,Tensor product ,symbols ,Tensor product random fields ,Mathematics - Probability ,[MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA] - Abstract
International audience; We consider approximation problems for tensor product and additive random fields based on standard information in the average case setting. We also study the probabilistic setting of the mentioned problem for tensor products. The main question we are concerned with in this paper is " How much do we loose by considering standard information algorithms against those using general linear information? " For both types of the fields, the error of linear algorithms has been studied in great detail; however, the power of standard information was not addressed so far, which we do here. Our main result is that in most interesting cases there is no more than a logarithmic loss in approximation error when information is being restricted to the standard one. The results are obtained by randomization techniques.
- Published
- 2015
- Full Text
- View/download PDF