基于GA-Chebyshev神经网络的分数阶Bagley-Torvik方程数值解法

本文基于现有的切比雪夫神经网络,提出了一种利用遗传算法优化切比雪夫神经网络求解分数阶Bagley-Torvik方程数值解的新方法,结合多点处的泰勒公式原理,给出数值解的一般形式,将原问题转化为求解无约束最小化问题.与现有数值方法的数值结果进行比较表明了本文方法的可行性和有效性,为分数阶微分方程中类似问题的求解提供了新的思路.     

Triangular functions (TF) method for the solution of nonlinear Volterra–Fredholm integral equations

A numerical method based on an m-set of general, orthogonal triangular functions (TF) is proposed to approximate the solution of nonlinear Volterra–Fredholm integral equations. The orthogonal triangular functions are utilized as a basis in collocation method to reduce the solution of nonlinear Volterra–Fredholm integral equations to the solution of algebraic equations. Also a theorem is proved for convergence analysis. Some numerical examples illustrate the proposed method.     

Finite-difference methods for solving the reaction-diffusion equations of a simple isothermal chemical system

Numerical methods are proposed for the numerical solution of a system of reaction-diffusion equations, which model chemical wave propagation. The reaction terms in this system of partial differential equations contain nonlinear expressions. Nevertheless, it is seen that the numerical solution is obtained by solving a linear algebraic system at each time step, as opposed to solving a nonlinear algebraic system, which is often required when integrating nonlinear partial differential equations. The development of each numerical method is made in the light of experience gained in solving the system of ordinary differential equations, which model the well-stirred analogue of the chemical system. The first-order numerical methods proposed for the solution of this initialvalue problem are characterized to be implicit. However, in each case it is seen that the numerical solution is obtained explicitly. In a series of numerical experiments, in which the ordinary differential equations are solved first of all, it is seen that the proposed methods have superior stability properties to those of the well-known, first-order, Euler method to which they are compared. Incorporating the proposed methods into the numerical solution of the partial differential equations is seen to lead to two economical and reliable methods, one sequential and one parallel, for solving the travelling-wave problem. © 1994 John Wiley & Sons, Inc.     

混合广义Jacobi和Chebyshev谱配置法求解时间分数阶对流扩散方程

研究时间Caputo分数阶对流扩散方程的高效高阶数值方法.对于给定的时间分数阶偏微分方程,在时间和空间方向分别采用基于移位广义Jacobi函数为基底和移位Chebyshev多项式运算矩阵的谱配置法进行数值求解.这样得到的数值解可以很好地逼近一类在时间方向非光滑的方程解.最后利用一些数值例子来说明该数值方法的有效性和准确性.     

NUMERICAL SOLUTIONS OF AN EIGENVALUE PROBLEM IN UNBOUNDED DOMAINS

A coupling method of finite element and infinite large element is proposed for the numerical solution of an eigenvalue problem in unbounded domains in this paper. With some conditions satisfied, the considered problem is proved to have discrete spectra. Several numerical experiments are presented. The results demonstrate the feasibility of the proposed method.     

Cardinal functions for Legendre pseudo-spectral method for solving the integro-differential equations

In this article, we present a new numerical method to solve the integro-differential equations (IDEs). The proposed method uses the Legendre cardinal functions to express the approximate solution as a finite series. In our method the operational matrix of derivatives is used to reduce IDEs to a system of algebraic equations. To demonstrate the validity and applicability of the proposed method, we present some numerical examples. We compare the obtained numerical results from the proposed method with some other methods. The results show that the proposed algorithm is of high accuracy, more simple and effective.     

A simple finite volume method for the shallow water equations

We present a new finite volume method for the numerical solution of shallow water equations for either flat or non-flat topography. The method is simple, accurate and avoids the solution of Riemann problems during the time integration process. The proposed approach consists of a predictor stage and a corrector stage. The predictor stage uses the method of characteristics to reconstruct the numerical fluxes, whereas the corrector stage recovers the conservation equations. The proposed finite volume method is well balanced, conservative, non-oscillatory and suitable for shallow water equations for which Riemann problems are difficult to solve. The proposed finite volume method is verified against several benchmark tests and shows good agreement with analytical solutions.     

A scheme for stable numerical differentiation

A method for stable numerical differentiation of noisy data is proposed. The method requires solving a Volterra integral equation of the second kind. This equation is solved analytically. In the examples considered its solution is computed analytically. Some numerical results of its application are presented. These examples show that the proposed method for stable numerical differentiation is numerically more efficient than some other methods, in particular, than variational regularization.     

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.     

Numerical Solution for the Helmholtz Equation with Mixed Boundary Condition

We consider the numerical solution for the Helmholtz equation in R~2 with mixed boundary conditions.The solvability of this mixed boundary value problem is estab- lished by the boundary integral equation method.Based on the Green formula,we express the solution in terms of the boundary data.The key to the numerical real- ization of this method is the computation of weakly singular integrals.Numerical performances show the validity and feasibility of our method.The numerical schemes proposed in this paper have been applied in the realization of probe method for inverse scattering problems.     

Analysis of traffic flow by the finite element method

A finite elernent methodology is developed for the numerical solution of traffic flow problems encountered in arterial streets. The simple continuum traffic flow model consisting of the equation of continuity and an equilibrium flow-density relationship is adopted. A Galerkin type finite element method is used to formulate the problem in discrete form and the solution is obtained by a step-by-step time integration in conjunction with the Newton-Raphson method. The proposed finite element methodology, which is of the shock capturing type, is applied to flow traffic problems. Two numerical examples illustrate the method and demonstrate its advantages over other analytical or numerical techniques.     

On the asymptotic convergence of a collocation method for some boundary integral equations of the first kind

In this paper we present a certain collocation method for the numerical solution of a class of boundary integral equations of the first kind with logarithmic kernel as principle part. The transformation of the boundary value problem into boundary singular integral equation of the first kind via single-layer potential is discussed. A discretization and error representation for the numerical solution of boundary integral equations has been given. Quadrature formulae have been proposed and the error arising due to the quadrature formulae used has been estimated. The convergence of the solution with respect to the proposed numerical algorithm is shown and finally some numerical results have been presented.     

Septic B-spline method of the Korteweg-de Vries–Burger’s equation

In this paper, a numerical solution for the Korteweg-de Vries–Burger’s equation (KdVB) by using the collocation method using the septic splines is proposed. Applying the Von-Neumann stability analysis technique we show that the method is unconditionally stable. By conducting a comparison between the absolute error for the obtained numerical results and the analytic solution of the equation we will test the accuracy of the proposed method.     

Numerical Solution of the Lippmann–Schwinger Equation by Approximate Approximations

A new method for the numerical solution of volume integral equations is proposed and applied to a Lippmann–Schwinger type equation in diffraction theory. The approximate solution is represented as a linear combination of the scaled and shifted Gaussian. We prove spectral convergence of the method up to some negligible saturation error. The theoretical results are confirmed by a numerical experiment.     

A semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints

Mathematical programs with vanishing constraints are a difficult class of optimization problems with important applications to optimal topology design problems of mechanical structures. Recently, they have attracted increasingly more attention of experts. The basic difficulty in the analysis and numerical solution of such problems is that their constraints are usually nonregular at the solution. In this paper, a new approach to the numerical solution of these problems is proposed. It is based on their reduction to the so-called lifted mathematical programs with conventional equality and inequality constraints. Special versions of the sequential quadratic programming method are proposed for solving lifted problems. Preliminary numerical results indicate the competitiveness of this approach.     

The Adomian decomposition method with Green’s function for solving nonlinear singular boundary value problems

In this paper, we present an efficient numerical algorithm for solving a general class of nonlinear singular boundary value problems. This present algorithm is based on the Adomian decomposition method (ADM) and Green’s function. The method depends on constructing Green’s function before establishing the recursive scheme. In contrast to the existing recursive schemes based on ADM, the proposed numerical algorithm avoids solving a sequence of transcendental equations for the undetermined coefficients. The approximate series solution is calculated in the form of series with easily computable components. Moreover, the convergence analysis and error estimation of the proposed method is given. Furthermore, the numerical examples are included to demonstrate the accuracy, applicability, and generality of the proposed scheme. The numerical results reveal that the proposed method is very effective.     

A Steffensen's type method in Banach spaces with applications on boundary-value problems

In this paper, a modified Steffensen's type iterative scheme for the numerical solution of a system of nonlinear equations is studied. Two convergence theorems are presented. The numerical solution of boundary-value problems by the multiple shooting method using the proposed iterative scheme is analyzed.     

An effective approach for numerical solution of linear and nonlinear singular boundary value problems

In this study, an effective approach is presented to obtain a numerical solution of linear and nonlinear singular boundary value problems. The proposed method is constructed by combining reproducing kernel and Legendre polynomials. Legendre basis functions are used to get the kernel function, and then the approximate solution is obtained as a finite series sum. Comparison of numerical results is made with the results obtained by other methods available in the literature. Furthermore, efficiency and accuracy of the method are demonstrated in tabulated results and plotted graphs. The numerical outcomes demonstrate that our method is very effective, applicable, and convenient.     

A moving collocation method for the solution of the transient convection–diffusion-reaction problems

An adaptive collocation method is introduced for simulating the short time diffusion–convection-reaction problem. The method is based on dividing the solution domain into active and inactive zones in such a way that the collocation points remain concentrated in regions of solution variation. The numerical results show that the proposed method is efficient in simulating the sharp profile at short time for the convective-dominant case. The adaptive scheme performance is found compatible with the high-order finite difference method, the QUICK method in terms of the CPU time and average numerical errors.     

Numerical properties of high order discrete velocity solutions to the BGK kinetic equation

A high order numerical method for the solution of model kinetic equations is proposed. The new method employs discontinuous Galerkin (DG) discretizations in the spatial and velocity variables and Runge-Kutta discretizations in the temporal variable. The method is implemented for the one-dimensional Bhatnagar-Gross-Krook equation. Convergence of the numerical solution and accuracy of the evaluation of macroparameters are studied for different orders of velocity discretization. Synthetic model problems are proposed and implemented to test accuracy of discretizations in the free molecular regime. The method is applied to the solution of the normal shock wave problem and the one-dimensional heat transfer problem.