紧算子方程的不适定性分析及其在一维热传导反问题中的应用

对紧算子方程的不适定性进行了详细的分析,证明了紧算子方程奇异值分解定理,并以一维热传导方程反问题为例,将其转化为紧算子方程,讨论了求解此反问题的最优估计及进行了误差分析,数值模拟表明了理论分析与实际应用的一致性.     

带常系数的Cauchy型奇异积分方程的快速方法

Petrov-Galerkin 方法是研究Cauchy型奇异积分方程的最基本的数值方法. 用此方法离散积分方程可得一系数矩阵是稠密的线性方程组. 如果方程组的阶比较大, 则求解此方程组所需要的计算复杂度则会变得很大. 因此, 发展此类方程的快速数值算法就变成了必然. 该文将就对带常系数的Cauchy型奇异积分方程给出一种快速数值方法. 首先用一稀疏矩阵来代替稠密系数矩阵, 其次用数值积分公式离散上述方程组得到其完全离散的形式,然后用多层扩充方法求解此完全离散的线性方程组. 证明经过上述过程得到方程组的逼进解仍然保持了最优阶, 并且整个过程所需要的计算复杂度是拟线性的. 最后通过数值实验证明结论.     

一维热传导方程移动边界识别的计算方法

构造了一种正则化的积分方程方法来由Cauchy数据确定一维热传导方程的移动边界．在将区域延拓至规则区域后,通过Fourier方法将问题转化为一个第一类Volterra积分方程．然后分别用Lavrentiev正则化方法以及Tikhonov正则化方法将不稳定的第一类Volterra积分方程转化为适定的第二类积分方程,并分别将积分方程转化为常微分方程组,并用Runge—Kutta方法数值求解,以及直接离散来求解．最后通过自由边界上的条件得到数值的移动边界．通过一些数值试验表明此方法是有效可行的,并且给出的方法无需迭代,数值计算较简单．     

求解三维第一类Fredholm积分方程的GMRES法

利用数值求积公式,将三维第一类Fredholm积分方程进行离散,通过引入正则化方法,将离散后的积分方程转化为一离散适定问题,通过广义极小残余算法得到了其数值解．数值模拟结果表明该方法的可行有效性．     

偏微分方程边值反问题的数值方法研究

本文研究了奇异积分方程在反边值问题中的应用问题.利用圆周上的自然积分方程及其反演公式,把Laplace方程的边值反问题转化为一对超奇异积分方程和弱奇异积分方程的组合,通过选取三角插值近似奇异积分的计算并构造相应的配置格式,并使用Tikhonov正则化方法求解所得到的线性方程组.数值实验表明了该方法的有效性.     

二维刚性边值问题的小波-吉尔解法

本文利用微分方程数值解的离散小波表示，讨论了此类方程在满足一定初始条件和边值条件下，在一个方向上利用小波伽辽金法，另一方向上利用吉尔方法进行求解，提出了一种解二维刚性初，边值问题的小波数值算法，计算结果表明，利用该方法所求得的数值解精度高，而且由小波特有的性质，它特别适用于求解带有奇异摄动的刚性问题。     

随机椭圆最优控制问题的随机配置方法

本文讨论求解随机系数泊松方程约束最优控制问题的有效数值方法.通过应用有限元方法和随机配置法,将原最优控制问题离散转化为最优化问题,再利用交替方向乘子法求解最优化问题.之后,对所提出的算法进行了收敛性分析,并通过数值实验验证了算法的有效性.     

求解热传导反问题的一种正则化Newton型迭代法

讨论热传导方程求解系数的一个反问题．把问题归结为一个非线性不适定的算子方程后,考虑该方程的Newton型迭代方法．对线性化后的Newton方程用隐式迭代法求解,关键的一步是引入了一种新的更合理的确定(内)迭代步数的后验准则．对新方法及对照的Tikhonov方法和Bakushiskii方法进行了数值实验,结果显示了新方法具有明显的优越性．     

平面定常Stokes问题的无奇异第一类边界积分方程

对无奇异边界积分方程归化法的研究,已有的结果都是针对直接变量的,其核心思想是利用刚体位移(包括刚体的转动和平移)或均匀场．然而,对第一类边界积分方程的无奇异边界归化法的研究,至今还未涉足．本文提交一种新方法,归化出平面定常Stokes问题的第一类无奇异边界积分方程,并建立完整的数值求解体系．一个简单的算例表明本文方法可获得理想的数值结果,特别是边界量的数值结果。     

改进的无奇异局部边界积分方程方法

在局部边界积分方程方法中,当源节点位于分析域的整体边界上时,局部边界积分将出现奇异积分问题,这些奇异积分需要做特别的处理．为此,提出了对域内节点采用局部积分方程,而对边界节点直接采用移动最小二乘近似函数引入边界条件来解决奇异积分问题,这同时也解决了对积分边界进行插值引入近似误差的问题．作为应用和数值实验,对Laplace方程和Helmholtz方程问题进行了分析,取得了很好的数值结果．进而,在Helmholtz方程求解中,采用了含波解信息的修正基函数来代替单项式基函数进行近似．数值结果显示,这样处理是简单高效的,在高波数声传播问题的求解中非常具有前景．     

Integrable discretization and numerical simulations of the generalized coupled integrable dispersionless equations

In this paper, we study the generalized coupled integrable dispersionless (GCID) equations and construct two integrable discrete analogues including a semi-discrete system and a full-discrete one. The results are based on the relations among the GCID equations, the sine-Gordon equation and the two-dimensional Toda lattice equation. We also present the N-soliton solutions to the semi-discrete and fully discrete systems in the form of Casorati determinant. In the continuous limit, we show that the fully discrete GCID equations converge to the semi-discrete GCID equations, then further to the continuous GCID equations. By using the integrable semi-discrete system, we design two numerical schemes to the GCID equations and carry out several numerical experiments with solitons and breather solutions.     

Numerical solution of nonlinear Jaulent–Miodek and Whitham–Broer–Kaup equations

In this work we investigate the numerical solution of Jaulent–Miodek (JM) and Whitham–Broer–Kaup (WBK) equations. The proposed numerical schemes are based on the fourth-order time-stepping schemes in combination with discrete Fourier transform. We discretize the original partial differential equations (PDEs) with discrete Fourier transform in space and obtain a system of ordinary differential equations (ODEs) in Fourier space which will be solved with fourth order time-stepping methods. After transforming the equations to a system of ODEs, the linear operator in JM equation is diagonal but in WBK equation is not diagonal. However for WBK equation we can also implement the methods such as diagonal case which reduces the CPU time. Comparing numerical solutions with analytical solutions demonstrates that those methods are accurate and readily implemented.     

A numerical study of variable depth KdV equations and generalizations of Camassa–Holm-like equations

In this paper we numerically study the KdV-top equation and compare it with the Boussinesq equations over uneven bottoms. We use here a finite-difference scheme that conserves a discrete energy for the fully discrete scheme. We also compare this approach with the discontinuous Galerkin method. For the equations obtained in the case of stronger nonlinearities and related to the Camassa–Holm equation, we find several finite difference schemes that conserve a discrete energy for the fully discrete scheme. Because of its accuracy for the conservation of energy, our numerical scheme is also of interest even in the simple case of flat bottoms. We compare this approach with the discontinuous Galerkin method.     

Numerical simulation for a nonlinear partial differential equation with variable coefficients by means of the discrete variational derivative method

Partial differential equations with possibly discontinuous coefficients play an important part in engineering, physics and ecology. In this paper, we will study nonlinear partial differential equations with variable coefficients arising from population models. Generally speaking, it is difficult to analyze the behavior of nonlinear partial differential equations; therefore, we usually rely on the numerical approximation. Currently, there is an increasing interest in designing numerical schemes that preserve energy properties for differential equations. We will design the numerical schemes that preserve discrete energy property and show numerical experiments for a nonlinear partial differential equation with variable coefficients.     

Error estimates for the numerical approximation of Neumann control problems governed by a class of quasilinear elliptic equations

We study the numerical approximation of Neumann boundary optimal control problems governed by a class of quasilinear elliptic equations. The coefficients of the main part of the operator depend on the state function, as a consequence the state equation is not monotone. We prove that strict local minima of the control problem can be approximated uniformly by local minima of discrete control problems and we also get an estimate of the rate of this convergence. One of the main issues in this study is the error analysis of the discretization of the state and adjoint state equations. Some difficulties arise due to the lack of uniqueness of solution of the discrete equations. The theoretical results are illustrated by numerical tests.     

Numerical treatment of oscillatory functional differential equations

In this paper we are concerned with oscillatory functional differential equations (that is, those equations where all the solutions oscillate) under a numerical approximation. Our interest is in the preservation of qualitative properties of solutions under a numerical discretisation. We give conditions under which an equation is oscillatory, and consider whether the discrete schemes derived using linear ?-methods will also be oscillatory. We conclude with some general theory.     

A discrete Schrödinger equation via optimal transport on graphs

In 1966, Edward Nelson presented an interesting derivation of the Schrödinger equation using Brownian motion. Recently, this derivation is linked to the theory of optimal transport, which shows that the Schrödinger equation is a Hamiltonian system on the probability density manifold equipped with the Wasserstein metric. In this paper, we consider similar matters on a finite graph. By using discrete optimal transport and its corresponding Nelson's approach, we derive a discrete Schrödinger equation on a finite graph. The proposed system is quite different from the commonly referred discretized Schrödinger equations. It is a system of nonlinear ordinary differential equations (ODEs) with many desirable properties. Several numerical examples are presented to illustrate the properties.     

Integrable Duffing’s maps and solutions of the Duffing equation

In the numerical integration of nonlinear differential equations, discretization of the nonlinear terms poses extra ambiguity in reducing the differential equation to a discrete difference equation. As for the cubic nonlinear Schrodinger equation, it was well known that there exists the corresponding discrete soliton system. Here, representing the discrete systems by the mappings, we explore structure of the integrable mappings. We introduce the first kind and the second kind of Duffing’s map, and investigate temporal evolution of the orbits. Although the smooth periodic orbits are in accord with the solutions of the Duffing equation, the integrable Duffing’s maps provide much wider variety of orbits.     

Strong convergence for explicit space–time discrete numerical approximation methods for stochastic Burgers equations

In this paper we propose and analyze explicit space–time discrete numerical approximations for additive space–time white noise driven stochastic partial differential equations (SPDEs) with non-globally monotone nonlinearities such as the stochastic Burgers equation with space–time white noise. The main result of this paper proves that the proposed explicit space–time discrete approximation method converges strongly to the solution process of the stochastic Burgers equation with space–time white noise. To the best of our knowledge, the main result of this work is the first result in the literature which establishes strong convergence for a space–time discrete approximation method in the case of the stochastic Burgers equations with space–time white noise.     

A Crank-Nicolson scheme for the Landau-Lifshitz equation without damping

An accurate and efficient numerical approach, based on a finite difference method with Crank-Nicolson time stepping, is proposed for the Landau-Lifshitz equation without damping. The phenomenological Landau-Lifshitz equation describes the dynamics of ferromagnetism. The Crank-Nicolson method is very popular in the numerical schemes for parabolic equations since it is second-order accurate in time. Although widely used, the method does not always produce accurate results when it is applied to the Landau-Lifshitz equation. The objective of this article is to enumerate the problems and then to propose an accurate and robust numerical solution algorithm. A discrete scheme and a numerical solution algorithm for the Landau-Lifshitz equation are described. A nonlinear multigrid method is used for handling the nonlinearities of the resulting discrete system of equations at each time step. We show numerically that the proposed scheme has a second-order convergence in space and time.