AN APPLICABLE APPROXIMATION METHOD AND ITS APPLICATION

In this work, by choosing an orthonormal basis for the Hilbert spaceL2[0,1], an approximation method for finding approximate solutions of the equation(I+K)x=yis proposed, called Haar wavelet approximation method(HWAM). To prove the applicability of the HWAM, a more general applicability theorem on an approximation method(AM) for an operator equationAx=yis proved first. As an application, applicability of the HWAM is obtained. Furthermore, four steps to use the HWAM are listed and three numerical examples are given in order to illustrate the effectiveness of the method.     

矩阵方程AX＋XB=C的双对称解及其最佳逼近

提出一种求解线性矩阵方程AX＋XB=C双对称解的迭代法.该算法能够自动地判断解的情况,并在方程相容时得到方程的双对称解,在方程不相容时得到方程的最小二乘双对称解.对任意的初始矩阵,在没有舍入误差的情况下,经过有限步迭代得到问题的一个双对称解.若取特殊的初始矩阵,则可以得到问题的极小范数双对称解,从而巧妙地解决了对给定矩...     

An algorithm for the approximate solution of integral equations of Mellin type

Summary. The cruciform crack problem of elasticity gives rise to an integral equation of the second kind on [0,1] whose kernel has a fixed singularity at (0,0). We introduce a transformation of [0,1] onto itself such that an arbitrary number of derivatives vanish at the end points 0 and 1. If the transformed kernel is dominated near the origin by a Mellin kernel then we have given conditions under which the use of a modified Euler-Maclaurin quadrature rule and the Nystr?m method gives an approximate solution which converges to the exact solution of the original equation. The method is illustrated with a numerical example. Received May 10, 1994     

Exact solutions for the generalized Klein–Gordon equation via a transformation and Exp-function method and comparison with Adomian’s method

In this paper, a suitable transformation and a so-called Exp-function method are used to obtain different types of exact solutions for the generalized Klein–Gordon equation. These exact solutions are in full agreement with the previous results obtained in Refs. [Sirendaoreji, Auxiliary equation method and new solutions of Klein–Gordon equations, Chaos, Solitons & Fractals 31 (4) (2007) 943–950; Huiqun Zhang, Extended Jacobi elliptic function expansion method and its applications, Communications in Nonlinear Science and Numerical Simulation, 12 (5) (2007) 627–635]. One of these exact solutions is compared with the approximate solutions obtained by the modified decomposition method. Accurate numerical results for a wider range of time are obtained after using different types of ADM-Padè approximation. Our results show that the Exp-function method is very effective in finding exact solutions for the problem considered while the modified decomposition method is very powerful in finding numerical solutions with good accuracy for nonlinear PDE without any need for a transformation or perturbation.     

A numerical method for nonlinear age-structured population models with finite maximum age

We propose a new numerical method for the approximation of solutions to a non-autonomous form of the classical Gurtin-MacCamy population model with a mortality rate that is the sum of an intrinsic age-dependent rate that becomes unbounded as the age approaches its maximum value, plus a non-local, non-autonomous, bounded rate that depends on some weighted population size. We prove that our new quadrature based method converges to second-order and we show the results of several numerical simulations.     

Numerical treatment of a well-posed Chebyshev Tau method for Bagley-Torvik equation with high-order of accuracy

The main purpose of this study is to develop and analyze a new high-order operational Tau method based on the Chebyshev polynomials as basis functions for obtaining the numerical solution of Bagley-Torvik equation which has a important role in the fractional calculus. It is shown that some derivatives of the solutions of these equations have a singularity at origin. To overcome this drawback we first change the original equation into a new equation with a better regularity properties by applying a regularization process and thereby the operational Chebyshev Tau method can be applied conveniently. Our proposed method has two main advantages. First, the algebraic form of the Tau discretization of the problem has an upper triangular structure which can be solved by forward substitution method. Second, Tau approximation of the problem converges to the exact ones with a highly rate of convergence under a more general regularity assumptions on the input data in spite of the singularity behavior of the exact solution. Numerical results are presented which confirm the theoretical results obtained and efficiency of the proposed method.     

Solving the Dym initial value problem in reproducing kernel space

We consider two numerical solution approaches for the Dym initial value problem using the reproducing kernel Hilbert space method. For each solution approach, the solution is represented in the form of a series contained in the reproducing kernel space, and a truncated approximate solution is obtained. This approximation converges to the exact solution of the Dym problem when a sufficient number of terms are included. In the first approach, we avoid to perform the Gram-Schmidt orthogonalization process on the basis functions, and this will decrease the computational time. Meanwhile, in the second approach, working with orthonormal basis elements gives some numerical advantages, despite the increased computational time. The latter approach also permits a more straightforward convergence analysis. Therefore, there are benefits to both approaches. After developing the reproducing kernel Hilbert space method for the numerical solution of the Dym equation, we present several numerical experiments in order to show that the method is efficient and can provide accurate approximations to the Dym initial value problem for sufficiently regular initial data after relatively few iterations. We present the absolute error of the results when exact solutions are known and residual errors for other cases. The results suggest that numerically solving the Dym initial value problem in reproducing kernel space is a useful approach for obtaining accurate solutions in an efficient manner.     

Chebyshev Wavelet collocation method for solving generalized Burgers–Huxley equation

In this paper, new and efficient numerical method, called as Chebyshev wavelet collocation method, is proposed for the solutions of generalized Burgers–Huxley equation. This method is based on the approximation by the truncated Chebyshev wavelet series. By using the Chebyshev collocation points, algebraic equation system has been obtained and solved. Approximate solutions of the generalized Burgers–Huxley equation are compared with exact solutions. These calculations demonstrate that the accuracy of the Chebyshev wavelet collocation solutions is quite high even in the case of a small number of grid points. Copyright © 2015 John Wiley & Sons, Ltd.     

A new analytical modelling for fractional telegraph equation via Laplace transform

The main aim of the present work is to propose a new and simple algorithm for space-fractional telegraph equation, namely new fractional homotopy analysis transform method (HATM). The fractional homotopy analysis transform method is an innovative adjustment in Laplace transform algorithm (LTA) and makes the calculation much simpler. The proposed technique solves the nonlinear problems without using Adomian polynomials and He’s polynomials which can be considered as a clear advantage of this new algorithm over decomposition and the homotopy perturbation transform method (HPTM). The beauty of the paper is error analysis which shows that our solution obtained by proposed method converges very rapidly to the known exact solution. The numerical solutions obtained by proposed method indicate that the approach is easy to implement and computationally very attractive. Finally, several numerical examples are given to illustrate the accuracy and stability of this method.     

Spectral Element Viscosity Methods for Nonlinear Conservation Laws onthe Semi-Infinite Interval

In this paper we propose a spectral element: vanishing viscosity (SEW) method for the conservation laws on the semi-infinite interval. By using a suitable mapping, the problem is first transformed into a modified conservation law in a bounded interval, then the well-known spectral vanishing viscosity technique is generalized to the multi-domain case in order to approximate this trarsformed equation more efficiently. The construction details and convergence analysis are presented. Under a usual assumption of boundedness of the approximation solutions, it is proven that the solution of the SEW approximation converges to the uniciue entropy solution of the conservation laws. A number of numerical tests is carried out to confirm the theoretical results.     

A Functional Equation Whose Unknown is \mathcal{P}([0,1]) Valued

We study a functional equation whose unknown maps a Euclidean space into the space of probability distributions on [0,1]. We prove existence and uniqueness of its solution under suitable regularity and boundary conditions, we show that it depends continuously on the boundary datum, and we characterize solutions that are diffuse on [0,1]. A canonical solution is obtained by means of a Randomly Reinforced Urn with different reinforcement distributions having equal means. The general solution to the functional equation defines a new parametric collection of distributions on [0,1] generalizing the Beta family.     

A power penalty approach to a mixed quasilinear elliptic complementarity problem

In this paper, a power penalty approximation method is proposed for solving a mixed quasilinear elliptic complementarity problem. The mixed complementarity problem is first reformulated as a double obstacle quasilinear elliptic variational inequality problem. A nonlinear elliptic partial differential equation is then defined to approximate the resulting variational inequality by using a power penalty approach. The existence and uniqueness of the solution to the partial differential penalty equation are proved. It is shown that, under some mild assumptions, the sequence of solutions to the penalty equations converges to the unique solution of the variational inequality problem as the penalty parameter tends to infinity. The error estimates of the convergence of this penalty approach are also derived. At last, numerical experimental results are presented to show that the power penalty approximation method is efficient and robust.

     

矩阵方程AXB+CYD=E的M对称解的迭代算法

在共轭梯度思想的启发下,结合线性投影算子,给出迭代算法求解了线性矩阵方程AXB+CYD=E的M对称解[X,Y]及其最佳逼近.当矩阵方程AXB+CYD=E有M对称解时,应用迭代算法,在有限的误差范围内,对任意初始M对称矩阵对[X_,Y_1],经过有限步迭代可得到矩阵方程的M对称解;选取合适的初始迭代矩阵,还可得到极小范数M对称解.而且,对任意给定的矩阵对[X,Y],矩阵方程AXB+CYD=E的最佳逼近可以通过迭代求解新的矩阵方程AXB+CYD=E的极小范数M对称解得到.文中的数值例子证实了该算法的有效性.     

A Variational Analysis for the Moving Finite Element Method for Gradient Flows

By using the Onsager principle as an approximation tool, we give a novel derivation for the moving finite element method for gradient flow equations. We show that the discretized problem has the same energy dissipation structure as the continuous one. This enables us to do numerical analysis for the stationary solution of a nonlinear reaction diffusion equation using the approximation theory of free-knot piecewise polynomials. We show that under certain conditions the solution obtained by the moving finite element method converges to a local minimizer of the total energy when time goes to infinity. The global minimizer, once it is detected by the discrete scheme, approximates the continuous stationary solution in optimal order. Numerical examples for a linear diffusion equation and a nonlinear Allen-Cahn equation are given to verify the analytical results.     

The exact solution of a class of Volterra integral equation with weakly singular kernel

In this paper, the weakly singular Volterra integral equations with an infinite set of solutions are investigated. Among the set of solutions only one particular solution is smooth and all others are singular at the origin. The numerical solutions of this class of equations have been a difficult topic to analyze and have received much previous investigation. The aim of this paper is to present a numerical technique for giving the approximate solution to the only smooth solution based on reproducing kernel theory. Applying weighted integral, we provide a new definition for reproducing kernel space and obtain reproducing kernel function. Using the good properties of reproducing kernel function, the only smooth solution is exactly expressed in the form of series. The n-term approximate solution is obtained by truncating the series. Meanwhile, we prove that the derivative of approximation converges to the derivative of exact solution uniformly. The final numerical examples compared with other methods show that the method is efficient.     

A fast high-order finite difference algorithm for pricing American options

We describe an improvement of Han and Wu’s algorithm [H. Han, X.Wu, A fast numerical method for the Black–Scholes equation of American options, SIAM J. Numer. Anal. 41 (6) (2003) 2081–2095] for American options. A high-order optimal compact scheme is used to discretise the transformed Black–Scholes PDE under a singularity separating framework. A more accurate free boundary location based on the smooth pasting condition and the use of a non-uniform grid with a modified tridiagonal solver lead to an efficient implementation of the free boundary value problem. Extensive numerical experiments show that the new finite difference algorithm converges rapidly and numerical solutions with good accuracy are obtained. Comparisons with some recently proposed methods for the American options problem are carried out to show the advantage of our numerical method.     

Galerkin finite element method and error analysis for the fractional cable equation

The cable equation is one of the most fundamental equations for modeling neuronal dynamics. These equations can be derived from the Nernst-Planck equation for electro-diffusion in smooth homogeneous cylinders. Fractional cable equations are introduced to model electrotonic properties of spiny neuronal dendrites. In this paper, a Galerkin finite element method(GFEM) is presented for the numerical simulation of the fractional cable equation(FCE) involving two integro-differential operators. The proposed method is based on a semi-discrete finite difference approximation in time and Galerkin finite element method in space. We prove that the numerical solution converges to the exact solution with order O(τ+h^l+1) for the lth-order finite element method. Further, a novel Galerkin finite element approximation for improving the order of convergence is also proposed. Finally, some numerical results are given to demonstrate the theoretical analysis. The results show that the numerical solution obtained by the improved Galerkin finite element approximation converges to the exact solution with order O(τ²+h^l+1).     

Numerical treatment of a mathematical model arising from a model of neuronal variability

In this paper, we describe a numerical approach based on finite difference method to solve a mathematical model arising from a model of neuronal variability. The mathematical modelling of the determination of the expected time for generation of action potentials in nerve cells by random synaptic inputs in dendrites includes a general boundary-value problem for singularly perturbed differential-difference equation with small shifts. In the numerical treatment for such type of boundary-value problems, first we use Taylor approximation to tackle the terms containing small shifts which converts it to a boundary-value problem for singularly perturbed differential equation. A rigorous analysis is carried out to obtain priori estimates on the solution of the problem and its derivatives up to third order. Then a parameter uniform difference scheme is constructed to solve the boundary-value problem so obtained. A parameter uniform error estimate for the numerical scheme so constructed is established. Though the convergence of the difference scheme is almost linear but its beauty is that it converges independently of the singular perturbation parameter, i.e., the numerical scheme converges for each value of the singular perturbation parameter (however small it may be but remains positive). Several test examples are solved to demonstrate the efficiency of the numerical scheme presented in the paper and to show the effect of the small shift on the solution behavior.     

Semidiscretisation Methods for Quasi‐periodic Solutions

The aim of our approach is a reliable numerical approximation of quasi‐periodic solutions of periodically forced ODEs without using a‐priori transformations into new coordinates [1]. The invariant torus is computed as a solution of a special invariance equation. In the case of two basic frequencies this system can be solved by semidiscretisation, which transforms the system into a higher dimensional autonomous ODE system with periodic solutions.     

Non-separable splines and numerical computation of evolution equations by the Galerkin methods

We construct new non-separable splines and we apply the spline sampling approximation to the computation of numerical solutions of evolution equations. The non-separable splines are basis functions which give a fine sampling approximation which enables us to compute numerical solutions by means of the method of lines combined with the Galerkin method. To demonstrate our approach we compute numerical solutions of the Burgers equation and the Kadomtsev–Petviashvili equation.