Révision 100 pobysoPythonSage/src/sageSLZ/sagePolynomialOperations.sage
| sagePolynomialOperations.sage (revision 100) | ||
|---|---|---|
| 144 | 144 |
return pow(norm, 1/p) |
| 145 | 145 |
# end spo_norm |
| 146 | 146 |
|
| 147 |
def spo_polynomial_to_proto_matrix(p, pRing, alpha, N, columnsWidth=0):
|
|
| 147 |
def spo_polynomial_to_proto_matrix(p, alpha, N, columnsWidth=0): |
|
| 148 | 148 |
""" |
| 149 | 149 |
From a (bivariate) polynomial and some other parameters build a proto |
| 150 | 150 |
matrix (an array of "rows") to be converted into a "true" matrix and |
| ... | ... | |
| 160 | 160 |
columsWidth: if == 0, no information is displayed, otherwise data is |
| 161 | 161 |
printed in colums of columnsWitdth width. |
| 162 | 162 |
""" |
| 163 |
pRing = p.parent() |
|
| 163 | 164 |
knownMonomials = [] |
| 164 | 165 |
protoMatrixRows = [] |
| 165 | 166 |
polynomialsList = [] |
Formats disponibles : Unified diff