Implementation of class "polyMatrix" for storing a matrix of polynomials and implements basic matrix operations; including a determinant and characteristic polynomial. It is based on the package 'polynom' and uses a lot of its methods to implement matrix operations. This package includes 3 methods of triangularization of polynomial matrices: Extended Euclidean algorithm which is most classical but numerically unstable; Sylvester algorithm based on LQ decomposition; Interpolation algorithm is based on LQ decomposition and Newton interpolation. Both methods are described in D. Henrion & M. Sebek, Reliable numerical methods for polynomial matrix triangularization, IEEE Transactions on Automatic Control (Volume 44, Issue 3, Mar 1999, Pages 497508) <doi:10.1109/9.751344> and in Salah Labhalla, Henri Lombardi & Roger Marlin, Algorithmes de calcule de la reduction de Hermite d'une matrice a coefficients polynomeaux, Theoretical Computer Science (Volume 161, Issue 12, July 1996, Pages 6992) <doi:10.1016/03043975(95)000909>.
Package details 


Author  Tamas Prohle [aut], Peter Prohle [aut], Nikolai Ryzhkov [aut, cre] (<https://orcid.org/000000034896280X>), Ildiko Laszlo [aut] (<https://orcid.org/0000000323248183>), Ulas Onat Alakent [ctb] 
Maintainer  Nikolai Ryzhkov <namezys@gmail.com> 
License  MIT + file LICENSE 
Version  0.9.16 
URL  https://github.com/namezys/polymatrix 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.