Changeset 20c540 in git for libpolys/polys/monomials/p_polys.h
 Timestamp:
 Oct 4, 2012, 7:47:33 PM (11 years ago)
 Branches:
 (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
 Children:
 db347cb0bbec256ffb358817738b700f8da08253
 Parents:
 dc79bd7d1e331302a1fc20150a37e81890e6300a
 gitauthor:
 Oleksandr Motsak <motsak@mathematik.unikl.de>20121004 19:47:33+02:00
 gitcommitter:
 Oleksandr Motsak <motsak@mathematik.unikl.de>20121005 19:05:33+02:00
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

libpolys/polys/monomials/p_polys.h
rdc79bd r20c540 1825 1825 int p_Weight(int c, const ring r); 1826 1826 1827 /* assumes that p and divisor are univariate polynomials in r, 1828 mentioning the same variable; 1829 assumes divisor != NULL; 1830 p may be NULL; 1831 assumes a global monomial ordering in r; 1832 performs polynomial division of p by divisor: 1833  afterwards p contains the remainder of the division, i.e., 1834 p_before = result * divisor + p_afterwards; 1835  if needResult == TRUE, then the method computes and returns 'result', 1836 otherwise NULL is returned (This parametrization can be used when 1837 one is only interested in the remainder of the division. In this 1838 case, the method will be slightly faster.) 1839 leaves divisor unmodified */ 1840 poly p_PolyDiv(poly &p, poly divisor, BOOLEAN needResult, ring r); 1841 1842 /* returns NULL if p == NULL, otherwise makes p monic by dividing 1843 by its leading coefficient (only done if this is not already 1); 1844 this assumes that we are over a ground field so that division 1845 is welldefined; 1846 modifies p */ 1847 void p_Monic(poly p, const ring r); 1848 1849 /* assumes that p and q are univariate polynomials in r, 1850 mentioning the same variable; 1851 assumes a global monomial ordering in r; 1852 assumes that not both p and q are NULL; 1853 returns the gcd of p and q; 1854 leaves p and q unmodified */ 1855 poly p_Gcd(poly p, poly q, ring r); 1856 1857 /* assumes that p and q are univariate polynomials in r, 1858 mentioning the same variable; 1859 assumes a global monomial ordering in r; 1860 assumes that not both p and q are NULL; 1861 returns the gcd of p and q; 1862 moreover, afterwards pFactor and qFactor contain appropriate 1863 factors such that gcd(p, q) = p * pFactor + q * qFactor; 1864 leaves p and q unmodified */ 1865 poly p_ExtGcd(poly p, poly &pFactor, poly q, poly &qFactor, ring r); 1827 /// assumes that p and divisor are univariate polynomials in r, 1828 /// mentioning the same variable; 1829 /// assumes divisor != NULL; 1830 /// p may be NULL; 1831 /// assumes a global monomial ordering in r; 1832 /// performs polynomial division of p by divisor: 1833 ///  afterwards p contains the remainder of the division, i.e., 1834 /// p_before = result * divisor + p_afterwards; 1835 ///  if needResult == TRUE, then the method computes and returns 'result', 1836 /// otherwise NULL is returned (This parametrization can be used when 1837 /// one is only interested in the remainder of the division. In this 1838 /// case, the method will be slightly faster.) 1839 /// leaves divisor unmodified 1840 poly p_PolyDiv(poly &p, const poly divisor, const BOOLEAN needResult, const ring r); 1866 1841 1867 1842 /* syszygy stuff */
Note: See TracChangeset
for help on using the changeset viewer.