Fundamental Order-Theoretic Principles

Siegfried Carl () and Seppo Heikkilä ()
Additional contact information
Siegfried Carl: Martin-Luther-Universität Halle-Wittenberg, Institut für Mathematik
Seppo Heikkilä: University of Oulu, Department of Mathematical Sciences

Chapter 2 in Fixed Point Theory in Ordered Sets and Applications, 2011, pp 23-55 from Springer

Abstract: 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.

Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4419-7585-0_2

Ordering information: This item can be ordered from
http://www.springer.com/9781441975850

DOI: 10.1007/978-1-4419-7585-0_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().