Abstract
Let \(\left( X,\rho \right)\) be a complete metric space, \(f:X\rightarrow X\) a nonlinear mapping. In order to solve the equation \(x=f\left( x\right) \) we consider a multistep method \[x_{n+k+1}=G(x_{n},x_{n+1},…,x_{n+k}), \quad n=1,2,… \] generated by a mapping \(G:X^{k+1}\rightarrow X\), whose diagonal restriction coincides with \(f\): \(G(x,…,x)=f(x)\). Under Lipschitz assumption on \(G\) we determine the algebraic equation whose unique positive solution leads to the convergence order of the iterations. We also study the case when the operator \(G\) replaced by an approximation of it.
Authors
Ion Păvăloiu
(Tiberiu Popoviciu Institute of Numerical Analysis)
Title
Original title (in French)
Sur l’approximation des racines des equations dans une espace métrique
English translation of the title
On approximating the solutions of equations in metric spaces
Keywords
multistep iterative methods; convergence; successive approximations
Cite this paper as:
I. Păvăloiu, Sur l’approximation des racines des equations dans une espace métrique, Seminar on functional analysis and numerical methods, Preprint no. 1 (1989), pp. 95-104 (in French).
About this paper
Journal
Seminar on functional analysis and numerical methods,
Preprint
Publisher Name
“Babes-Bolyai” University,
Faculty of Mathematics,
Research Seminars
DOI
Not available yet.
References
[1] I. Pavaloiu, I., Serb, Sur des methodes iteratives optimales, Research Seminars, Seminar on Functional Analysis and Numerical Methods, Preprint Nr.1 (1983), 175–182.
[2] I.A. Rus, An iterative method for the solution of the equation x = f (x, x, . . . , x), Anal. Num´er. Theor. Approx., 10 (1981), 95–100.
[3] Weinischke, J.H., Uber eine klasse von Iterationverfahren, Numerische Mathematik 6 (1964), 395–404.
Paper (preprint) in HTML form
"Babeş-Bolyai" University
Faculty of Mathematics and Physics
Research Seminars
Seminar on Functional Analysis and Numerical Methods
Preprint Nr.1, 1989, pp.95-104
On approximating the solutions of equations in metric spaces
In this note we study the evaluation of errors that arise during the numerical resolution of equations in metric spaces using certain multi-step iteration methods.
Consider a metric spacecomplete and the following equation:
| (1) |
Oris any operator.
Let us designate bythat is to say the Cartesian product of the setwith himselftimes.
For the resolution of equation ( 1 ) we consider the applicationwhich we assume is restricted to the diagonal of spacecoincides with the operator, that's to say:
| (2) |
for each.
Consider the followingprovided by the following iteration process:
| (3) |
Orare given elements.
Let us designate bya bounded set in this space. We assume that on the setthe operatorverifies the Lipschitz condition, that is:
| (4) |
Orfor each , .
Consider the equation:
| (5) |
We know that in the case where for each and where there exists at least one numberfor which , this equation has only one rootreal and positive.
If in addition:
| (6) |
then this root verifies the inequality
| (7) |
Regarding the convergence of the sequenceprovided by method ( 3 ) we have the following theorem:
Theorem 1 .
If the applicationand the initial elements meet the following conditions:
- i)
-
ii)
The wholeOris the positive root of equation ( 5 ) and
then we have the following properties:
-
j)
for each;
-
jj)
the sequelis convergent and if we denote bythe limit of the sequence, SOAndis the unique solution of equation ( 1 ) of the sphere;
-
jjj)
we have the following inequalities:
Demonstration.
From conclusion ii) it follows thatfor each. Forwe have the following inequalities:
| (8) | ||||
from which we deduce thatFor.
Subsequently we assume thatAndfor each. From this inequality we deduce that:
where we used the fact thatverifies equation ( 5 ).
From the above inequalities, and in a manner similar to that used in the demonstration of relation ( 8 ), we deduce that. From the principle of mathematical induction it therefore follows that all the elements of the sequence belong to the sphere.
On the completeness of spaceand inequalities
| (9) | ||||
for eachit follows that the followingis convergent.
Let us designate by. So by passing to limit in the inequalities ( 9 ) with on a:
| (10) |
Let us now demonstrate that.
Let us now show thatis the unique solution of equation ( 1 ) which belongs to the sphere. Suppose instead that equation ( 1 ) has at least two solutionsAnd in. So fromAnd, and from ( 2 ) it follows that:
from which, if we take into account ( 6 ) we obtain
This last inequality being impossible, it follows that the assumption is false, therefore that equation ( 1 ) has a unique solution.
Let us then consider the applicationwhich fills with the applicationthe following condition:
| (11) |
for each.
To solve equation ( 1 ) we will replace the sequenceprovided by the relation ( 3 ), subsequently provided by the following iterative process:
| (12) |
where we assume that the initial elements have been chosensuch that the following conditions are met:
| (13) | ||||
Regarding the relationshipwe assume that we have the following condition
Let us also assume that the set:
| (14) |
is contained in.
Furthermore we assume that the initial elementsof method ( 12 ) fill with the elementsof ( 3 ) the following conditions:
| (15) | ||||
Using these assumptions and further using the fact that verifies the hypotheses of Theorem 1 , we will demonstrate that for eachwe have the following inequalities:
| (16) |
| (17) |
And
| (18) |
Indeed, by using relations ( 15 ) we obtain the following relations:
| (19) | ||||
that is to say that inequality ( 16 ) is verified, forLet us now show that. Using inequalities ( 19 ) and ( 8 ) we obtain:
| (20) | ||||
Generally, if we assume that
and that we have the following inequalities:
for eachthen in a manner similar to that used to demonstrate inequality ( 19 ) we obtain:
| (21) | ||||
from which it follows that we have the inequalities ( 16 ) for each. From relations ( 21 ) and ( 8 ), in a manner similar to that used in the deduction of relation ( 20 ), it follows that.
Let us now demonstrate that the inequalities ( 17 ) are verified. If we consider the relations ( 13 ) we have the following inequalities:
| (22) | ||||
so we obtained the inequality ( 17 ) for
Now assuming that we have the following inequalities:
Forin a manner similar to that employed in the deduction of inequality ( 22 ) we obtain inequalities ( 17 ).
Inequalities ( 18 ) provide an assessment of the distance between the exact solution of equation ( 1 ) and its approximation, obtained using the iteration method ( 12 ).
Noticed .
If we notice that the wholeon which condition ( 4 ) is fulfilled, is itself a metric space, it follows that we can consider theorem 1 as a special case of the main result contained in the work [ 3 ] . From our point of view the importance of this theorem consists in the fact that the setbeing limited it allows easy choice of application, application that fills with the applicationthe condition ( 11 ). Let us imagine for example the trivial case of the equation and the approximate equation
Because it follows that the differenceis not bounded, so even in the casecondition ( 11 ) cannot be fulfilled in the whole space.
Bibliography
- [1]
- [2] I. Păvăloiu, I., Şerb, Sur des methodes iteratives optimales, Research Seminars, Seminar on Functional Analysis and Numerical Methods, Preprint Nr.1 (1983), 175–182.
- [3] I.A. Rus, An iterative method for the solution of the equation Anal. Numér. Théor. Approx., 10 (1981), 95–100.
- [4] Weinischke, JH, On a class of iteration methods , Numerical Mathematics 6 (1964), 395–404.
Institute of Computing
Post Office 1
C.P. 68
3400 Cluj-Napoca
Romania
This paper is in final form and no version of it is or will be submitted for publication elsewhere.
