Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Tensor train-Karhunen-Loève expansion for continuous-indexed random fields using higher-order cumulant functions (1907.06304v1)

Published 15 Jul 2019 in math.NA, cs.CE, and cs.NA

Abstract: The goals of this work are two-fold: firstly, to propose a new theoretical framework for representing random fields on a large class of multidimensional geometrical domain in the tensor train format; secondly, to develop a new algorithm framework for accurately computing the modes and the second and third-order cumulant tensors within moderate time. The core of the new theoretical framework is the tensor train decomposition of cumulant functions. This decomposition is accurately computed with a novel rank-revealing algorithm. Compared with existing Galerkin-type and collocation-type methods, the proposed computational procedure totally removes the need of selecting the basis functions or collocation points and the quadrature points, which not only greatly enhances adaptivity, but also avoids solving large-scale eigenvalue problems. Moreover, by computing with third-order cumulant functions, the new theoretical and algorithm frameworks show great potential for representing general non-Gaussian non-homogeneous random fields. Three numerical examples, including a three-dimensional random field discretization problem, illustrate the efficiency and accuracy of the proposed algorithm framework.

Summary

We haven't generated a summary for this paper yet.