Changeset c9b1d66 in git for factory/facHensel.h

Timestamp:

Dec 16, 2010, 2:22:47 PM (13 years ago)

Author:

Martin Lee <martinlee84@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

8af49d09040b6ced3fa697fae0b4338a908944a5

Parents:

d08ed84a213b4110fe1dbe0d38276dce7695a481

Message:

added division with remainder via Newton inversion


git-svn-id: file:///usr/local/Singular/svn/trunk@13774 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• factory/facHensel.h (modified) (2 diffs)

factory/facHensel.h

@@ -29 +29 @@
 #include "algext.h"
 
-CanonicalForm mul (const CanonicalForm& F, const CanonicalForm& G);
-CanonicalForm mulMod3 (const CanonicalForm& F, const CanonicalForm& G, const CFList& MOD);
 /// multiplication of univariate polys over a finite field using NTL, if we are
 /// in GF factory's default multiplication is used.
@@ -139 +137 @@
                                    ///< Variables of level higher than 1
             );
+
+
+/// division with remainder of @a F by
+/// @a G wrt Variable (1) modulo @a M using Newton inversion
+///
+/// @return @a Q returns the dividend, @a R returns the remainder.
+/// @sa divrem2(), newtonDiv()
+void
+newtonDivrem (const CanonicalForm& F, ///< [in] bivariate, compressed polynomial
+              const CanonicalForm& G, ///< [in] bivariate, compressed polynomial
+                                      ///< which is monic in Variable (1)
+              CanonicalForm& Q,       ///< [in,out] dividend
+              CanonicalForm& R,       ///< [in,out] remainder, degree (R, 1) <
+                                      ///< degree (G, 1)
+              const CanonicalForm& M  ///< [in] power of Variable (2)
+             );
+
+/// division of @a F by
+/// @a G wrt Variable (1) modulo @a M using Newton inversion
+///
+/// @return @a newtonDiv returns the dividend
+/// @sa divrem2(), newtonDivrem()
+CanonicalForm
+newtonDiv (const CanonicalForm& F, ///< [in] bivariate, compressed polynomial
+           const CanonicalForm& G, ///< [in] bivariate, compressed polynomial
+                                   ///< which is monic in Variable (1)
+           const CanonicalForm& M  ///< [in] power of Variable (2)
+          );
 
 /// reduce @a F modulo elements in @a M.