Abstract
In this paper, we review two types of doubling algorithm and some techniques for analyzing them. We then use the techniques to study the doubling algorithm for three different nonlinear matrix equations in the critical case. We show that the convergence of the doubling algorithm is at least linear with rate 1/2 . As compared to earlier work on this topic, the results we present here are more general, and the analysis here is much simpler.
Original language | English |
---|---|
Pages (from-to) | 227 - 247 |
Number of pages | 21 |
Journal | SIAM Journal on Matrix Analysis and Applications |
Volume | 31 |
Issue number | 2 |
Publication status | Published - 2009 |