Tensor Train Approximation of Moment Equations for the Log-normal Darcy Problem
نویسندگان
چکیده
We study the Darcy problem with log-normal permeability, modeling the fluid flow in a heterogeneous porous medium. A perturbation approach is adopted, expanding the solution in Taylor series around the nominal value of the permeability. The resulting recursive deterministic problem satisfied by the expected value of the stochastic solution, analytically derived and studied in [4], is discretized with a full tensor product finite element technique. To overcome the incurred curse of dimensionality the solution is sought in a low-rank tensor format, the so called Tensor Train format. We develop an algorithm for solving the recursive first moment problem approximately in the Tensor Train format and show its effectiveness with numerical examples.
منابع مشابه
Moment equations for the mixed formulation of the Hodge Laplacian with stochastic loading term
We study the mixed formulation of the stochastic Hodge–Laplace problem defined on an n-dimensional domain D (n 1), with random forcing term. In particular, we focus on the magnetostatic problem and on the Darcy problem in the three-dimensional case. We derive and analyse the moment equations, that is, the deterministic equations solved by the mth moment (m 1) of the unique stochastic solution o...
متن کاملMoment equations for the mixed formulation of the Hodge Laplacian with stochastic data
We study the mixed formulation of the stochastic Hodge-Laplace problem defined on a n-dimensional domain D (n ≥ 1), with random forcing term. In particular, we focus on the magnetostatic problem and on the Darcy problem in the three dimensional case. We derive and analyze the moment equations, that is the deterministic equations solved by the m-th moment (m ≥ 1) of the unique stochastic solutio...
متن کاملAssessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملEfficient low-rank approximation of the stochastic Galerkin matrix in tensor formats
In this article we describe an efficient approximation of the stochastic Galerkin matrix which stems from a stationary diffusion equation. The uncertain permeability coefficient is assumed to be a log-normal random field with given covariance and mean functions. The approximation is done in the canonical tensor format and then compared numerically with the tensor train and hierarchical tensor f...
متن کاملRegularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions
We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning large-scale overdetermined or underdetermined systems of linear equations. The computation is performed efficiently and stably based on the modified alternating least squares (MALS) schem...
متن کامل