Rate of convergence of iterative algorithms

Christian Lantuéjoul
Additional contact information
Christian Lantuéjoul: École des Mines, Centre de Géostatistique

Chapter 9 in Geostatistical Simulation, 2002, pp 87-99 from Springer

Abstract: Abstract In the previous chapter, we showed how to simulate a distribution as the limit of an iterative algorithm. In practice, these algorithms cannot be run eternally; they have to be stopped after a finite number of iterations. Of course there is no reason for the distribution thus simulated to be identical to the limit distribution, and the number of iterations to carry out must be chosen so that their difference lies below a prescribed level of acceptability. This requires the study of the rate of convergence of the iterative algorithm. A considerable amount of literature has been devoted to the determination of the rate of convergence of algorithms based on Markovian iterations (in particular Nummelin, 1984; Meyn and Tweedie, 1993; Tierney, 1994; Duflo, 1996). This chapter only deals with two cases corresponding to two different assumptions on the transition kernel of the algorithm: If the transition kernel is minorized by a positive measure, then the rate of convergence is uniform (section 9.2). If the transition kernel admits an isofaetorial representation, then a geometric rate of convergence is expected in many cases (section 9.3). The integral range introduced in chapter 4 can be used to determine it empirically (section 9.4).

Keywords: Markov Chain; Iterative Algorithm; Compact Operator; Accumulation Point; Convergent Subsequence (search for similar items in EconPapers)
Date: 2002
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-662-04808-5_9

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

DOI: 10.1007/978-3-662-04808-5_9

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