MatrixPolynomialAlgebra[PopovForm] - compute the Popov normal form of a Matrix
|
Calling Sequence
|
|
PopovForm(A, x, shifts, out)
PopovForm[row](A, x, shifts, out)
PopovForm[column](A, x, shifts, out)
|
|
Parameters
|
|
A
|
-
|
Matrix
|
x
|
-
|
variable name of the polynomial domain
|
shifts
|
-
|
(optional) equation of the form shifts = obj where obj is a list of one or two lists
|
out
|
-
|
(optional) equation of the form output = obj where obj is one of 'P', 'U', 'rank', 'P_pivots', 'U_pivots' or a list containing one or more of these names; select result objects to compute
|
|
|
|
|
Description
|
|
•
|
The PopovForm(A,x) and PopovForm[row](A,x) commands compute the Popov normal form (in row form) of an m x n rectangular Matrix of 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 PopovForm[column](A,x) command computes the Popov normal form (in column form).
|
•
|
For row Popov normal form, if m = n and P is nonsingular, then P has the following degree constraints
|
|
If and P has full row rank, then there is a trailing list of n pivot columns P_pivots such that P[*,P_pivots] is in Popov normal form.
|
|
The row Popov normal form is obtained by performing elementary row operations on A. This includes interchanging rows, multiplying a row by a unit, and subtracting a polynomial multiple of one row from another. The method used is a fraction-free algorithm by Beckermann, Labahn and Villard. The returned Matrix objects have the property that for row Popov normal form.
|
•
|
The output option (out) determines the content of the returned expression sequence.
|
|
As determined by the out option, an expression sequence containing one or more of the factors P (the Popov normal form), U (the unimodular transformation Matrix), rank (the rank of the matrix), P_pivots, or U_pivots (the pivot columns of P and U, respectively -- interesting in the non-full rank case) is returned. If obj is a list, the objects are returned in the order specified in the list.
|
•
|
The shifts option is an optional input that allows the user to shift the degree constraints on both the Popov form and the minimal multiplier (in the non-full row rank case).
|
•
|
The row Popov normal form and the column Popov normal form is related in the following way. If P is the row Popov normal form of A, P^T is the column Popov normal form of A^T.
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
| (5) |
>
|
|
| (6) |
>
|
|
| (7) |
>
|
|
| (8) |
>
|
|
| (9) |
Low rank matrix:
>
|
|
| (10) |
>
|
|
| (11) |
>
|
|
| (12) |
>
|
|
| (13) |
>
|
|
| (14) |
[1,-2,0]-shifted Popov form:
>
|
|
| (15) |
[2,2,0,0]-shifted Popov form:
>
|
|
| (16) |
Popov form with [0,-3]-shift for unimodular multiplier:
>
|
|
| (17) |
>
|
|
| (18) |
>
|
|
| (19) |
>
|
|
| (20) |
Popov form with [0,-3,0,0]-shift for unimodular multiplier:
>
|
|
| (21) |
>
|
|
| (22) |
|
|
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.
|
|
Beckermann, B.; Labahn, G.; and Villard, G. "Shifted Normal Forms of General Polynomial Matrices." University of Waterloo, Technical Report, Department of Computer Science, (2001).
|
|
Beckermann, B.; Labahn, G.; and Villard, G. "Shifted Normal Forms of Polynomial Matrices" ISSAC'99 (1999): 189-196.
|
|
|