Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
Numerical Approximation Of Generalised Riccati Equations By Iterative Decomposition Method

Numerical Approximation Of Generalised Riccati Equations By Iterative Decomposition Method

Ratings: (0)|Views: 31 |Likes:
Published by ijcsis
In this paper, the Iterative Decomposition Method is applied to solve the generalized Riccati equations. We considered equations with variable coefficients, as well as those with constant coefficients. The present method presents solutions as easily computable, fast convergent infinite series, requiring no discretization. Examples are presented to establish the accuracy and efficiency of the method.
In this paper, the Iterative Decomposition Method is applied to solve the generalized Riccati equations. We considered equations with variable coefficients, as well as those with constant coefficients. The present method presents solutions as easily computable, fast convergent infinite series, requiring no discretization. Examples are presented to establish the accuracy and efficiency of the method.

More info:

Published by: ijcsis on Jul 07, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

07/07/2011

pdf

text

original

 
N
1
Dep
a
2
. Dep
k
3
. Dep
t
 Abstract 
-
 Inis applied t considered those with presents soinfinite ser  presented t method.
 keyword: G Decomposit
The Ricprocesses,diffusion pThe solutiusing somEuler metnumericalpopular Abeen appliequations.was usedequations.Tfor a solurelative edetails, witIterative
umerical
rtment of Co
dekunleya@
artment Electr
diritoyin2
artment of Ma
odetunde@ya
this paper, theo solve the geequations withconstant coelutions as easies, requiring nestablish the
eneralised Riccion Method.
I. Icati equationsoptimal conroblem, as wens of Riccatitraditional nod, and theschemes havomian Decoed in [2, 6] tIn [10],theto obtain thehe basic motivtion techniquese, and requihout any lossecomposition
pproxim
Adeku
puter Science
mail.com
ical/Electronic
007@yahoo.c
thematical Sci
hoo.co.uk
 
 Iterative Decomeralized Riccat variable coeffic
 
 ficients. Thely computable,o discretizationaccuracy and 
 ati Equations, I 
TRODUCTION
find applicatitrol, network ll as in Financquations havemerical methunge-Kuttabeen applieposition Metsolve the noomotopy Ananalytic solutation for this wwhich can biring minimalf accuracy orMethod (ID
tion of GeDecomp
le, Y.A.
1*
, K
and Mathemas Engineering
om
ence, Olabisi
osition Methoi equations. W ients, as well aresent metho fast convergen. Examples ar  fficiency of th
 terative
ns in Randoanalysis anmathematicsbeen obtaineds such as thethod. Neweby [3]. Thod ADM hanlinear Riccatialysis Methoion of Riccatiork is the neeapplied witmathematicalfficiency. ThM) has bee
neralisedosition M
 
adiri, K.O.
2
,
tics, Babcock , Federal Polytnabanjo Uni .iilappliequavariaequaIn allreliasolutmeth appliRiccThe lInDecpresmethsectisecti
 
II.
 
SMet
Conrenti WhefunctEqu
iccati Eqthod
Odetunde, O
University, Iliechnic, Offa,ersity, Ago-Ied in [7] to stions. In [8]tional probletion were appl of these papele accuracyions, and withods.The aim ocation of the I
 
ati Equations.layout of the rsection 2,mposition Mnted. We neod developedn 3. A concln 4.
lution Technod
sider theal Equation.reionstion (i) can b
ations by
.S.
3
san-Remo OgKwara State,oye, Ogun Stolve one-dimthe method ws while in [roximated usirs, the resultswhen comresults obtainf this paperterative Decost of the papethe analysisthod IDM forxt present thein section 2 tusion is draw
ique By Itera
Generale written in th
Iterative
n State, Nigerigeriate,Nigeriansional Biharas applied to] delay diffeg the same mobtained showpared withd using otheris to continposition on Gis as follows:of the ItRiccati equatiapplicationo some examn on the meth
ive Decompo
Riccatiaree formiamonicsolverentialethod.s veryexactnowne theeneralrativeons isf theles inod, in
ition
Diffescalar
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 6, June 2011310http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
 
Where thThe Univdefined byApplyingthatThe iteratiunknown f an infinitewherecomponenTo convecompletenis of the fowhere
isWe can deFrom (8) a ,Thus,ande differentialrse operator i the universe ove Decomposiunctionseries of the f t canthe idea of ss of the techrma constant andcompose the nnd (10), equatiperator L is giis thus the intperator (4) ontion method acan be expresrme determinedthe method,nique [7] we cis the nonlinear termion (9) is equi ven byegral operato(2), it followsumes that thsed in terms oso that thiterativelys well as foan see that (8onlinear term.
 
asalent toIIIConcoef TheTheWe t 
Tablet
0.00.10.20.30.40.50.60.70.80.91.0Tableobtainnumb
 ExaConTheApplhave
Numerical E
Example 3.1ider the Ricientsxact solutionIterative Decohus have an a
1Exact Solutio
 0.0996679940.1973753200.2913126120.3799489620.4621171570.5370493660.6043677770.6640367700.7162978700.7615941551 shows the numed from our prer of points in
ple 3.2ider the Riccaxact solutionying the Iter 
xamples
iccati equatiof the problemmposition Metproximation
n Approxsolution
0.09966790.19737370.29128520.37974600.46116290.53368780.59467210.63989270.66254900.6519658rical comparisonsent scheme andthe interval [0,
 
ti equation witof the problemtive Decompon with coishod gives
imatey IDME
 1 1.3 E-4 1.61672 2.7386 2.02931 9.54343 3.36236 9.69689 2.41471 5.37524 1.096f results for Exathe exact soluti1]. Error is def 
variable coef issition Methonstant
rror
8E-6E-5E-4E-4E-3E-3E-2E-2E-1ple 3.1on at ained as
ficientd, we
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 6, June 2011311http://sites.google.com/site/ijcsis/ISSN 1947-5500

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->