亚洲男人的天堂2018av,欧美草比,久久久久久免费视频精选,国色天香在线看免费,久久久久亚洲av成人片仓井空

Reduced Order Modelling (ROM) has been widely used to create lower order, computationally inexpensive representations of higher-order dynamical systems. Using these representations, ROMs can efficiently model flow fields while using significantly lesser parameters. Conventional ROMs accomplish this by linearly projecting higher-order manifolds to lower-dimensional space using dimensionality reduction techniques such as Proper Orthogonal Decomposition (POD). In this work, we develop a novel deep learning framework DL-ROM (Deep Learning - Reduced Order Modelling) to create a neural network capable of non-linear projections to reduced order states. We then use the learned reduced state to efficiently predict future time steps of the simulation using 3D Autoencoder and 3D U-Net based architectures. Our model DL-ROM is able to create highly accurate reconstructions from the learned ROM and is thus able to efficiently predict future time steps by temporally traversing in the learned reduced state. All of this is achieved without ground truth supervision or needing to iteratively solve the expensive Navier-Stokes(NS) equations thereby resulting in massive computational savings. To test the effectiveness and performance of our approach, we evaluate our implementation on five different Computational Fluid Dynamics (CFD) datasets using reconstruction performance and computational runtime metrics. DL-ROM can reduce the computational runtimes of iterative solvers by nearly two orders of magnitude while maintaining an acceptable error threshold.

We construct several smooth finite element spaces defined on three--dimensional Worsey--Farin splits. In particular, we construct $C^1$, $H^1(\curl)$, and $H^1$-conforming finite element spaces and show the discrete spaces satisfy local exactness properties. A feature of the spaces is their low polynomial degree and lack of extrinsic supersmoothness at sub-simplices of the mesh. In the lowest order case, the last two spaces in the sequence consist of piecewise linear and piecewise constant spaces, and are suitable for the discretization of the (Navier-)Stokes equation.

Biharmonic wave equations are of importance to various applications including thin plate analyses. In this work, the numerical approximation of their solutions by a $C^1$-conforming in space and time finite element approach is proposed and analyzed. Therein, the smoothness properties of solutions to the continuous evolution problem is embodied. High potential of the presented approach for more sophisticated multi-physics and multi-scale systems is expected. Time discretization is based on a combined Galerkin and collocation technique. For space discretization the Bogner--Fox--Schmit element is applied. Optimal order error estimates are proven. The convergence and performance properties are illustrated with numerical experiments.

We propose in this work to employ the Box-LASSO, a variation of the popular LASSO method, as a low-complexity decoder in a massive multiple-input multiple-output (MIMO) wireless communication system. The Box-LASSO is mainly useful for detecting simultaneously structured signals such as signals that are known to be sparse and bounded. One modulation technique that generates essentially sparse and bounded constellation points is the so-called generalized space-shift keying (GSSK) modulation. In this direction, we derive high dimensional sharp characterizations of various performance measures of the Box-LASSO such as the mean square error, probability of support recovery, and the element error rate, under independent and identically distributed (i.i.d.) Gaussian channels that are not perfectly known. In particular, the analytical characterizations can be used to demonstrate performance improvements of the Box-LASSO as compared to the widely used standard LASSO. Then, we can use these measures to optimally tune the involved hyper-parameters of Box-LASSO such as the regularization parameter. In addition, we derive optimum power allocation and training duration schemes in a training-based massive MIMO system. Monte Carlo simulations are used to validate these premises and to show the sharpness of the derived analytical results.

In this paper we derive stability estimates in $L^{2}$- and $L^{\infty}$- based Sobolev spaces for the $L^{2}$ projection and a family of quasiinterolants in the space of smooth, 1-periodic, polynomial splines defined on a uniform mesh in $[0,1]$. As a result of the assumed periodicity and the uniform mesh, cyclic matrix techniques and suitable decay estimates of the elements of the inverse of a Gram matrix associated with the standard basis of the space of splines, are used to establish the stability results.

We introduce the multivariate decomposition finite element method (MDFEM) for solving elliptic PDEs with uniform random diffusion coefficients. We show that the MDFEM can be used to reduce the computational complexity of estimating the expected value of a linear functional of the solution of the PDE. The proposed algorithm combines the multivariate decomposition method (MDM), to compute infinite dimensional integrals, with the finite element method (FEM), to solve different instances of the PDE. The strategy of the MDFEM is to decompose the infinite-dimensional problem into multiple finite-dimensional ones which lends itself to easier parallelization than to solve a single large dimensional problem. Our first result adjusts the analysis of the multivariate decomposition method to incorporate the log-factor which typically appears in error bounds for multivariate quadrature, i.e., cubature, methods; and we take care of the fact that the number of points $n$ needs to come, e.g., in powers of 2 for higher order approximations. For the further analysis we specialize the cubature methods to be two types of quasi-Monte Carlo (QMC) rules, being digitally shifted polynomial lattice rules and interlaced polynomial lattice rules. The second and main contribution then presents a bound on the error of the MDFEM and shows higher-order convergence w.r.t. the total computational cost in case of the interlaced polynomial lattice rules in combination with a higher-order finite element method.

We propose an efficient semi-Lagrangian Characteristic Mapping (CM) method for solving the three-dimensional (3D) incompressible Euler equations. This method evolves advected quantities by discretizing the flow map associated with the velocity field. Using the properties of the Lie group of volume preserving diffeomorphisms SDiff, long-time deformations are computed from a composition of short-time submaps which can be accurately evolved on coarse grids. This method is a fundamental extension to the CM method for two-dimensional incompressible Euler equations [51]. We take a geometric approach in the 3D case where the vorticity is not a scalar advected quantity, but can be computed as a differential 2-form through the pullback of the initial condition by the characteristic map. This formulation is based on the Kelvin circulation theorem and gives point-wise a Lagrangian description of the vorticity field. We demonstrate through numerical experiments the validity of the method and show that energy is not dissipated through artificial viscosity and small scales of the solution are preserved. We provide error estimates and numerical convergence tests showing that the method is globally third-order accurate.

Comparison of two univariate distributions based on independent samples from them is a fundamental problem in statistics, with applications in a wide variety of scientific disciplines. In many situations, we might hypothesize that the two distributions are stochastically ordered, meaning intuitively that samples from one distribution tend to be larger than those from the other. One type of stochastic order that arises in economics, biomedicine, and elsewhere is the likelihood ratio order, also known as the density ratio order, in which the ratio of the density functions of the two distributions is monotone non-decreasing. In this article, we derive and study the nonparametric maximum likelihood estimator of the individual distributions and the ratio of their densities under the likelihood ratio order. Our work applies to discrete distributions, continuous distributions, and mixed continuous-discrete distributions. We demonstrate convergence in distribution of the estimator in certain cases, and we illustrate our results using numerical experiments and an analysis of a biomarker for predicting bacterial infection in children with systemic inflammatory response syndrome.

In this paper, we consider numerical approximation to periodic measure of a time periodic stochastic differential equations (SDEs) under weakly dissipative condition. For this we first study the existence of the periodic measure $\rho_t$ and the large time behaviour of $\mathcal{U}(t+s,s,x) := \mathbb{E}\phi(X_{t}^{s,x})-\int\phi d\rho_t,$ where $X_t^{s,x}$ is the solution of the SDEs and $\phi$ is a test function being smooth and of polynomial growth at infinity. We prove $\mathcal{U}$ and all its spatial derivatives decay to 0 with exponential rate on time $t$ in the sense of average on initial time $s$. We also prove the existence and the geometric ergodicity of the periodic measure of the discretized semi-flow from the Euler-Maruyama scheme and moment estimate of any order when the time step is sufficiently small (uniform for all orders). We thereafter obtain that the weak error for the numerical scheme of infinite horizon is of the order $1$ in terms of the time step. We prove that the choice of step size can be uniform for all test functions $\phi$. Subsequently we are able to estimate the average periodic measure with ergodic numerical schemes.

Accurately forecasting transportation demand is crucial for efficient urban traffic guidance, control and management. One solution to enhance the level of prediction accuracy is to leverage graph convolutional networks (GCN), a neural network based modelling approach with the ability to process data contained in graph based structures. As a powerful extension of GCN, a spatial-temporal graph convolutional network (ST-GCN) aims to capture the relationship of data contained in the graphical nodes across both spatial and temporal dimensions, which presents a novel deep learning paradigm for the analysis of complex time-series data that also involves spatial information as present in transportation use cases. In this paper, we present an Attention-based ST-GCN (AST-GCN) for predicting the number of available bikes in bike-sharing systems in cities, where the attention-based mechanism is introduced to further improve the performance of an ST-GCN. Furthermore, we also discuss the impacts of different modelling methods of adjacency matrices on the proposed architecture. Our experimental results are presented using two real-world datasets, Dublinbikes and NYC-Citi Bike, to illustrate the efficacy of our proposed model which outperforms the majority of existing approaches.