A.J. Geurts, C. Praagman
Abstract
A few years ago Beelen developed an algorithm to determine a minimal basis for the kernel of a polynomial matrix. In this paper we use a modified version of this algorithm to find a column reduced polynomial matrix unimodularly equivalent to a given polynomial matrix.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A few years ago Beelen developed an algorithm to determine a minimal basis for the kernel of a polynomial matrix. In this paper we use a modified version of this algorithm to find a column reduced polynomial matrix unimodularly equivalent to a given polynomial matrix.
Key concepts: Polynomial matrix, Matrix polynomial, Column (typography), Polynomial, Mathematics, Matrix (chemical analysis), Reduction (mathematics), Stable polynomial