The discrete fracture model (DFM) has been widely used in the simulation of fluid flow in fractured porous media. Traditional DFM uses the so-called hybrid-dimensional approach to treat fractures explicitly as low-dimensional entries (e.g. line entries in 2D media and face entries in 3D media) on the interfaces of matrix cells and then couple the matrix and fracture flow systems together based on the principle of superposition with the fracture thickness used as the dimensional homogeneity factor. Because of this methodology, DFM is considered to be limited on conforming meshes and thus may raise difficulties in generating high quality unstructured meshes due to the complexity of fracture's geometrical morphology. In this paper, we clarify that the DFM actually can be extended to non-conforming meshes without any essential changes. To show it clearly, we provide another perspective for DFM based on hybrid-dimensional representation of permeability tensor to describe fractures as one-dimensional line Dirac delta functions contained in permeability tensor. A finite element DFM scheme for single-phase flow on non-conforming meshes is then derived by applying Galerkin finite element method to it. Analytical analysis and numerical experiments show that our DFM automatically degenerates to the classical finite element DFM when the mesh is conforming with fractures. Moreover, the accuracy and efficiency of the model on non-conforming meshes are demonstrated by testing several benchmark problems. This model is also applicable to curved fracture with variable thickness.

By performing estimates on the integral of the absolute value of vorticity along a local vortex line segment, we establish a relatively sharp dynamic growth estimate of maximum vorticity under some assumptions on the local geometric regularity of the vorticity vector. Our analysis applies to both the 3D incompressible Euler equations and the surface quasi-geostrophic model (SQG). As an application of our vorticity growth estimate, we apply our result to the 3D Euler equation with the two anti-parallel vortex tubes initial data considered by Hou-Li [12]. Under some additional assumption on the vorticity eld, which seems to be consistent with the computational results of [12], we show that the maximum vorticity can not grow faster than double exponential in time. Our analysis extends the earlier results by Cordoba-Feerman [6, 7] and Deng-Hou-Yu [8, 9].

Local discontinuous Galerkin (LDG) methods are popular for convection-diffusion equations. In LDG methods, we introduce an auxiliary variable $p$ to represent the derivative of the primary variable $u$, and solve them on the same mesh. In this paper, we will introduce a new LDG method, and solve $u$ and $p$ on different meshes. The stability and error estimates will be investigated. The new algorithm is more flexible and flux-free for pure diffusion equations without introducing additional computational cost compared with the original LDG methods, since it is not necessary to solve each equation twice. Moreover, it is possible to construct third-order maximum-principle-preserving schemes based on the new algorithm. However, one cannot anticipate optimal accuracy in some special cases. In this paper, we will find out the reason for accuracy degeneration which further leads to several alternatives to obtain optimal convergence rates. Finally, several numerical experiments will be given to demonstrate the stability and optimal accuracy of the new algorithm.

We analyze the random fluctuations of several multiscale algorithms, such as the multiscale finite element method (MsFEM) and the finite element heterogeneous multiscale method (HMM), that have been developed to solve partial differential equations with highly heterogeneous coefficients. Such multiscale algorithms are often shown to correctly capture the homogenization limit when the highly oscillatory random medium is stationary and ergodic. This paper is concerned with the random fluctuations of the solution about the deterministic homogenization limit. We consider the simplified setting of the one-dimensional elliptic equation, where the theory of random fluctuations is well understood. We develop a fluctuation theory for the multiscale algorithms in the presence of random environments with short-range and long-range correlations. For a given mesh size h, we show that the fluctuations converge in distribution in the space of continuous paths to Gaussian processes as the correlation length ε→0. We next derive the limit of such Gaussian processes as h→0 and compare this limit with the distribution of the random fluctuations of the continuous model. When such limits agree, we conclude that the multiscale algorithm captures the random fluctuations accurately and passes the corrector test. This property serves as an interesting benchmark to assess the behavior of the multiscale algorithm in practical situations where the assumptions necessary for the theory of homogenization are not met. What we find is that the computationally more expensive methods MsFEM, and HMM with a choice of parameter δ=h, correctly capture the random fluctuations both for short-range and long-range oscillations in the medium. The less expensive method HMM with δ<h correctly captures the fluctuations for long-range oscillations and strongly amplifies their size in media with short-range oscillations. We present a modified scheme with an intermediate computational cost that captures the random fluctuations in all cases.

We propose an efficient eigensolver for computing densely distributed spectra of the two-dimensional transmission eigenvalue problem (TEP), which is derived from Maxwell's equations with Tellegen media and the transverse magnetic mode. The governing equations, when discretized by the standard piecewise linear finite element method, give rise to a large-scale quadratic eigenvalue problem (QEP). Our numerical simulation shows that half of the positive eigenvalues of the QEP are densely distributed in some interval near the origin. The quadratic JacobiDavidson method with a so-called non-equivalence deflation technique is proposed to compute the dense spectrum of the QEP. Extensive numerical simulations show that our proposed method processes the convergence efficiently, even when it needs to compute more than 5000 desired eigenpairs. Numerical results also illustrate that the computed