1999
DOI: 10.1016/s1474-6670(17)56295-3
|View full text |Cite
|
Sign up to set email alerts
|

Numerical solvers for discrete-time periodic riccati equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2005
2005
2007
2007

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…The set (5.4) with the periodicity condition S t S t ( ) ( ) + = τ will be called, as in [7], periodic discrete Riccati equation (PDRE). Algorithms of solving PDREs are described in [2,5,7,12,15,16,28].…”
Section: Optimization Of a Reliable Periodic Controllermentioning
confidence: 99%
See 1 more Smart Citation
“…The set (5.4) with the periodicity condition S t S t ( ) ( ) + = τ will be called, as in [7], periodic discrete Riccati equation (PDRE). Algorithms of solving PDREs are described in [2,5,7,12,15,16,28].…”
Section: Optimization Of a Reliable Periodic Controllermentioning
confidence: 99%
“…This kind of problems is solved using different approaches (generalized to periodic systems) intended to analyze stationary systems. Noteworthy are synthesis algorithms based on a stabilizing solution of the Riccati equation [2,6,7,12,16,28], algorithms based on linear matrix inequalities (LMIs) [1,3,8,22], etc. Note that researchers usually try to generalize a synthesis algorithm for stationary systems to periodic systems.…”
mentioning
confidence: 99%
“…In some cases, the associated problems can be reduced to a discrete-time periodic Riccati equation (DPRE). However, conventional solvers for such equations [6,7,9,14,19,27] are generally based on certain assumptions as to the matrix coefficients of the DPRE. Thus, the next task is to develop DPRE solvers that would be universal in a sense.…”
Section: Introductionmentioning
confidence: 99%
“…Note that the conventional solvers for the DPRE (1.1) [6,9,14,19] are based on the assumption that the matrices R j are invertible. The algorithms from [1,5,7,8,22] do not have this constraint but assume that N j = 0.…”
Section: Introductionmentioning
confidence: 99%