| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0410530 |
| utime |
20240103182220.5 |
| mtime |
20060210235959.9 |
| title
(primary) (eng) |
Reliable numerical methods for polynomial matrix triangularization |
| publisher |
| place |
Alghero |
| name |
IEEE |
| pub_time |
1998 |
|
| specification |
|
| serial |
| title
|
Proceedings of the Mediterranean Conference on Control and Automation IEEE |
| page_num |
1-27 |
|
| keyword |
triangularization |
| keyword |
polynomial matrices |
| keyword |
numerical methods |
| 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 |
GA102/97/0861 |
| agency |
GA ČR |
| ARLID |
cav_un_auth*0004367 |
|
| research |
AV0Z1075907 |
| abstract
(eng) |
Numerical procedures are proposed for triangularizing polynomial matrices over the field of polynomial fractions and over the ring of polynomials. They are based on two standard polynomial techniques: Sylvester matrices and interpolation. In contrast to other triangularization methods, the algorithms described in this paper only rely on well-worked numerically realiable tools. They can also be used for greatest common divisor extraction. |
| action |
| ARLID |
cav_un_auth*0212744 |
| name |
Mediterranean Conference on Control and Automation IEEE '98 |
| place |
Alghero |
| country |
IT |
| dates |
23.06.1998-27.06.1998 |
|
| RIV |
BC |
| department |
TŘ |
| permalink |
http://hdl.handle.net/11104/0130619 |
| ID_orig |
UTIA-B 20000246 |
| arlyear |
1998 |
| mrcbU10 |
1998 |
| mrcbU10 |
Alghero IEEE |
| mrcbU63 |
Proceedings of the Mediterranean Conference on Control and Automation IEEE 1 27 |
|