Algorithm 767: a Fortran 77 package for column reduction of polynomial matrices

DOI10.1145/244768.244791zbMATH Open0888.65049OpenAlexW2097957045WikidataQ113310343 ScholiaQ113310343MaRDI QIDQ4371127FDOQ4371127

Authors: A. J. Geurts, C. Praagman 

Publication date: 13 May 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/

Recommendations

• Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich
• Column reduction of polynomial matrices
• A new method for computing a column reduced polynomial matrix
• An algorithm for polynomial matrix factor extraction

zbMATH Keywords

performancealgorithmpolynomial matrixFORTRAN subroutinecolumn reductioncolumn-reduced matrix

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Matrices over function rings in one or more variables (15A54)

Cited In (2)

• Column reduction of polynomial matrices
• Algorithm 767

Uses Software

• COLRED

This page was built for publication: Algorithm 767: a Fortran 77 package for column reduction of polynomial matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371127)