2001
DOI: 10.1016/s0167-6911(00)00083-9
|View full text |Cite
|
Sign up to set email alerts
|

A two-variable approach to solve the polynomial Lyapunov equation

Abstract: A two-variable polynomial approach to solve the one-variable polynomial Lyapunov equation is proposed. Lifting the problem from the one-variable to the two-variable context allows to use Faddeev-type recursions in order to solve the polynomial Lyapunov equation in an iterative fashion. The method is especially suitable for applications requiring exact or symbolic computation.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2005
2005
2010
2010

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 28 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…, A n−1 } is known as the Faddeev sequence of A, and can be computed recursively by setting A 0 = d 0 I n , and A k := AA k−1 + d k I n . We remark that Feddeev sequences can be used for determining matrix inverses, and are applied for solving polynomial Lyaponov equations ( [6,10]). We have not yet investigated these connections in detail.…”
Section: Reduction Formulamentioning
confidence: 99%
“…, A n−1 } is known as the Faddeev sequence of A, and can be computed recursively by setting A 0 = d 0 I n , and A k := AA k−1 + d k I n . We remark that Feddeev sequences can be used for determining matrix inverses, and are applied for solving polynomial Lyaponov equations ( [6,10]). We have not yet investigated these connections in detail.…”
Section: Reduction Formulamentioning
confidence: 99%