اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantized tensor FEM for multiscale problems: diffusion problems in two and three dimensions
85
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Homogenization in terms of multiscale limits transforms a multiscale problem with $n+1$ asymptotically separated microscales posed on a physical domain $D subset mathbb{R}^d$ into a one-scale problem posed on a product domain of dimension $(n+1)d$ by introducing $n$ so-called fast variables. This procedure allows to convert $n+1$ scales in $d$ physical dimensions into a single-scale structure in $(n+1)d$ dimensions. We prove here that both the original, physical multiscale problem and the corresponding high-dimensional, one-scale limiting problem can be efficiently treated numerically with the recently developed quantized tensor-train finite-element method (QTT-FEM). The method is based on restricting computation to sequences of nested subspaces of low dimensions (which are called tensor ranks) within a vast but generic virtual (background) discretization space. In the course of computation, these subspaces are computed iteratively and data-adaptively at runtime, bypassing any offline precomputation. For the purpose of theoretical analysis, such low-dimensional subspaces are constructed analytically to bound the tensor ranks vs. error $tau>0$. We consider a model linear elliptic multiscale problem in several physical dimensions and show, theoretically and experimentally, that both (i) the solution of the associated high-dimensional one-scale problem and (ii) the corresponding approximation to the solution of the multiscale problem admit efficient approximation by the QTT-FEM. These problems can therefore be numerically solved in a scale-robust fashion by standard (low-order) PDE discretizations combined with state-of-the-art general-purpose solvers for tensor-structured linear systems. We prove scale-robust exponential convergence, i.e., that QTT-FEM achieves accuracy $tau$ with the number of effective degrees of freedom scaling polynomially in $log tau$.
قيم البحث
اقرأ أيضاً
In this work we propose an efficient black-box solver for two-dimensional stationary diffusion equations, which is based on a new robust discretization scheme. The idea is to formulate an equation in a certain form without derivatives with a non-loca
l stencil, which leads us to a linear system of equations with dense matrix. This matrix and a right-hand side are represented in a low-rank parametric representation -- the quantized tensor train (QTT-) format, and then all operations are performed with logarithmic complexity and memory consumption. Hence very fine grids can be used, and very accurate solutions with extremely high spatial resolution can be obtained. Numerical experiments show that this formulation gives accurate results and can be used up to $2^{60}$ grid points with no problems with conditioning, while total computational time is around several seconds.
In this work we formulate and test a new procedure, the Multiscale Perturbation Method for Two-Phase Flows (MPM-2P), for the fast, accurate and naturally parallelizable numerical solution of two-phase, incompressible, immiscible displacement in porou
s media approximated by an operator splitting method. The proposed procedure is based on domain decomposition and combines the Multiscale Perturbation Method (MPM) with the Multiscale Robin Coupled Method (MRCM). When an update of the velocity field is called by the operator splitting algorithm, the MPM-2P may provide, depending on the magnitude of a dimensionless algorithmic parameter, an accurate and computationally inexpensive approximation for the velocity field by reusing previously computed multiscale basis functions. Thus, a full update of all multiscale basis functions required by the MRCM for the construction of a new velocity field is avoided. There are two main steps in the formulation of the MPM-2P. Initially, for each subdomain one local boundary value problem with trivial Robin boundary conditions is solved (instead of a full set of multiscale basis functions, that would be required by the MRCM). Then, the solution of an inexpensive interface problem provides the velocity field on the skeleton of the decomposition of the domain. The resulting approximation for the velocity field is obtained by downscaling. We consider challenging two-phase flow problems, with high-contrast permeability fields and water-oil finger growth in homogeneous media. Our numerical experiments show that the use of the MPM-2P gives exceptional speed-up - almost 90% of reduction in computational cost - of two-phase flow simulations. Hundreds of MRCM solutions can be replaced by inexpensive MPM-2P solutions, and water breakthrough can be simulated with very few updates of the MRCM set of multiscale basis functions.
We present a novel algorithm based on the ensemble Kalman filter to solve inverse problems involving multiscale elliptic partial differential equations. Our method is based on numerical homogenization and finite element discretization and allows to r
ecover a highly oscillatory tensor from measurements of the multiscale solution in a computationally inexpensive manner. The properties of the approximate solution are analysed with respect to the multiscale and discretization parameters, and a convergence result is shown to hold. A reinterpretation of the solution from a Bayesian perspective is provided, and convergence of the approximate conditional posterior distribution is proved with respect to the Wasserstein distance. A numerical experiment validates our methodology, with a particular emphasis on modelling error and computational cost.
In this paper, we study temporal splitting algorithms for multiscale problems. The exact fine-grid spatial problems typically require some reduction in degrees of freedom. Multiscale algorithms are designed to represent the fine-scale details on a co
arse grid and, thus, reduce the problems size. When solving time-dependent problems, one can take advantage of the multiscale decomposition of the solution and perform temporal splitting by solving smaller-dimensional problems, which is studied in the paper. In the proposed approach, we consider the temporal splitting based on various low dimensional spatial approximations. Because a multiscale spatial splitting gives a good decomposition of the solution space, one can achieve an efficient implicit-explicit temporal discretization. We present a recently developed theoretical result in our earlier work and adopt it in this paper for multiscale problems. Numerical results are presented to demonstrate the efficiency of the proposed splitting algorithm.
Splitting is a method to handle application problems by splitting physics, scales, domain, and so on. Many splitting algorithms have been designed for efficient temporal discretization. In this paper, our goal is to use temporal splitting concepts in
designing machine learning algorithms and, at the same time, help splitting algorithms by incorporating data and speeding them up. Since the spitting solution usually has an explicit and implicit part, we will call our method hybrid explicit-implict (HEI) learning. We will consider a recently introduced multiscale splitting algorithms. To approximate the dynamics, only a few degrees of freedom are solved implicitly, while others explicitly. In this paper, we use this splitting concept in machine learning and propose several strategies. First, the implicit part of the solution can be learned as it is more difficult to solve, while the explicit part can be computed. This provides a speed-up and data incorporation for splitting approaches. Secondly, one can design a hybrid neural network architecture because handling explicit parts requires much fewer communications among neurons and can be done efficiently. Thirdly, one can solve the coarse grid component via PDEs or other approximation methods and construct simpler neural networks for the explicit part of the solutions. We discuss these options and implement one of them by interpreting it as a machine translation task. This interpretation successfully enables us using the Transformer since it can perform model reduction for multiple time series and learn the connection. We also find that the splitting scheme is a great platform to predict the coarse solution with insufficient information of the target model: the target problem is partially given and we need to solve it through a known problem. We conduct four numerical examples and the results show that our method is stable and accurate.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
