Return to search

On the solution of the radical matrix equation $X=Q+LX^{-1}L^T$

We study numerical methods for finding the maximal
symmetric positive definite solution of the nonlinear matrix equation
$X = Q + LX^{-1}L^T$, where Q is symmetric positive definite and L is
nonsingular. Such equations arise for instance in the analysis of
stationary Gaussian reciprocal processes over a finite interval.
Its unique largest positive definite solution coincides with the unique
positive definite solution of a related discrete-time algebraic
Riccati equation (DARE). We discuss how to use the butterfly
SZ algorithm to solve the DARE. This approach is compared to
several fixed point type iterative methods suggested in the
literature.

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:18829
Date26 November 2007
CreatorsBenner, Peter, Faßbender, Heike
PublisherTechnische Universität Chemnitz
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typedoc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess

Page generated in 0.0019 seconds