Show simple item record

dc.contributor.authorChiang, Chun-Yueh
dc.contributor.authorChu, Eric King-Wah
dc.contributor.authorGuo, Chun-Hua
dc.contributor.authorHuang, Tsung-Ming
dc.contributor.authorLin, Wen-Wei
dc.contributor.authorXu, Shu-Fang
dc.date.accessioned2014-04-28T01:48:07Z
dc.date.available2014-04-28T01:48:07Z
dc.date.issued2009
dc.identifier.citationSIAM J. Matrix Anal. Appl.en_US
dc.identifier.urihttp://hdl.handle.net/10294/5269
dc.description.abstractIn 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.en_US
dc.description.sponsorshipNSERC, NSC (Taiwan), NCTS (Taiwan)en_US
dc.language.isoenen_US
dc.publisherSIAMen_US
dc.titleConvergence Analysis of the Doubling Algorithm for Several Nonlinear Matrix Equations in the Critical Caseen_US
dc.typeArticleen_US
dc.description.authorstatusFacultyen_US
dc.description.peerreviewyesen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record