Remarks on solving the systems of equations by iterative methods

Abstract

In this paper we give a condition for the convergence of an iterative method of Gauss-Seidel type  \[ x_i = \varphi (x_{i-1}, y_{i-1}) \\ y_i = \psi (x_i, y_{i-1})\] for solving the nonlinear system of equations of the type: \[ x = \varphi (x, y) \\ y = \psi (x, y). \] We then provide some error evaluations in case of exact and approximate computations. We also provide a sufficient condition when the system contains \(k\) equations with \(k\) unknowns \[x_i = \varphi_i (x_1,x_2,…,x_k), \quad i=1,…,k.\]

Authors

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

Title

Original Title (in Romanian)

Observații asupra rezolvării sistemelor de ecuații cu ajutorul procedeelor iterative

English Translation of the Title

Remarks on solving the systems of equations by iterative methods

Keywords

nonlinear system of equations; fixed point problem; Gauss-Seidel method.

PDF

Cite this paper as:

I. Păvăloiu, Observaţii asupra rezolvării sistemelor de ecuaţii cu ajutorul procedeelor iterative, Studii şi cercetări matematice, 19 (1967) no. 9, pp. 1289-1298.

About this paper

Journal

Studii şi cercetări matematice

Publisher Name

Academia Republicii S.R.

DOI

Not available yet.

MSC

Not available yet.

MR

Not available yet.

ZBL

Not available yet.

Google scholar – not available yet

Paper (preprint) in HTML form

Observaţii asupra rezolvării sistemelor de ecuaţii cu ajutorul procedeelor iterative (English translation) Remarks on solving the systems of equations by iterative methods1)

Observaţii asupra rezolvării sistemelor de ecuaţii cu ajutorul procedeelor iterative
 
(English translation)
Remarks on solving the systems of equations
by iterative methods1)

by
Ion Păvăloiu
(Cluj)
Abstract.

In this paper we give a condition for the convergence of an iterative method of Gauss-Seidel type for solving the system of equations:

x =φ(x,y)
y =ψ(x,y).

We then provide some error evaluations in case of exact and approximate computations. We also provide a sufficient condition when the system contains k equations with k unknowns.

1)Communication presented at the second Scientific Session of the Youth, May 20-22, 1966, Bucharest, Romania.
 
 ST. CERC. MAT., TOM. 19, NR. 9, PP. 1289–1298, BUCUREŞTI, 1967.

Introduction

Given the systems of equations:

(1) x =φ(x,y)
y =ψ(x,y),

where the functions φ and ψ are assumed to satisfy:

  • a)

    The functions φ and ψ are defined on the closed domain D¯, and transform this domain in itself.

  • b)

    The functions φ and ψ are Lipschitz on D¯, i.e., there exist α, β, a and b0 such that:

    |φ(x1,y1)φ(x2,y2)| α|x1x2|+β|y1y2|
    |ψ(x1,y1)ψ(x2,y2)| a|x1x2|+b|y1y2|,(xi,yi)D¯,i=1,2.

We propose the following iterations for solving the system (1). Let (x0,y0)D¯ be an initial approximation; let:

(2) xi =φ(xi1,yi1)
yi =ψ(xi,yi1),i=1,2,3,,

Regarding the sequences (2), the following result is well known [1]:

Theorem 1.

If the functions φ and ψ satisfy the hypotheses a) and b) with the following restrictions: either α+β<1, a+b<1 or a+α<1, b+β<1, then the sequences (2) converge to the limits x¯ and y¯ such that the point M(x¯,y¯) is a solution of the system (1), and this solution is unique.

Since Theorem 1 offers sufficient (but not also necessary) conditions for the convergence of the sequences (2), there are cases when the constants α, β, a and b do not satisfy the hypotheses of Theorem 1 but still, the sequences (2) converge. In this note we give certain conditions on the constants α, β, a and b which strictly include those in Theorem 1; our conditions will contain supplementary cases for which the system (1) admits an unique solution, which can be computed with the aid of the sequences (2).

1. Auxiliary results

Being given two sequences of nonnegative numbers:

(1) g ={g0,g1,,gn,}
f ={f0,f1,,fn,}.

we assume that the elements obey the conditions:

(2) fn αfn1+βgn1
gn afn+bgn1,n=1,2,,

with α, β, and a,b nonnegative. We attach to the system of recurrent inequalities (2) the following algebraic system in the unknowns k and h:

(3) α+βh =kh,
ak+b =kh.
Lemma 2.

The necessary and sufficient condition for the system (3) to admit a solution (h1,k1),h10k10, such that

(4) 0h1k1q<1

is that the constants α, β, a and b satisfy the following inequalities:

(5) α+b+aβ <2
(1α)(1b) >aβ.
Proof.

Necessity. From (3) we deduce the following equation in h:

(6) βh2(b+βaα)hαa=0.

If we add the relation

(7) p=kh

to the system (3) and we eliminate h and k from the three obtained equalities and we take into account (6), we obtain the following equation in p:

(8) F(p)=p2(b+βa+α)p+bα=0.

Again, from the system (3) we deduce the following equation in k:

(9) ak2(α+βab)kβb=0.

We notice that the equations (6) and (9) admit real roots, and since the right-hand site terms from both equations are negative, it follows that these equations admit roots of different signs.

Denote by (h1,h2) the roots of (6) and by (k1,k2) the roots of equations (9); then the roots of (8) will be p1=k1h1 and p2=k2h2 and these roots are always real. If (k1,h1) is the pair of positive solutions of equations (6) and (9), then it is obvious that p1>p2 and p20. Assume that p1<1. For this inequality to hold, it is necessary that F(1)>0 and p1+p22<1 which leads to inequalities (5).

Sufficiency. If inequalities (5) are true, it follows that:

F(0) =bα0
F(1) =(1α)(1b)aβ>0

and

p1+p22=(α+b+aβ)2<1

whence p1<1, which finishes the proof. ∎

Lemma 3.

If α, β, a and b satisfy inequalities (5) and the elements of the sequences (1) satisfy inequalities (2), then there exists a nonnegative constant c1 for which

(10) fn c1h1n1k1n1
gn c1h1nk1n1

and, moreover, the series i=0fi and i=1gi are convergent.

Proof.

Let (h1,k1) be a solution of the system (3) such that the hypotheses of the lemma are satisfied. Assume that for n=1 we have:

(11) f1 c1
g1 c1h1

One notes without difficulty that for these inequalities to hold it suffices to choose c1 such that:

(12) c1max{αf0+βg0,af1+bg0h1}.

If the inequalities (11) are satisfied by the chosen c1 we assume by induction that:

fn1 c1h1n2k1n2
gn1 c1h1n1k1n2.

Based on the fact that the system (3) is verified by the solutions h1 and k1 from (2) we have:

fnc1h1n2k1n2(α+βh1)=c1h1n1k1n1

and

gnc1h1n1k1n2(ak1+b)=c1h1nk1n1.

According to the induction principle, the first part of the lemma is proved. The second part is obvious, since the terms of the two series are majorized by the terms of two geometrical series with subunitary ratio. ∎

Corollary 4.

If α+β<1 and a+b<1 or α+a<1 and β+b<1, the inequalities (5) are satisfied.

Lemma 5.

If the elements of the sequence (1) satisfy the following inequalities:

(13) fn αfn1+βgn1+δ
gn afn+bgn1+δ,

where δ is a positive constant and ifα,β,a and bsatisfy inequalities (5), then there exists a positive constant c1 such that

(14) fn c1h1n1k1n1+δ1h1k1
gn c1h1nk1n1+δh11h1k1.

The proof of this lemma is analogous to the proof of Lemma 2.

2. Theorem of existence and uniqueness of solution

Theorem 6.

If the functions φandψsatisfy conditions a) and b), and, moreover, the constants α,β,aandb are such that the following inequalities are satisfied:

(15) a+b+aβ <2
(1α)(1b) >aβ

then system (1) has a unique solution in D¯,given by the limits of the sequences (2).

Proof.

We shall show first that the sequences (2) are convergent. One notices that the partial sums of the following series

(16) (X)x0+i=1(xixi1)
(Y)y0+i=1(yiyi1)

coincide with the terms of the sequences (2). If we denote fn1=|xnxn1| andgn1=|ynyn1|,then taking into account condition  b) and the terms of the sequences (2) then we are lead to the following inequalities

fn αfn1+βgn1
gn afn+bgn1.

By using Lemma 3, it follows that the series (16) are absolutely convergent, and therefore convergent. Therefore there exist two numbers x¯,y¯, such that

limnxn=x¯andlimnyn=y¯.

Taking now into account that functions φandψ satisfy condition b), it follows that they are continuous on D¯, and passing to the limit in the equalities

xn+1 =φ(xn,yn)
yn+1 =ψ(xn+1,yn)

we get

x¯=φ(x¯,y¯)

and

y¯=ψ(x¯,y¯)

whence it follows that x¯andy¯ satisfy system (1). Let us now show that the obtained solution is the unique solution of the system (1) in the domain D¯. Assume that, besides the solution (x¯,y¯)the system admits another solution,(x¯1,y¯1) which does not coincide with the previous one. We shall show first that if (x¯,y¯) is a solution of (1) and (x¯0,y¯0)is an arbitrary element of D¯, then there exist two sequences

x1 =φ(x0,y0),,xn=φ(xn1,yn1),
y1 =φ(x1,y0),,yn=φ(xn,yn1),

such that

(17) limn|x¯xn| =0
limn|yy¯n| =0.

Indeed, from the fact that (x¯,y¯) satisfy (1) and if we take into account condition b) we get the following inequalities

|x¯xn| α|x¯xn1|+β|y¯yn1|
|y¯yn| a(x¯xn)+b|y¯yn1|,

whence, taking into account Lemma 2 it follows that the inequalities (17) are true. If (x0,y0)and(x0,y0)are distinct points fromD¯ and

xn =φ(xn1,yn1)xn=φ(xn1,yn1)
yn =ψ(xn,yn1),n=1,2,,yn=ψ(xn,yn1),n=1,2,

are the sequences generated by them, we shall show that

(18) limn|xnxn| =0
limn|ynyn| =0.

Indeed, we have

|xnyn| α|xn1xn1|+β|yn1yn1|
|ynyn| a|xnxn|+b|yn1yn1|.

Then Lemma 2 imply the inequalities (18). The above relations imply that if {xn} and{yn} are two sequences such that

limnxn =x¯
limnyn =y¯

and {xn} and {yn} are two sequences such that

limxn =x¯1,
limy1 =y¯1,

then we have

|x¯x¯1| |x¯xn|+|xnxn|+|xnx¯1|
|y¯y¯1| |y¯yn|+|ynyn|+|yny¯1|.

These inequalities are true for all n. Passing to limit as n and taking into account the above remarks, we have

x¯=x¯1and y¯=y¯1

and therefore the system has a unique solution. ∎

Corollary 7.

From the consequence of Lemma 3 it follows that the conditions from Theorem 1 are contained also in Theorem 6, but Theorem 6 contains other cases, which are not contained in Theorem 1. We shall illustrate this in the following example.

Example 1.

Given the linear system

x =0.1x+8y0,6
y =0.05x+0.45y0.5.

Theorem 1 can say nothing about this, while if we apply Theorem 6 we obtain the system

0.1+8h =hk
0.05k+0.45 =hk

which can be seen to satisfy (5). From here we can draw the conclusion that the procedure (2) applied to the above system converges to the solution of this system. Starting from x0=0 and y0=0 in approximately 150 iterations we obtain the approximate solutionsx=45.578936,y=5.052631.

3. The evaluation of errors in the exact case

In order to evaluate the errors we assume that one can exactly compute the values of φ and ψat any point inD¯. Consider

|xn+pxn| |xn+pxn+p1|++|xn+1xn|
c1(h1n+p2k1n+p2++h1n1k1n1),

whence, passing to limit as p, one obtains

(19) |x¯xn|c1h1n1k1n11h1k1.

Analogously, we obtain for the second solution the following evaluation:

(20) |y¯yn|c1h1nk1n11h1k1.

4. The evaluation of errors in the approximate case

We consider here that the values of the functions φandψcannot be computed at the points inD¯, but we have the possibility to compute the exact values of two functionsφ1andψ1which are defined on the domain D¯,and the functions φ1andψ1 transform this domain in itself. We also assume that there exists a positive number δ such that

(21) |φ(x,y)φ1(x,y)| δ
|ψ(x,y)ψ1(x,y)| δ,for all (x,y)D.

Instead of the system (1) we consider now an approximate one

(22) x =φ1(x,y)
y =ψ1(x,y).

Regarding the functions φ1andψ1 we have assumed just that they obey (21), and we do not know whether the Gauss-Seidel method applied to it converges. Also, if we intend to stop the iterations when

(23) |xn+1xn| ε
|yn+1yn| ε

we have no guarantee that for arbitrary εthe inequalities  (23) can be satisfied. Indeed, considering the iterations

xn+1 =φ1(xn,yn)
yn+1 =ψ1(xn+1,yn).

We have

|xn+1xn|α|xnxn1|+β|ynyn1|+2δ

and

|yn+1yn|a|xn+1xn|+b|ynyn1|+2δ.

If we take into account Lemma 5 we get

(24) |xn+1xn| c1h1n1k1n1+2δ1h1k1
|yn+1yn| c1h1nk1n1+2δh11h1k1,

whence it follows that if we choose ε such that

(25) ε>max{2δ1h1k1,2δh11h1k1},

at a certain step nthe inequalities  (23) will be satisfied. Let now ε be chosen as in (25); then there exists n such that

(26) |xn+1xn| ε
|yn+1yn| ε;

we have

|x¯xn+1|α|x¯xn|+β|y¯yn|+δ.

If we take into account that for the system (3) to admit a solution (h1,k1) for which

0h1k1q<1,

it is necessary thatα<1 and b<1. Then we have

(27) |x¯xn+1|αε+δ+β(y¯yn)1α.

Analogously, we find for |y¯yn+1| the following evaluation

(28) |y¯yn+1|bε+δ+a|x¯xn+1|1b.

From (27) and (28) we obtain

(29) |x¯xn+1| (α+β)ε+δ1α+β1α|y¯yn+1|
|y¯yn+1| bε+δ1b+a1b|x¯xn+1|.

From the above inequalities, taking into account (5) we deduce

(30) |x¯xn+1| (1b)[(α+β)ε+δ]+β(bε+δ)(1α)(1b)βa
|y¯yn+1| (1α)[bε+δ]+a[(α+β)ε+δ](1α)(1b)βa.

5. A generalization

Consider now a system of kequations in k unknowns of the form

(31) xi=φi(x1,x2,,xk),i=1,2,,k.

Regarding the functions φi,i=1,2,,k, we consider assumptions similar to those considered for the system (1):

  • a)

    The functions φi,i=1,2,,k, transform the domain D¯,of the space Ek, in itself;

  • b)

    There exists a matrix with nonnegative constants, β=(βij),i,j=1,2,,k, such that

    |φi(x1,x2,,xk)φi(x1,x2,,xk)|j=1kβij|xjxj|,i=1,2,,k

    for all (x1,x2,,xk)and x1,x2,,xk are two points from D¯.

We obtain the following result.

Theorem 8.

If the functions φi, i=1,2,,k,satisfy conditions  a’), b’) and the elements of the matrix β are such that the system

β11+β21h1++βk1h1h2hk1=h1h2hk
.
β1ihihi+1hk+β2ih1hihk++βii+βi+1ihi++βkihihi+1hk1=h1h2hk
.
β1khk+β2kh1hk++βk1kh1h2hk2hk+βkk=h1h2hk

is compatible and has a solution (h10,h20,,hk0), hi0    i=1,2,,k for which

0h10h20hk0q<1,

then the system (31) has a unique solution in the domain D¯, which can be obtained from the iterations

xi(n)=φi(x1(n),x2(n),,xi1(n),xi(n1),,xk(n1)),i=1,2,,k;n=1,2,3,,

for any initial approximation (x10,x20,,xk0)D.

The proof of this result is obtained analogously to the proof of Theorem 6.


Received by the editors on March 23, 1967.


Institutul de Calcul al Academiei Republicii Socialiste Romania - Filiala Cluj

References

  • [1] Demidovici, B.P., Maron, I.A., Osnovi vacislietel’noi matematiki, Gas. izd. fiz. mat. lit., Moskva, 1960, pp. 148–151.
  • [2] J.F. Traub, Iterative Methods for the Solution of Equations. Prentice Hall, Inc., Englewwod Cliffs, N.J., 1964, 99.38-39.
  • [3] Ostrowski, A.N., Resenie uravnenii i sistem uravnenii, Izd. inostr. lit., Moskva, 1963, pp. 83–94.
  • [4] I. Păvăloiu, On some recurrent inequalities and some of their applications, Communication at the Scientific Session of the Institute for Mining Petroşani, February 7–10, 1966.
  1. B.P. Demidovici, I.A. Maron, Osnovi vacislietel’noi matematiki, Gas. izd. fiz. mat. lit., Moskva, 1960, pp. 148–151.
  2. J.F. Traub, Iterative Methods for the Solution of Equations. Prentice Hall, Inc., Englewwod Cliffs, N.J., 1964, 99.38-39.
  3. A.M. Ostrowski, Resenie uravnenii i sistem uravnenii, Izd. inostr. lit., Moskva, 1963, pp. 83–94.
  4. I. Pavaloiu, On some recurrent inequalities and some of their applications, Communication at the Scientific Session of the Institute for Mining Petrosani, February 7–10, 1966.
1967

Related Posts

No results found.