Error estimations in the numerical solving of the systems of equations

Abstract

Let \(\left( x_{i},\rho_{i}\right) ,\ i=1,2,\) be two complete metric space and \(F_{1}:X_{1}\times X_{2}\rightarrow X_{1},\ F_{2}:X_{1}\times X_{2}\rightarrow X_{2}\) two nonlinear mappings. We study the solving of the system \begin{align}
x_{1} & =F_{1}\left( x_{1},x_{2}\right) \label{f.1}\\
x_{2} & =F_{2}\left( x_{1},x_{2}\right) ,\qquad \left( x_{1},x_{2}\right)
\in X.\nonumber
\end{align} by the Gauss-Seidel type method \begin{align}
x_{1}^{\left( n+1\right) } & =F_{1}\left( x_{1}^{\left( n\right)
},x_{2}^{\left( n\right) }\right) \label{f.2}\\
x_{2}^{\left( n+1\right) } & =F_{2}\left( x_{1}^{\left( n+1\right)
},x_{2}^{\left( n\right) }\right) ,\qquad n=0,1,\ldots;\left( x_{1}^{\left(
0\right) },x_{2}^{\left( 0\right) }\right) \in X\nonumber
\end{align}  We give sufficient conditions for convergence and some error estimations. We also study the case when the mappings \(F_{1}\) and \(F_{2}\) are replaced by some approximations.

Authors

Ion Păvăloiu
(Tiberiu Popoviciu Institute of Numerical Analysis)

Title

Original title (in French)

Délimitation des erreur dans la résolution numérique des systèmes d’equations

English translation of the title

Error estimations in the numerical solving of the systems of equations

Keywords

nonlinear system in metric space; Gauss-Seidel type method; convergence; approximate value

PDF

Cite this paper as:

I. Păvăloiu, Délimitation des erreur dans la résolution numérique des systèmes d’equations, Seminar on mathematical analysis, Preprint no. 7 (1988), pp. 167-178 (in French).

About this paper

Journal

Seminar on mathematical analysis,
Preprint

Publisher Name

“Babes-Bolyai” University,
Faculty of Mathematics,
Research Seminars

DOI

Not available yet.

References

[1] Pavaloiu, I., Introducere in teoria aproximarii solutiilor ecuatiilor, Editura Dacia,  Cluj-Napoca, 1976.

[2] Pavaloiu, I., La resolution des systemes operationnelles a l’aide des methodes iteratives, Mathematica, 11(34), (1969), 137–141.

[3] Pavaloiu, I., Estimation des erreurs dans la resolution numerique des systemes  d’equations dans des espaces metriques, Seminar on Functional Analysis and Numerical Methods, Preprint Nr. 1, (1987), 121–129.

[4] Pavaloiu, I., La convergence de certaines methodes iteratives pour resoudre certaines equations operatorielles, Seminar on Functional analysis and Numerical Methods, Preprint Nr. 1 (1986), 127–132.

[5] Traub, J. F., Iterative Methods for the Solution of Equations, Prentice Hall Series in Automatic Computation, Englewood Cliffs, N. J. (1964).

[6] Urabe, M., Convergence of numerical iteration in solution of equations, J. Sci. Hiroshima Univ. Ser. A, 19 (1956), 479–489.

[7] Urabe, M., Error estimation in numerical solution of equations by iteration process, J. Sci. Hiroshima Univ. Ser. A-I, 26, (1962), 77–91.

Paper (preprint) in HTML form

"Babeş-Bolyai" University

Faculty of Mathematics and Physics

Research Seminars

Seminar on Mathematical Analysis

Preprint Nr.7, 1988, pp.167-178


Error estimations in the numerical solving of the systems of equations

Ion Pavaloiu

Let us designate by(Xi,ri),i=1,2two complete metric spaces and byX=X1×X2the Cartesian product of these spaces. We will denote byF1:XX1And F2:XX2two applications of spaceXinX1, respectively inX2and we consider the following system of equations:

(1) x1 =F1(x1,x2)
x2 =F2(x1,x2),(x1,x2)X.

To solve the system ( 1 ) we will adopt the following Gauss-Seidel type iterative process:

(2) x1(n+1) =F1(x1(n),x2(n))
x2(n+1) =F2(x1(n+1),x2(n)),n=0,1,;(x1(0),x2(0))X

In works [ 2 ] , [ 3 ] we studied the convergence of method ( 2 ) under the assumption that the applicationsF1AndF2satisfy Lipschitz-type conditions throughout the space  X.

In work [ 4 ] we obtained bounds of errors in the numerical resolution of system ( 1 ) using a method of type ( 2 ), in which the applications F1AndF2are replaced by two other applications F1AndF2, which meet certain conditions for bringing togetherF2AndF1throughout spaceX.

In the applications of this theory to the resolution of a class of concrete equations, the conditions imposed on the applicationsF1,F2,F1AndF2throughout space Xare awkward, because of the fact that the spaceXmay not be limited.

In the following we will study this problem on the assumption thatF1AndF2meet Lipschitz-type conditions and rapprochement conditionsF1AndF2in certain bounded subsetsD1X1AndD2X2.

Let us therefore designate byD1AndD2two bounded sets of spacesX1respectivelyX2and byD=D1×D2their Cartesian product. Consider two sequences(fn)n=0And(gn)n=0whose elements meet the conditions:

(3) fn afn1+bgn1
gn afn+bgn1,n=1,2,,

Ora,b, aAndbare non-negative real numbers andfn0, gn0for everythingn=0,1,.

We will associate to the system ( 3 ) the following system of equations in the unknownshAndk:

(4) a+bh =hk
ak+b =nk

In works [ 2 ] , [ 3 ] and [ 4 ] we have shown that if the numbersa,b,aAndb check the relationships

(5) a+b+ab <2
(1a)(1b)ab >0
b >0,a>0

then the system ( 4 ) admits real solutions(hi,ki),i=1,2for which0<hiki<1and that one of the solutions verifies the conditionsh1>0,k1>0. In addition, the elements of the suites(fn)n=0 (gn)n=0check the relationships

(6) fn Ch1n1k1n1
gn Ch1nk1n1,n=1,2,,

OrC=max{af0+bg0,af1+bg0h1}.

If we writep1=h1,k1then we easily see using ( 4 ) thatp1check the equation

(7) p2(b+ba+a)p+ba=0.

Let us designate byd1>0a number such thatS1D1S2D2, Or

(8) S1 ={xX1:r1(x,x1(0))d11p1}
S2 ={xX2:r2(x,x2(0))d1h11p1}

Regarding the convergence of sequences(x1(n))n=0,(x2(n))n=0we have the following theorem:

Theorem 1 .

If the applicationsF1,F2check the conditions

  • i.
    r1(F1(x1,and1),F1(x2,and2)) ar1(x1,x2)+br2(x2,and2)
    r2(F2(x1,and1),F2(x2,and2)) ar1(x1,x2)+br2(x2,and2)

    for all(x1,x2),(and1,and2)D;

  • ii.

    The namesa,b, aAndbcheck the relationships ( 5 );

  • iii.

    The elementsx1(1)And x2(1)suites(x1(n))n=0,(x2(n))n=0check the conditionsr1(x1(0),x1(1))<d1Andr2(x2(0),x2(1))d1h1.

Then the following properties are true:

  • j.

    These suites(x1(n))n=0,(x2(n))n=0 constructed using method ( 2 ) are convergent;

  • jj.

    If we writex¯1=limnx1(n)Andx¯2=limnx2(n)SO(x¯1,x¯2)SOrS=S1×S2And(x¯1,x¯2) is the only solution of the system ( 1 ) in the setS;

  • jjj.

    The following relationships take place

    r1(x¯1,x1(n)) d1p1n1p1
    r2(x¯2,x2(n)) d1h1p1n1p1
Demonstration.

From i. and ( 2 ) we deduce the following inequalities

r1(x1(2),x1(1)) ar1(x1(1),x1(0))+br2(x1(1),x2(0))
ad1+bd1h1d1p1

And

r2(x2(2),x2(1)) ar1(x1(2),x1(1))+br2(x2(1),x2(0))
ad1p1+bd1h1d1h1p1.

We now show thatx1(2)S1And x2(2)S2. We have indeed

r1(x1(2),x1(0)) r1(x1(2),x1(1))+r1(x1(1),x1(0))
d1+d1p1 <d11p1,

And

r2(x2(2),x2(0)) r2(x2(2),x2(1))+r2(x2(1),x2(0))
d1h1+d1p1h1h1d11p1

from which it follows thatx1(2)S1,x2(2)S2.

We will now assume that the following inequalities hold

(9) r1(x1(i),x1(i1)) d1p1i1
r2(x2(i),x2(i1)) d1h1p1i1

Fori=1,2,,kAnd

(10) x1(k)S1,x2(k)S2.

Taking into account ii., we deduce from hypotheses ( 9 ) and ( 10 ) and from i.

r1(x1(k+1),x1(k)) =r1(F1(x1(k),x2(k)),F1(x1(k1),x2(k1)))
ar1(x1(k),x1(k1))+br2(x2(k),x2(k1))
d1p1k1(a+bh1)=d1p1k

and taking into account the above inequality we deduce in an analogous manner

r2(x2(k+1),x2(k))d1h1p1k

from which it follows that relations ( 9 ) also hold fori=k+1. We will now show thatx1(k+1)S1Andx2(k+1)S2. It follows from the above inequalities

r1(x1(k+1),x1(0)) r1(x1(k+1),x1(k))+r1(x1(k),x1(k1))+r1(x1(1),x1(0))
d1+d1p1+d1p12++d1p1k<d11p1

and similarly

r2(x2(k+1),x2(0))<d1h11p1.

Since inequalities ( 9 ) hold for all i=1,2,,it results that the suites(x1(n))n=0And(x2(n))n=0are fundamental and that the following inequalities are true

(11) r1(x1(n+s),x1(n)) d1p1n1p1
r2(x2(n+s),x2(n)) d1h1p1n1p1

for everythingn=0,1,; s=1,2,.

From the hypothesis that the spacesX1AndX2are complete spaces it follows that the sequences(xn(n))n=0And(x2(n))n=0are convergent.

Passing the limit forswe deduce from ( 11 )

(12) r1(x¯1,x1(n)) d1p1n1p1
r2(x¯2,x2(n)) d1h1p1n1p1

It results, forn=0,whatx¯1S1Andx¯2S2. We will show that(x¯1,x¯2)is the only solution of the system ( 1 ) to the property that x¯1S1Andx¯2S2.

Let us suppose by contradiction that system ( 1 ) has another solution (and¯1,and¯2)to the propertyand¯1S1, and¯2S2. Taking into account i., the inequalities result

r1(x¯1,and¯1) ba(1a)(1b)r1(x¯1,and¯1)
r2(x¯2,and¯2) ba(1a)(1b)r2(x2,and2)

and from ( 5 ) it follows thatba(1a)(1b)<1. Therefore the above inequalities hold if and only ifx¯1=and¯1Andx¯2=and¯2. ∎

We now consider two applicationsF1:DX1AndF2:DX2, Or D=D1×D2.

We will assume thatF1, F2, F1AndF2 check the relationships

(13) r1(F1(in,in),F1(in,in)) d1
r2(F2(in,in),F2(in,in)) d2

for everything(in,in)D,Ord1>0,  d2>0 are given numbers. In order to solve the system ( 1 ) we will now consider instead of the procedure ( 2 ) the following iterative procedure:

(14) x1(n+1) =F1(x1(n),x2(n))
x2(n+1) =F2(x1(n+1),x2(n)),n=0,1,x1(0)=x1(0),x2(0)=x2(0),

In the following we will proceed to the delimitation of errors in the case where for the resolution of the system ( 1 ) we use instead of the method ( 2 ) the method ( 14 ). We write

(15) i1 =bd2+(1b)d1(1a)(1b)ab
i2 =(1a)d2+ad1(1a)(1b)ab

and designate byS1,S2the following sets:

(16) S1 ={xX1:r1(x,x1(0))d1+d11p1+i1}
S2 ={xX2:r2(x,x2(0))d1h1+d1h11p1+i2}.

In these notations we will demonstrate the following theorem:

Theorem 2 .

If the assumptions of Theorem 1 are satisfied and if in addition the following conditions are met:

  • i1.

    The applicationsF1,F2,F1AndF2 meet the conditions ( 13 );

  • i2.

    S1D1,S2D2,

so whatever the real numbers aree1, e2who verify the relationshipse1>2i1,e2>2i2, there is ansuch asr1(x1(n+1),x1(n))e1, Andr2(x2(n+1),x2(n))e2for everythingn>nand, furthermore, the following properties are true:

  • j1.

    x1(n)S1, x2(n)S2for everythingn=1,2,;

  • j2.

    The following inequalities are true:

    r1(x¯1,x1(n+1)) b(ae1+be2)+ae1(1b)(1a)(1b)ab+e12
    r2(x¯2,x2(n+1)) a(ae1+be2)+be2(1a)(1a)(1b)ab+e22

    for everythingn>n, Or(x¯1,x¯2) is the solution of the system ( 1 ).

Demonstration.

We will first show that properties j 1 are true. Since we have assumed thatx1(0)=x1(0),x2(0)=x2(0),it follows from ( 14 ) and i.

r1(x1(1),x1(1)) =r1(F1(x1(0),x2(0)),F1(x1(0),x2(0)))
d1+ar1(x1(0)x1(0))+br2(x2(0)x2(0))=d1

Taking into account iii., we deduce

r1(x1(1),x1(0)) r1(x1(1),x1(1))+r1(x1(1),x1(0))
d1+d1d1+d11p1+i1

since obviouslyd1i1, from which it results x1(1)S1.

We have in a similar way

r2(x2(1),x2(1)) =r2(F2(x1(1),x2(0)),F2(x1(1),x2(0)))
d2+ar1(x1(1),x1(1))+br2(x2(0),x2(0))d2+ad1

Taking into account iii. we deduce

r2(x2(1),x2(0))r2(x2(1),x2(1))+r2(x2(1),x2(0))d2+ad1+d1h1.

Taking into account thatd2+ad1i2it follows that

r2(x2(1),x2(0))h1d1+h1d11p1+i2

and thereforex2(1)S2.

We will now assume by induction thatx1(n1)S1Andx2(n1)S2.

We then have

(17) r1(x1(n),x1(n)) =r1(F1(x1(n1),x2(n1)),F(x1(n1),x2(n1)))
ar1(x1(n1),x1(n1))+br2(x2(n1),x2(n1))+d1

And

(18) r2(x2(n),x2(n)) =r2(F2(x1(n),x2(n1)),F2(x1(n),x2(n1)))
ar1(x1(n),x1(n))+br2(x2(n1),x2(n1))+d2.

We show by induction, from the above relations, that

(19) r1(x1(n),x1(n)) d1h1n1,k1n1+i1
r2(x2(n),x2(n)) d1h1n,k1n1+i2,

from which we deduce:

r1(x1(n),x1(0))r1(x1(n),x1(n))+r1(x1(n),x1(0))d1+d11p1+i1

And

r2(x2(n),x2(0))r2(x2(n),x2(n))+r2(x2(n),x2(0))d1h1+d1h11p1+i2

that's to sayx1(n)S1, x2(n)S2.

From the assumptions of Theorem 2 and the fact that x1(n)S1,x2(n)S2  for everythingnN, the following relationships result:

r1(x1(n+1),x1(n))ar1(x1(n),x1(n1))+br2(x2(n),x2(n1))+2d1

And

r2(x2(n+1),x2(n))ar1(x1(n+1),x1(n))+br2(x2(n),x2(n1))+2d2

Forn=0,1,.

From the above inequalities we deduce the following inequalities:

(20) r1(x1(n+1),x1(n)) d1h1n1k1n1+2i1
r2(x2(n+1),x2(n)) d1h1nk1n1+2i2,n=1,2,

We immediately deduce from ( 20 ) that ife1>2i1, Ande2>2i2,so it existsnsuch as forn>n r1(x1(n+1),x1(n))e1Andr2(x2(n+1),x2(n))e2that is, the iterative process ( 14 ) can be stopped when the distance between two successive iterations is sufficiently small.

We will now evaluate the distances between the solutions x¯1Andx¯2of the system ( 1 ) and the elements of the sequences(x1(n))s=0,respectively(x2(n))s=0. We will assume that the iterative process ( 14 ) is stopped whenr1(x1(n+1),x1(n))e1And r2(x2(n+1),x2(n))e2.

Taking into account what has been demonstrated above and the assumptions of Theorem 2 , we have:

r1(x¯1,x1(n+1)) ar1(x¯1,x1(n))+br2(x¯2,x2(n))+d1
r2(x¯2,x2(n+1)) ar1(x¯1,x1(n+1))+br2(x¯2,x2(n))+d2

It follows from the above inequalities

(1a)r1(x¯1,x1(n+1)) ae1+br2(x¯2,x2(n))+d1
(1b)r2(x¯2,x2(n+1)) ar1(x¯1,x1(n+1))+be2+d2

that's to say

(21) r1(x¯1,x1(n+1)) ae11a+b1ar2(x¯2,x2(n))+d11a
r2(x¯2,x2(n+1)) a1br1(x¯1,x1(n+1))+be21b+d21b

from which it results

(22) r2(x¯2,x2(n+1))a(ae1+be2)+b(1a)e2(1a)(1b)ab+e22.

Becausen>n+1, it follows that the second inequality of ( 21 ) is also true if we replacen+1aboutn, that is to say that

r2(x¯2,x2(n))a1br1(x¯1,x1(n))+be21b+d21b

inequality which associated with the inequality of ( 21 ) gives us

(23) r1(x¯1,x1(n+1))b(ae1+be2)+a(1b)e1(1a)(1b)ab+e12

Bibliography




Résumé

In this work, bounds are provided for the errors committed in the numerical resolution using the Gauss-Seidel method - of a system of two equations with two unknowns in metric spaces.

And(Xi,ri),i=1,2,are two complete metric spaces andF1:X1×X2X1AndF2:X1×X2X2two applications, then we apply for the resolution of the systemx1=F1(x1,x2),x2=F2(x1,x2),the Gauss-Seidel method and sufficient conditions are given for the convergence of the process used.

We designate byD1X1AndD2X2two bounded sets ofX1AndX2and then we consider two operatorsF1:D1×D2X1F2:D1×D2X2which check against F1AndF2the conditions:r1(F1(x1,x2),F1(x1,x2))e1,r2(F2(x1,x2),F2(x1,x2))e2for each(x1,x2)D1×D2. Under these conditions, the Gauss-Seidel method is applied to the system for the resolution of the initial system.x1=F1(x1,x2),x2=F2(x1,x2). Under these conditions, we give delimitations of the distance between the solution of the system and the approximate solution.


Ion Pavaloiu

Institute of Mathematics

Post Office 1

C.P. 68

3400 Cluj-Napoca

Romania



This Note is in final form and no version of it is or will be submitted for publication elsewhere.

1988

Related Posts