Changeset b728bf in git
- Timestamp:
- Jul 31, 2013, 5:30:24 PM (10 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- dd8e726c1c4e5b7410c5a9627c9f52be7b122067
- Parents:
- 091b25018851d6b7049240bf5eb739710e97cb1a
- git-author:
- Martin Lee <martinlee84@web.de>2013-07-31 17:30:24+02:00
- git-committer:
- Martin Lee <martinlee84@web.de>2013-08-30 13:48:24+02:00
- Location:
- factory
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
factory/facFqBivarUtil.cc
r091b250 rb728bf 56 56 for (CFFListIterator i= factors; i.hasItem(); i++) 57 57 i.getItem()= CFFactor (N (i.getItem().factor()), i.getItem().exp()); 58 } 59 60 void decompress (CFAFList& factors, const CFMap& N) 61 { 62 for (CFAFListIterator i= factors; i.hasItem(); i++) 63 i.getItem()= CFAFactor (N (i.getItem().factor()), i.getItem().minpoly(), 64 i.getItem().exp()); 58 65 } 59 66 -
factory/facFqBivarUtil.h
r091b250 rb728bf 38 38 ); 39 39 40 /// as above 41 void decompress (CFAFList& factors, ///< [in,out] a list of factors 42 const CFMap& N ///< [in] a map 43 ); 44 40 45 /// first swap Variables in @a factors1 if necessary, then append @a factors2 41 46 /// and @a factors3 on @a factors1 and finally decompress @a factors1 … … 68 73 ///< Fq if we are not over some 69 74 ///< GF 70 const int k, ///< some int k such that k 75 const int k, ///< some int k such that k 71 76 ///< divides l if we are not 72 77 ///< over some Fq … … 189 194 /// Variable (2)^l 190 195 CFArray 191 logarithmicDerivative (const CanonicalForm& F, ///< [in] bivariate poly 196 logarithmicDerivative (const CanonicalForm& F, ///< [in] bivariate poly 192 197 ///< truncated at Variable(2)^l 193 198 const CanonicalForm& G, ///< [in] a factor of F … … 199 204 ); 200 205 201 /// compute bounds for logarithmic derivative as described in K. Belabas, 202 /// M. van Hoeij, J. KlÃŒners, and A. Steel, Factoring polynomials over global 206 /// compute bounds for logarithmic derivative as described in K. Belabas, 207 /// M. van Hoeij, J. KlÃŒners, and A. Steel, Factoring polynomials over global 203 208 /// fields 204 209 /// … … 225 230 /// @return coefficients of \f$ x^i \f$ for \f$i\geq k\f$ 226 231 /// @sa {getCoeffs (const CanonicalForm&, const int, const Variable&), 227 /// getCoeffs (const CanonicalForm&, const int, const int, const int, 232 /// getCoeffs (const CanonicalForm&, const int, const int, const int, 228 233 /// const Variable&, const CanonicalForm&, const mat_zz_p&)} 229 234 CFArray … … 237 242 /// @return coefficients of \f$ x^i \f$ for \f$i\geq k\f$ 238 243 /// @sa {getCoeffs (const CanonicalForm&, const int), 239 /// getCoeffs (const CanonicalForm&, const int, const int, const int, 244 /// getCoeffs (const CanonicalForm&, const int, const int, const int, 240 245 /// const Variable&, const CanonicalForm&, const mat_zz_p&)} 241 246 CFArray 242 getCoeffs (const CanonicalForm& F,///< [in] compressed bivariate poly over 247 getCoeffs (const CanonicalForm& F,///< [in] compressed bivariate poly over 243 248 ///< F_p(alpha) 244 249 const int k, ///< [in] some int … … 281 286 /// substitute x^d by x in F 282 287 void 283 subst (const CanonicalForm& F, ///< [in] a polynomial 288 subst (const CanonicalForm& F, ///< [in] a polynomial 284 289 CanonicalForm& A, ///< [in,out] returns F with x^d replaced by x 285 290 const int d, ///< d > 1 such that a substitution x^d -> x … … 299 304 /// reverse a substitution x^d->x 300 305 void 301 reverseSubst (CFList& L, ///< [in,out] a list of polys, returns the 306 reverseSubst (CFList& L, ///< [in,out] a list of polys, returns the 302 307 ///< given list with x replaced by x^d 303 308 const int d, ///< [in] an integer > 0
Note: See TracChangeset
for help on using the changeset viewer.