Abstract
The paper discusses a technique for handling numerical, iterative processes that combines the efficiency of ordinary floating-point iterations with the accuracy control that may be obtained by iterations in interval arithmetic. As illustration the technique is used for the solution of fixed point problems in one and several variables.
Similar content being viewed by others
References
R. E. Moore,Introduction to algebraic problems, InTopics in Interval Analysis (ed. E. Hansen), Oxford, (1969), 3–10.
J. H. Wilkinson,Modern error analysis, SIAM Rev. 13 (1971), 548–568.
Karl Nickel,Triplex-Algol and its applications, InTopics in Interval Analysis (ed. E. Hansen), Oxford, (1969), 10–25.
Karl Nickel,Verbandstheoretische Grundlagen der Interval-Mathematik, InInterval Mathematics (ed. K. Nickel), Springer (1975), 251–263.
G. Birkhoff,Lattice theory, Providence 1967 AMS.
R. E. Moore,Interval analysis, Prentice-Hall, 1966.
L. V. Kantorovich and G. P. Akilov,Functional analysis in normed spaces, Pergamon Press, 1964.
F. N. Ris,Tools for the analysis of interval arithmetic, InInterval Mathematics (ed. K. Nickel), Springer (1975), 75–99.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Caprani, O., Madsen, K. Iterative methods for interval inclusion of fixed points. BIT 18, 42–51 (1978). https://doi.org/10.1007/BF01947742
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01947742