Solving large-scale nonlinear matrix equations by doubling

檔案

日期

2013-08-15

類型

期刊名稱

LINEAR ALGEBRA AND ITS APPLICATIONS

卷期與頁次

第 439 卷第 4 期,頁 914–932

ISSN

0024-3795

語言

英文

摘要

We consider the solution of the large-scale nonlinear matrix equation X + BX-1 A - Q = 0, with A, B, Q, X is an element of C-nxn, and in some applications B = A(star) (star = T or H). The matrix Q is assumed to be nonsingular and sparse with its structure allowing the solution of the corresponding linear system Qv = r in O(n) computational complexity. Furthermore, B and A are respectively of ranks ra, rb << n. The type 2 structure-preserving doubling algorithm by Lin and Xu (2006) [241 is adapted, with the appropriate applications of the Sherman-Morrison-Woodbury formula and the lowrank updates of various iterates. Two resulting large-scale doubling algorithms have an O((r(a) + r(b))(3)) computational complexity per iteration, after some pre-processing of data in O(n) computational complexity and memory requirement, and converge quadratically. These are illustrated by the numerical examples. (C) 2012 Elsevier Inc. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Weng, P. C.-Y., Chu, E. K.-W., Kuo, Y.-C., & Lin, W.-W. (2013). Solving large-scale nonlinear matrix equations by doubling. LINEAR ALGEBRA AND ITS APPLICATIONS, 439(4), 914–932. https://doi.org/10.1016/j.laa.2012.08.008

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/22116