Scopus İndeksli Yayınlar Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/8651
Browse
5 results
Search Results
Article Citation - WoS: 20Citation - Scopus: 19A Highly Accurate Jacobi Collocation Algorithm for Systems of High-Order Linear Differential-Difference Equations With Mixed Initial Conditions(Wiley, 2015) Doha, E. H.; Baleanu, D.; Hafez, R. M.; Bhrawy, A. H.In this paper, a shifted Jacobi-Gauss collocation spectral algorithm is developed for solving numerically systems of high-order linear retarded and advanced differential-difference equations with variable coefficients subject to mixed initial conditions. The spatial collocation approximation is based upon the use of shifted Jacobi-Gauss interpolation nodes as collocation nodes. The system of differential-difference equations is reduced to a system of algebraic equations in the unknown expansion coefficients of the sought-for spectral approximations. The convergence is discussed graphically. The proposed method has an exponential convergence rate. The validity and effectiveness of the method are demonstrated by solving several numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the results obtained by other methods and with the exact solutions more easier. Copyright (C) 2015 John Wiley & Sons, Ltd.Article Citation - WoS: 99Citation - Scopus: 110A New Jacobi Rational-Gauss Collocation Method for Numerical Solution of Generalized Pantograph Equations(Elsevier, 2014) Bhrawy, A. H.; Baleanu, D.; Hafez, R. M.; Doha, E. H.This paper is concerned with a generalization of a functional differential equation known as the pantograph equation which contains a linear functional argument. In this article, a new spectral collocation method is applied to solve the generalized pantograph equation with variable coefficients on a semi-infinite domain. This method is based on Jacobi rational functions and Gauss quadrature integration. The Jacobi rational-Gauss method reduces solving the generalized pantograph equation to a system of algebraic equations. Reasonable numerical results are obtained by selecting few Jacobi rational-Gauss collocation points. The proposed Jacobi rational-Gauss method is favorably compared with other methods. Numerical results demonstrate its accuracy, efficiency, and versatility on the half-line. (C) 2013 IMACS. Published by Elsevier B.V. All rights reserved.Article Citation - WoS: 76Citation - Scopus: 82On Shifted Jacobi Spectral Approximations for Solving Fractional Differential Equations(Elsevier Science inc, 2013) Bhrawy, A. H.; Baleanu, D.; Ezz-Eldien, S. S.; Doha, E. H.In this paper, a new formula of Caputo fractional-order derivatives of shifted Jacobi polynomials of any degree in terms of shifted Jacobi polynomials themselves is proved. We discuss a direct solution technique for linear multi-order fractional differential equations (FDEs) subject to nonhomogeneous initial conditions using a shifted Jacobi tau approximation. A quadrature shifted Jacobi tau (Q-SJT) approximation is introduced for the solution of linear multi-order FDEs with variable coefficients. We also propose a shifted Jacobi collocation technique for solving nonlinear multi-order fractional initial value. problems. The advantages of using the proposed techniques are discussed and we compare them with other existing methods. We investigate some illustrative examples of FDEs including linear and nonlinear terms. We demonstrate the high accuracy and the efficiency of the proposed techniques. (C) 2013 Elsevier Inc. All rights reserved.Article Citation - WoS: 4Citation - Scopus: 6Modified Jacobi-Bernstein Basis Transformation and Its Application To Multi-Degree Reduction of Bezier Curves(Elsevier Science Bv, 2016) Doha, E. H.; Saker, M. A.; Baleanu, D.; Bhrawy, A. H.This paper reports new modified Jacobi polynomials (MJPs). We derive the basis transformation between MJPs and Bernstein polynomials and vice versa. This transformation is merging the perfect Least-square performance of the new polynomials together with the geometrical insight of Bernstein polynomials. The MJPs with indexes corresponding to the number of endpoints constraints are the natural basis functions for Least-square approximation of Bezier curves. Using MJPs leads us to deal with the constrained Jacobi polynomials and the unconstrained Jacobi polynomials as orthogonal polynomials. The MJPs are automatically satisfying the homogeneous boundary conditions. Thereby, the main advantage of using MJPs, in multi-degree reduction of Bezier curves on computer aided geometric design (CAGD), is that the constraints in CAGD are also satisfied and that decreases the steps of multi-degree reduction algorithm. Several numerical results for the multi-degree reduction of Bezier curves on CAGD are given. (C) 2016 Elsevier B.V. All rights reserved.Article Citation - WoS: 203Citation - Scopus: 217A Spectral Tau Algorithm Based on Jacobi Operational Matrix for Numerical Solution of Time Fractional Diffusion-Wave Equations(Academic Press inc Elsevier Science, 2015) Doha, E. H.; Baleanu, D.; Ezz-Eldien, S. S.; Bhrawy, A. H.In this paper, an efficient and accurate spectral numerical method is presented for solving second-, fourth-order fractional diffusion-wave equations and fractional wave equations with damping. The proposed method is based on Jacobi tau spectral procedure together with the Jacobi operational matrix for fractional integrals, described in the Riemann-Liouville sense. The main characteristic behind this approach is to reduce such problems to those of solving systems of algebraic equations in the unknown expansion coefficients of the sought-for spectral approximations. The validity and effectiveness of the method are demonstrated by solving five numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the results obtained by other methods and with the exact solutions more easier. (C) 2014 Elsevier Inc. All rights reserved.