Changeset 473102 in git


Ignore:
Timestamp:
Jun 25, 2013, 3:25:38 PM (10 years ago)
Author:
Martin Lee <martinlee84@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
Children:
e380c094a09f6af6dd282c36d78055ec8bd24ece
Parents:
26fc598971dac7165d7ec99eec29433a9e8b9428
git-author:
Martin Lee <martinlee84@web.de>2013-06-25 15:25:38+02:00
git-committer:
Martin Lee <martinlee84@web.de>2013-07-22 15:49:53+02:00
Message:
various changes/fixes to documentation
Location:
factory
Files:
7 edited

Legend:

Unmodified
Added
Removed

  • factory/cf_gcd_smallp.cc

    r26fc59 r473102  
    88 * This file implements the GCD of two polynomials over \f$ F_{p} \f$ ,
    99 * \f$ F_{p}(\alpha ) \f$ or GF based on Alg. 7.2. as described in "Algorithms
    10  * for Computer Algebra" by Geddes, Czapor, Labahnn
     10 * for Computer Algebra" by Geddes, Czapor, Labahn
    1111 *
    1212 * @par Copyright:
    … …  
    11331133}
    11341134
    1135 /// F is assumed to be an univariate polynomial in x,
    1136 /// computes a random monic irreducible univariate polynomial of random
    1137 /// degree < i in x which does not divide F
     1135/// computes a random monic irreducible univariate polynomial in x of random
     1136/// degree < i
    11381137CanonicalForm
    11391138randomIrredpoly (int i, const Variable & x)

  • factory/cf_map_ext.h

    r26fc59 r473102  
    4848
    4949/// map from \f$ F_p(\alpha) \f$ to \f$ F_p(\beta) \f$ such that
    50 /// \f$ F\in\F_p(\alpha) \f$ is mapped onto \f$ \beta \f$
     50/// \f$ F\in F_p(\alpha) \f$ is mapped onto \f$ \beta \f$
    5151///
    5252/// @return @a map returns the image of @a primElem such that the above
    … …  
    6464    );
    6565
    66 /// compute minimal polynomial of \f$ F\in\F_p(\alpha)\backslash\F_p \f$ via NTL
     66/// compute minimal polynomial of \f$ F\in F_p(\alpha)\backslash F_p \f$ via NTL
    6767///
    6868/// @return @a findMinPoly computes the minimal polynomial of F
    6969CanonicalForm
    7070findMinPoly (const CanonicalForm& F, ///< [in] an element of
    71                                      ///< \f$ \F_p(\alpha)\backslash\F_p \f$
     71                                     ///< \f$ F_p(\alpha)\backslash F_p \f$
    7272             const Variable& alpha   ///< [in] algebraic variable
    7373            );

  • factory/facHensel.cc

    r26fc59 r473102  
    77 *
    88 * ABSTRACT: Hensel lifting is described in "Efficient Multivariate
    9  * Factorization over Finite Fields" by L. Bernardin & M. Monagon.
     9 * Factorization over Finite Fields" by L. Bernardin & M. Monagon and
     10 * "Algorithms for Computer Algebra" by Geddes, Czapor, Labahn
    1011 *
    1112 * @author Martin Lee
    … …  
    483484}
    484485
     486/// solve \f$ 1=\sum_{i=1}^n{\delta_{i} \prod_{j\neq i}{f_j}} \f$ mod \f$p^k\f$
     487/// over Q(alpha) by p-adic lifting
    485488CFList
    486489diophantineHenselQa (const CanonicalForm & F, const CanonicalForm& G,
    … …  
    691694}
    692695
     696
     697/// solve \f$ 1=\sum_{i=1}^n{\delta_{i} \prod_{j\neq i}{f_j}} \f$ mod \f$p^k\f$
     698/// over Q(alpha) by first computing mod \f$p\f$ and if no zero divisor occured
     699/// compute it mod \f$p^k\f$
    693700CFList
    694701diophantineQa (const CanonicalForm& F, const CanonicalForm& G,
    … …  
    20112018
    20122019
    2013 /// solve \f$ E=sum_{i= 1}^{r}{\sigma_{i}prod_{j=1, j\neq i}^{r}{f_{i}}}\f$
    2014 /// mod M, products contains \f$ prod_{j=1, j\neq i}^{r}{f_{i}}} \f$
     2020/// solve \f$ E=\sum_{i= 1}^r{\sigma_{i}\prod_{j=1, j\neq i}^{r}{f_{i}}}\f$
     2021/// mod M, @a products contains \f$ \prod_{j=1, j\neq i}^{r}{f_{j}} \f$
    20152022CFList
    20162023diophantine (const CFList& recResult, const CFList& factors,

  • factory/facHensel.h

    r26fc59 r473102  
    77 *
    88 * ABSTRACT: function are used for bi- and multivariate factorization over
    9  * finite fields
     9 * finite fields. Described in "Efficient Multivariate Factorization over Finite
     10 * Fields" by L. Bernardin & M. Monagon and "Algorithms for Computer Algebra" by
     11 * Geddes, Czapor, Labahn
    1012 *
    1113 * @author Martin Lee

  • factory/facIrredTest.h

    r26fc59 r473102  
    22 * Computer Algebra System SINGULAR
    33\*****************************************************************************/
    4 /** @file facHensel.h
     4/** @file facIrredTest.h
    55 *
    66 * This file provides a probabilistic irreducibility test for polynomials over

  • factory/facNTLzzpEXGCD.cc

    r26fc59 r473102  
    1313 *   (c) by The SINGULAR Team, see LICENSE file
    1414 *
    15 **/
    16 //*****************************************************************************
    17 
    18 /**
     15
    1916                  COPYRIGHT NOTICE
    2017                    for NTL 5.5

  • factory/facNTLzzpEXGCD.h

    r26fc59 r473102  
    1515 * @author Martin Lee
    1616 *
    17  **/
    18 /*****************************************************************************/
    1917
    20 /**
     18
    2119                  COPYRIGHT NOTICE
    2220                    for NTL 5.5
Note: See TracChangeset for help on using the changeset viewer.