Comparison New Algorithm Modified Euler Based on Harmonic-Polygon Approach for Solving Ordinary Differential Equation
Keywords:Euler, Harmonic-Polygon Scheme, Polygon, Harmonic Mean,
AbstractThere are many benefits to improve Euler scheme for solving the Ordinary Differential Equation problems. Among the benefits are simple implementation and low-cost computation. However, the problem of accuracy in the Euler scheme persuades scholar to use the complex method. Therefore, the main purpose of this research is to show the development of a new modified Euler scheme that improves the accuracy of the Polygon scheme in various step sizes. The implementation of the new scheme is by using the Polygon scheme and then Harmonic mean concept that is called the Harmonic-Polygon scheme. This Harmonic-Polygon scheme can provide new advantages more than the Euler scheme could offer by solving Ordinary Differential Equation problem. Four set of problems are solved via Harmonic-Polygon. Findings showed that new scheme or Harmonic-Polygon scheme can produced much better accuracy result.
A.S. Rambley, M. S. M. Noraini and R. M. Nazar, Persamaan Beza & Terbitan, Universiti Kebangsaan Malaysia (1999).
S. Fadugba, B. Ogunrinde and T. Okunlola, Euler's Method for Solving Initial Value Problems in Ordinary Differential Equations, The Pacific Journal of Science Technology 13(2)(2012), pp. 152-158.
M.S. Chandio and A.G. Memon, Improving the Effiency of Heun's Method, Sindh Universiti Res. Journal, 42(2)(2010), pp. 85-88.
C. F. Gerald and P. O. Wheatley, Applied Numerical Analysis 7th Edition, Pearson 2004
G. E. Urroz, Ordinary Differential Equations with SCILAB InforClearinghouse.com, 2001, pp 3-4.
Universiti Teknologi Malaysia, D.B.d.P.K.P.M., Ensiklopedia Sains dan Teknologi Maklumat, in Ensiklopedia Sains dan Teknologi 2005: Kuala Lumpur. p. 489.
Z. Salleh, Ordinary Differential Equations (ODE) Using Euler's Technique and Scilab Programming, Mathematical Models and Methods in Modern Science 20(4) (2012), pp. 264-269.
S. Qureshi, M.S. Chandio, I.A. Junejo, A.A. Shaikh and Z.-U.N. Memon, On Error Bound for Local Truncation Error of an Explicit Iterative Algorithm in Ordinary Differential Equations, Sci.Int.(Lahore) 26(3) (2014), pp. 1413-1415.
Z. Majid and M. Suleiman, Performance of 4-Point Diagonally Implicit Block Method for Solving Ordinary Differential Equations, MATEMATIKA 22(2) (2006), pp. 137-146.
N.M.M. Yusop and M.K. Hasan, Development of New Harmonic Euler Using Nonstandard Finite Difference Technique for Solving Stiff Problems, Jurnal Teknologi (Sciences and Engineering), 7(22) (2014), pp. 19-24.
How to Cite
TRANSFER OF COPYRIGHT AGREEMENT
The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):
- All proprietary right other than copyright, such as patent rights
- The right to make further copies of all or part of the published article for my use in classroom teaching
- The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
- The right to make copies of the published work for internal distribution within the institution that employs me
I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.