Arithmetic Mean Derivative Based Midpoint Rule

Similar documents
Harmonic Mean Derivative - Based Closed Newton Cotes Quadrature

OPEN NEWTON - COTES QUADRATURE WITH MIDPOINT DERIVATIVE FOR INTEGRATION OF ALGEBRAIC FUNCTIONS

New Expansion and Infinite Series

NUMERICAL INTEGRATION

Composite Mendeleev s Quadratures for Solving a Linear Fredholm Integral Equation of The Second Kind

Numerical Analysis: Trapezoidal and Simpson s Rule

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.

Undergraduate Research

Lecture 14: Quadrature

III. Lecture on Numerical Integration. File faclib/dattab/lecture-notes/numerical-inter03.tex /by EC, 3/14/2008 at 15:11, version 9

The Solution of Volterra Integral Equation of the Second Kind by Using the Elzaki Transform

DOING PHYSICS WITH MATLAB MATHEMATICAL ROUTINES

63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1

On the Generalized Weighted Quasi-Arithmetic Integral Mean 1

Fredholm Integral Equations of the First Kind Solved by Using the Homotopy Perturbation Method

CLOSED EXPRESSIONS FOR COEFFICIENTS IN WEIGHTED NEWTON-COTES QUADRATURES

Orthogonal Polynomials

AN INTEGRAL INEQUALITY FOR CONVEX FUNCTIONS AND APPLICATIONS IN NUMERICAL INTEGRATION

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

A Modified ADM for Solving Systems of Linear Fredholm Integral Equations of the Second Kind

Lecture 12: Numerical Quadrature

COT4501 Spring Homework VII

QUADRATURE is an old-fashioned word that refers to

Quadrature Rules for Evaluation of Hyper Singular Integrals

Advanced Computational Fluid Dynamics AA215A Lecture 3 Polynomial Interpolation: Numerical Differentiation and Integration.

Definite integral. Mathematics FRDIS MENDELU

Realistic Method for Solving Fully Intuitionistic Fuzzy. Transportation Problems

Numerical Integration

Definite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30

Lecture Note 4: Numerical differentiation and integration. Xiaoqun Zhang Shanghai Jiao Tong University

1 The Riemann Integral

Lecture 19: Continuous Least Squares Approximation

On the Decomposition Method for System of Linear Fredholm Integral Equations of the Second Kind

The Riemann Integral

Lecture 17. Integration: Gauss Quadrature. David Semeraro. University of Illinois at Urbana-Champaign. March 20, 2014

Numerical quadrature based on interpolating functions: A MATLAB implementation

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

Construction of Gauss Quadrature Rules

Review of Calculus, cont d

Lecture 20: Numerical Integration III

A Computational Method for Solving Linear Volterra Integral Equations

1 Error Analysis of Simple Rules for Numerical Integration

Adomian Decomposition Method with Green s. Function for Solving Twelfth-Order Boundary. Value Problems

Results on Planar Near Rings

Orthogonal Polynomials and Least-Squares Approximations to Functions

1 The Lagrange interpolation formula

Tangent Line and Tangent Plane Approximations of Definite Integral

Lecture 6: Singular Integrals, Open Quadrature rules, and Gauss Quadrature

Lecture 14 Numerical integration: advanced topics

Section 6.1 INTRO to LAPLACE TRANSFORMS

Discrete Least-squares Approximations

INTRODUCTION TO INTEGRATION

A Generalized Inequality of Ostrowski Type for Twice Differentiable Bounded Mappings and Applications

Calculus II: Integrations and Series

3.4 Numerical integration

Numerical Analysis. 10th ed. R L Burden, J D Faires, and A M Burden

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )

Numerical integration

Z b. f(x)dx. Yet in the above two cases we know what f(x) is. Sometimes, engineers want to calculate an area by computing I, but...

APPROXIMATE INTEGRATION

AN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS. I. Fedotov and S. S. Dragomir

Numerical Integration

THE HANKEL MATRIX METHOD FOR GAUSSIAN QUADRATURE IN 1 AND 2 DIMENSIONS

Best Approximation. Chapter The General Case

A basic logarithmic inequality, and the logarithmic mean

B.Sc. in Mathematics (Ordinary)

Keywords : Generalized Ostrowski s inequality, generalized midpoint inequality, Taylor s formula.

Physics 116C Solution of inhomogeneous ordinary differential equations using Green s functions

Section 7.1 Integration by Substitution

6.5 Numerical Approximations of Definite Integrals

1.2. Linear Variable Coefficient Equations. y + b "! = a y + b " Remark: The case b = 0 and a non-constant can be solved with the same idea as above.

Key words. Numerical quadrature, piecewise polynomial, convergence rate, trapezoidal rule, midpoint rule, Simpson s rule, spectral accuracy.

Solutions of Klein - Gordan equations, using Finite Fourier Sine Transform

Improper Integrals. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics

SOLUTION OF QUADRATIC NONLINEAR PROBLEMS WITH MULTIPLE SCALES LINDSTEDT-POINCARE METHOD. Mehmet Pakdemirli and Gözde Sarı

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

Trapezoidal Rule, n = 1, x 0 = a, x 1 = b, h = b a. f (x)dx = h 2 (f (x 0) + f (x 1 )) h3

Review of Gaussian Quadrature method

Hermite-Hadamard type inequalities for harmonically convex functions

LECTURE 19. Numerical Integration. Z b. is generally thought of as representing the area under the graph of fèxè between the points x = a and

A Bernstein polynomial approach for solution of nonlinear integral equations

COSC 3361 Numerical Analysis I Numerical Integration and Differentiation (III) - Gauss Quadrature and Adaptive Quadrature

We know that if f is a continuous nonnegative function on the interval [a, b], then b

Math& 152 Section Integration by Parts

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

Hermite-Hadamard Type Inequalities for the Functions whose Second Derivatives in Absolute Value are Convex and Concave

n f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1

Modification Adomian Decomposition Method for solving Seventh OrderIntegro-Differential Equations

Application of Exp-Function Method to. a Huxley Equation with Variable Coefficient *

Chapter 6 Notes, Larson/Hostetler 3e

x = b a n x 2 e x dx. cdx = c(b a), where c is any constant. a b

An optimal 3-point quadrature formula of closed type and error bounds

Lecture 23: Interpolatory Quadrature

Math 1B, lecture 4: Error bounds for numerical methods

Section 4.8. D v(t j 1 ) t. (4.8.1) j=1

Czechoslovak Mathematical Journal, 55 (130) (2005), , Abbotsford. 1. Introduction

Chapter 3 Polynomials

Lab 11 Approximate Integration

Research Article On Existence and Uniqueness of Solutions of a Nonlinear Integral Equation

Research Article Numerical Treatment of Singularly Perturbed Two-Point Boundary Value Problems by Using Differential Transformation Method

Transcription:

Applied Mthemticl Sciences, Vol. 1, 018, no. 13, 65-633 HIKARI Ltd www.m-hikri.com https://doi.org/10.1988/ms.018.858 Arithmetic Men Derivtive Bsed Midpoint Rule Rike Mrjulis 1, M. Imrn, Symsudhuh Numericl Computing Group, Deprtment of Mthemtics University of Riu, Peknbru 893, Indonesi Copyright c 018 Mrjulis, Imrn nd Symsudhuh. This rticle is distributed under the Cretive Commons Attribution License, which permits unrestricted use, distribution, nd reproduction in ny medium, provided the originl work is properly cited. Abstrct In this rticle, we discuss the modifiction of double midpoint rule nd corrected midpoint rule by dding the derivtive evluted t rithmetic men of the nodes to pproximte definite integrl. The proposed rules give increse of precision over the existing rules. Lstly, the effectiveness of the proposed rules is illustrted by numericl exmples nd the results re compred with the existing rules. Mthemtics Subject Clssifiction: 65D30, 65D3 Keywords: Midpoint rule, rithmetic men, derivtive-bsed qudrture 1 Introduction Definite integrl of the form I = f(x)dx (1) is n object of intensive reserch in mthemtics. In some pplictions, we need to clculte the integrl. If the ntiderivtives of f(x) is known, the integrl cn be clculted using Newton-Leibniz rule. If the ntiderivtive function is unvilble or not esy to obtin, the integrl cn be pproximted using numericl integrtion method. 1 Corresponding uthor

66 Mrjulis, M. Imrn nd Symsudhuh The most common numericl integrtion process is derived by pproximting f(x) with polynomil interpoltion, known s Newton-Cotes method. The generl form of the formul cn be expressed s f(x)dx = n w i f(x i ) + E n, () i=0 where weights w i nd nodes x i [, b] re to be determined nd E n is the error of the formul. If the end points of the intervl integrtion re included s node points, the formul is nmed by closed Newton-Cotes formul, otherwise it is clled open Newton-Cotes formul [3]. The improvement of closed Newton-Cotes method by including the end of intervl integrtion s new vribles to be determined ws proposed by Deghn et l. [7]. Rmchndrn et l. [11, 13, 1, 1] introduced n improvement of closed Newton-Cotes method by dding the derivtive of the function evluted t the geometric men, heronin men, root men squre, nd hrmonic men. Furthermore Rmchndrn nd Priml [8] modified closed Newton-Cotes method by dding the derivtive of the function evluted t the centroidl men vlue. In [10], Rmchndrn et l. performed comprison between their methods which were proposed in [15, 11, 1]. Deghn et l. [5] nd [6] hve modified the open nd semi-open Newton- Cotes method by the sme strtegy s the improvement of closed Newton- Cotes methods. Menwhile Zfr et l. [16] modified the open Newton-Cotes method by combining the function vlues nd the evlution of derivtive t uniformly spced points. Furthermore Rmchndrn et l. [9] lso modified the midpoint rule [, h. 69] ( ) + b M r (f) = (b )f + (b )3 f (ξ), ξ (, b), (3) by dding the evlution of derivtive in the midpoint, so tht they obtined ( ) ( ) + b (b )3 + b M m (f) = (b )f + f, ξ (, b). () Zfr et l. [16] generlized the corrected midpoint rule ( ) + b (b ( ) ) M ct (f) = (b )f + f (b) f () 7(b )5 f () (ξ), ξ (, b), (5) 5760 by tking the liner combintion of the function nd its derivtive vlues t the node points

Arithmetic men derivtive-bsed midpoint rule 67 Formul midpoint cn lso be modified by tking x 0 = + 1 (b ) nd x 1 = + 3 (b ) to obtin double midpoint rule [1, h. 17] M d (f) = (b ) (f(x 0 ) + f(x 1 )) + (b )3 f (ξ), ξ (, b). (6) 96 In section two, we discuss the modifiction of double-midpoint rule (6) nd corrected midpoint rule (5) by dding the derivtive which is evluted t rithmetic men of the nodes. Then it is followed by doing the error nlysis of the proposed rule in section three. The discussion is closed by performing some numericl computtion to see the effectiveness of the proposed rules. Arithmetic Men Derivtive-Bsed Double Midpoint Rule In this section firstly we proposed the modifiction of double midpoint rule by dding the derivtive evluted t rithmetic men in eqution (6). Theorem 1 If f C [, b] then the rithmetic men derivtive-bsed double midpoint rule to pproximte f(x)dx given by [ ( ) ( )] ( ) (b ) 3 + b + 3b (b )3 + b M d (f) = f + f + f, (7) 96 hs the precision three. Proof: We show tht the formul (7) is exct for f(x) = x 3. The exct vlue of x3 dx = 1 (b ). From (7) we obtin M d (f) = (b ) [ (3 ) 3 ( ) ] 3 + b + 3b + = 7 3 b + b 3 + 7b 3 = 8b 8 3 M d (f) = 1 (b ). + 6(b )3 ( + b) 19 + + 3 b b 3 + b 3 This proves the theorem. Next ) we improve the corrected midpoint rule by tking the vlue of ξ = in eqution (5). ( +b

68 Mrjulis, M. Imrn nd Symsudhuh Theorem If f C [, b] then the rithmetic men derivtive-bsed corrected midpoint rule to pproximte f(x)dx given by ( ) + b (b [ ] ) M ct (f) = (b )f + f (b) f () 7 ( ) + b 5760 (b )5 f (), (8) hs the precision five Proof: The eqution (8) is verified by f(x) = x 5 which hs the exct vlue x5 dx = 1 6 (b6 6 ). From (8) we obtin ( ) 5 + b M ct (f) = (b ) + (b ) [ 5b 5 ] 80 (b )5 5760 = 36 1 5 b 15 b + 15 b + 1b 5 + 3b 6 96 + 06 + 0 5 b 0 b + 0 b 0b 5 + 0b 6 96 76 + 8 5 b 35 b + 35 b 8b 5 + 7b 6 96 M ct (f) = 1 6 (b6 6 ). ( ) + b This proves the theorem. We hve shown tht the rithmetic men derivtive-bsed double midpoint rule hs the precision three nd the rithmetic men derivtive-bsed double midpoint rule hs the precision five. 3 Error Anlysis We derive the error term of the rithmetic men derivtive-bsed double midpoint rule nd the rithmetic men derivtive-bsed double midpoint rule using x the reminder of the qudrture formuls for the monomil p+1 nd the exct (p+1)! 1 b vlue of (p+1)! xp+1 dx, where p is the precision of the formul. Theorem 3 If f C [, b] then error term for rithmetic men derivtivebsed double midpoint rule is E Md (f) = 11 3070 (b )5 f () (ξ), (9) where ξ (, b). This rule hs fifth order ccurte.

Arithmetic men derivtive-bsed midpoint rule 69 Proof: To show (9), we let f(x) = x! in eqution (3). The exct solution is x! dx = 1 10 (b5 5 ). By pplying the rithmetic men derivtive-bsed double midpoint rule (7), we hve [ ( ) (b ) 1 3 + b M d (f) = + 1 ( ) ] [ ( ) ] + 3b (b )3 1 + b +!! 96 = ( 15 19 b + 6 3 b 6 b 3 + 19b + 1b 5 ) 61 + ( 5 + b + 3 b b 3 b + b 5 ) 768 M d (f) = ( 95 11 b + 3 b b 3 + 11b + 9b 5 ). 61 Hence the error form bsed on the Burg [] is E Md (f) = f(x)dx M d (f) = 11 3070 (b )5 f () (ξ), ξ (, b). The precision, the orders nd the error terms for M m [9], M r [], M d [1], nd proposed method M d re shown in Tble 1. Tble 1: Comprison of error terms Rules Precision Order Error terms 1 M r 1 3 (b )3 f (ξ) 1 M m 3 5 (b 190 )5 f () (ξ) 1 M d 1 3 (b 96 )3 f ( ) (ξ) 11 M d 3 5 (b 3070 )5 f () (ξ) Theorem If f C 6 [, b] then error term for rithmetic men derivtivebsed corrected midpoint rule is E Mct (f) = 1 53760 (b )7 f (6) (ξ), (10) where ξ (, b). This rule hs seventh order ccurte.

630 Mrjulis, M. Imrn nd Symsudhuh Proof: Let f(x) in eqution (10) is verified by f(x) = x6 6! whose exct solution is x 6 6! dx = 1 500 (b7 7 ). Next by using rithmetic men derivtive-bsed corrected midpoint rule, we obtin ( ) 6 [ ] (b ) + b (b ) b 5 M ct (f) = + 70 10 5 7 ( ) (b ) 5 + b. 10 5760 = ( 7 5 6 b 9 5 b 5 b 3 + 5 3 b + 9 b 5 + 5b 6 + b 7 ) 6080 + ( 7 + 6 b 5 b + b 5 b 6 + b 7 ) 880 ( 77 + 1 6 b 7 5 b 35 b 3 + 35 3 b + 7 b 5 1b 6 + 7b 7 ) 6080 M ct (f) = 107 + 6 6 b 18 5 b + 30 b 3 30 3 b + 18 b 5 6b 6 + 10b 7. 6080 Then bsed on the Burg [], the error form is obtined s E Mct (f) = f(x)dx M ct (f) E Mct (f) = 1 53760 (b )7 f (6) (ξ), ξ (, b). The precision, the orders nd the error terms for M ct [16] nd proposed method M ct re shown in Tble. Tble : Comprison of error terms Rules Precision Order Error terms M ct 3 5 7 (b 5760 )5 f () (ξ) M ct 5 7 1 (b 53760 )7 f (6) (ξ) Numericl Exmples In this section, the vlues of 1 0 ex dx, π 0 tn xdx nd 1 (1 + 0 x6 )dx re pproximted by M r, M m, M d, M d, M ct, nd M ct. The results re shown in Tbel 3.

Arithmetic men derivtive-bsed midpoint rule 631 Tble 3: Comprison of M r, M m, M d, M ct, nd M ct. 1 0 ex dx π Integrl Method 0 tn x dx 1 0 x6 )dx Error Error Error M r 6.96e 0 9.56e 0 1.7e 01 M m 8.6e 0 3.30e 0.91e 0 M d 1.78e 0 3.98e 0 5.37e 0 M d 5.95e 0.e 0 3.e 0 M ct.03e 03 1.10e 01 1.3e 01 M ct 3.09e 05.9e 0 1.3e 0 From the computtionl results s depicted in Tble 3, it cn be seen tht the error rithmetic men derivtive-bsed double midpoint rule nd the rithmetic men derivtive bsed-corrected midpoint rule is smller thn the comprison rules. Wht we found here is in greement with the error nlysis where the precision of the method is incresed respectively by one nd two precisions. Funding. This reserch is conducted without ny funding support from ny institutions. References [1] H.M. Anti, Numericl Methods for Scientists, Tt McGrw Hill, Delhi, 1955. [] K.E. Atkinson, An Introduction to Numericl Anlysis, Second Ed., John Wiley Sons, New York, 1989. [3] R. L. Burden nd J. D. Fires, Numericl Anlysis, Ninth Edition, Brooks/Cole, Boston, 010. [] C. O. E. Burg nd E. Degny, Derivtive-bsed midpoint qudrture rule, Applied Mthemtics, (013), 8-3. https://doi.org/10.36/m.013.1035 [5] M. Deghn, M. Msjed-Jmei nd M. R. Eslhchi, On numericl improvement of open Newton-Cotes qudrtue rules, Applied Mthemtics nd Computtion, 175 (006), 618-67. https://doi.org/10.1016/j.mc.005.07.030

63 Mrjulis, M. Imrn nd Symsudhuh [6] M. Deghn, M. Msjed-Jmei nd M.R. Eslhchi, The semi open Newton- Cotes qudrtue rules nd its numericl improvement, Applied Mthemtics nd Computtion, 171 (005), 119-110. https://doi.org/10.1016/j.mc.005.01.137 [7] M. Deghn, M. Msjed-Jmei nd M. R. Eslhchi, On Numericl Improvement of Closed Newton-Cotes Qudrtue Rules, Applied Mthemtics nd Computtion, 165 (005), 51-60. https://doi.org/10.1016/j.mc.00.07.009 [8] T. Rmchndrn nd R. Priml, Centroidl men derivtive-bsed closed Newton-Cotes qudrture, Interntionl Journl of Science nd Reserch (IJSR), 5 (016), 338-33. [9] T. Rmchndrn nd R. Priml, Open Newton-Cotes qudrture with midpoint derivtive for integrtion of lgebric functions, Interntionl Journl of Reserch in Engineering nd Technology (IJRET), (015), 30-35. https://doi.org/10.1563/ijret.015.010070 [10] T. Rmchndrn, D. Udykumr nd R. Priml, Comprison of rithmetic men, geometric men nd hrmonic men derivtive-bsed closed Newton Cotes qudrture, Progress in Nonliner Dynmics nd Chos, (016), 35-3. [11] T. Rmchndrn, D. Udykumr nd R. Priml, Geometric men derivtive-bsed closed Newton-Cotes qudrture, Interntionl J. of Pure nd Engg. Mthemtics (IJPEM), (016), 107-116. [1] T. Rmchndrn, D. Udykumr nd R. Priml, Hrmonic men derivtive-bsed closed Newton-Cotes qudrture, IOSR Journl of Mthemtics (IOSR-JM), 1 (016), 36-1. [13] T. Rmchndrn, D. Udykumr nd R. Priml, Heronin men derivtive-bsed closed Newton-Cotes qudrture, Interntionl Journl of Mthemticl Archive, 7 (016), 53-58. [1] T. Rmchndrn, D. Udykumr nd R. Priml, Root men squre derivtive-bsed closed Newton-Cotes qudrture, IOSR-Journl of Scientific nd Reserch Publictions, 6 (016), 9-13. [15] W. Zho nd H. Li, Midpoint derivtive-bsed closed Newton-Cotes qudrture, Abstrct nd Applied Anlysis, 013 (013), Article ID 9507, 1-10. https://doi.org/10.1155/013/9507

Arithmetic men derivtive-bsed midpoint rule 633 [16] F. Zfr, S. Slem, nd C.O.E. Burg, New derivtive bsed open Newton- Cotes qudrture rules, Abstrct nd Applied Anlysis, 01 (01), Article ID 109138, 1-16. https://doi.org/10.1155/01/109138 Received: My 1, 018; Published: June 5, 018