Abstract: A new algorithm is presented for directly determining both the quotient and the remainder associated with the division of one polynomial matrix by another. The procedure requires that the ...
Abstract: We present a simple algorithm to compute the factors of a Unimodular-Upper (UU) polynomial matrix decomposition. The algorithm relies on the classical LU factorization and the inverse of the ...
Polynomial matrix instantiation is quite slow, however especially slow over field extensions. sage: def time_poly_matrix(m,f): ....: fx = f[x] ....: coeffs_map = [[{i ...
returns a matrix containing the terms of considered as a matrix of rational functions in B that have been expanded as power series is a scalar containing the value of m above. The default value is 1.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results