Solving large-scale nonlinear matrix equations by doubling

We consider the solution of the large-scale nonlinear matrix equation X+BX-1A-Q=0, with A,B,Q,X∈Cn×n, and in some applications B=A★ (★=⊤ 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...

Full description

Saved in:
Bibliographic Details
Published in:Linear algebra and its applications 2013-08, Vol.439 (4), p.914-932
Main Authors: Weng, Peter Chang-Yi, Chu, Eric King-Wah, Kuo, Yueh-Cheng, Lin, Wen-Wei
Format: Article
Language:English
Subjects:
Doubling algorithm
Green’s function
Krylov subspace
Leaky surface wave
Nano research
Nonlinear matrix equation
Surface acoustic wave
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the solution of the large-scale nonlinear matrix equation X+BX-1A-Q=0, with A,B,Q,X∈Cn×n, and in some applications B=A★ (★=⊤ 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) [24] is adapted, with the appropriate applications of the Sherman–Morrison–Woodbury formula and the low-rank updates of various iterates. Two resulting large-scale doubling algorithms have an O((ra+rb)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.
ISSN:0024-3795
1873-1856
DOI:10.1016/j.laa.2012.08.008