Become an expert in R — Interactive courses, Cheat Sheets, certificates and more!
Get Started for Free

triang_Euclidean

Triangularization of a polynomial matrix by Euclidean division metho


Description

Triangularization of a polynomial matrix by Euclidean division metho

Usage

triang_Euclidean(pm)

Arguments

pm

matrix to triangularize

Details

The method use the for polynomilas extended Euclidean algorithm.

This method search a solution of the triangulrization by the method of Sylvester matrix, descripted in the article Labhalla-Lombardi-Marlin (1996).

Value

Upper tringular matrix 'T' and transformation matrix 'U'.

Author(s)

Nikolai Ryzhkov, namezys@gmail.com

References

Thomas Kailaith:Linear Systems, Prentice-Hall, 1980, pp 373-376

See Also

triang_Sylvester


polyMatrix

Infrastructure for Manipulation Polynomial Matrices

v0.3.1
MIT + file LICENSE
Authors
Tamas Prohle [aut], Peter Prohle [aut], Nikolai Ryzhkov [aut, cre], Ildiko Laszlo [aut] (<https://orcid.org/0000-0003-2324-8183>), Ulas Onat Alakent [ctb]
Initial release

We don't support your browser anymore

Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.