2014
DOI: 10.3182/20140824-6-za-1003.01259
|View full text |Cite
|
Sign up to set email alerts
|

Toward a Rational Matrix Approximation of the Parameter-Dependent Riccati Equation Solution

Abstract: This paper considers the problem of solving parameter-dependent Riccati equations. In this paper, a tractable iterative scheme involving mainly additions and multiplications is developed for finding solutions to arbitrary accuracy. It is first presented in the parameter-independent case and then extended to the parametric case. It hinges upon two results: (i) a palindromic quadratic polynomial matrix characterization of the matrix sign and square root functions. (ii) a particular representation of parameterdep… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…Furthermore, some recent works have tried to extend these results to the parameter-dependent case (Rice et al, 2010), (Guerra et al, 2012) and (Guerra et al, 2014). Specifically, the method developed in (Rice et al, 2010) consists of using the main iteration for the matrix sign function, which is Newton's method associated with a linear fractional transformation (LFT) parametric dependence.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, some recent works have tried to extend these results to the parameter-dependent case (Rice et al, 2010), (Guerra et al, 2012) and (Guerra et al, 2014). Specifically, the method developed in (Rice et al, 2010) consists of using the main iteration for the matrix sign function, which is Newton's method associated with a linear fractional transformation (LFT) parametric dependence.…”
Section: Introductionmentioning
confidence: 99%
“…In (Guerra et al, 2014), a promising palindromic quadratic polynomial matrix characterization of the matrix sign is used. Although efficient, this method is limited to those cases where a spectral radius condition is verified.…”
Section: Introductionmentioning
confidence: 99%