Sobolev方程的一类各向异性非协调有限元逼近

在各向异性网格下,分别讨论了Sobolev方程在半离散和全离散格式下的一类非协调有限元逼近,得到了与传统有限元方法相同的误差估计和一些超逼近性质.同时在半离散格式下,通过构造具有各向异性特征的插值后处理算子得到了整体超收敛结果.     

非线性Galerkin算法的收敛性和复杂性

本文给出了数值求解非线性发展方程的全离散非线性Ｇａｌｅｒｋｉｎ算法,即将空间离散时的谱非线性Ｇａｌｅｒｋｉｎ算法和时间离散的Ｅｕｌｅｒ差分格式相结合,得到了显式和隐式两种全离散数值格式,相应地也考虑了显式和隐式的Ｇａｌｅｒｋｉｎ全离散格式,并分别分析了上述四种全离散格式的收敛性和复杂性,经过比较得出结论;在某些约束条件下,非线性Ｇａｌｅｒｋｉｎ算法和Ｇａｌｅｒｋｉｎ算法具有相同阶的收敛速度,然而前     

非线性抛物积分微分方程的类Wilson非协调元分析

在半离散和全离散格式下讨论非线性抛物积分微分方程的类Wilson非协调有限元逼近.当问题的精确解u∈H3(Ω)/H4(Ω)时,利用该元的相容误差在能量模意义下可以达到O(h2)/O(h3)比其插值误差高一阶和二阶的特殊性质,再结合协调部分的高精度分析及插值后处理技术,并借助于双线性插值代替传统有限元分析中不可缺少的Ritz-Volterra投影导出了半离散格式下的O(h2)阶超逼近和超收敛结果.同时分别得到了向后Euler全离散格式下的超逼近性和Crank-Nicolson全离散格式下的最优误差估计.     

非线性耦合Schrdinger-KdV方程组的一个局部能量守恒格式

本文利用平均值离散梯度给出了一个构造哈密尔顿偏微分方程的局部能量守恒格式的系统方法.并用非线性耦合Schrdinger-KdV方程组加以说明.证明了格式满足离散的局部能量守恒律,在周期边界条件下,格式也保持离散整体能量及系统的其它两个不变量.最后数值实验验证了理论结果的正确性.     

对流扩散方程的缩减基有限元法的后验误差

将缩减基(RB)方法和有限元方法相结合,在保证偏微分方程的有限元离散格式具有足够高精确度前提下,能够大幅度地降低有限元离散格式的维数,从而大大降低计算中内存容量和计算时间的消耗.针对对流扩散方程建立基于RB方法的Crank-Nicolson有限元离散格式,并给出后验误差估计结果.     

时间分数阶对流-扩散方程的局部间断Galerkin谱方法

提出了求解时间分数阶对流-扩散方程的局部间断Galerkin谱方法.在空间方向上,按局部间断Galerkin谱方法进行离散,时间方向上,对α阶Caputo时间分数阶导数按有限差分格式进行离散,非线性项和源项采用Chebyshev-Gauss-Lobatto插值,从而得到有限差分/局部间断Galerkin谱全离散格式,并且给出了其全离散格式线性情形下的稳定性和收敛性分析.最后给出了一些数值算例,比较了单区域方法和局部间断Galerkin谱方法的数值结果,得出后种方法更具优势.还通过对比Gorenflo-Mainardi-Moretti-Paradisi(GMMP)和有限差分这两种全离散格式下的数值结果,得出有限差分格式在某些问题中比GMMP格式精度更高,收敛速度更快.     

RLW-KdV方程的高阶紧致有限差分格式（英文）

对RLW-KdV方程提出一种新的四阶精度紧致有限差分格式.用离散能量法证明差分格式的能量守恒性、可解性、收敛性和稳定性.在离散L~∞-范数下,所建格式在空间上四阶收敛且在时间上二阶收敛.通过两个数值算例验证了该格式的有效性和可靠性.     

离散算子差分法的单元函数

给出了弹性力学离散算子差分法的离散格式,并给出了该方法的几个板弯曲单元和平面四边形单元,通过对它们的考察,分析了离散算子差分方法中的离散格式对单元位移函数的反映能力。在离散算子差分方法中,无论单元位移函数是否协调,其位移函数均能在离散格式中得到十分好的再现,说明了离散算子差分方法的离散格式是一种性能很优良的离散格式。     

非定常不可压Navier-Stokes方程两重网格方法的稳定性和L2误差估计

讨论了二维非定常不可压Navier-Stokes方程的两重网格方法．此方法包括在粗网格上求解一个非线性问题,在细网格上求解一个Stokes问题．采用一种新的全离散(时间离散用Crank-Nicolson格式,空间离散用混合有限元方法)格式数值求解N-S方程．证明了该全离散格式的稳定性．给出了L2误差估计．对比标准有限元方法,在保持同样精度的前提下,TGM能节省大量的计算量．     

一类非线性双曲型方程扩展混合有限元方法的误差估计

该文针对一类非线性双曲型方程提出了扩展混合有限元方法.首先,建立了半离散扩展混合元格式,获得了半离散扩展混合元解的L∞(L2)先验误差估计.然后,利用有限差分法对时间项进行离散,建立了全离散扩展混合元格式,并给出了全离散格式下的先验误差估计.最后,通过数值算例验证了理论结果.     

Discrete and continuous coupled nonlinear integrable systems via the dressing method

A discrete analog of the dressing method is presented and used to derive integrable nonlinear evolution equations, including two infinite families of novel continuous and discrete coupled integrable systems of equations of nonlinear Schrödinger type. First, a demonstration is given of how discrete nonlinear integrable equations can be derived starting from their linear counterparts. Then, starting from two uncoupled, discrete one‐directional linear wave equations, an appropriate matrix Riemann‐Hilbert problem is constructed, and a discrete matrix nonlinear Schrödinger system of equations is derived, together with its Lax pair. The corresponding compatible vector reductions admitted by these systems are also discussed, as well as their continuum limits. Finally, by increasing the size of the problem, three‐component discrete and continuous integrable discrete systems are derived, as well as their generalizations to systems with an arbitrary number of components.     

离散数学的翻转课堂教学法研究

离散数学是计算机专业的重要的基础课程.但是离散数学课程抽象难懂、教学模式单一、理论实际结合能力差,从而影响了这一课程的教学效果.为了提升离散数学的教学效果,面向学生翻转课堂的教学模式被引入.翻转课堂通过视频、示例或者项目、以及拓展等方式充分发挥学生为中心,教师辅助的教学理念,提升学生学习的主动性,提升离散数学的教学效果,为后续计算机专业课程奠定良好的基础.     

A TWO-LEVEL FINITE ELEMENT GALERKIN METHOD FOR THE NONSTATIONARY NAVIER-STOKES EQUATIONS II： TIME DISCRETIZATION

In this article we consider the fully discrete two-level finite element Galerkin method for the two-dimensional nonstationary incompressible Navier-Stokes equations. This method consists in dealing with the fully discrete nonlinear Navier-Stokes problem on a coarse mesh with width $H$ and the fully discrete linear generalized Stokes problem on a fine mesh with width $h << H$. Our results show that if we choose $H=O(h^{1/2}$) this method is as the same stability and convergence as the fully discrete standard finite element Galerkin method which needs dealing with the fully discrete nonlinear Navier-Stokes problem on a fine mesh with width $h$. However, our method is cheaper than the standard fully discrete finite element Galerkin method.     

A critical review of discrete filled function methods in solving nonlinear discrete optimization problems

Many real life problems can be modeled as nonlinear discrete optimization problems. Such problems often have multiple local minima and thus require global optimization methods. Due to high complexity of these problems, heuristic based global optimization techniques are usually required when solving large scale discrete optimization or mixed discrete optimization problems. One of the more recent global optimization tools is known as the discrete filled function method. Nine variations of the discrete filled function method in literature are identified and a review on theoretical properties of each method is given. Some of the most promising filled functions are tested on various benchmark problems. Numerical results are given for comparison.     

Convergence rates to discrete shocks for nonconvex conservation laws

Summary. This paper is concerned with polynomial decay rates of perturbations to stationary discrete shocks for the Lax-Friedrichs scheme approximating non-convex scalar conservation laws. We assume that the discrete initial data tend to constant states as , respectively, and that the Riemann problem for the corresponding hyperbolic equation admits a stationary shock wave. If the summation of the initial perturbation over is small and decays with an algebraic rate as , then the perturbations to discrete shocks are shown to decay with the corresponding rate as . The proof is given by applying weighted energy estimates. A discrete weight function, which depends on the space-time variables for the decay rate and the state of the discrete shocks in order to treat the non-convexity, plays a crucial role. Received November 25, 1998 / Published online November 8, 2000     

A discrete Hartley transform based on Simpson's rule

The Hartley transform is an integral transformation that maps a real valued function into a real valued frequency function via the Hartley kernel, thereby avoiding complex arithmetic as opposed to the Fourier transform. Approximation of the Hartley integral by the trapezoidal quadrature results in the discrete Hartley transform, which has proven a contender to the discrete Fourier transform because of its involutory nature. In this paper, a discrete transform is proposed as a real transform with a convolution property and is an alternative to the discrete Hartley transform. Copyright © 2015 John Wiley & Sons, Ltd.     

A discrete generalization of the extended simplest equation method

We modified the so-called extended simplest equation method to obtain discrete traveling wave solutions for nonlinear differential-difference equations. The Wadati lattice equation is chosen to illustrate the method in detail. Further discrete soliton/periodic solutions with more arbitrary parameters, as well as discrete rational solutions, are revealed. We note that using our approach one can also find in principal highly accurate exact discrete solutions for other lattice equations arising in the applied sciences.     

Effect of time delay on a harvested predator-prey model

The predator-prey systems with harvesting have received a great deal of attentions for last few decades. Incorporating discrete time delays into predator-prey models could induce instability and bifurcation. In this paper we are interested in studying the combined effects of harvesting and discrete time delay on the dynamics of a predator-prey model. A comparative analysis is provided for stability behaviour in absence as well as in presence of time delay. The length of discrete time delay to preserve stability of the model system is obtained. Existence of Hopf-bifurcating small amplitude periodic solutions is derived by taking discrete time delay as a bifurcation parameter.     

浅水长波近似方程组的拟小波解

以浅水长波近似方程组为例,提出了拟小波方法求解(1 1)维非线性偏微分方程组数值解,该方程用拟小波离散格式离散空间导数,得到关于时间的常微分方程组,用四阶Runge-K utta方法离散时间导数,并将其拟小波解与解析解进行比较和验证.     

3D discrete X-ray transform

The analysis of 3D discrete volumetric data becomes increasingly important as computation power increases. 3D analysis and visualization applications are expected to be especially relevant in areas like medical imaging and nondestructive testing, where elaborated continuous theory exists. However, this theory is not directly applicable to discrete datasets. Therefore, we have to establish theoretical foundations that will replace the existing inexact discretizations, which have been based on the continuous regime. We want to preserve the concepts, properties, and main results of the continuous theory in the discrete case. In this paper, we present a discretization of the continuous X-ray transform for discrete 3D images. Our definition of the discrete X-ray transform is shown to be exact and geometrically faithful as it uses summation along straight geometric lines without arbitrary interpolation schemes. We derive a discrete Fourier slice theorem, which relates our discrete X-ray transform with the Fourier transform of the underlying image, and then use this Fourier slice theorem to derive an algorithm that computes the discrete X-ray transform in O(n⁴logn) operations. Finally, we show that our discrete X-ray transform is invertible.