Convergence Analysis of the Doubling Algorithm for Several Nonlinear Matrix Equations in the Critical Case

  • Authors:
  • Chun-Yueh Chiang;Eric King-Wah Chu;Chun-Hua Guo;Tsung-Ming Huang;Wen-Wei Lin;Shu-Fang Xu

  • Affiliations:
  • d907201@oz.nthu.edu.tw;eric.chu@sci.monash.edu.au;chguo@math.uregina.ca;min@math.ntnu.edu.tw;wwlin@math.nctu.edu.tw;xsf@pku.edu.cn

  • Venue:
  • SIAM Journal on Matrix Analysis and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

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.