Approximation complexity of tensor product-type random fields with heavy spectrum (Q2439845): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3103/s1063454113020040 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2080155690 / rank | |||
Normal rank |
Latest revision as of 08:33, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation complexity of tensor product-type random fields with heavy spectrum |
scientific article |
Statements
Approximation complexity of tensor product-type random fields with heavy spectrum (English)
0 references
17 March 2014
0 references
A sequence \(X_d(t)\) of Gaussian tensor product-type random fields is considered, where \(X_d(t)\) contains independent standard Gaussian random variables and all eigenvalues and eigenfunctions of the covariance operator of the process \(X_1\). Here, \(t\in [0,1]^d\) and \(d\in\mathbb{N}\). For each \(d\in\mathbb{N}\), the sample paths of \(X_d\) almost surely belong to \(L_2([0,1]^d)\) with norm \(\|.\|_{2,d}\). Furthermore, the so-called eigenpairs of the covariance operator of \(X_d\) are considered. Finally, the random fields \(X_d\) are approximated by the finite sums \(X^{(n)}_d\) corresponding to the \(n\) maximal eigenvalues of the covariance operator of \(X_d\). The main results contain investigations on the logarithmic asymptotics of the average approximation complexity and of the probabilistic approximation complexity as the parametric dimension \(d\to\infty\).
0 references
Gaussian tensor product-type random fields
0 references
average approximation complexity
0 references
probabilistic approximation complexity
0 references
logarithmic asymptotics
0 references
eigenvalues
0 references
eigenvectors
0 references
covariance operator
0 references