Changeset d40d654 in git


Ignore:
Timestamp:
Oct 3, 2023, 2:34:08 PM (7 months ago)
Author:
Frédéric Chapoton <chapoton@…>
Branches:
(u'spielwiese', 'd08f5f0bb3329b8ca19f23b74cb1473686415c3a')
Children:
0c751c50e648adb9839c49ee17eba6692006c2ae
Parents:
ce3bb41937fefb89b5291df7b3c05e68009e0a77
git-author:
Frédéric Chapoton <chapoton@unistra.fr>2023-10-03 14:34:08+02:00
git-committer:
Hans Schoenemann <hannes@mathematik.uni-kl.de>2023-11-07 16:19:53+01:00
Message:
fixing a few typos (#1193)
Location:
IntegerProgramming
Files:
5 edited

Legend:

Unmodified
Added
Removed

  • IntegerProgramming/Buchberger.cc

    rce3bb41 rd40d654  
    384384// "old" binomials do not have to be computed anymore (but pairs of an old
    385385// and a new one have to be computed, of course). As the generator list are
    386 // ordered with respect to the "done"-flag (all undone elements preceed all
     386// ordered with respect to the "done"-flag (all undone elements precede all
    387387// done elements), we can avoid unnecessary iteration steps by breaking
    388388// the iteration at the right point.
    … …  
    391391
    392392// For a better overview, the code for NO_SUPPORT_DRIVEN_METHODS_EXTENDED
    393 // and SUPPORT_DRIVEN_METHODS_EXTENDED is completetly separated in this
     393// and SUPPORT_DRIVEN_METHODS_EXTENDED is completely separated in this
    394394// function.
    395395
    … …  
    637637// at all. This is done in the appropriate Groebner basis routine
    638638// (reduced_Groebner_basis_1 or ..._1a) when moving them from the aux_list
    639 // to the generator lists. This meens that S-binomials cannot only be reduced
     639// to the generator lists. This means that S-binomials cannot only be reduced
    640640// by the generators known at the time of their computation, but also by
    641641// the S-pairs that where already treated.
    … …  
    646646// Furthermore, the computation of S-pairs with unreduced generators is
    647647// avoided.
    648 // To provide a possibility to compensate the mentionned disadvantage,
     648// To provide a possibility to compensate the mentioned disadvantage,
    649649// I have written the routine minimalize_S_pairs() that interreduces the
    650650// binomials stored in aux_list.
    … …  
    902902ideal& ideal::compute_actual_S_pairs_3()
    903903{
    904 // This routine is quite similar to the preceeding.
     904// This routine is quite similar to the preceding one.
    905905// The main difference is that the computed S-binomials are not stored in the
    906906// aux_list, but in new_generators. This makes a difference when minimalizing
    … …  
    20212021{
    20222022// For a better overview, the code for NO_SUPPORT_DRIVEN_METHODS_EXTENDED
    2023 // and SUPPORT_DRIVEN_METHODS_EXTENDED is completetly separated in this
     2023// and SUPPORT_DRIVEN_METHODS_EXTENDED is completely separated in this
    20242024// function. Note that th iteration methods are quite different for those
    20252025// two possibilities.
    … …  
    25092509// basis. The actual procedure reduces such a minimal basis at the end of
    25102510// BuchbergerŽs algorithm. It will probably cause problems when called
    2511 // in the course of the algorithm. For an explaination of this fact, see
     2511// in the course of the algorithm. For an explanation of this fact, see
    25122512// the following comment.
    25132513
    … …  
    28632863{
    28642864  // set flags for the use of the S-pair criteria
    2865   // for an explaination see in globals.h
     2865  // for an explanation see in globals.h
    28662866  rel_primeness=(S_pair_criteria & 1);
    28672867  M_criterion=(S_pair_criteria & 2);
    … …  
    29442944{
    29452945  // set flags for the use of the S-pair criteria
    2946   // for an explaination see in globals.h
     2946  // for an explanation see in globals.h
    29472947  rel_primeness=(S_pair_criteria & 1);
    29482948  M_criterion=(S_pair_criteria & 2);
    … …  
    30253025{
    30263026  // set flags for the use of the S-pair criteria
    3027   // for an explaination see in globals.h
     3027  // for an explanation see in globals.h
    30283028  rel_primeness=(S_pair_criteria & 1);
    30293029  M_criterion=(S_pair_criteria & 2);
    … …  
    31063106{
    31073107  // set flags for the use of the S-pair criteria
    3108   // for an explaination see in globals.h
     3108  // for an explanation see in globals.h
    31093109  rel_primeness=(S_pair_criteria & 1);
    31103110  M_criterion=(S_pair_criteria & 2);

  • IntegerProgramming/IP_algorithms.h

    rce3bb41 rd40d654  
    2626// be done by the following procedures. They check the format of their input
    2727// file (which should be a MATRIX file as described below) and return 1 if
    28 // they were successfull, 0 else.
     28// they were successful, 0 else.
    2929//  They take as arguments:
    3030// - their input file
    … …  
    106106// A modified version of the algorithm called EATI using "pseudo-elimination".
    107107// This algorithm is quite similar to Pottier's algorithm, but deals with
    108 // homogenous binomials.
     108// homogeneous binomials.
    109109
    110110// The second step of the IP-solution is to reduce one or more given

  • IntegerProgramming/binomial.cc

    rce3bb41 rd40d654  
    878878  {
    879879    Integer& actual_entry=exponent_vector[_number_of_variables-1-i];
    880     // to avoid unneccessary pointer arithmetic
     880    // to avoid unnecessary pointer arithmetic
    881881
    882882    actual_entry*=sign;
    … …  
    951951  {
    952952    Integer& actual_entry=exponent_vector[_number_of_variables-1-i];
    953     // to avoid unneccessary pointer arithmetic
     953    // to avoid unnecessary pointer arithmetic
    954954
    955955    if(i<size_of_support_vectors)
    … …  
    10491049    Integer& actual_entry=result.exponent_vector
    10501050      [result._number_of_variables-1-i];
    1051     // to avoid unneccessary pointer arithmetic
     1051    // to avoid unnecessary pointer arithmetic
    10521052
    10531053    actual_entry*=sign;

  • IntegerProgramming/change_cost.hlp

    rce3bb41 rd40d654  
    2828where GB stands for GROEBNER and <alg> is the abbreviation of the
    2929algorithm used for computing the input GROEBNER file (see the help for
    30 solve_IP or toric_ideal for an explaination).
     30solve_IP or toric_ideal for an explanation).
    3131
    3232A GROEBNER file looks as follows:
    … …  
    120120
    121121 -S [RP] [M] [B] [M] [2]  criteria to use in BuchbergerŽs algorithm
    122                           for discarding unneccessary S-pairs
     122                          for discarding unnecessary S-pairs
    123123             RP           relatively prime leading terms
    124124             M            Gebauer-Moeller criterion M

  • IntegerProgramming/list.h

    rce3bb41 rd40d654  
    163163  void ordered_print(const term_ordering&) const;
    164164  // Writes the list to the standard output medium.
    165   // The first routine writes the list elements as they are oredred in
     165  // The first routine writes the list elements as they are ordered in
    166166  // the list.
    167167  // The second one writes them in increasing order with respect to the
    … …  
    258258  int operator==(const list_iterator& iter) const;
    259259  int operator!=(const list_iterator& iter) const;
    260   // These operators verifie if actual references the same element
     260  // These operators verify if actual references the same element
    261261  // as iter.actual.
    262262
Note: See TracChangeset for help on using the changeset viewer.