International Journal of Pure and Applied Sciences and Technology

Similar documents
Numerical Solution of Linear Fredholm Fuzzy Integral Equations by Modified Homotopy Perturbation Method

7.2 Volume. A cross section is the shape we get when cutting straight through an object.

Lecture 4: Piecewise Cubic Interpolation

Introduction to Numerical Integration Part II

LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN FRACTAL HEAT TRANSFER

Lecture 36. Finite Element Methods

6 Roots of Equations: Open Methods

Partially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism

CISE 301: Numerical Methods Lecture 5, Topic 4 Least Squares, Curve Fitting

THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR

The Number of Rows which Equal Certain Row

Computation of Fifth Degree of Spline Function Model by Using C++ Programming

4. Eccentric axial loading, cross-section core

Study of Trapezoidal Fuzzy Linear System of Equations S. M. Bargir 1, *, M. S. Bapat 2, J. D. Yadav 3 1

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Rank One Update And the Google Matrix by Al Bernstein Signal Science, LLC

CHAPTER - 7. Firefly Algorithm based Strategic Bidding to Maximize Profit of IPPs in Competitive Electricity Market

Applied Statistics Qualifier Examination

The Study of Lawson Criterion in Fusion Systems for the

Numerical Solution of Nonlinear Multi-order Fractional Differential Equations by Implementation of the Operational Matrix of Fractional Derivative

8. INVERSE Z-TRANSFORM

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Math 497C Sep 17, Curves and Surfaces Fall 2004, PSU

A Family of Multivariate Abel Series Distributions. of Order k

Multiple view geometry

Mixed Type Duality for Multiobjective Variational Problems

ME 501A Seminar in Engineering Analysis Page 1

Two Coefficients of the Dyson Product

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)

Statistics and Probability Letters

UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II

90 S.S. Drgomr nd (t b)du(t) =u()(b ) u(t)dt: If we dd the bove two equltes, we get (.) u()(b ) u(t)dt = p(; t)du(t) where p(; t) := for ll ; t [; b]:

Numerical Solution of Fredholm Integral Equations of the Second Kind by using 2-Point Explicit Group Successive Over-Relaxation Iterative Method

Effects of polarization on the reflected wave

ON SIMPSON S INEQUALITY AND APPLICATIONS. 1. Introduction The following inequality is well known in the literature as Simpson s inequality : 2 1 f (4)

Numerical solution of fractional elliptic PDE's by the collocation method

NUMERICAL MODELLING OF A CILIUM USING AN INTEGRAL EQUATION

LAPLACE TRANSFORM SOLUTION OF THE PROBLEM OF TIME-FRACTIONAL HEAT CONDUCTION IN A TWO-LAYERED SLAB

INTERPOLATION(1) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek

The Schur-Cohn Algorithm

Point-based methods for estimating the length of a parametric curve

Jens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers

523 P a g e. is measured through p. should be slower for lesser values of p and faster for greater values of p. If we set p*

Review of linear algebra. Nuno Vasconcelos UCSD

Zbus 1.0 Introduction The Zbus is the inverse of the Ybus, i.e., (1) Since we know that

Frequency scaling simulation of Chua s circuit by automatic determination and control of step-size

Principle Component Analysis

FUNDAMENTALS ON ALGEBRA MATRICES AND DETERMINANTS

Activator-Inhibitor Model of a Dynamical System: Application to an Oscillating Chemical Reaction System

Chapter 5 Supplemental Text Material R S T. ij i j ij ijk

Numerical Solution of Freholm-Volterra Integral Equations by Using Scaling Function Interpolation Method

COMPLEX NUMBERS INDEX

Dennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1

State Estimation in TPN and PPN Guidance Laws by Using Unscented and Extended Kalman Filters

INTRODUCTORY NUMERICAL ANALYSIS

GAUSS ELIMINATION. Consider the following system of algebraic linear equations

INTRODUCTION TO COMPLEX NUMBERS

Online Appendix to. Mandating Behavioral Conformity in Social Groups with Conformist Members

A New Algorithm Linear Programming

Pyramid Algorithms for Barycentric Rational Interpolation

Abhilasha Classes Class- XII Date: SOLUTION (Chap - 9,10,12) MM 50 Mob no

COMPLEX NUMBER & QUADRATIC EQUATION

Convexity preserving interpolation by splines of arbitrary degree

Definition of Tracking

ORDINARY DIFFERENTIAL EQUATIONS

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 9

Sequences of Intuitionistic Fuzzy Soft G-Modules

A New Method for Solving Fuzzy Volterra Integro-Differential Equations

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

Haddow s Experiment:

ITERATIVE METHODS FOR SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +

Generalization of the Exact Solution of 1D Poisson Equation with Robin Boundary Conditions, Using the Finite Difference Method

APPLICATION OF MULTI OBJECTIVE FUZZY LINEAR PROGRAMMING IN SUPPLY PRODUCTION PLANNING PROBLEM

CENTROID (AĞIRLIK MERKEZİ )

Machine Learning Support Vector Machines SVM

A new Approach for Solving Linear Ordinary Differential Equations

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

Numerische Mathematik

A MODIFIED METHOD FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS

Least squares. Václav Hlaváč. Czech Technical University in Prague

CIS587 - Artificial Intelligence. Uncertainty CIS587 - AI. KB for medical diagnosis. Example.

Estimation of the composition of the liquid and vapor streams exiting a flash unit with a supercritical component

APPENDIX A Some Linear Algebra

ESCI 342 Atmospheric Dynamics I Lesson 1 Vectors and Vector Calculus

NON-HOMOGENEOUS COMPOSITE BEAMS: ANALYTIC FORMULATION AND SOLUTION

Chapter Runge-Kutta 2nd Order Method for Ordinary Differential Equations

% & 5.3 PRACTICAL APPLICATIONS. Given system, (49) , determine the Boolean Function, , in such a way that we always have expression: " Y1 = Y2

SVMs for regression Multilayer neural networks

2.12 Pull Back, Push Forward and Lie Time Derivatives

ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION

One-sided finite-difference approximations suitable for use with Richardson extrapolation

M/G/1/GD/ / System. ! Pollaczek-Khinchin (PK) Equation. ! Steady-state probabilities. ! Finding L, W q, W. ! π 0 = 1 ρ

Systematic Construction of examples for cycling in the simplex method

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

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

Jean Fernand Nguema LAMETA UFR Sciences Economiques Montpellier. Abstract

Research Article On the Upper Bounds of Eigenvalues for a Class of Systems of Ordinary Differential Equations with Higher Order

A Tri-Valued Belief Network Model for Information Retrieval

Katholieke Universiteit Leuven Department of Computer Science

Transcription:

Int. J. Pure Appl. Sc. Technol., () (), pp. 44-49 Interntonl Journl of Pure nd Appled Scences nd Technolog ISSN 9-67 Avlle onlne t www.jopst.n Reserch Pper Numercl Soluton for Non-Lner Fredholm Integrl Equtons Newton Kntorovch Method nd Comprson wth HPM nd ADM Mehd Gholm Porshoouh *, Behzd Ghnr nd Bjn Rhm Deprtment of Mthemtcs, Testn Brnch, Islmc Azd Unverst, Testn, Irn * Correspondng uthor, e-ml: (m_gholm_p@hoo.com) (Receved: 5--; Accepted: --) Astrct: The m of ths pper s to present numercl soluton for non-lner Fredholm Integrl equtons Newton Kntorovch Method. Frst we ppl Newton Kntorovch Method, nd we use ths method to solve n exmple. The numercl results hve compred wth the results otned HPM nd ADM. The results revel tht the method s ver effectve nd smple. Kewords: Newton Kntorovch Method; Non-lner Fredholm ntegrl equtons; The Qudrture Method. Introducton Nonlner ntegrl equtons wth constnt ntegrton lmts cn e represented n the form () ( x ) = f ( x ) + ( x, t, ( t )) dt, x [, ]. Where ( x, t, ( t )) s the ernel of the ntegrl equtons nd ( t ) s the unnown functon. Eq.() s clled non-lner Fredholm ntegrl equton of second nd. ll functons n () re ssumed to e contnuous n [, ] [, ]. The frst uthor hve extended the Adomn Decomposton Method (ADM)[], nd the Homotop Perturton Method (HPM)[], for solvng non-lner of Fredholm ntegrl equtons of the second nd. The soluton of

Int. J. Pure Appl. Sc. Technol., () (), 44-49 45 nonlner ntegrl equtons s complcted prolem of computtonl mthemtcs, whch s relted to dffcultes of oth prncpl nd computtonl chrcter. In ths connecton, methods re developed tht re especll desgned for solvng nonlner equtons, ncludng the Newton Kntorovch method, whch mes t possle to provde nd ccelerte the convergence of terton processes n mn cses.. Soluton of method.. The Newton Kntorovch Method We consder ths method n connecton wth the solve of Eq. (). The terton process s constructed s follows: ( x ) = ( x ) + ϕ ( x ), =,, K. () ϕ ( x ) ε ( x ) x, t, ( t ) ϕ ( t ) dt, = + ε = + ( ) ( x ) f ( x ) x, t, ( t ) dt ( x ), At ech step of lgorthm, lner ntegrl equton for the correcton ϕ x s solved.n ths wor we solve these lner ntegrl equtons pplng The Qudrture Method tht s one of numercl methods to solve lner Fredholm Integrl equtons of frst nd, tht expln followng. () (4).. The Qudrture Method The method of qudrture s method for constructng n pproxmte soluton of n ntegrl equton sed on the replcement of ntegrls fnte sums ccordng to some formul. Such formuls re clled qudrture formuls nd, n generl, hve the form ϕ( x ) dx A ϕ( x ) n = (5) Where x ( = Ln) re the scsss of the prtton ponts of the ntegrton ntervl [, ] or qudrture nodes, A,( = Ln) re numercl coeffcents ndependent of the choce of the functon ϕ ( x ). Smpson s rule (or przmodl formul) s the smplest nd most frequentl used n prctce. We use ths method wth s follows

Int. J. Pure Appl. Sc. Technol., () (), 44-49 + ϕ( x ) dx ( ϕ + 4 ϕ + ϕ( )). 6 46 (6) B ppl Qudrture Method for solvng lner Fredholm ntegrl equton of frst nd, n Eq. () we cn fnd pproxmton of x t ech step. ϕ.. Convergence of the lgorthm nd the exstence. Let the functon ( x, t, ( t )) e jontl contnuous together wth the dervtves x, t, ( t ) x, t, ( t ) wth the respect to the vrles x, t,, where nd x, t nd let the followng condtons hold: - For the ntl pproxmton, the resolvng of the lner ntegrl equton wth the ernel x, t, ( t ) stsfes the condton R( x, t ) dt A, x. - The resdul of Eq.(4) for the pproxmton stsfes the neqult ε ( x ) = f ( x ) + x, t, ( t ) dt ( x ) B <. - In the domn, the followng relton holds sup ( x, t, ( t ) dt D <. 4- The constnt A, B nd C stsf the condton H = ( + A ) BD. In ths cse, under ssumptons - 4, the process () converges to the soluton of Eq. () n the domn ( x ) ( x ) H H ( A ) B, x <. The soluton s unque n the domn ( x ) ( x ) + A B, x <. The rte of convergence s determnte the estmte ( ), <. x x H A B x Thus the ove condtons estlsh the convergence of the lgorthm nd the exstence, the poston nd the unqueness domn of soluton of the nonlner equton (). These condtons mpose certn restrctons on the ntl pproxmton x whose choce s n mportnt ndependent prolem tht hs no unfed pproch. As usul, the ntl pproxmton s determned ether more detled pror nlss of the equton under

Int. J. Pure Appl. Sc. Technol., () (), 44-49 47 consderton or phscl resonng mpled the essence of the prolem descred ths equton. Under successful choce of the ntl pproxmton, the Newton Kntorovch method provdes hgh rte of convergence of the terton process to otn n pproxmte soluton wth gven ccurc [].. Numercl results In ths secton to llustrte ove theoretcl results, n exmple s presented. In ths exmple, numercl results otn ths method compred ones otned nd ADM's method [] nd HPM `s method []. Exmple. Let us solve the followng non-lner Fredholm ntegrl equton: φ( x) = sn( π x) + cos( π x)sn( π x) ( φ( x) ) dt x [,]. 5 9 For whch the exct soluton s φ( x ) = sn( π x ) + cos( π x ). For the ntl pproxmton we te ( x ) = sn( π x ). Accordng to (4), we fnd the resdul = + 5 cos( π x ) 4 cos( π x ) ε ( x ) sn( π x ) cos( π x )sn( πt ) ( t ) dt ( t ) = sn ( πt ) dt = 5 4 The _dervtve of the ernel (x, t, ), whch s needed n the clcultons,hs the form. Accordng to Eq. (), we form the followng equton for (x, t, ) = sn( π x)cos( π t) ( t ) ϕ ( x ) cos( π x ) ϕ( x ) = + cos( π x ) sn( πt ) ( t ) ϕ( t ) dt, 4 B ppl The Qudrture Method t possle to otn soluton such tht cos( πx ) cos( πx ) π ϕ( x ) = + (sn( π) () ϕ() + 4(sn ϕ) + sn( π) () ϕ(), 4 B smplfcton cos( π x ) cos( π x ) ϕ ( x ) = + 4 ϕ, 4 B compute ϕ n (7) we get ϕ = nd puttng n Eq. (7) we rrve followng (7)

Int. J. Pure Appl. Sc. Technol., () (), 44-49 48 cos( π x ) ϕ ( x ) =, 4 (8) Now we defne the frst pproxmton to the desred functon: ( x ) = ( x ) + ϕ( x ) = sn( π x ) + cos( π x ). 4 We contnue the terton process nd otn ε( x ) = sn( π x ) + cos( π x )sn( πt ) ( t ) dt ( t ) 5 7 = cos( π x ). 64 And 7 cos( π x ) ϕ( x ) = cos( π x ) + sn( πt ) ( t ) ϕ( t ) dt, 64 5 Smlr ove computton eldng 7 ϕ( x ) = cos( π x ) 64 Then 7 ( x ) = ( x ) + ϕ( x ) = sn( π x ) + cos( π x ) + cos( π x ) 4 64 487 = sn( π x ) + cos( π x ). 64 To fnd ( x ) (lst terton) gn we compute ε ( x ), ϕ ( x ) s followng = + 5 ε ( x ) sn( π x ) cos( π x )sn( πt ) ( t ) dt ( t ) 779787 = cos( π x ). 684 And 779787 cos( π x ) ϕ( x ) = cos( π x ) + sn( πt ) ( t ) ϕ( t ) dt, 684 5 B solve ths ntegrl equton 779787 ϕ( x ) = cos( π x ) 684 Then 487 779787 ( x ) = ( x ) + ϕ( x ) = sn( π x ) + cos( π x ) + cos( π x ) 64 684 57899787 = sn( π x ) + cos( π x ). 684 We stop terton t thrd step. Tle shows result of ppl ths method onl three terton to solve ths Exmple nd compres these results nd ADM' method nd HPM' method. Ths tle shows ccurc nd hgh rte of convergence of the terton process.

Int. J. Pure Appl. Sc. Technol., () (), 44-49 49 Tle Comprsons etween results otn Newton Kntorovch nd HPM nd ADM for exmple x ADM HPM Newton Kntorovch error soluton error soluton error soluton. 4.9 E-4.7554.8 E-6.7546889 5.55 E-8.7546644..89 E-4.76848. E-6.8758 5.8 E-8.8759866.. E-4.64549448 9.6 E-7.6488769 4.49 E-8.64886685..4 E-4.8594855 6.99 E-7.85594.6 E-8.8556578.4.6 E-4.9799.67 E-7.9746477.7 E-8.9746468.5.6.6 E-4.99989.67 E-7.9774875.7 E-8.97748444.7.4 E-4.7679 6.99 E-7.7646898.6 E-8.764687.8. E-4.55598 9.6 E-7.5676476 4.49 E-8.56768.9.89 E-4.4946. E-6.7889 5.8 E-8.784. 4.9 E-4 -.75.8 E-6 -.754599 5.56 E-8 -.754664 4. Conclusons In ths wor ws ult up n effcent tertve method to solve nonlner ntegrl equton the convergence of method hs een proved nd the convergence estlshed.the lgorthm llustrte exmple the perform hs een compred wth other method nd showed tht t ehves equl or etter thn the other two methods. The dvntge of ths method s ts smple procedure nd es computton nd ts rpd convergence. It seems to e ver es to emplo wth relle to solve non-lner Fredholm ntegrl equtons of second nd. The computtons ssocted wth the exmples were performed usng Mple. References [] J. Bzr nd A. Rnjr, A comprson etween Newton s method nd A.D.M.for solvng especl Fredholm ntegrl Equtons, Interntonl Mthemtcl Forum, (7), 5. [] J. Bzr nd H. Ghzvn, Numercl soluton for specl non-lner Fredholm ntegrl equton HPM, Appled Mthemtcs nd Computton, 95, (8), 68 687. [] A. D. Polnn nd A. V. Mnzhrov, Hndoo of Integrl Equtons, Chpmn & Hll/CRC Press, Boc Rton London, 998.