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.
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)
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:
We then provide some error evaluations in case of exact and approximate computations. We also provide a sufficient condition when the system contains equations with unknowns.
ST. CERC. MAT., TOM. 19, NR. 9, PP. 1289–1298, BUCUREŞTI, 1967.
Introduction
Given the systems of equations:
(1) | ||||
where the functions and are assumed to satisfy:
-
a)
The functions and are defined on the closed domain and transform this domain in itself.
-
b)
The functions and are Lipschitz on i.e., there exist and such that:
We propose the following iterations for solving the system (1). Let be an initial approximation; let:
(2) | ||||
Theorem 1.
Since Theorem 1 offers sufficient (but not also necessary) conditions for the convergence of the sequences (2), there are cases when the constants and do not satisfy the hypotheses of Theorem 1 but still, the sequences (2) converge. In this note we give certain conditions on the constants and 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) | ||||
we assume that the elements obey the conditions:
(2) | ||||
with and nonnegative. We attach to the system of recurrent inequalities (2) the following algebraic system in the unknowns and :
(3) | ||||
Lemma 2.
The necessary and sufficient condition for the system (3) to admit a solution such that
(4) |
is that the constants and satisfy the following inequalities:
(5) | ||||
Proof.
Necessity. From (3) we deduce the following equation in :
(6) |
If we add the relation
(7) |
to the system (3) and we eliminate and from the three obtained equalities and we take into account (6), we obtain the following equation in :
(8) |
Again, from the system (3) we deduce the following equation in :
(9) |
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 the roots of (6) and by the roots of equations (9); then the roots of (8) will be and and these roots are always real. If is the pair of positive solutions of equations (6) and (9), then it is obvious that and Assume that For this inequality to hold, it is necessary that and which leads to inequalities (5).
Lemma 3.
Proof.
Let be a solution of the system (3) such that the hypotheses of the lemma are satisfied. Assume that for we have:
(11) | ||||
One notes without difficulty that for these inequalities to hold it suffices to choose such that:
(12) |
If the inequalities (11) are satisfied by the chosen we assume by induction that:
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 and or and the inequalities (5) are satisfied.
Lemma 5.
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 andsatisfy conditions a) and b), and, moreover, the constants and are such that the following inequalities are satisfied:
(15) | ||||
Proof.
We shall show first that the sequences (2) are convergent. One notices that the partial sums of the following series
(16) | |||
coincide with the terms of the sequences (2). If we denote andthen taking into account condition b) and the terms of the sequences (2) then we are lead to the following inequalities
By using Lemma 3, it follows that the series (16) are absolutely convergent, and therefore convergent. Therefore there exist two numbers such that
Taking now into account that functions and satisfy condition b), it follows that they are continuous on and passing to the limit in the equalities
we get
and
whence it follows that and satisfy system (1). Let us now show that the obtained solution is the unique solution of the system (1) in the domain . Assume that, besides the solution the system admits another solution, which does not coincide with the previous one. We shall show first that if is a solution of (1) and is an arbitrary element of , then there exist two sequences
such that
(17) | ||||
Indeed, from the fact that satisfy (1) and if we take into account condition b) we get the following inequalities
whence, taking into account Lemma 2 it follows that the inequalities (17) are true. If andare distinct points from and
are the sequences generated by them, we shall show that
(18) | ||||
Indeed, we have
Then Lemma 2 imply the inequalities (18). The above relations imply that if and are two sequences such that
and and are two sequences such that
then we have
These inequalities are true for all Passing to limit as and taking into account the above remarks, we have
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
Theorem 1 can say nothing about this, while if we apply Theorem 6 we obtain the system
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 and in approximately 150 iterations we obtain the approximate solutions
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 in. Consider
whence, passing to limit as one obtains
(19) |
Analogously, we obtain for the second solution the following evaluation:
(20) |
4. The evaluation of errors in the approximate case
We consider here that the values of the functions andcannot be computed at the points in, but we have the possibility to compute the exact values of two functionsandwhich are defined on the domain and the functions and transform this domain in itself. We also assume that there exists a positive number such that
(21) | ||||
Instead of the system (1) we consider now an approximate one
(22) | ||||
Regarding the functions and 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) | ||||
we have no guarantee that for arbitrary the inequalities (23) can be satisfied. Indeed, considering the iterations
We have
and
If we take into account Lemma 5 we get
(24) | ||||
whence it follows that if we choose such that
(25) |
at a certain step the inequalities (23) will be satisfied. Let now be chosen as in (25); then there exists such that
(26) | ||||
we have
If we take into account that for the system (3) to admit a solution for which
it is necessary that and . Then we have
(27) |
Analogously, we find for the following evaluation
(28) |
From the above inequalities, taking into account (5) we deduce
(30) | ||||
5. A generalization
Consider now a system of equations in unknowns of the form
(31) |
Regarding the functions , we consider assumptions similar to those considered for the system (1):
-
a′)
The functions , transform the domain of the space , in itself;
-
b′)
There exists a matrix with nonnegative constants, such that
for all and are two points from .
We obtain the following result.
Theorem 8.
If the functions satisfy conditions a’), b’) and the elements of the matrix are such that the system
is compatible and has a solution for which
then the system (31) has a unique solution in the domain which can be obtained from the iterations
for any initial approximation .
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.
- B.P. Demidovici, I.A. Maron, Osnovi vacislietel’noi matematiki, Gas. izd. fiz. mat. lit., Moskva, 1960, pp. 148–151.
- J.F. Traub, Iterative Methods for the Solution of Equations. Prentice Hall, Inc., Englewwod Cliffs, N.J., 1964, 99.38-39.
- A.M. Ostrowski, Resenie uravnenii i sistem uravnenii, Izd. inostr. lit., Moskva, 1963, pp. 83–94.
- 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.