Spectral analytic comparisons for data augmentation |
| |
Authors: | Vivekananda Roy |
| |
Affiliation: | Department of Statistics, Iowa State University, Ames, IA 50011-1210, United States |
| |
Abstract: | The sandwich algorithm (SA) is an alternative to the data augmentation (DA) algorithm that uses an extra simulation step at each iteration. In this paper, we show that the sandwich algorithm always converges at least as fast as the DA algorithm, in the Markov operator norm sense. We also establish conditions under which the spectrum of SA dominates that of DA. An example illustrates the results. |
| |
Keywords: | Compact operator Convergence rate Data augmentation algorithm Eigenvalue Markov chain |
本文献已被 ScienceDirect 等数据库收录! |
|