bibtype |
C -
Conference Paper (international conference)
|
ARLID |
0410529 |
utime |
20240103182220.5 |
mtime |
20060210235959.9 |
title
(primary) (eng) |
An algorithm for polynomial matrix factor extraction |
publisher |
place |
Phoenix |
name |
IEEE |
pub_time |
1999 |
|
specification |
|
serial |
title
|
Proceedings of the Conference on Decision and Control IEEE 1999 |
page_num |
1-17 |
|
keyword |
polynomial matrix |
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) |
An algorithm is described for extracting a polynomial matrix factor featuring any subset of the zeros of a given non-singular polynomial matrix. It is assumed that the zeros to be extracted are given as input data. Complex or repeated zeros are allowed. The algorithm is based on interpolation and relies upon numerically reliable subroutines only. It makes use of a procedure that computes the generalized characteristic vectors of a polynomial matrix at a given point. |
action |
ARLID |
cav_un_auth*0212743 |
name |
IEEE Conference on Decision and Control 1999 |
place |
Phoenix |
country |
US |
dates |
07.12.1999-10.12.1999 |
|
RIV |
BC |
department |
TŘ |
permalink |
http://hdl.handle.net/11104/0130618 |
ID_orig |
UTIA-B 20000245 |
arlyear |
1999 |
mrcbU10 |
1999 |
mrcbU10 |
Phoenix IEEE |
mrcbU63 |
Proceedings of the Conference on Decision and Control IEEE 1999 1 17 |
|