<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605524629</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100754.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s10958-014-2195-2</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s10958-014-2195-2</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Khartov</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">St. Petersburg State University, St. Petersburg, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Approximation in Probability of Tensor Product-Type Random Fields of Increasing Parametric Dimension</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[A. Khartov]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">We consider the sequence of Gaussian tensor product-type random fields Xd given by a multiparametric Karhunen-Loéve expansion X d t = ∑ k ∈ ℕ d ∏ l = 1 d λ k l 1 / 2 ξ k ∏ l = 1 d ψ k l t l , t ∈ 0 1 d , $$ {X}_d(t)={\displaystyle \sum_{k\in {\mathrm{\mathbb{N}}}^d}{\displaystyle \prod_{l=1}^d{\uplambda}_{k_l}^{1/2}{\xi}_k}{\displaystyle \prod_{l=1}^d{\psi}_{k_l}\left({t}_l\right),\kern0.36em t\in {\left[0,1\right]}^d},} $$ where (ξk)k∈ℕ dare standard Gaussian random variables and (λi)i∈ℕ and (ψi)i∈ℕ are the eigenvalues and eigenfunctions of the covariance operator of the process X1. We approximate Xd by finite sums X d (n) of the series using L2([0, 1]d)-norm ‖ ⋅ ‖ 2,d and study the exact asymptotics of the probabilistic approximation complexity n d p r ε δ : = min n ∈ ℕ : ℙ X d − X d n 2 , d 2 &gt; ε 2 E X d 2 , d 2 ≤ δ $$ {n}_d^{\mathrm{pr}}\left(\varepsilon, \delta \right):= \min \left\{n\in \mathbb{N}:\mathrm{\mathbb{P}}\left({\left\Vert {X}_d-{X}_d^{(n)}\right\Vert}_{2,d}^2&gt;{\varepsilon}^2\mathbb{E}{\left\Vert {X}_d\right\Vert}_{2,d}^2\right)\le \delta \right\} $$ in the case where the error threshold ε ∈ (0, 1) is fixed, the parametric dimension d→∞, and the confidence level δ = δd,ε may depend on ε and d. We show that under some conditions on (λi)i∈ℕ, the probabilistic complexity is asymptotically equivalent to the average approximation complexity n d a v g ε : = min n ∈ ℕ : E X d − X d n 2 , d 2 ≤ ε 2 E X d 2 , d 2 $$ {n}_d^{\mathrm{avg}}\left(\varepsilon \right):= \min \left\{n\in \mathbb{N}:\mathbb{E}{\left\Vert {X}_d-{X}_d^{(n)}\right\Vert}_{2,d}^2\le {\varepsilon}^2\mathbb{E}{\left\Vert {X}_d\right\Vert}_{2,d}^2\right\} $$ The result depends on the existence of a lattice structure of the sequence (λi)i∈ℕ. Bibliography: 10 titles.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer Science+Business Media New York, 2014</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Journal of Mathematical Sciences</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">204/1(2015-01-01), 165-179</subfield>
   <subfield code="x">1072-3374</subfield>
   <subfield code="q">204:1&lt;165</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">204</subfield>
   <subfield code="o">10958</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s10958-014-2195-2</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s10958-014-2195-2</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Khartov</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">St. Petersburg State University, St. Petersburg, Russia</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Journal of Mathematical Sciences</subfield>
   <subfield code="d">Springer US; http://www.springer-ny.com</subfield>
   <subfield code="g">204/1(2015-01-01), 165-179</subfield>
   <subfield code="x">1072-3374</subfield>
   <subfield code="q">204:1&lt;165</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">204</subfield>
   <subfield code="o">10958</subfield>
  </datafield>
 </record>
</collection>
