Article
Keywords:
nonlinear systems; convex functions; Brown’s method; monotone convergence; Fourier iterates
Summary:
Given two initial points generating monotone convergent Brown iterations in the context of the monotone Newton theorem (MNT), it is proved that if one of them is an upper bound of the other, then the same holds for each pair of respective terms in the Brown sequences they generate. This comparison result is carried over to the corresponding Brown-Fourier iterations. An illustration is discussed.
References:
[6] J. P. Milaszewicz:
Comparison theorems for monotone Newton-Fourier iterations and applications in functional elimination. Linear Algebra Appl. 220 (1995), 343–357 343–357.
MR 1334584 |
Zbl 0844.65050
[9] J. M. Ortega, W. C. Rheinboldt:
Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York-London, 1970.
MR 0273810
[10] A. M. Ostrowski:
Solution of Equations and Systems of Equations. Academic Press, New York-London, 1960.
MR 0216746
[11] H. Schwetlick: Numerische Lösung Nichtlinearer Gleichungssysteme. R. Oldenburg Verlag, München, 1979.
[12] R. S. Varga:
Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs, 1962.
MR 0158502