A new Jacobi operational matrix: An application for solving fractional differential equations

In this paper, we derived the shifted Jacobi operational matrix (JOM) of fractional derivatives which is applied together with spectral tau method for numerical solution of general linear multi-term fractional differential equations (FDEs). A new approach implementing shifted Jacobi operational matrix in combination with the shifted Jacobi collocation technique is introduced for the numerical solution of nonlinear multi-term FDEs. The main characteristic behind this approach is that it reduces such problems to those of solving a system of algebraic equations which greatly simplifying the problem. The proposed methods are applied for solving linear and nonlinear multi-term FDEs subject to initial or boundary conditions, and the exact solutions are obtained for some tested problems. Special attention is given to the comparison of the numerical results obtained by the new algorithm with those found by other known methods.     

A numerical-analytical solution of multi-term fractional-order differential equations

In this paper, a solution to initial value problems for fractional-order linear commensurate multi-term differential equations with Caputo derivatives is presented. The solution is obtained in the form of a finite sum of the Mittag-Leffler–type functions and the meta-trigonometric cosine function by using a numerical-analytical method. The results of presented numerical experiments show that for high accuracy calculations of these functions, the multi-precision arithmetic must be applied. The approach for solving of the initial value problems for generalized Basset equation, generalized Bagley-Torvik equation, and multi-term fractional equation is demonstrated.     

Numerical analysis of singularly perturbed delay differential turning point problem

In this paper, we describe a numerical method based on fitted operator finite difference scheme for the boundary value problems for singularly perturbed delay differential equations with turning point and mixed shifts. Similar boundary value problems are encountered while simulating several real life processes for instance, first exit time problem in the modelling of neuronal variability. A rigorous analysis is carried out to obtain priori estimates on the solution and its derivatives for the considered problem. In the development of numerical methods for constructing an approximation to the solution of the problem, a special type of mesh is generated to tackle the delay term along with the turning point. Then, to develop robust numerical scheme and deal with the singularity because of the small parameter multiplying the highest order derivative term, an exponential fitting parameter is used. Several numerical examples are presented to support the theory developed in the paper.     

The generalized Cauchy problem with data on two surfaces for a quasilinear analytic system

We consider the generalized Cauchy problem with data on two surfaces for a second-order quasilinear analytic system. The distinction of the generalized Cauchy problem from the traditional statement of the Cauchy problem is that the initial conditions for different unknown functions are given on different surfaces: for each unknown function we pose its own initial condition on its own coordinate axis. Earlier, the generalized Cauchy problem was considered in the works of C. Riquier, N. M. Gyunter, S. L. Sobolev, N. A. Lednev, V. M. Teshukov, and S. P. Bautin. In this article we construct a solution to the generalized Cauchy problem in the case when the system of partial differential equations additionally contains the values of the derivatives of the unknown functions (in particular outer derivatives) given on the coordinate axes. The last circumstance is a principal distinction of the problem in the present article from the generalized Cauchy problems studied earlier.     

Solving delay differential systems with history functions by the Adomian decomposition method

A number of nonlinear phenomena in many branches of the applied sciences and engineering are described in terms of delay differential equations, which arise when the evolution of a system depends both on its present and past time. In this work we apply the Adomian decomposition method (ADM) to obtain solutions of several delay differential equations subject to history functions and then investigate several numerical examples via our subroutines in MAPLE that demonstrate the efficiency of our new approach. In our approach history functions are continuous across the initial value and its derivatives must be equal to the initial conditions (see Section 3) so that our results are more efficient and accurate than previous works.     

关于海洋动力学中二维的大尺度原始方程组(Ⅰ)

考虑地球物理学中大尺度海洋运动的二维原始方程组的初边值问题．先假定海洋的深度为正的常数．首先,当初始数据是平方可积时,应用Faedo-Galerkin方法,得到了这一问题整体弱解的存在性．其次,当初始数据及其它们关于垂直方向的导数均为平方可积时,应用Faedo-Galerkin方法和各向异性不等式,得到了上述初边值问题的整体弱强解的存在、唯一性．     

Fractional Goal Programming for Fuzzy Solid Transportation Problem with Interval Cost

In this paper, we study a solid transportation problem with interval cost using fractional goal programming approach (FGP). In real life applications of the FGP problem with multiple objectives, it is difficult for the decision-maker(s) to determine the goal value of each objective precisely as the goal values are imprecise, vague, or uncertain. Therefore, a fuzzy goal programming model is developed for this purpose. The proposed model presents an application of fuzzy goal programming to the solid transportation problem. Also, we use a special type of non-linear (hyperbolic) membership functions to solve multi-objective transportation problem. It gives an optimal compromise solution. The proposed model is illustrated by using an example.     

Method of lines solutions of the parabolic inverse problem with an overspecification at a point

The present work is motivated by the desire to obtain numerical solution to a quasilinear parabolic inverse problem. The solution is presented by means of the method of lines. Method of lines is an alternative computational approach which involves making an approximation to the space derivatives and reducing the problem to a system of ordinary differential equations in the variable time, then a proper initial value problem solver can be used to solve this ordinary differential equations system. Some numerical examples and also comparison with finite difference methods will be investigated to confirm the efficiency of this procedure.     

Fractional differential equations solved by using Mellin transform

In this paper, the solution of the multi-order differential equations, by using Mellin transform, is proposed. It is shown that the problem related to the shift of the real part of the argument of the transformed function, arising when the Mellin integral operates on the fractional derivatives, may be overcame. Then, the solution may be found for any fractional differential equation involving multi-order fractional derivatives (or integrals). The solution is found in the Mellin domain, by solving a linear set of algebraic equations, whose inverse transform gives the solution of the fractional differential equation at hands.     

Computational Krylov‐based methods for large‐scale differential Sylvester matrix problems

In the present paper, we propose Krylov‐based methods for solving large‐scale differential Sylvester matrix equations having a low‐rank constant term. We present two new approaches for solving such differential matrix equations. The first approach is based on the integral expression of the exact solution and a Krylov method for the computation of the exponential of a matrix times a block of vectors. In the second approach, we first project the initial problem onto a block (or extended block) Krylov subspace and get a low‐dimensional differential Sylvester matrix equation. The latter problem is then solved by some integration numerical methods such as the backward differentiation formula or Rosenbrock method, and the obtained solution is used to build the low‐rank approximate solution of the original problem. We give some new theoretical results such as a simple expression of the residual norm and upper bounds for the norm of the error. Some numerical experiments are given in order to compare the two approaches.     

On the solution of the non-local parabolic partial differential equations via radial basis functions

In this paper, the problem of solving the one-dimensional parabolic partial differential equation subject to given initial and non-local boundary conditions is considered. The approximate solution is found using the radial basis functions collocation method. There are some difficulties in computing the solution of the time dependent partial differential equations using radial basis functions. If time and space are discretized using radial basis functions, the resulted coefficient matrix will be very ill-conditioned and so the corresponding linear system cannot be solved easily. As an alternative method for solution, we can use finite-difference methods for discretization of time and radial basis functions for discretization of space. Although this method is easy to use but an accurate solution cannot be provided. In this work an efficient collocation method is proposed for solving non-local parabolic partial differential equations using radial basis functions. Numerical results are presented and are compared with some existing methods.     

Method of weighted residuals as applied to nonlinear differential equations

A new method for solving a class of nonlinear boundary-value problems is presented. In this method, the nonlinear equation is linearized by guessing an initial solution and using it to evaluate the nonlinear terms. Next, a method of weighted residuals is applied to transform the linearized form of the boundary value problem to an initial value problem. The second (improved) solution is obtained by integrating the initial value problem by a fourth order Runge-Kutta scheme. The entire process is repeated until a desired convergence criterion is achieved.     

Nonlinear Chebyshev fitting from the solution of ordinary differential equations

The nonlinear Chebyshev approximation of real-valued data is considered where the approximating functions are generated from the solution of parameter dependent initial value problems in ordinary differential equations. A theory for this process applied to the approximation of continuous functions on a continuum is developed by the authors in [17]. This is briefly described and extended to approximation on a discrete set. A much simplified proof of the local Haar condition is given. Some algorithmic details are described along with numerical examples of best approximations computed by the Exchange algorithm and a Gauss-Newton type method.     

One-Step Hybrid Block Method Containing Third Derivatives and Improving Strategies for Solving Bratu's and Troesch's Problems

In this paper, we develop a one-step hybrid block method for solving boundary value problems, which is applied to the classical one-dimensional Bratu's and Troesch's problems. The convergence analysis of the new technique is discussed, and some improving strategies are considered to get better performance of the method. The proposed approach produces discrete approximations at the grid points, obtained after solving an algebraic system of equations. The solution of this system is obtained through a homotopy-type strategy used to provide the starting points needed by Newton's method. Some numerical experiments are presented to show the performance and effectiveness of the proposed approach in comparison with other methods that appeared in the literature.     

Implicit Interval Methods for Solving the Initial Value Problem

Implicit interval methods of Runge–Kutta and Adams–Moulton type for solving the initial value problem are proposed. It can be proved that the exact solution of the problem belongs to interval-solutions obtained by the considered methods. Furthermore, it is possible to estimate the widths of interval-solutions.     

A numerical scheme based on mean value solutions for the helmholtz equation on triangular grids

A numerical treatment for the Dirichlet boundary value problem on regular triangular grids for homogeneous Helmholtz equations is presented, which also applies to the convection-diffusion problems. The main characteristic of the method is that an accuracy estimate is provided in analytical form with a better evaluation than that obtained with the usual finite difference method. Besides, this classical method can be seen as a truncated series approximation to the proposed method. The method is developed from the analytical solutions for the Dirichlet problem on a ball together with an error evaluation of an integral on the corresponding circle, yielding accuracy. Some numerical examples are discussed and the results are compared with other methods, with a consistent advantage to the solution obtained here.

     

On the computation of solutions of systems of interval polynomial equations

Systems of algebraic equations with interval coefficients are very common in several areas of engineering sciences. The computation of the solution of such systems is a central problem when the characterization of the variables related by such systems is desired.In this paper we characterize the solution of systems of algebraic equations with real interval coefficients. The characterization is obtained considering the approach introduced in J. Comput. Appl. Math. 136 (2001) 271.     

A method of solving evolutionary problems based on the Laguerre step-by-step transform

In [1], Mikhailenko proposed a method of solving dynamic problems of elasticity theory. The method is based on the Laguerre transform with respect to time. In this paper, we propose a modification of this approach, applying the Laguerre transform to a sequence of finite time intervals. The solution obtained at the end of one time interval is used as initial data for solving the problem on the next time interval. To implement the approach, four parameters are chosen: a scale factor to approximate the solution by Laguerre functions, an exponential coefficient of a weight function that is used for finding a solution on a finite time interval, the duration of this interval, and the number of projections of the Laguerre transform. A way to find parameters that provide stability of calculations is proposed. The effect of the parameters on the accuracy of calculations when using second- and fourth-order difference schemes is studied. It is shown that the approach makes it possible to obtain a high-accuracy solution on large time intervals.     

Recovering a tsunami source and designing an observational system based on an <Emphasis Type="Italic">r</Emphasis>-solution method

A theoretical approach to recovering the initial tsunami waveform proposed by the author is applied to a real tsunami event. The approach is based on least squares and truncated singular value decomposition techniques. The problem of recovering a tsunami source from available measurements of the incomingwave is considered as an inverse problem ofmathematical physics. To avoid potential instability of the numerical solution, an r-solution method is used. An observation system for retrieving the initial tsunami waveform is optimally configured by using this approach. Several numerical simulations with real tsunami data are presented.