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
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
Let us designate bytwo complete metric spaces and bythe Cartesian product of these spaces. We will denote byAnd two applications of spacein, respectively inand we consider the following system of equations:
| (1) | ||||
To solve the system ( 1 ) we will adopt the following Gauss-Seidel type iterative process:
| (2) | ||||
In works [ 2 ] , [ 3 ] we studied the convergence of method ( 2 ) under the assumption that the applicationsAndsatisfy Lipschitz-type conditions throughout the space .
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 Andare replaced by two other applications And, which meet certain conditions for bringing togetherAndthroughout space.
In the applications of this theory to the resolution of a class of concrete equations, the conditions imposed on the applicationsAndthroughout space are awkward, because of the fact that the spacemay not be limited.
In the following we will study this problem on the assumption thatAndmeet Lipschitz-type conditions and rapprochement conditionsAndin certain bounded subsetsAnd.
Let us therefore designate byAndtwo bounded sets of spacesrespectivelyand bytheir Cartesian product. Consider two sequencesAndwhose elements meet the conditions:
| (3) | ||||
Or Andare non-negative real numbers and for everything.
We will associate to the system ( 3 ) the following system of equations in the unknownsAnd:
| (4) | ||||
In works [ 2 ] , [ 3 ] and [ 4 ] we have shown that if the numbersAnd check the relationships
| (5) | ||||
then the system ( 4 ) admits real solutionsfor whichand that one of the solutions verifies the conditions. In addition, the elements of the suites check the relationships
| (6) | ||||
Or
If we writethen we easily see using ( 4 ) thatcheck the equation
| (7) |
Let us designate bya number such that, , Or
| (8) | ||||
Regarding the convergence of sequenceswe have the following theorem:
Theorem 1 .
If the applicationscheck the conditions
-
i.
for all
-
ii.
The names Andcheck the relationships ( 5 );
-
iii.
The elementsAnd suitescheck the conditionsAnd.
Then the following properties are true:
Demonstration.
From i. and ( 2 ) we deduce the following inequalities
And
We now show thatAnd . We have indeed
And
from which it follows that.
We will now assume that the following inequalities hold
| (9) | ||||
ForAnd
| (10) |
Taking into account ii., we deduce from hypotheses ( 9 ) and ( 10 ) and from i.
and taking into account the above inequality we deduce in an analogous manner
from which it follows that relations ( 9 ) also hold for. We will now show thatAnd. It follows from the above inequalities
and similarly
Since inequalities ( 9 ) hold for all it results that the suitesAndare fundamental and that the following inequalities are true
| (11) | ||||
for everything .
From the hypothesis that the spacesAndare complete spaces it follows that the sequencesAndare convergent.
We now consider two applicationsAnd, Or .
We will assume that And check the relationships
| (13) | ||||
for everythingOr are given numbers. In order to solve the system ( 1 ) we will now consider instead of the procedure ( 2 ) the following iterative procedure:
| (14) | ||||
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) | ||||
and designate bythe following sets:
| (16) | ||||
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:
-
i
The applicationsAnd meet the conditions ( 13 );
-
i
,
so whatever the real numbers are who verify the relationships, there is asuch as, Andfor everythingand, furthermore, the following properties are true:
-
j
for everything
- j
Demonstration.
We will first show that properties j 1 are true. Since we have assumed thatit follows from ( 14 ) and i.
Taking into account iii., we deduce
since obviously, from which it results .
We have in a similar way
Taking into account iii. we deduce
Taking into account thatit follows that
and therefore.
We will now assume by induction thatAnd.
We then have
| (17) | ||||
And
| (18) | ||||
We show by induction, from the above relations, that
| (19) | ||||
from which we deduce:
And
that's to say .
From the assumptions of Theorem 2 and the fact that for everything, the following relationships result:
And
For.
From the above inequalities we deduce the following inequalities:
| (20) | ||||
We immediately deduce from ( 20 ) that if Andso it existssuch as for Andthat 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 Andof the system ( 1 ) and the elements of the sequencesrespectively. We will assume that the iterative process ( 14 ) is stopped whenAnd .
Taking into account what has been demonstrated above and the assumptions of Theorem 2 , we have:
It follows from the above inequalities
that's to say
| (21) | ||||
from which it results
| (22) |
Because, it follows that the second inequality of ( 21 ) is also true if we replaceabout, that is to say that
inequality which associated with the inequality of ( 21 ) gives us
| (23) |
∎
Bibliography
- [1]
-
[2]
Pavaloiu, I.,
††margin:
clickable
Introduction to the theory of approximation of solutions of equations , Dacia Publishing House, Cluj-Napoca, 1976. -
[3]
††margin:
clickable
clickable
clickable Păvăloiu, I., The resolution of operational systems using iterative methods , Mathematica, 11(34), (1969), 137–141. - [4] Păvăloiu, I., Estimation of errors in the numerical resolution of systems of equations in metric spaces , Seminar on Functional Analysis and Numerical Methods, Preprint Nr. 1, (1987), 121–129.
- [5] Păvăloiu, I., The convergence of certain iterative methods for solving certain operatorial equations , Seminar on Functional analysis and Numerical Methods, Preprint Nr. 1 (1986), 127–132.
- [6] Traub, J. F., Iterative Methods for the Solution of Equations, Prentice Hall Series in Automatic Computation, Englewood Cliffs, N. J. (1964).
- [7] Urabe, M., Convergence of numerical iteration in solution of equations, J. Sci. Hiroshima Univ. Ser. A, 19 (1956), 479–489.
- [8] Urabe, M., Error estimation in numerical solution of equations by iteration process, J. Sci. Hiroshima Univ. Ser. A-I, 26, (1962), 77–91.
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.
Andare two complete metric spaces andAndtwo applications, then we apply for the resolution of the systemthe Gauss-Seidel method and sufficient conditions are given for the convergence of the process used.
We designate byAndtwo bounded sets ofAndand then we consider two operatorswhich check against Andthe conditions:for each. Under these conditions, the Gauss-Seidel method is applied to the system for the resolution of the initial system.. 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.
