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 non...
详细信息
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.
We consider the solution of the large-scale nonsymmetric algebraic Riccati equation XCX - XD - AX + B = 0 from transport theory (Juang 1995), with M equivalent to [D, -C;-B, A] is an element of R-2nx2n being a nonsing...
详细信息
We consider the solution of the large-scale nonsymmetric algebraic Riccati equation XCX - XD - AX + B = 0 from transport theory (Juang 1995), with M equivalent to [D, -C;-B, A] is an element of R-2nx2n being a nonsingular M-matrix. In addition, A, D are rank-1 updates of diagonal matrices, with the products A(-1)u, A(-T)u, D-1 v and D-T v computable in O(n) complexity, for some vectors u and v, and B, C are rank 1. The structure-preserving doubling algorithm by Guo et al. (2006) is adapted, with the appropriate applications of the Sherman-Morrison-Woodbury formula and the sparse-plus-low-rank representations of various iterates. The resulting large-scale doubling algorithm has an O(n) computational complexity and memory requirement per iteration and converges essentially quadratically, as illustrated by the numerical examples. (C) 2012 Elsevier Inc. All rights reserved.
For the steady-state solution of a differential equation from a one-dimensional multistate model in transport theory, we shall derive and study a nonsymmetric algebraic Riccati equation B- -XF- -F+ X + XB+X = 0, where...
详细信息
For the steady-state solution of a differential equation from a one-dimensional multistate model in transport theory, we shall derive and study a nonsymmetric algebraic Riccati equation B- -XF- -F+ X + XB+X = 0, where F-+/- = (I -F) D-+/- and B-+/- = BD +/- with positive diagonal matrices D-+/- and possibly low-ranked matrices F and B. We prove the existence of the minimal positive solution X* under a set of physically reasonable assumptions and study its numerical computation by fixed-point iteration, Newton's method and the doubling algorithm. We shall also study several special cases. For example when B and F are low ranked then X* = Gamma circle(Sigma(i=1UiViT)-U-r) with low-ranked U-i and V-i that can be computed using more efficient iterative processes. Numerical examples will be given to illustrate our theoretical results.
We study the matrix equation X + A(T)X(-1)A = Q, where A is a complex square matrix and Q is complex symmetric. Special cases of this equation appear in Green's function calculation in nano research and also in th...
详细信息
We study the matrix equation X + A(T)X(-1)A = Q, where A is a complex square matrix and Q is complex symmetric. Special cases of this equation appear in Green's function calculation in nano research and also in the vibration analysis of fast trains. In those applications, the existence of a unique complex symmetric stabilizing solution has been proved using advanced results on linear operators. The stabilizing solution is the solution of practical interest. In this paper we provide an elementary proof of the existence for the general matrix equation, under an assumption that is satisfied for the two special applications. Moreover, our new approach here reveals that the unique complex symmetric stabilizing solution has a positive definite imaginary part. The unique stabilizing solution can be computed efficiently by the doubling algorithm. (C) 2011 Elsevier Inc. All rights reserved.
For the steady-state solution of an integral-differential equation from a two-dimensional model in transport theory, we shall derive and study a nonsymmetric algebraic Riccati equation B- - XF- - F+X + XB+X = 0, where...
详细信息
For the steady-state solution of an integral-differential equation from a two-dimensional model in transport theory, we shall derive and study a nonsymmetric algebraic Riccati equation B- - XF- - F+X + XB+X = 0, where F-+/- equivalent to I - (s) over cap PD +/-, B- equivalent to (b) over capl + (s) over capP)D-)D- and B+ equivalent to (b) over capl + (s) over capP)D+)D+ with a nonnegative matrix P, positive diagonal matrices D, and nonnegative parameters f, (b) over cap equivalent to(1 - f) and (s) over cap equivalent to (1 - f). We prove the existence of the minimal nonnegative solution X* under the physically reasonable assumption f + b + s parallel to P(D+ + D-)parallel to(infinity) < 1, and study its numerical computation by fixed-point iteration, Newton's method and doubling. We shall also study several special cases;e.g. when = 0 and P is low-ranked, then X* = <(s)over cap>/2 UV is low-ranked and can be computed using more efficient iterative processes in U and V. Numerical examples will be given to illustrate our theoretical results. (C) 2010 Elsevier Inc. All rights reserved.
In this paper, we propose the palindromic doubling algorithm (PDA) for the palindromic generalized eigenvalue problem (PGEP) A*x = lambda Ax. We establish a complete convergence theory of the PDA for PGEPs without uni...
详细信息
In this paper, we propose the palindromic doubling algorithm (PDA) for the palindromic generalized eigenvalue problem (PGEP) A*x = lambda Ax. We establish a complete convergence theory of the PDA for PGEPs without unimodular eigenvalues, or with unimodular eigenvalues of partial multiplicities two (one or two for eigenvalue 1). Some important applications from the vibration analysis and the optimal control for singular descriptor linear systems will be presented to illustrate the feasibility and efficiency of the PDA. (C) 2009 Elsevier Inc. All rights reserved.
We consider the solution of the rational matrix equations, or generalized algebraic Riccati equations with rational terms, arising in stochastic optimal control in continuous- and discrete-time. The modified Newton...
详细信息
ISBN:
(纸本)9781424487363
We consider the solution of the rational matrix equations, or generalized algebraic Riccati equations with rational terms, arising in stochastic optimal control in continuous- and discrete-time. The modified Newton's methods, the DARE- and CARE-type iterations for continuous- and discrete-time rational Riccati equations respectively, will be considered. In particular, the convergence of these new modified Newton's method will be proved.
Nonsymmetric algebraic Riccati equations for which the four coefficient matrices form an irreducible M-matrix M are considered. The emphasis is on the case where M is an irreducible singular M-matrix, which arises in ...
详细信息
Nonsymmetric algebraic Riccati equations for which the four coefficient matrices form an irreducible M-matrix M are considered. The emphasis is on the case where M is an irreducible singular M-matrix, which arises in the study of Markov models. The doubling algorithm is considered for finding the minimal nonnegative solution, the one of practical interest. The algorithm has been recently studied by others for the case where M is a nonsingular M-matrix. A shift technique is proposed to transform the original Riccati equation into a new Riccati equation for which the four coefficient matrices form a nonsingular matrix. The convergence of the doubling algorithm is accelerated when it is applied to the shifted Riccati equation.
We consider the solution of the rational matrix equations, or generalized algebraic Riccati equations with rational terms, arising in stochastic optimal control in continuous-and discrete-time. The modified Newton'...
详细信息
We consider the solution of the rational matrix equations, or generalized algebraic Riccati equations with rational terms, arising in stochastic optimal control in continuous-and discrete-time. The modified Newton's methods, the DAREand CARE-type iterations for continuous-and discrete-time rational Riccati equations respectively, will be considered. In particular, the convergence of these new modified Newton's method will be proved.
The matrix equation X + A(T)X(-1) A = Q has been studied extensively when A and Q are real square matrices and Q is symmetric positive definite. The equation has positive definite solutions under suitable conditions, ...
详细信息
The matrix equation X + A(T)X(-1) A = Q has been studied extensively when A and Q are real square matrices and Q is symmetric positive definite. The equation has positive definite solutions under suitable conditions, and in that case the solution of interest is the maximal positive definite solution. The same matrix equation plays an important role in Green's function calculations in nano research, but the matrix Q there is usually indefinite (so the matrix equation has no positive definite solutions), and one is interested in the case where the matrix equation has no positive definite solutions even when Q is positive definite. The solution of interest in this nano application is a special weakly stabilizing complex symmetric solution. In this paper we show how a doubling algorithm can be used to find good approximations to the desired solution efficiently and reliably.
暂无评论