An Arbitrary-Order Discrete de Rham Complex on Polyhedral Meshes: Exactness,Poincaré Inequalities,and Consistency

In this paper, we present a novel arbitrary-order discrete de Rham (DDR) complex on general polyhedral meshes based on the decomposition of polynomial spaces into ranges of vector calculus operators and complements linked to the spaces in the Koszul complex. The DDR complex is fully discrete, meaning that both the spaces and discrete calculus operators are replaced by discrete counterparts, and satisfies suitable exactness properties depending on the topology of the domain. In conjunction with bespoke discrete counterparts of \(\text {L}^2\)-products, it can be used to design schemes for partial differential equations that benefit from the exactness of the sequence but, unlike classical (e.g., Raviart–Thomas–Nédélec) finite elements, are nonconforming. We prove a complete panel of results for the analysis of such schemes: exactness properties, uniform Poincaré inequalities, as well as primal and adjoint consistency. We also show how this DDR complex enables the design of a numerical scheme for a magnetostatics problem, and use the aforementioned results to prove stability and optimal error estimates for this scheme.

     

一个求解约束非线性优化问题的微分方程方法

本文构造的求解非线性优化问题的微分方程方法包括两个微分方程系统,第一个系统基于问题函数的一阶信息,第二个系统基于二阶信息．这两个系统具有性质:非线性优化问题的局部最优解是它们的渐近稳定的平衡点,并且初始点是可行点时,解轨迹都落于可行域中．我们证明了两个微分方程系统的离散迭代格式的收敛性定理和基于第二个系统的离散迭代格式的局部二次收敛性质．还给出了基于两个系统的离散迭代方法的数值算例,数值结果表明基于二阶信息的微分方程方法速度更快．     

On the numerical solution of large-scale sparse discrete-time Riccati equations

We discuss the numerical solution of large-scale discrete-time algebraic Riccati equations (DAREs) as they arise, e.g., in fully discretized linear-quadratic optimal control problems for parabolic partial differential equations (PDEs). We employ variants of Newton??s method that allow to compute an approximate low-rank factor of the solution of the DARE. The principal computation in the Newton iteration is the numerical solution of a Stein (aka discrete Lyapunov) equation in each step. For this purpose, we present a low-rank Smith method as well as a low-rank alternating-direction-implicit (ADI) iteration to compute low-rank approximations to solutions of Stein equations arising in this context. Numerical results are given to verify the efficiency and accuracy of the proposed algorithms.     

ON DISCRETE PROJECTION AND NUMERICAL BOUNDARY CONDITIONS FOR THE NUMERICAL SOLUTION OF THE UNSTEADY INCOMPRESSIBLE NAVIER-STOKES EQUATIONS

1. IntroductionLet us consider the unsteady incompressible Navier--Stokes equations (INSE)on a two--dimensional rectangular region fl with boundary 0fl. Here w = (u, v)" is tl1e velocityvector, p is the pressure, and f a known vector function of x) y, and…     

A comparison of numerical integration rules for the meshless local Petrov–Galerkin method

The meshless local Petrov–Galerkin (MLPG) method is a mesh-free procedure for solving partial differential equations. However, the benefit in avoiding the mesh construction and refinement is counterbalanced by the use of complicated non polynomial shape functions with subsequent difficulties, and a potentially large cost, when implementing numerical integration schemes. In this paper we describe and compare some numerical quadrature rules with the aim at preserving the MLPG solution accuracy and at the same time reducing its computational cost.     

Stable numerical schemes for a partly convolutional partial integro-differential equation

A model partial integro-differential operator (PIDO) that contains both local and nonlocal diffusion operators is considered in this article. This type of operators come in modeling various scientific and financial engineering problems. In most cases, people use finite difference schemes to generate solutions of such model problems. We compare and analyze stability and accuracy of two such finite difference schemes. We first present a discrete analogue of the PIDO and then approximate the semi-discrete time dependent problem using two different one step methods and show the stability conditions and the accuracy of the schemes. We use the Fourier transforms throughout our analysis.     

Primary decomposition of modules: A computational differential approach

We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary finitely generated module over a polynomial ring. We characterize primary submodules in terms of differential operators and punctual Quot schemes. Moreover, we introduce and implement an algorithm that computes a minimal differential primary decomposition for a module.     

A Large Time Step explicit scheme (CFL>1) on unstructured grids for 2D conservation laws: Application to the homogeneous shallow water equations

In this work, a Large Time Step (LTS) explicit finite volume scheme designed to allow CFL > 1 is applied to the numerical resolution of 2D scalar and systems of conservation laws on triangular grids. Based on the flux difference splitting formulation, a special concern is put on finding the way of packing the information to compute the numerical solution when working on unstructured grids. Not only the cell areas but also the length of the interfaces and their orientation are questions of interest to send the information from each edge or interface. The information to update the cell variables is computed according to the local average discrete velocity and the orientation of the edges of the cells involved. The performance of these ideas is tested and compared with the conventional explicit first order and second order schemes in academic configurations for the 2D linear scalar equation and for 2D systems of conservation laws (in particular the shallow water equations) without source terms. The LTS scheme is demonstrated to preserve or even gain accuracy and save computational time with respect to the first order scheme.     

Adaptive multi-element polynomial chaos with discrete measure: Algorithms and application to SPDEs

We develop a multi-element probabilistic collocation method (ME-PCM) for arbitrary discrete probability measures with finite moments and apply it to solve partial differential equations with random parameters. The method is based on numerical construction of orthogonal polynomial bases in terms of a discrete probability measure. To this end, we compare the accuracy and efficiency of five different constructions. We develop an adaptive procedure for decomposition of the parametric space using the local variance criterion. We then couple the ME-PCM with sparse grids to study the Korteweg–de Vries (KdV) equation subject to random excitation, where the random parameters are associated with either a discrete or a continuous probability measure. Numerical experiments demonstrate that the proposed algorithms lead to high accuracy and efficiency for hybrid (discrete–continuous) random inputs.     

The fast scalar auxiliary variable approach with unconditional energy stability for nonlocal Cahn–Hilliard equation

Comparing with the classical local gradient flow and phase field models, the nonlocal models such as nonlocal Cahn–Hilliard equations equipped with nonlocal diffusion operator can describe more practical phenomena for modeling phase transitions. In this paper, we construct an accurate and efficient scalar auxiliary variable approach for the nonlocal Cahn–Hilliard equation with general nonlinear potential. The first contribution is that we have proved the unconditional energy stability for nonlocal Cahn–Hilliard model and its semi‐discrete schemes carefully and rigorously. Second, what we need to focus on is that the nonlocality of the nonlocal diffusion term will lead the stiffness matrix to be almost full matrix which generates huge computational work and memory requirement. For spatial discretizaion by finite difference method, we find that the discretizaition for nonlocal operator will lead to a block‐Toeplitz–Toeplitz‐block matrix by applying four transformation operators. Based on this special structure, we present a fast procedure to reduce the computational work and memory requirement. Finally, several numerical simulations are demonstrated to verify the accuracy and efficiency of our proposed schemes.     

Numerical and theoretical study of weak Galerkin finite element solutions of Turing patterns in reaction–diffusion systems

In this paper, we introduce numerical schemes and their analysis based on weak Galerkin finite element framework for solving 2‐D reaction–diffusion systems. Weak Galerkin finite element method (WGFEM) for partial differential equations relies on the concept of weak functions and weak gradients, in which differential operators are approximated by weak forms through the Green's theorem. This method allows the use of totally discontinuous functions in the approximation space. In the current work, the WGFEM solves reaction–diffusion systems to find unknown concentrations (u, v) in element interiors and boundaries in the weak Galerkin finite element space WG(P₀, P₀, RT₀) . The WGFEM is used to approximate the spatial variables and the time discretization is made by the backward Euler method. For reaction–diffusion systems, stability analysis and error bounds for semi‐discrete and fully discrete schemes are proved. Accuracy and efficiency of the proposed method successfully tested on several numerical examples and obtained results satisfy the well‐known result that for small values of diffusion coefficient, the steady state solution converges to equilibrium point. Acquired numerical results asserted the efficiency of the proposed scheme.     

Symbolic Computation of Newton Sum Rules for the Zeros of Polynomial Eigenfunctions of Linear Differential Operators

A symbolic algorithm based on the generalized Lucas polynomials of first kind is used in order to compute the Newton sum rules for the zeros of polynomial eigenfunctions of linear differential operators with polynomial coefficients.     

Curvature analysis of roller-follower cam mechanisms

The equations related to the curvature analysis of the roller-follower cam mechanisms are presented for roller surfaces being revolution surface, hyperboloidal surface, and globoidal surface. These equations give the expressions of the meshing function, the limit function of the first kind, and the limit function of the second kind. Once these functions are known, the principal curvatures of the cam surface, the relative normal curvatures of contacting surfaces, and the condition of undercutting can be derived. Three particular cam mechanisms with hyperboloidal roller are illustrated and the numerical comparison between 2-D and 3-D cam is given.     

On a class of finite-difference schemes for solving ill-posed Cauchy problems in Banach spaces

A class of finite-difference schemes for solving ill-posed Cauchy problems for first-order linear differential equations with sectorial operators in Banach spaces is examined. Under various assumptions concerning the desired solution, time-uniform accuracy and error characteristics are obtained that refine and improve known estimates for these schemes. Some numerical results are presented.     

Evaluating Local Approximations of the L2-Orthogonal Projection Between Non-Nested Finite Element Spaces

We present quantitative studies of transfer operators between finite element spaces associated with unrelated meshes. Several local approximations of the global $L^2$-orthogonal projection are reviewed and evaluated computationally. The numerical studies in 3D provide the first estimates of the quantitative differences between a range of transfer operators between non-nested finite element spaces. We consider the standard finite element interpolation, Clément's quasi-interpolation with different local polynomial degrees the global $L^2$-orthogonal projection, a local $L^2$-quasi-projection via a discrete inner product, and a pseudo-$L^2$-projection defined by a Petrov-Galerkin variational equation with a discontinuous test space. Understanding their qualitative and quantitative behaviors in this computational way is interesting per se; it could also be relevant in the context of discretization and solution techniques which make use of different non-nested meshes. It turns out that the pseudo-$L^2$-projection approximates the actual $L^2$-orthogonal projection best. The obtained results seem to be largely independent of the underlying computational domain; this is demonstrated by four examples (ball, cylinder, half torus and Stanford Bunny).     

One-point commuting difference operators of rank 1

One-point commuting difference operators of rank 1 are considered. The coefficients in such operators depend on one functional parameter, and the degrees of shift operators in difference operators are positive. These operators are studied in the case of hyperelliptic spectral curves, where the base point coincides with a point of branching. Examples of operators with polynomial and trigonometric coefficients are constructed. Operators with polynomial coefficients are embedded in differential operators with polynomial coefficients. This construction provides a new method for constructing commutative subalgebras in the first Weyl algebra.     

抛物型方程非齐次边值问题的推广型LOD有限差分及有限元格式

1引言本文考虑区域Ω=[0,1]~d(d=2,3)上的非齐次抛物型方程第一边值问题(?)-C_1△u C_2u=f(x,t),x∈Ω,t∈(0,T],(1．1) u(x,0)=u_0(x),x∈Ω,(1．2) u(x,t)=(?)(x,t),x∈(?)Ω,t∈(0,T],(1．3)其中C_1,C_2为常数且C_1＞0,C_2≥0．对于以上问题,可以使用有限差分方法及有限元方法进行离散,并采用交替方向方法求解．交替方向方法能够将高维问题转化为一系列的一维问题进行计算,具有计算量少,计算稳定且易于并行实现等优点,在大规模科学计算中起着非常重要的作用,一直是计算数     

三维两相渗流驱动问题迎风区域分裂显隐差分法

对三维两相渗流驱动问题提出了两种迎风区域分裂显隐差分格式．压力方程采用了七点差分格式,为了能达到实际并行计算的要求,对饱和度方程采用了迎风区域分裂差分法,内边界处和各子区域分别对应显隐格式．得到了离散l2模收敛性分析,最后给出数值试验,支撑了理论分析结果．     

Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.     

Symmetrical weighted essentially non‐oscillatory‐flux limiter schemes for Hamilton–Jacobi equations

In this paper, we propose a new scheme that combines weighted essentially non‐oscillatory (WENO) procedures together with monotone upwind schemes to approximate the viscosity solution of the Hamilton–Jacobi equations. In one‐dimensional (1D) case, first, we obtain an optimum polynomial on a four‐point stencil. This optimum polynomial is third‐order accurate in regions of smoothness. Next, we modify a second‐order ENO polynomial by choosing an additional point inside the stencil in order to obtain the highest accuracy when combined with the Harten–Osher reconstruction‐evolution method limiter. Finally, the optimum polynomial is considered as a symmetric and convex combination of three polynomials with ideal weights. Following the methodology of the classic WENO procedure, then, we calculate the non‐oscillatory weights with the ideal weights. Numerical experiments in 1D and 2D are performed to compare the capability of the hybrid scheme to WENO schemes. Copyright © 2015 John Wiley & Sons, Ltd.