scholarly journals Numerical Solution of Duffing Equation by Using an Improved Taylor Matrix Method

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Berna Bülbül ◽  
Mehmet Sezer
Keyword(s):  
Matrix Method ◽  
Numerical Approach ◽  
Duffing Equation ◽  
Matrix Equations ◽  
Algebraic Equations ◽  
Solution Function ◽  
Numerical Examples ◽  
Collocation Points ◽  
Nonlinear Algebraic Equations ◽  
The Matrix

We have suggested a numerical approach, which is based on an improved Taylor matrix method, for solving Duffing differential equations. The method is based on the approximation by the truncated Taylor series about center zero. Duffing equation and conditions are transformed into the matrix equations, which corresponds to a system of nonlinear algebraic equations with the unknown coefficients, via collocation points. Combining these matrix equations and then solving the system yield the unknown coefficients of the solution function. Numerical examples are included to demonstrate the validity and the applicability of the technique. The results show the efficiency and the accuracy of the present work. Also, the method can be easily applied to engineering and science problems.

scholarly journals A Numerical Approach Based on Taylor Polynomials for Solving a Class of Nonlinear Differential Equations

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
C. Guler ◽  
S. O. Kaya
Keyword(s):  
Differential Equations ◽  
Nonlinear Differential Equations ◽  
Numerical Approach ◽  
The Other ◽  
Algebraic Equations ◽  
Numerical Examples ◽  
Taylor Coefficients ◽  
Collocation Points ◽  
Nonlinear Algebraic Equations ◽  
Taylor Polynomials

In this study, a matrix method based on Taylor polynomials and collocation points is presented for the approximate solution of a class of nonlinear differential equations, which have many applications in mathematics, physics and engineering. By means of matrix forms of the Taylor polynomials and their derivatives, the technique we have used reduces the solution of the nonlinear equation with mixed conditions to the solution of a matrix equation which corresponds to a system of nonlinear algebraic equations with the unknown Taylor coefficients. On the other hand, to illustrate the validity and applicability of the method, some numerical examples together with residual error analysis are performed and the obtained results are compared with the existing results in literature.

Legendre Collocation Method to Solve the Riccati Equations with Functional Arguments

2020 ◽  
Vol 17 (10) ◽  
pp. 2050011
Author(s):  
Şuayip Yüzbaşı ◽  
Gamze Yıldırım
Keyword(s):  
Approximate Solutions ◽  
Coefficient Matrix ◽  
Numerical Results ◽  
Matrix Form ◽  
Algebraic Equations ◽  
Mixed Condition ◽  
Collocation Points ◽  
Nonlinear Algebraic Equations ◽  
The Matrix ◽  
Legendre Collocation Method

In this study, a method for numerically solving Riccatti type differential equations with functional arguments under the mixed condition is presented. For the method, Legendre polynomials, the solution forms and the required expressions are written in the matrix form and the collocation points are defined. Then, by using the obtained matrix relations and the collocation points, the Riccati problem is reduced to a system of nonlinear algebraic equations. The condition in the problem is written in the matrix form and a new system of the nonlinear algebraic equations is found with the aid of the obtained matrix relation. This system is solved and thus the coefficient matrix is detected. This coefficient matrix is written in the solution form and hence approximate solution is obtained. In addition, by defining the residual function, an error problem is established and approximate solutions which give better numerical results are obtained. To demonstrate that the method is trustworthy and convenient, the presented method and error estimation technique are explicated by numerical examples. Consequently, the numerical results are shown more clearly with the aid of the tables and graphs and also the results are compared with the results of other methods.

scholarly journals Solving Fuzzy Volterra Integrodifferential Equations of Fractional Order by Bernoulli Wavelet Method

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
R. Mastani Shabestari ◽  
R. Ezzati ◽  
T. Allahviranloo
Keyword(s):  
Integrodifferential Equation ◽  
Matrix Equation ◽  
Matrix Method ◽  
Integrodifferential Equations ◽  
Algebraic Equations ◽  
Wavelet Method ◽  
Collocation Points ◽  
Nonlinear Algebraic Equations ◽  
Bernoulli Wavelet ◽  
Fractional Integrodifferential Equation

A matrix method called the Bernoulli wavelet method is presented for numerically solving the fuzzy fractional integrodifferential equations. Using the collocation points, this method transforms the fuzzy fractional integrodifferential equation to a matrix equation which corresponds to a system of nonlinear algebraic equations with unknown coefficients. To illustrate the method, it is applied to certain fuzzy fractional integrodifferential equations, and the results are compared.

scholarly journals New Numerical Approach for Solving Abel’s Integral Equations

2021 ◽  
Vol 46 (3) ◽  
pp. 255-271
Author(s):  
Ayşe Anapalı Şenel ◽  
Yalçın Öztürk ◽  
Mustafa Gülsu
Keyword(s):  
Integral Equation ◽  
Integral Equations ◽  
Efficient Method ◽  
Fractional Derivatives ◽  
Numerical Approach ◽  
Main Character ◽  
Algebraic Equations ◽  
Solution Function ◽  
Numerical Examples ◽  
Taylor Expansions

Abstract In this article, we present an efficient method for solving Abel’s integral equations. This important equation is consisting of an integral equation that is modeling many problems in literature. Our proposed method is based on first taking the truncated Taylor expansions of the solution function and fractional derivatives, then substituting their matrix forms into the equation. The main character behind this technique’s approach is that it reduces such problems to solving a system of algebraic equations, thus greatly simplifying the problem. Numerical examples are used to illustrate the preciseness and effectiveness of the proposed method. Figures and tables are demonstrated to solutions impress. Also, all numerical examples are solved with the aid of Maple.

Numerical solution of Abel equation using operational matrix method with Chebyshev polynomials

2017 ◽  
Vol 10 (03) ◽  
pp. 1750053 ◽  
Author(s):  
Yalçın Öztürk ◽  
Mustafa Gülsu
Keyword(s):  
Chebyshev Polynomials ◽  
Matrix Method ◽  
Numerical Scheme ◽  
Operational Matrix ◽  
Abel Equation ◽  
Operational Method ◽  
Algebraic Equations ◽  
Numerical Examples ◽  
Operational Matrix Method ◽  
Nonlinear Algebraic Equations

In this paper, we present a numerical scheme for solving the Abel equation. The approach is based on the shifted Chebyshev polynomials together with operational method. We reduce the problem to a set of nonlinear algebraic equations using operational matrix method. In addition, convergence analysis of the method is presented. Some numerical examples are given to demonstrate the validity and applicability of the method. The only a small number of Chebyshev polynomials is needed to obtain a satisfactory result.

scholarly journals A Pseudospectral Algorithm for Solving Multipantograph Delay Systems on a Semi-Infinite Interval Using Legendre Rational Functions

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
E. H. Doha ◽  
D. Baleanu ◽  
A. H. Bhrawy ◽  
R. M. Hafez
Keyword(s):  
Numerical Solutions ◽  
Rational Functions ◽  
Absolute Error ◽  
Delay Systems ◽  
Infinite Interval ◽  
Algebraic Equations ◽  
Collocation Points ◽  
Nonlinear Algebraic Equations ◽  
Linear And Nonlinear ◽  
Pseudospectral Scheme

A new Legendre rational pseudospectral scheme is proposed and developed for solving numerically systems of linear and nonlinear multipantograph equations on a semi-infinite interval. A Legendre rational collocation method based on Legendre rational-Gauss quadrature points is utilized to reduce the solution of such systems to systems of linear and nonlinear algebraic equations. In addition, accurate approximations are achieved by selecting few Legendre rational-Gauss collocation points. The numerical results obtained by this method have been compared with various exact solutions in order to demonstrate the accuracy and efficiency of the proposed method. Indeed, for relatively limited nodes used, the absolute error in our numerical solutions is sufficiently small.

scholarly journals A New Iterative Algorithm for Solving a Class of Matrix Nearness Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-6
Author(s):  
Xuefeng Duan ◽  
Chunmei Li
Keyword(s):  
Iterative Algorithm ◽  
Projection Algorithm ◽  
Frobenius Norm ◽  
Matrix Equations ◽  
Von Neumann ◽  
Numerical Examples ◽  
Matrix Nearness Problem ◽  
Least Frobenius Norm Solution ◽  
Alternating Projection ◽  
The Matrix

Based on the alternating projection algorithm, which was proposed by Von Neumann to treat the problem of finding the projection of a given point onto the intersection of two closed subspaces, we propose a new iterative algorithm to solve the matrix nearness problem associated with the matrix equations AXB=E, CXD=F, which arises frequently in experimental design. If we choose the initial iterative matrix X0=0, the least Frobenius norm solution of these matrix equations is obtained. Numerical examples show that the new algorithm is feasible and effective.

scholarly journals Second-Order Delay Differential Equations to Deal the Experimentation of Internet of Industrial Things via Haar Wavelet Approach

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yongtao Xuan ◽  
Rohul Amin ◽  
Fakhar Zaman ◽  
Zohaib Khan ◽  
Imad Ullah ◽  
...  
Keyword(s):  
Differential Equations ◽  
Delay Differential Equations ◽  
Numerical Approach ◽  
Haar Wavelet ◽  
Second Order ◽  
Algebraic Equations ◽  
Elimination Algorithm ◽  
Collocation Points ◽  
Delay Differential ◽  
Mean Square Errors

In this article, an efficient numerical approach for the solution of second-order delay differential equations to deal with the experimentation of the Internet of Industrial Things (IIoT) is presented. With the help of the Haar wavelet technique, the considered problem is transformed into a system of algebraic equations which is then solved for the required results by using Gauss elimination algorithm. Some numerical examples for convergence of the proposed technique are taken from the literature. Maximum absolute and root mean square errors are calculated for various collocation points. The results show that the Haar wavelet method is an effective method for solving delay differential equations of second order. The convergence rate is also measured for various collocation points, which is almost equal to 2.

Multiple Dynamic Response Patterns of Flexible Multibody Systems With Random Uncertain Parameters

2019 ◽  
Vol 14 (2) ◽  
Author(s):  
Zhe Wang ◽  
Qiang Tian ◽  
Haiyan Hu
Keyword(s):  
Dynamic Response ◽  
Multibody System ◽  
Uncertain Parameters ◽  
Response Patterns ◽  
Algebraic Equations ◽  
Flexible Multibody System ◽  
Random Parameters ◽  
Collocation Points ◽  
Nonlinear Algebraic Equations ◽  
Flexible Multibody

The mechanisms with uncertain parameters may exhibit multiple dynamic response patterns. As a single surrogate model can hardly describe all the dynamic response patterns of mechanism dynamics, a new computation methodology is proposed to study multiple dynamic response patterns of a flexible multibody system with uncertain random parameters. The flexible multibody system of concern is modeled by using a unified mesh of the absolute nodal coordinate formulation (ANCF). The polynomial chaos (PC) expansion with collocation methods is used to generate the surrogate model for the flexible multibody system with random parameters. Several subsurrogate models are used to describe multiple dynamic response patterns of the system dynamics. By the motivation of the data mining, the Dirichlet process mixture model (DPMM) is used to determine the dynamic response patterns and project the collocation points into different patterns. The uncertain differential algebraic equations (DAEs) for the flexible multibody system are directly transformed into the uncertain nonlinear algebraic equations by using the generalized-alpha algorithm. Then, the PC expansion is further used to transform the uncertain nonlinear algebraic equations into several sets of nonlinear algebraic equations with deterministic collocation points. Finally, two numerical examples are presented to validate the proposed methodology. The first confirms the effectiveness of the proposed methodology, and the second one shows the effectiveness of the proposed computation methodology in multiple dynamic response patterns study of a complicated spatial flexible multibody system with uncertain random parameters.

scholarly journals Solving Some Differential Equations Arising in Electric Engineering Using Hermite Polynomials

2020 ◽  
Vol 12 (4) ◽  
pp. 517-523
Author(s):  
G. Singh ◽  
I. Singh
Keyword(s):  
Differential Equations ◽  
Numerical Solution ◽  
Collocation Method ◽  
Hermite Polynomials ◽  
Electric Circuit ◽  
Algebraic Equations ◽  
Numerical Examples ◽  
Electric Engineering ◽  
Collocation Points ◽  
Linear Algebraic Equations

In this paper, a collocation method based on Hermite polynomials is presented for the numerical solution of the electric circuit equations arising in many branches of sciences and engineering. By using collocation points and Hermite polynomials, electric circuit equations are transformed into a system of linear algebraic equations with unknown Hermite coefficients. These unknown Hermite coefficients have been computed by solving such algebraic equations. To illustrate the accuracy of the proposed method some numerical examples are presented.

Sign in / Sign up

Export Citation Format

Share Document