Polynomial Rows and Matrices #
Minimal row-oriented polynomial-matrix infrastructure for shifted row reduction.
A polynomial row over F[X].
Instances For
A polynomial matrix over F[X], stored as an array of rows.
Instances For
Runtime rectangular shape of a polynomial matrix.
Instances For
Instances For
Instances For
Instances For
Width of a row.
Instances For
Matrix width, using the first row and width 0 for an empty matrix.
Instances For
Runtime matrix shape.
Instances For
Matrix rows as a list, for membership statements.
Instances For
A matrix is rectangular when every row has the matrix width.
Instances For
Read a row coefficient with zero default.
Instances For
The zero row of a fixed width.
Instances For
Pointwise row addition over the maximum input width.
Instances For
Pointwise row negation.
Instances For
Pointwise row subtraction over the maximum input width.
Instances For
Multiply a row by a univariate polynomial.
Instances For
Multiply a row by c * X^d.
Instances For
Fused a - c * X^d * b over the maximum input width, entrywise via
CPolynomial.subMulMonomial. One call costs O(deg + d) per entry instead of
the O(d * deg) convolution behind rowSub a (rowScaleMonomial c d b).
Instances For
Replace a row if the index is in bounds.