Abstract
In a partially ordered space, the method xn+1 = L+x +n − N+x -n − L−y+ + N− y -n + r, yn+1 = N+y+ − L+y -n − N−x +n + L−x− + t of successive approximation is developed in order to enclose the solutions of a set of linear fixed point equations monotonously. The method works if only the inequalities x0 ≤ y0, x0 ≤ x1, y1 ≤ y0 related to the starting elements are satisfied. In finite-dimensional spaces suitable starting vectors can be computed if a sufficiently good approximation for the fixed points is known.
Similar content being viewed by others
Literaturverzeichnis
J. Albrecht, Monotone Iterationsfolgen und ihre Verwendung zur Lösung linearer Gleichungssysteme,Numer. Math. 3 (1961), 345–358.MR 25 # 754
G. Alefeld undJ. Herzberger,Einführung in die Intervallrechnung, Bibliographisches Institut, Mannheim, 1974.MR 53 # 11950
W. Dück,Numerische Methoden der Wirtschaftsmathematik, I, Akademie-Verlag, Berlin, 1970.MR 42 # 1311
N. S. Kurpel' undT. S. Kurčenko, Dvustoronnie metody rešenija sistem uravnenii (Two-sided methods for the solution of systems of equations)}, Naukova Dumka, Kiev, 1975.MR 54 # 1586
J. W. Schmidt, Einschließung inverser Elemente durch Fixpunktverfahren,Numer. Math. 31 (1978), 313–320.MR 28 a:65112
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schmidt, J.W. Ein Einschliessungsverfahren für Lösungen Fehlerbehafteter Linearer Gleichungen. Period Math Hung 13, 29–37 (1982). https://doi.org/10.1007/BF01848094
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01848094