Changeset f37df2 in git


Ignore:
Timestamp:
Jun 20, 2014, 2:11:44 PM (10 years ago)
Author:
Martin Lee <martinlee84@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
a4d2fae92c6a452e379d088cfdef55fab20197de
Parents:
1a82eb5fd98b8cf62bd4e5eb81204776dd748fe6
git-author:
Martin Lee <martinlee84@web.de>2014-06-20 14:11:44+02:00
git-committer:
Martin Lee <martinlee84@web.de>2014-06-24 12:06:05+02:00
Message:
chg: docu for new files
Location:
factory
Files:
6 edited

Legend:

Unmodified
Added
Removed

  • factory/cfEzgcd.cc

    r1a82eb rf37df2  
    936936static int sizePerVars1= 500; //try dense gcd if size/#variables is bigger
    937937
    938 /// Extended Zassenhaus GCD for finite fields
     938/// Extended Zassenhaus GCD for finite fields.
     939/// In case things become too dense we switch to a modular algorithm
    939940CanonicalForm EZGCD_P( const CanonicalForm & FF, const CanonicalForm & GG )
    940941{

  • factory/cfEzgcd.h

    r1a82eb rf37df2  
     1/**
     2 * @file cfEzgcd.h
     3 *
     4 * Extended Zassenhaus GCD over finite fields and Z
     5**/
     6
    17#ifndef CF_EZ_GCD_H
    28#define CF_EZ_GCD_H
    3 /// extended Zassenhaus GCD
    49CanonicalForm
    510EZGCD_P (const CanonicalForm& A, const CanonicalForm& B);

  • factory/cfGcdUtil.h

    r1a82eb rf37df2  
     1/**
     2 * @file cfGcdUtil.h
     3 *
     4 * coprimality check and change of representation mod n
     5**/
     6
    17#ifndef CF_GCD_UTIL_H
    28#define CF_GCD_UTIL_H

  • factory/cfSubResGcd.h

    r1a82eb rf37df2  
     1/**
     2 * @file cfSubResGcd.h
     3 *
     4 * subresultant pseudo remainder sequence GCD over finite fields and Z
     5**/
    16#ifndef CF_SUB_RES_GCD_H
    27#define CF_SUB_RES_GCD_H
    38
     9/// subresultant GCD over finite fields.
     10/// In case things become too dense we switch to a modular algorithm
    411CanonicalForm
    512gcd_poly_p( const CanonicalForm & f, const CanonicalForm & g );
    613
     14/// subresultant GCD over Z.
     15/// @note in contrast to gcd_poly_p we do not switch to a modular algorithm
     16///       in case things become too dense
    717CanonicalForm
    818gcd_poly_0( const CanonicalForm & f, const CanonicalForm & g );

  • factory/cfUnivarGcd.h

    r1a82eb rf37df2  
     1/**
     2 * @file cfUnivarGcd.h
     3 *
     4 * univariate Gcd over finite fields and Z, extended GCD over finite fields
     5 * and Q
     6 *
     7 * @note if NTL or FLINT are available they are used to compute the (ext)Gcd
     8**/
     9
    110#ifndef CF_UNIVAR_GCD_H
    211#define CF_UNIVAR_GCD_H

  • factory/cf_gcd.cc

    r1a82eb rf37df2  
    8181 * Different gcd variants get called depending the input, characteristic, and
    8282 * on switches (cf_defs.h)
     83 *
     84 * With the current settings from Singular (i.e. SW_USE_EZGCD= on,
     85 * SW_USE_EZGCD_P= on, SW_USE_CHINREM_GCD= on, the EZ GCD variants are the
     86 * default algorithms for multivariate polynomial GCD computations)
    8387 *
    8488 * @sa gcd(), cf_defs.h
Note: See TracChangeset for help on using the changeset viewer.