The Mathematical Theory of Iterative Methods

Aleksandr A. Samarskii and Evgenii S. Nikolaev
Additional contact information
Aleksandr A. Samarskii: Moscow University, Department of Computational, Mathematics and Cybernetics
Evgenii S. Nikolaev: Moscow University, Department of Computational, Mathematics and Cybernetics

Chapter Chapter 5 in Numerical Methods for Grid Equations, 1989, pp 1-63 from Springer

Abstract: Abstract The current chapter contains results and basic concepts from the theory of iterative methods; these methods will be studied in the succeding chapters. In Section 5.1 we state the simplest concepts of functional analysis, give the basic properties of linear and non-linear operators in a Hilbert space, and also give several theorems on the solubility of operator equations. In Section 5.2, we give a systematic treatment of difference schemes as operator equations in an abstract space and indicate the properties of the corresponding operators. In Section 5.3, we look at the basic definitions and concepts from the theory of iterative processes, examine a canonical form for iterative schemes, and also the concepts of convergence and number of iterations.

Keywords: Linear Operator; Iterative Method; Difference Scheme; Operator Equation; Iterative Scheme (search for similar items in EconPapers)
Date: 1989
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-3-0348-9142-4_1

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

DOI: 10.1007/978-3-0348-9142-4_1

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 ().