Abstract
In this chapter we use the Chain Generating Recursion Principle formulated in the Introduction to develop generalized iteration methods and to prove existence and comparison results for operator equations and inclusions in partially ordered sets. Algorithms are designed to solve concrete problems by appropriately constructed Maple programs.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Carl, S., Heikkilä, S. (2011). Fundamental Order-Theoretic Principles. In: Fixed Point Theory in Ordered Sets and Applications. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7585-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7585-0_2
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7584-3
Online ISBN: 978-1-4419-7585-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)