| bibtype |
J -
Journal Article
|
| ARLID |
0410531 |
| utime |
20240103182220.6 |
| mtime |
20060210235959.9 |
| title
(primary) (eng) |
An efficient numerical method for the discrete-time symmetric matrix polynomial equation |
| specification |
|
| serial |
| ARLID |
cav_un_epca*0256713 |
| ISSN |
1350-2379 |
| title
|
IEE Proceedings. Control Theory and Applications |
| volume_id |
145 |
| volume |
5 (1998) |
| page_num |
443-448 |
|
| keyword |
matrix polynomial equation |
| author
(primary) |
| ARLID |
cav_un_auth*0015534 |
| name1 |
Henrion |
| name2 |
D. |
| country |
FR |
|
| author
|
| ARLID |
cav_un_auth*0101204 |
| name1 |
Šebek |
| name2 |
Michael |
| institution |
UTIA-B |
| full_dept |
Department of Control Theory |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| COSATI |
09I |
| cas_special |
| project |
| project_id |
KSK1075601 |
| agency |
GA AV |
| country |
CZ |
| ARLID |
cav_un_auth*0027435 |
|
| research |
AV0Z1075907 |
| abstract
(eng) |
A numerical procedure is proposed to solve a matrix polynomial frequently encountered in discrete-time control and signal processing. The algorithm is based on simple rewriting of the original equation in terms of a reduced Sylvester matrix. In contrast to previously published methods, it does not make use of elementary polynomial operations. Moreover and most notably, it is numerically reliable. |
| RIV |
BC |
| department |
TŘ |
| permalink |
http://hdl.handle.net/11104/0130620 |
| ID_orig |
UTIA-B 20000247 |
| arlyear |
1998 |
| mrcbU63 |
cav_un_epca*0256713 IEE Proceedings. Control Theory and Applications 1350-2379 Roč. 145 č. 5 1998 443 448 do 2007 |
|