MatrixPolynomialAlgebra[MatrixLCLM] - compute a least-common left multiple of 2 matrices of polynomials
MatrixPolynomialAlgebra[MatrixLCRM] - compute a least-common right multiple of 2 matrices of polynomials
|
Calling Sequence
|
|
MatrixLCLM(A, B, x)
MatrixLCRM(A, B, x)
|
|
Parameters
|
|
A
|
-
|
Matrix of polynomials
|
B
|
-
|
Matrix of polynomials
|
x
|
-
|
variable name of the polynomial domain
|
|
|
|
|
Description
|
|
•
|
The MatrixLCLM(A, B, x) command computes a least-common left multiple of two matrices of polynomials. Both input matrices of polynomials can be square or rectangular but must have the same number of columns. The entries are either univariate polynomials in x over the field of rational numbers Q, or rational expressions over Q, that is, univariate polynomials in x with coefficients in Q(a1,...,an).
|
|
The matrix of polynomials must have more rows than columns and full column rank.
|
•
|
The MatrixLCRM(A, B, x) command computes a least-common right multiple of two matrices of polynomials. The matrix of polynomials must have more columns than rows and full row rank.
|
|
The method is a fraction-free algorithm by Beckermann and Labahn that computes a matrix GCD using Mahler systems.
|
|
|
Examples
|
|
>
|
|
>
|
|
>
|
|
Left matrix LCMs:
>
|
|
| (1) |
Right matrix LCMs:
>
|
|
| (2) |
|
|
References
|
|
|
Beckermann, B., and Labahn, G. "Fraction-free Computation of Matrix Rational Interpolants and Matrix GCDs." SIAM Journal on Matrix Analysis and Applications, Vol. 22 No.1, (2000): 114-144.
|
|
|
Download Help Document
Was this information helpful?