: 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 reliable tools. They can also be used for greatest common divisor extraction, polynomial rank evaluation or polynomial null-space computation. Key Words : Triangularization, Polynomial Matrices, Numerical Methods. y This work is part of the Barrande Project No. 97/005-97/026. It was also supported by the Grant Agency of the Czech Republic under contract No. 102/97/0861, by the Mini...
This paper deals with the polynomial interpolation of degree at most n passing through n 1 distinct ...
A novel algorithm for calculating the QR decomposition (QRD) of polynomial matrix is proposed. The a...
A new algorithm is presented for computing a column reduced form of a given full column rank polynom...
Abstract: Numerical procedures are proposed for triangularizing polynomial matrices over the eld of ...
: An interpolation approach to reduction into triangular form of an arbitrary polynomial matrix is p...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
: Two algorithms are proposed for evaluating the rank of an arbitrary polynomial matrix. They rely u...
10.1016/S0045-7825(03)00266-4Computer Methods in Applied Mechanics and Engineering192192269-2295CMME
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
Combination of algebraic and numerical techniques for improving the computations in algebra and geom...
In this thesis we develop new numerical algorithms for polynomial matrices. We tackle the problem of...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-o...
summary:Numerical operations on and among rational matrices are traditionally handled by direct mani...
International audienceFour methods for solving polynomial systems by means of triangular sets are pr...
This paper deals with the polynomial interpolation of degree at most n passing through n 1 distinct ...
A novel algorithm for calculating the QR decomposition (QRD) of polynomial matrix is proposed. The a...
A new algorithm is presented for computing a column reduced form of a given full column rank polynom...
Abstract: Numerical procedures are proposed for triangularizing polynomial matrices over the eld of ...
: An interpolation approach to reduction into triangular form of an arbitrary polynomial matrix is p...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
: Two algorithms are proposed for evaluating the rank of an arbitrary polynomial matrix. They rely u...
10.1016/S0045-7825(03)00266-4Computer Methods in Applied Mechanics and Engineering192192269-2295CMME
Polynomial matrix theory is very important to many automatic control related pro- blems. This thesis...
Combination of algebraic and numerical techniques for improving the computations in algebra and geom...
In this thesis we develop new numerical algorithms for polynomial matrices. We tackle the problem of...
Abstract. Multipoint polynomial evaluation and interpolation are fun-damental for modern numerical a...
The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-o...
summary:Numerical operations on and among rational matrices are traditionally handled by direct mani...
International audienceFour methods for solving polynomial systems by means of triangular sets are pr...
This paper deals with the polynomial interpolation of degree at most n passing through n 1 distinct ...
A novel algorithm for calculating the QR decomposition (QRD) of polynomial matrix is proposed. The a...
A new algorithm is presented for computing a column reduced form of a given full column rank polynom...