一维非线性Schrdinger方程的两个无条件收敛的守恒紧致差分格式

本文对一维非线性Schrdinger方程给出两个紧致差分格式,运用能量方法和两个新的分析技巧证明格式关于离散质量和离散能量守恒,而且在最大模意义下无条件收敛.对非线性紧格式构造了一个新的迭代算法,证明了算法的收敛性,并在此基础上给出一个新的线性化紧格式.数值算例验证了理论分析的正确性,并通过外推进一步提高了数值解的精度.     

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

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

一类带有铁磁材料参数的非线性涡流问题的A-φ有限元法

针对带有铁磁材料的非线性涡流问题,其非线性性通常体现在磁场强度和磁感应强度的关系上.本文提出了一种全离散的有限元A-φ格式,分别在时间和空间上采用向后欧拉公式以及节点有限元进行离散.首先,在合适的函数空间里给出时间上的半离散格式,通过考察其弱形式建立相应的适定性理论,并证明近似解收敛于弱解.其次,给出全离散格式并讨论其误差估计.最后,给出两个数值算例以验证理论结果.     

非定常 N-S 方程的非线性 Galerkin 算法及其误差估计

本文给出了二维非定常N-S方程的三种数值格式,其中空间变量用谱非线性Galerkin算法进行离散,时间变量用有限差分离散,并研究了这些格式数值解的逼近精度．最后,给出了部分数值计算结果．     

带非线性源项的双侧空间分数阶扩散方程的隐式中点方法

本文用隐式中点方法离散一阶时间偏导数,并用拟紧差分算子逼近Riemann-Liouville空间分数阶偏导数,构造了求解带非线性源项的空间分数阶扩散方程的数值格式.给出了数值方法的稳定性和收敛性分析.数值试验表明数值方法是有效的.     

反应扩散方程的紧交替方向差分格式

本文研究二维常系数反应扩散方程的紧交替方向隐式差分格式．首先综合应用降阶法和降维法导出了紧差分格式,并给出了差分格式截断误差的表达式．其次引进过渡层变量,给出了紧交替方向隐式差分格式算法．接着用能量分析方法给出了紧交替方向隐式差分格式的解在离散H^1范数下的先验估计式,证明了差分格式的可解性、稳定性和收敛性,在离散H^1范数下收敛阶为O(r^2 H^4)．然后将Rechardson外推法应用于紧交替方向隐式差分格式,外推一次得到具有O(r^4 H^6)阶精度的近似解．最后给出了数值例子,数值结果和理论结果是吻合的．     

一类带参数的非线性奇异摄动问题的自适应移动网格算法

本文讨论一类带参数的非线性奇异摄动问题的自适应移动网格方法.首先,在任意非均匀网格下,利用向后欧拉公式对方程进行离散,并给出相应的局部截断误差.然后,基于局部截断误差和网格等分布原理,利用精确解的弧长函数,证明半离散格式下自适应移动网格算法是一阶收敛的.同时,基于近似的弧长控制函数,给出易于实现的网格生成算法,并给出全离散格式下的后验误差估计.最后,数值实验结果验证了本文所给出的理论结果.     

求解非线性规划问题的两个微分方程系统

本文给出Evtushenko与Zhadan（1974）提出的求解数学规划问题微分方程系统的两个校正形式,它们可用于求解具有等式和不等式约束的非线性规化问题。第一个校正系统拓宽了Evtushenko与Zhadan微分方程方法;第二个校正系统通过引入新的方程系统导出乘子函数得到,它无需使用Evtushenko与Zhadan所用的那样强的约束规范。我们建立了这两个微分方程方法及其离散迭代方法的收敛性定理,给出了基于第二个微分方程离散格式的数值算法及其某些数值结果。     

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

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

求解对称鞍点问题的修正Uzawa方法

本文基于两个非线性逼近逆的非线性Uzawa方法,给出了一种新的修正非线性Uzawa方法,并对其收敛性进行了分析以及与已有算法的收敛性进行了比较.最后由数值试验说明了算法的正确性和有效性.     

A Fast Conservative Scheme for the Space Fractional Nonlinear Schrödinger Equation with Wave Operator

A new efficient compact difference scheme is proposed for solving a space fractional nonlinear Schrödinger equation with wave operator. The scheme is proved to conserve the total mass and total energy in a discrete sense. Using the energy method, the proposed scheme is proved to be unconditionally stable and its convergence order is shown to be of $ \mathcal{O}( h^6 + \tau^2) $ in the discrete $ L_2 $ norm with mesh size $ h $ and the time step $ \tau $. Moreover, a fast difference solver is developed to speed up the numerical computation of the scheme. Numerical experiments are given to support the theoretical analysis and to verify the efficiency, accuracy, and discrete conservation laws.     

A new fourth‐order numerical algorithm for a class of three‐dimensional nonlinear evolution equations

In this article, a new compact alternating direction implicit finite difference scheme is derived for solving a class of 3‐D nonlinear evolution equations. By the discrete energy method, it is shown that the new difference scheme has good stability and can attain second‐order accuracy in time and fourth‐order accuracy in space with respect to the discrete H¹ ‐norm. A Richardson extrapolation algorithm is applied to achieve fourth‐order accuracy in temporal dimension. Numerical experiments illustrate the accuracy and efficiency of the extrapolation algorithm. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Convergence of a nonlinear finite difference scheme for the Kuramoto–Tsuzuki equation

A nonlinear finite difference scheme is studied for solving the Kuramoto–Tsuzuki equation. Because the maximum estimate of the numerical solution can not be obtained directly, it is difficult to prove the stability and convergence of the scheme. In this paper, we introduce the Brouwer-type fixed point theorem and induction argument to prove the unique existence and convergence of the nonlinear scheme. An iterative algorithm is proposed for solving the nonlinear scheme, and its convergence is proved. Based on the iterative algorithm, some linearized schemes are presented. Numerical examples are carried out to verify the correction of the theory analysis. The extrapolation technique is applied to improve the accuracy of the schemes, and some interesting results are obtained.     

The Conservation and Convergence of Two Finite Difference Schemes for KdV Equations with Initial and Boundary Value Conditions

Korteweg-de Vries equation is a nonlinear evolutionary partial differential equation that is of third order in space. For the approximation to this equation with the initial and boundary value conditions using the finite difference method, the difficulty is how to construct matched finite difference schemes at all the inner grid points. In this paper, two finite difference schemes are constructed for the problem. The accuracy is second-order in time and first-order in space. The first scheme is a two-level nonlinear implicit finite difference scheme and the second one is a three-level linearized finite difference scheme. The Browder fixed point theorem is used to prove the existence of the nonlinear implicit finite difference scheme. The conservation, boundedness, stability, convergence of these schemes are discussed and analyzed by the energy method together with other techniques. The two-level nonlinear finite difference scheme is proved to be unconditionally convergent and the three-level linearized one is proved to be conditionally convergent. Some numerical examples illustrate the efficiency of the proposed finite difference schemes.     

Conservative compact finite difference scheme for the N‐coupled nonlinear Klein–Gordon equations

In this article, a compact finite difference method is developed for the periodic initial value problem of the N‐coupled nonlinear Klein–Gordon equations. The present scheme is proved to preserve the total energy in the discrete sense. Due to the difficulty in obtaining the priori estimate from the discrete energy conservation law, the cut‐off function technique is employed to prove the convergence, which shows the new scheme possesses second order accuracy in time and fourth order accuracy in space, respectively. Additionally, several numerical results are reported to confirm our theoretical analysis. Lastly, we apply the reliable method to simulate and study the collisions of solitary waves numerically.     

A nonlinear iteration method for solving a two-dimensional nonlinear coupled system of parabolic and hyperbolic equations

A nonlinear iteration method for solving a class of two-dimensional nonlinear coupled systems of parabolic and hyperbolic equations is studied. A simple iterative finite difference scheme is designed; the calculation complexity is reduced by decoupling the nonlinear system, and the precision is assured by timely evaluation updating. A strict theoretical analysis is carried out as regards the convergence and approximation properties of the iterative scheme, and the related stability and approximation properties of the nonlinear fully implicit finite difference (FIFD) scheme. The iterative algorithm has a linear constringent ratio; its solution gives a second-order spatial approximation and first-order temporal approximation to the real solution. The corresponding nonlinear FIFD scheme is stable and gives the same order of approximation. Numerical tests verify the results of the theoretical analysis. The discrete functional analysis and inductive hypothesis reasoning techniques used in this paper are helpful for overcoming difficulties arising from the nonlinearity and coupling and lead to a related theoretical analysis for nonlinear FI schemes.     

Conservative finite difference methods for fractional Schrödinger–Boussinesq equations and convergence analysis

In this paper, two conservative finite difference schemes for fractional Schrödinger–Boussinesq equations are formulated and investigated. The convergence of the nonlinear fully implicit scheme is established via discrete energy method, while the linear semi‐implicit scheme is analyzed by means of mathematical induction method. Our schemes are proved to preserve the total mass and energy in discrete level. The numerical results are given to confirm the theoretical analysis.     

Compact difference scheme for two-dimensional fourth-order nonlinear hyperbolic equation

High-order compact finite difference method for solving the two-dimensional fourth-order nonlinear hyperbolic equation is considered in this article. In order to design an implicit compact finite difference scheme, the fourth-order equation is written as a system of two second-order equations by introducing the second-order spatial derivative as a new variable. The second-order spatial derivatives are approximated by the compact finite difference operators to obtain a fourth-order convergence. As well as, the second-order time derivative is approximated by the central difference method. Then, existence and uniqueness of numerical solution is given. The stability and convergence of the compact finite difference scheme are proved by the energy method. Numerical results are provided to verify the accuracy and efficiency of this scheme.     

A linearized high‐order difference scheme for the fractional Ginzburg–Landau equation

The numerical solution for the one‐dimensional complex fractional Ginzburg–Landau equation is considered and a linearized high‐order accurate difference scheme is derived. The fractional centered difference formula, combining the compact technique, is applied to discretize fractional Laplacian, while Crank–Nicolson/leap‐frog scheme is used to deal with the temporal discretization. A rigorous analysis of the difference scheme is carried out by the discrete energy method. It is proved that the difference scheme is uniquely solvable and unconditionally convergent, in discrete maximum norm, with the convergence order of two in time and four in space, respectively. Numerical simulations are given to show the efficiency and accuracy of the scheme. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 105–124, 2017     

两类变时间步长的非线性Galerkin算法的稳定性

1．引言近年来,随着计算机的飞速发展,人们越来越关心非线性发展方程解的渐进行为．为了较精确地描述解在时间t→∞时的渐进行为,人们发展了一类惯性算法,即非线性Galerkin算法．该算法是将来解空间分解为低维部分和高维部分,相应的方程可以分别投影到它们上面,它的解也相应地分解为两部分,大涡分量和小涡分量;然后核算法给出大涡分量和小涡分量之间依赖关系的一种近似,以便容易求出相应的近似解．许多研究表明,非线性Galerkin算法比通常的Galerkin算法节省可观的计算量．当数值求解微分方程时,计算机只能对已知数据进行有限位…