Browsing by Author "Bhrawy, A. H."
Now showing 1 - 20 of 25
- Results Per Page
- Sort Options
Item A Chebyshev-Gauss-Radau Scheme For Nonlinear Hyperbolic System Of First Order(NATURAL SCIENCES PUBLISHING CORP-NSP, 2014) Doha, E. H.; Bhrawy, A. H.; Hafez, R. M.; Abdelkawy, M. A.A numerical approximation of the initial-boundary system of nonlinear hyperbolic equations based on spectral collocation method is presented in this article. A Chebyshev-Gauss-Radau collocation (C-GR-C) method in combination with the implicit Runge-Kutta scheme are employed to obtain highly accurate approximations to the mentioned problem. The collocation points are the Chebyshev interpolation nodes. This approach reduces this problem to solve system of nonlinear ordinary differential equations which are far easier to be solved. Indeed, by selecting a limited number of collocation nodes, we obtain an accurate results. The numerical examples demonstrate the accuracy, efficiency, and versatility of the method.Item An efficient collocation algorithm for multidimensional wave type equations with nonlocal conservation conditions(ELSEVIER SCIENCE INC, 2015) Bhrawy, A. H.; Doha, E. H.; Abdelkawy, M. A.; Hafez, R. M.In this paper, we derive and analyze an efficient spectral collocation algorithm to solve numerically some wave equations subject to initial-boundary nonlocal conservation conditions in one and two space dimensions. The Legendre pseudospectral approximation is investigated for spatial approximation of the wave equations. The Legendre-Gauss-Lobatto quadrature rule is established to treat the nonlocal conservation conditions, and then the problem with its nonlocal conservation conditions are reduced to a system of ODEs in time. As a theoretical result, we study the convergence of the solution for the one-dimensional case. In addition, the proposed method is extended successfully to the two-dimensional case. Several numerical examples with comparisons are given. The computational results indicate that the proposed method is more accurate than finite difference method, the method of lines and spline collocation approach. (C) 2015 Elsevier Inc. All rights reserved.Item Efficient Jacobi-Gauss Collocation Method for Solving Initial Value Problems of Bratu Type(PLEIADES PUBLISHING INC, 2013) Doha, E. H.; Bhrawy, A. H.; Baleanu, D.; Hafez, R. M.In this paper, we propose the shifted Jacobi-Gauss collocation spectral method for solving initial value problems of Bratu type, which is widely applicable in fuel ignition of the combustion theory and heat transfer. The spatial approximation is based on shifted Jacobi polynomials J(n)((alpha, beta))(x) with alpha, beta is an element of (-1, infinity), x is an element of [0, 1] and n the polynomial degree. The shifted Jacobi-Gauss points are used as collocation nodes. Illustrative examples have been discussed to demonstrate the validity and applicability of the proposed technique. Comparing the numerical results of the proposed method with some well-known results show that the method is efficient and gives excellent numerical results.Item An Efficient Legendre Spectral Tau Matrix Formulation for Solving Fractional Subdiffusion and Reaction Subdiffusion Equations(ASME, 2015) Doha, E. H.; Bhrawy, A. H.; Ezz-Eldien, S. S.n this work, we discuss an operational matrix approach for introducing an approximate solution of the fractional subdiffusion equation (FSDE) with both Dirichlet boundary conditions (DBCs) and Neumann boundary conditions (NBCs). We propose a spectral method in both temporal and spatial discretizations for this equation. Our approach is based on the space-time shifted Legendre tau-spectral method combined with the operational matrix of 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. In addition, this approach is also investigated for solving the FSDE with the variable coefficients and the fractional reaction subdiffusion equation (FRSDE). For conforming the validity and accuracy of the numerical scheme proposed, four numerical examples with their approximate solutions are presented. Also, comparisons between our numerical results and those obtained by compact finite difference method (CFDM), Box-type scheme (B-TS), and FDM with Fourier analysis (FA) are introduced.Item An Efficient Numerical Scheme for Solving Multi-Dimensional Fractional Optimal Control Problems With a Quadratic Performance Index(WILEY, 2015) Bhrawy, A. H.; Doha, E. H.; Tenreiro Machado, J. A.; Ezz-Eldien, S. S.The shifted Legendre orthogonal polynomials are used for the numerical solution of a new formulation for the multi-dimensional fractional optimal control problem (M-DFOCP) with a quadratic performance index. The fractional derivatives are described in the Caputo sense. The Lagrange multiplier method for the constrained extremum and the operational matrix of fractional integrals are used together with the help of the properties of the shifted Legendre orthonormal polynomials. The method reduces the M-DFOCP to a simpler problem that consists of solving a system of algebraic equations. For confirming the efficiency and accuracy of the proposed scheme, some test problems are implemented with their approximate solutions.Item GENERALIZED LAGUERRE-GAUSS-RADAU SCHEME FOR FIRST ORDER HYPERBOLIC EQUATIONS ON SEMI-INFINITE DOMAINS(EDITURA ACAD ROMANE, 2015) Bhrawy, A. H.; Hafez, R. M.; Alzahrani, E. O.; Baleanu, D.In this article, we develop a numerical approximation for first-order hyperbolic equations on semi-infinite domains by using a spectral collocation scheme. First, we propose the generalized Laguerre-Gauss-Radau collocation scheme for both spatial and temporal discretizations. This in turn reduces the problem to the obtaining of a system of algebraic equations. Second, we use a Newton iteration technique to solve it. Finally, the obtained results are compared with the exact solutions, highlighting the performance of the proposed numerical methodItem Integrals of Bernstein polynomials: An application for the solution of high even-order differential equations(PERGAMON-ELSEVIER SCIENCE LTD, 2011) Doha, E. H.; Bhrawy, A. H.; Saker, M. A.A new explicit formula for the integrals of Bernstein polynomials of any degree for any order in terms of Bernstein polynomials themselves is derived. A fast and accurate algorithm is developed for the solution of high even-order boundary value problems (BVPs) with two point boundary conditions but by considering their integrated forms. The Bernstein-Petrov-Galerkin method (BPG) is applied to construct the numerical solution for such problems. The method is then tested on examples and compared with other methods. It is shown that the BPG yields better results. (C) 2010 Elsevier Ltd. All rights reserved.Item A Jacobi Dual-Petrov-Galerkin Method for Solving Some Odd-Order Ordinary Differential Equations(HINDAWI PUBLISHING CORPORATION, 2011) Doha, E. H.; Bhrawy, A. H.; Hafez, R. M.A Jacobi dual-Petrov-Galerkin (JDPG) method is introduced and used for solving fully integrated reformulations of third- and fifth-order ordinary differential equations (ODEs) with constant coefficients. The reformulated equation for the Jth order ODE involves n-fold indefinite integrals for n = 1, ... , J. Extension of the JDPG for ODEs with polynomial coefficients is treated using the Jacobi-Gauss-Lobatto quadrature. Numerical results with comparisons are given to confirm the reliability of the proposed method for some constant and polynomial coefficients ODEs.Item A Jacobi rational pseudospectral method for Lane-Emden initial value problems arising in astrophysics on a semi-infinite interval(SPRINGER HEIDELBERG, 2014) Doha, E. H.; Bhrawy, A. H.; Hafez, R. M.; Van Gorder, Robert A.We derive an operational matrix representation for the differentiation of Jacobi rational functions, which is used to create a new Jacobi rational pseudo spectral method based on the operational matrix of Jacobi rational functions. This Jacobi rational pseudospectral method is implemented to approximate solutions to Lane-Emden type equations on semi-infinite intervals. The advantages of using the Jacobi rational pseudospectral method over other techniques are discussed. Indeed, through several numerical examples, including the Lane-Emden problems of first and second kind, we evaluate the accuracy and performance of the proposed method. We also compare our method to other approaches in the literature. The results suggest that the Jacobi rational pseudospectral method is a useful tool for studying Lane-Emden initial value problems, as well as related problems which have regular singular points and are nonlinear.Item A Jacobi-Jacobi dual-Petrov-Galerkin method for third- and fifth-order differential equations(PERGAMON-ELSEVIER SCIENCE LTD, 2011) Doha, E. H.; Bhrawy, A. H.; Hafez, R. M.; https://cutt.ly/hePtIOEhis paper analyzes a method for solving the third-and fifth-order differential equations with constant coefficients using a Jacobi dual-Petrov-Galerkin method, which is more reasonable than the standard Galerkin one. The spatial approximation is based on Jacobi polynomials P-n((alpha,beta)) with alpha,beta is an element of (-1,infinity) and n is the polynomial degree. By choosing appropriate base functions, the resulting system is sparse and the method can be implemented efficiently. A Jacobi-Jacobi dual-Petrov-Galerkin method for the differential equations with variable coefficients is developed. This method is based on the Petrov-Galerkin variational form of one Jacobi polynomial class, but the variable coefficients and the right-hand terms are treated by using the Gauss-Lobatto quadrature form of another Jacobi class. Numerical results illustrate the theory and constitute a convincing argument for the feasibility of the proposed numerical methods. (C) 2011 Elsevier Ltd. All rights reserved.Item Modified Jacobi-Bernstein basis transformation and its application to multi-degree reduction of Bezier curves(ELSEVIER SCIENCE BV, 2016) Bhrawy, A. H.; Doha, E. H.; Saker, M. A.; Baleanu, D.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.Item A NEW COLLOCATION SCHEME FOR SOLVING HYPERBOLIC EQUATIONS OF SECOND ORDER IN A SEMI-INFINITE DOMAIN(EDITURA ACAD ROMANE, 2016) Hafez, R. M.; Abdelkawy, M. A.; Doha, E. H.; Bhrawy, A. H.This paper reports a new fully collocation algorithm for the numerical solution of hyperbolic partial differential equations of second order in a semi-infinite domain, using Jacobi rational Gauss-Radau collocation method. The widely applicable, efficiency, and high accuracy are the key advantages of the collocation method. The series expansion in Jacobi rational functions is the main step for solving the mentioned problems. The expansion coefficients are then determined by reducing the hyperbolic equations with their boundary and initial conditions to a system of algebraic equations for these coefficients. This system may be solved analytically or numerically in a step-by-step manner by using Newton's iterative method. Numerical results are consistent with the theoretical analysis and indicate the high accuracy and effectiveness of this algorithm.Item A new Jacobi rational-Gauss collocation method for numerical solution of generalized pantograph equations(ELSEVIER SCIENCE BV, 2014) Bhrawy, A. H.; Doha, E. H.; Baleanu, D.; Hafez, R. M.his 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.Item A new Jacobi spectral collocation method for solving 1+1 fractional Schrodinger equations and fractional coupled Schrodinger systems(SPRINGER HEIDELBERG, 2014) Bhrawy, A. H.; Doha, E. H.; Ezz-Eldien, S. S.; Van Gorder, Robert A.The Jacobi spectral collocation method (JSCM) is constructed and used in combination with the operational matrix of fractional derivatives (described in the Caputo sense) for the numerical solution of the time-fractional Schrodinger equation (T-FSE) and the space-fractional Schrodinger equation (S-FSE). The main characteristic behind this approach is that it reduces such problems to those of solving a system of algebraic equations, which greatly simplifies the solution process. In addition, the presented approach is also applied to solve the time-fractional coupled Schrodinger system (T-FCSS). In order to demonstrate the validity and accuracy of the numerical scheme proposed, several numerical examples with their approximate solutions are presented with comparisons between our numerical results and those obtained by other methods.Item A numerical approach based on Legendre orthonormal polynomials for numerical solutions of fractional optimal control problems(SAGE PUBLICATIONS LTD, 2017) Ezz-Eldien, S. S.; Doha, E. H.; Baleanu, D.; Bhrawy, A. H.The numerical solution of a fractional optimal control problem having a quadratic performance index is proposed and analyzed. The performance index of the fractional optimal control problem is considered as a function of both the state and the control variables. The dynamic constraint is expressed as a fractional differential equation that includes an integer derivative in addition to the fractional derivative. The order of the fractional derivative is taken as less than one and described in the Caputo sense. Based on the shifted Legendre orthonormal polynomials, we employ the operational matrix of fractional derivatives, the Legendre-Gauss quadrature formula and the Lagrange multiplier method for reducing such a problem into a problem consisting of solving a system of algebraic equations. The convergence of the proposed method is analyzed. For confirming the validity and accuracy of the proposed numerical method, a numerical example is presented along with a comparison between our numerical results and those obtained using the Legendre spectral-collocation method.Item Numerical solution of initial-boundary system of nonlinear hyperbolic equations(INDIAN NAT SCI ACAD, 2015) Doha, EH; Bhrawy, A. H.; Abdelkawy, M. A.; Hafez, R. M.In this article, we present a numerical approximation of the initial-boundary system of nonlinear hyperbolic equations based on spectral Jacobi-Gauss-Radau collocation (J-GR-C) method. A J-GR-C method in combination with the implicit Runge-Kutta scheme are employed to obtain a highly accurate approximation to the mentioned problem. J-GR-C method, based on Jacobi polynomials and Gauss-Radau quadrature integration, reduces solving the system of nonlinear hyperbolic equations to solve a system of nonlinear ordinary differential equations (SNODEs). In the examples given, numerical results by the J-GR-C method are compared with the exact solutions. In fact, by selecting relatively few J-GR-C points, we are able to get very accurate approximations. In this way, the results show that this method has a good accuracy and efficiency for solving coupled partial differential equations.Item NUMERICAL SOLUTIONS OF TWO-DIMENSIONAL MIXED VOLTERRA-FREDHOLM INTEGRAL EQUATIONS VIA BERNOULLI COLLOCATION METHOD(EDITURA ACAD ROMANE, 2017) Hafez, R. M.; Doha, E. H.; Bhrawy, A. H.; Baleanu, D.The mixed Volterra-Fredholm integral equations (VFIEs) arise in various physical and biological models. The main purpose of this article is to propose and analyze efficient Bernoulli collocation techniques for numerically solving classes of two-dimensional linear and nonlinear mixed VFIEs. The novel aspect of the technique is that it reduces the problem under consideration to a system of algebraic equations by using the Gauss-Bernoulli nodes. One of the main advantages of the present approach is its superior accuracy. Consequently, good results can be obtained even by using a relatively small number of collocation nodes. In addition, several numerical results are given to illustrate the features of the proposed technique.Item A numerical technique based on the shifted Legendre polynomials for solving the time-fractional coupled KdV equations(SPRINGER-VERLAG ITALIA SRL, 2016) Bhrawy, A. H.; Doha, E. H.; Ezz-Eldien, S. S.; Abdelkawy, M. A.The time-fractional coupled Korteweg-de Vries (KdV) system is a generalization of the classical coupled KdV system and obtained by replacing the first order time derivatives by fractional derivatives of orders nu(1) and nu(2), (0 < nu(1), nu(2) <= 1). In this paper, an accurate and robust numerical technique is proposed for solving the time-fractional coupled KdV equations. The shifted Legendre polynomials are introduced as basis functions of the collocation spectral method together with the operational matrix of fractional derivatives (described in the Caputo sense) in order to reduce the time-fractional coupled KdV equations into a problem consisting of a system of algebraic equations that greatly simplifies the problem. In order to test the efficiency and validity of the proposed numerical technique, we apply it to solve two numerical examples.Item On Generalized Jacobi-Bernstein Basis Transformation: Application of Multidegree Reduction of Bezier Curves and Surfaces(ASME, 2014) Doha, E. H.; Bhrawy, A. H.; Saker, M. A.This paper formulates a new explicit expression for the generalized Jacobi polynomials (GJPs) in terms of Bernstein basis. We also establish and prove the basis transformation between the GJPs basis and Bernstein basis and vice versa. This transformation embeds the perfect least-square performance of the GJPs with the geometrical insight of the Bernstein form. Moreover, the GJPs with indexes corresponding to the number of endpoint constraints are the natural basis functions for least-square approximation of Bezier curves and surfaces. Application to multidegree reduction (MDR) of Bezier curves and surfaces in computer aided geometric design (CAGD) is given.Item On shifted Jacobi spectral method for high-order multi-point boundary value problems(ELSEVIER, 2012) Doha, E. H.; Bhrawy, A. H.; Hafez, R. M.This paper reports a spectral tau method for numerically solving multi-point boundary value problems (BVPs) of linear high-order ordinary differential equations. The construction of the shifted Jacobi tau approximation is based on conventional differentiation. This use of differentiation allows the imposition of the governing equation at the whole set of grid points and the straight forward implementation of multiple boundary conditions. Extension of the tau method for high-order multi-point BVPs with variable coefficients is treated using the shifted Jacobi Gauss-Lobatto quadrature. Shifted Jacobi collocation method is developed for solving nonlinear high-order multi-point BVPs. The performance of the proposed methods is investigated by considering several examples. Accurate results and high convergence rates are achieved. (C) 2012 Elsevier B.V. All rights reserved.