Three-Level 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 7 in Numerical Methods for Grid Equations, 1989, pp 125-143 from Springer

Abstract: Abstract In this chapter we study three-level iterative methods for solving the operator equation Au = f. The iterative parameters are chosen using a priori information about the operators of the scheme. In Section 7.1, an estimate is given for the convergence rate of three-level schemes of standard type. In Sections 7.2, 7.3 the Chebyshev semi-iterative method and the stationary three-level method are considered. In Section 7.4 we investigate the stability of two-level and three-level methods with regard to perturbations of the a priori data.

Keywords: Convergence Rate; Recurrence Relation; Chebyshev Polynomial; Iteration Count; Iterative Approximation (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_3

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

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

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