Numerical analysis of an inverse problem for the eikonal equation

We are concerned with the inverse problem for an eikonal equation of determining the speed function using observations of the arrival time on a fixed surface. This is formulated as an optimisation problem for a quadratic functional with the state equation being the eikonal equation coupled to the so-called Soner boundary condition. The state equation is discretised by a suitable finite difference scheme for which we obtain existence, uniqueness and an error bound. We set up an approximate optimisation problem and show that a subsequence of the discrete mimina converges to a solution of the continuous optimisation problem as the mesh size goes to zero. The derivative of the discrete functional is calculated with the help of an adjoint equation which can be solved efficiently by using fast marching techniques. Finally we describe some numerical results.     

Approximation of relaxed nonlinear parabolic optimal control problems

We consider a relaxed optimal control problem for systems defined by nonlinear parabolic partial differential equations with distributed control. The problem is completely discretized by using a finite-element approximation scheme with piecewise linear states and piecewise constant controls. Existence of optimal controls and necessary conditions for optimality are derived for both the continuous and the discrete problem. We then prove that accumulation points of sequences of discrete optimal [resp. extremal] controls are optimal [resp. extremal] for the continuous problem.     

A new reliable algorithm based on the sinc function for the time fractional diffusion equation

This paper deals with the numerical solution of time fractional diffusion equation. In this work, we consider the fractional derivative in the sense of Riemann-Liouville. At first, the time fractional derivative is discretized by integrating both sides of the equation with respect to the time variable and we arrive at a semi–discrete scheme. The stability and convergence of time discretized scheme are proven by using the energy method. Also we show that the convergence order of this scheme is O(τ2?α). Then we use the sinc collocation method to approximate the solution of semi–discrete scheme and show that the problem is reduced to a Sylvester matrix equation. Besides by performing some theorems, the exponential convergence rate of sinc method is illustrated. The numerical experiments are presented to show the excellent behavior and high accuracy of the proposed hybrid method in comparison with some other well known methods.     

求解约束优化问题的两个微分方程算法

本文给出求解具有等式约束和不等式约束的非线性优化问题的一阶信息和二阶信息的两个微分方程系统,问题的局部最优解是这两个微分方程系统的渐近稳定的平衡点,给出了这两个微分方程系统的Euler离散迭代格式并证明了它们的收敛性定理,用龙格库塔法分别求解两个微分方程系统．我们构造了搜索方向由两个微分系统计算,步长采用Armijo线搜索的算法分别求解这个约束最优化问题,在局部Lipschitz条件下基于二阶信息的微分方程系统的迭代方法具有二阶的收敛速度。我们给出的数值结果表明龙格库塔的微分方程算法具有较好的稳定性和更高的精确度,求解二阶信息的微分方程系统的方法具有更快的收敛速度．     

Approximation of optimal feedback control: a dynamic programming approach

We consider the general continuous time finite-dimensional deterministic system under a finite horizon cost functional. Our aim is to calculate approximate solutions to the optimal feedback control. First we apply the dynamic programming principle to obtain the evolutive Hamilton–Jacobi–Bellman (HJB) equation satisfied by the value function of the optimal control problem. We then propose two schemes to solve the equation numerically. One is in terms of the time difference approximation and the other the time-space approximation. For each scheme, we prove that (a) the algorithm is convergent, that is, the solution of the discrete scheme converges to the viscosity solution of the HJB equation, and (b) the optimal control of the discrete system determined by the corresponding dynamic programming is a minimizing sequence of the optimal feedback control of the continuous counterpart. An example is presented for the time-space algorithm; the results illustrate that the scheme is effective.     

A sixth-order dual preserving algorithm for the Camassa-Holm equation

The paper presents a sixth-order numerical algorithm for studying the completely integrable Camassa-Holm (CH) equation. The proposed sixth-order accurate method preserves both the dispersion relation and the Hamiltonians of the CH equation. The CH equation in this study is written as an evolution equation, involving only the first-order spatial derivatives, coupled with the Helmholtz equation. We propose a two-step method that first solves the evolution equation by a sixth-order symplectic Runge-Kutta method and then solves the Helmholtz equation using a three-point sixth-order compact scheme. The first-order derivative terms in the first step are approximated by a sixth-order dispersion-relation-preserving scheme that preserves the physically inherent dispersive nature. The compact Helmholtz solver, on the other hand, allows us to use relatively few nodal points in a stencil, while achieving a higher-order accuracy. The sixth-order symplectic Runge-Kutta time integrator is preferable for an equation that possesses a Hamiltonian structure. We illustrate the ability of the proposed scheme by examining examples involving peakon or peakon-like solutions. We compare the computed solutions with exact solutions or asymptotic predictions. We also demonstrate the ability of the symplectic time integrator to preserve the Hamiltonians. Finally, via a smooth travelling wave problem, we compare the accuracy, elapsed computing time, and rate of convergence among the proposed method, a second-order two-step algorithm, and a completely integrable particle method.     

Uniform boundary controllability of a semi-discrete 1-D wave equation

Summary. A numerical scheme for the controlled semi-discrete 1-D wave equation is considered. We analyze the convergence of the boundary controls of the semi-discrete equations to a control of the continuous wave equation when the mesh size tends to zero. We prove that, if the high modes of the discrete initial data have been filtered out, there exists a sequence of uniformly bounded controls and any weak limit of this sequence is a control for the continuous problem. The number of the eliminated frequencies depends on the mesh size and the regularity of the continuous initial data. The case of the HUM controls is also discussed. Received March 3, 2001 / Published online October 17, 2001     

Convergence analysis of a DDFV scheme for a system describing miscible fluid flows in porous media

In this article, we prove the convergence of a discrete duality finite volume scheme for a system of partial differential equations describing miscible displacement in porous media. This system is made of two coupled equations: an anisotropic diffusion equation on the pressure and a convection‐diffusion‐dispersion equation on the concentration. We first establish some a priori estimates satisfied by the sequences of approximate solutions. Then, it yields the compactness of these sequences. Passing to the limit in the numerical scheme, we finally obtain that the limit of the sequence of approximate solutions is a weak solution to the problem under study. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 723–760, 2015     

On the convergence of a conservative numerical scheme for the usual Rosenau-RLW equation

In this paper, we study the initial-boundary value problem of the usual Rosenau-RLW equation by finite difference method. We design a conservative numerical scheme which preserves the original conservative properties for the equation. The scheme is three-level and linear-implicit. The unique solvability of numerical solutions has been shown. Priori estimate and second order convergence of the finite difference approximate solutions are discussed by discrete energy method. Numerical results demonstrate that the scheme is efficient and accurate.     

Discrete approximation of relaxed optimal control problems

We consider a general nonlinear optimal control problem for systems governed by ordinary differential equations with terminal state constraints. No convexity assumptions are made. The problem, in its so-called relaxed form, is discretized and necessary conditions for discrete relaxed optimality are derived. We then prove that discrete optimality [resp., extremality] in the limit carries over to continuous optimality [resp., extremality]. Finally, we prove that limits of sequences of Gamkrelidze discrete relaxed controls can be approximated by classical controls.     

Fourth‐order compact scheme for the one‐dimensional sine‐Gordon equation

Finite difference scheme to the generalized one‐dimensional sine‐Gordon equation is considered in this paper. After approximating the second order derivative in the space variable by the compact finite difference, we transform the sine‐Gordon equation into an initial‐value problem of a second‐order ordinary differential equation. Then Padé approximant is used to approximate the time derivatives. The resulting fully discrete nonlinear finite‐difference equation is solved by a predictor‐corrector scheme. Both Dirichlet and Neumann boundary conditions are considered in our proposed algorithm. Stability analysis and error estimate are given for homogeneous Dirichlet boundary value problems using energy method. Numerical results are given to verify the condition for stability and convergence and to examine the accuracy and efficiency of the proposed algorithm. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

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

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

Algorithm for min-range multiplication of affine forms

We consider an approximate method based on the alternate trapezoidal quadrature for the eigenvalue problem given by a periodic singular Fredholm integral equation of second kind. For some convolution-type integral kernels, the eigenvalues of the discrete eigenvalue problem provided by the alternate trapezoidal quadrature method have multiplicity at least two, except up to two eigenvalues of multiplicity one. In general, these eigenvalues exhibit some symmetry properties that are not necessarily observed in the eigenvalues of the continuous problem. For a class of Hilbert-type kernels, we provide error estimates that are valid for a subset of the discrete spectrum. This subset is further enlarged in an improved quadrature method presented herein. The results are illustrated through numerical examples.     

四阶抛物偏微分方程的H1-Galerkin混合元方法及数值模拟

到目前为止, H¹-Galerkin 混合有限元方法研究的问题仅局限于二阶发展方程. 然而对于高阶发展方程, 特别是重要的四阶发展方程问题的研究却没有出现. 本文首次提出四阶发展方程的H¹-Galerkin 混合有限元方法, 为了给出理论分析的需要, 我们考虑四阶抛物型发展方程. 通过引进三个适当的中间辅助变量, 形成四个一阶方程组成的方程组系统, 提出四阶抛物型方程的H¹-Galerkin 混合有限元方法. 得到了一维情形下的半离散和全离散格式的最优收敛阶误差估计和多维情形的半离散格式误差估计, 并采用迭代方法证明了全离散格式的稳定性. 最后, 通过数值例子验证了提出算法的可行性. 在一维情况下我们能够同时得到未知纯量函数、一阶导数、负二阶导数和负三阶导数的最优逼近解, 这一点是以往混合元方法所不能得到的.     

Existence and smoothness of continuous and discrete solutions of a two-dimensional shallow water problem over movable beds

We consider a two-dimensional shallow water system over movable beds. We begin with a continuous system and prove the existence of the solutions, and then we investigate their smoothness. Then, we employ a Galerkin method to obtain a finite-dimensional problem which is solved using a Brouwer fixed point theorem. Therefore, we show that the limits of the resulting solution sequences satisfy the model equations.After solving the continuous problem, we focus on the corresponding discrete problem. We employ a local discontinuous Galerkin scheme for numerical solution of the discrete system and conduct an error analysis of the numerical scheme. We prove that the method is convergent and that the error is bounded according to a specific norm defined herein.     

Crank‐Nicolson‐Galerkin finite element scheme for nonlocal coupled parabolic problem using the Newton's method

In this article, a finite element scheme based on the Newton's method is proposed to approximate the solution of a nonlocal coupled system of parabolic problem. The Crank‐Nicolson method is used for time discretization. Well‐posedness of the problem is discussed at continuous and discrete levels. We derive a priori error estimates for both semidiscrete and fully discrete formulations. Results based on usual finite element method are provided to confirm the theoretical estimates.     

Error analysis and applications of the Fourier-Galerkin Runge-Kutta schemes for high-order stiff PDEs

An integrating factor mixed with Runge-Kutta technique is a time integration method that can be efficiently combined with spatial spectral approximations to provide a very high resolution to the smooth solutions of some linear and nonlinear partial differential equations. In this paper, the novel hybrid Fourier-Galerkin Runge-Kutta scheme, with the aid of an integrating factor, is proposed to solve nonlinear high-order stiff PDEs. Error analysis and properties of the scheme are provided. Application to the approximate solution of the nonlinear stiff Korteweg-de Vries (the 3rd order PDE, dispersive equation), Kuramoto-Sivashinsky (the 4th order PDE, dissipative equation) and Kawahara (the 5th order PDE) equations are presented. Comparisons are made between this proposed scheme and the competing method given by Kassam and Trefethen. It is found that for KdV, KS and Kawahara equations, the proposed method is the best.     

Monotone iterative sequences for nonlinear boundary value problems of fractional order

In this paper we extend the maximum principle and the method of upper and lower solutions to boundary value problems with the Caputo fractional derivative. We establish positivity and uniqueness results for the problem. We then introduce two well-defined monotone sequences of upper and lower solutions which converge uniformly to the actual solution of the problem. A numerical iterative scheme is introduced to obtain an accurate approximate solution for the problem. The accuracy and efficiency of the new approach are tested through two examples.     

On the numerical method for solving a hypersingular integral equation with the computation of the solution gradient

We consider a linear integral equation, which arises when solving the Neumann boundary value problem for the Laplace equation with the representation of the solution in the form of a double layer potential, with a hypersingular integral treated in the sense of Hadamard finite value. We consider the case in which the exterior or interior problem is solved in a domain whose boundary is a closed smooth surface and the integral equation is written over that surface. A numerical scheme for solving the integral equation is constructed with the use of quadrature formulas of the type of the method of discrete singularities with a regularization for the use of an irregular grid. We prove the convergence, uniform over the grid points, of the numerical solutions to the exact solution of the hypersingular equation and, in addition, the uniform convergence of the values of the approximate finite-difference derivative operator on the numerical solution to the values on the projection of the exact solution onto the subspace of grid functions with nodes at the collocation points.     

Global Error versus Tolerance for Explicit Runge-Kutta Methods

Initial value solvers typically input a problem specificationand an error tolerance, and output an approximate solution.Faced with this situation many users assume, or hope for, alinear relationship between the global error and the tolerance.In this paper we examine the potential for such ‘toleranceproportionality’ in existing explicit Runge-Kutta algorithms.We take account of recent developments in the derivation ofhigh-order formulae, defect control strategies, and interpolantsfor continuous solution and first derivative approximations.Numerical examples are used to verify the theoretical predictions.The analysis draws on the work of Stetter, and the numericaltesting makes use of the nonstiff DETEST package of Enrightand Pryce.