2018-11-17T15:24:09Z
http://cmde.tabrizu.ac.ir/?_action=export&rf=summon&issue=662
Computational Methods for Differential Equations
Comput. Methods Differ. Equ.
2345-3982
2345-3982
2015
3
1
Monodromy problem for the degenerate critical points
Razie
Shafeii Lashkarian
Dariush
Behmardi Sharifabad
For the polynomial planar vector fields with a hyperbolic or nilpotent critical point at the origin, the monodromy problem has been solved, but for the strongly degenerate critical points this problem is still open. When the critical point is monodromic, the stability problem or the center- focus problem is an open problem too. In this paper we will consider the polynomial planar vector fields with a degenerate critical point at the origin. At first we give some normal form for the systems which has no characteristic directions. Then we consider the systems with some characteristic directions at which the origin is still a monodromic critical point and we give a monodromy criterion. Finally we clarify our work by some examples.
Monodromy problem
degenerate critical point
hyperbolic critical point
nilpotent critical point
blow up method
2015
01
01
1
13
http://cmde.tabrizu.ac.ir/article_3773_abd632cbb0a50fae55f87a7fd04abd3b.pdf
Computational Methods for Differential Equations
Comput. Methods Differ. Equ.
2345-3982
2345-3982
2015
3
1
Brenstien polynomials and its application to fractional differential equation
Hammad
Khalil
Rahmat
Khan
M.
Rashidi
The paper is devoted to the study of Brenstien Polynomials and development of some new operational matrices of fractional order integrations and derivatives. The operational matrices are used to convert fractional order differential equations to systems of algebraic equations. A simple scheme yielding accurate approximate solutions of the couple systems for fractional differential equations is developed. The scheme is designed such a way that it can be easily simulated with any computational software. The efficiency of proposed method verified by some test problems.
Brenstien polynomials,Coupled system
Fractional differential equations
operational matrices of integrations
Numerical simulations
2015
01
01
14
35
http://cmde.tabrizu.ac.ir/article_3798_54b86cd79ac7d1a5e159da4320fe9f5a.pdf
Computational Methods for Differential Equations
Comput. Methods Differ. Equ.
2345-3982
2345-3982
2015
3
1
Discrete Galerkin Method for Higher Even-Order Integro-Differential Equations with Variable Coefficients
Mahdiye
Gholipour
Payam
Mokhtary
This paper presents discrete Galerkin method for obtaining the numerical solution of higher even-order integro-differential equations with variable coefficients. We use the generalized Jacobi polynomials with indexes corresponding to the number of homogeneous initial conditions as natural basis functions for the approximate solution. Numerical results are presented to demonstrate the effectiveness and wellposedness of the proposed method. In addition, the results obtained are compared with those obtained by well known Pseudospectral method, thereby confirming the superiority of our proposed scheme.
Discrete Galerkin method
Generalized Jacobi polynomials
Higher even-order Integro-Differential Equations
2015
01
01
36
44
http://cmde.tabrizu.ac.ir/article_3799_b43e56719f7a409023def050c681084e.pdf
Computational Methods for Differential Equations
Comput. Methods Differ. Equ.
2345-3982
2345-3982
2015
3
1
A continuous approximation fitting to the discrete distributions using ODE
Hossein
Bevrani
The probability density functions fitting to the discrete probability functions has always been needed, and very important. This paper is fitting the continuous curves which are probability density functions to the binomial probability functions, negative binomial geometrics, poisson and hypergeometric. The main key in these fittings is the use of the derivative concept and common differential equations.
Ordinary differential equations
Probability density functions
Pearson's family distribution
2015
01
01
45
50
http://cmde.tabrizu.ac.ir/article_3800_f745eda5291740921262040f296adf0c.pdf
Computational Methods for Differential Equations
Comput. Methods Differ. Equ.
2345-3982
2345-3982
2015
3
1
A new family of four-step fifteenth-order root-finding methods with high efficiency index
Tahereh
Eftekhari
In this paper a new family of fifteenth-order methods with high efficiency index is presented. This family include four evaluations of the function and one evaluation of its first derivative per iteration. Therefore, this family of methods has the efficiency index which equals 1.71877. In order to show the applicability and validity of the class, some numerical examples are discussed.
Nonlinear equations
Ostrowski's method
Order of convergence
Efficiency index
2015
01
01
51
58
http://cmde.tabrizu.ac.ir/article_3885_c17d30902b762fd0dc8d52a6e041e419.pdf
Computational Methods for Differential Equations
Comput. Methods Differ. Equ.
2345-3982
2345-3982
2015
3
1
Application of the new extended (G'/G) -expansion method to find exact solutions for nonlinear partial differential equation
Md. Nur
Alam
Md.
Mashiar Rahman
Md.
Rafiqul Islam
Harun-Or-
Roshid
In recent years, numerous approaches have been utilized for finding the exact solutions to nonlinear partial differential equations. One such method is known as the new extended (G'/G)-expansion method and was proposed by Roshid et al. In this paper, we apply this method and achieve exact solutions to nonlinear partial differential equations (NLPDEs), namely the Benjamin-Ono equation. It is establish that the method by Roshid et al. is a very well-organized method which can be used to find exact solutions of a large number of NLPDEs.
New extended (G'/G)-expansion method
the Benjamin-Ono equation
exact solutions
2015
01
01
59
69
http://cmde.tabrizu.ac.ir/article_3886_2bd1c0b9a5f11541d167f7414573fda6.pdf