cali.chg 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215
  1. % Author H.-G. Graebe | Univ. Leipzig
  2. % graebe@informatik.uni-leipzig.dbp.de
  3. CALI Changes from v. 2.0. to v. 2.1. :
  4. =====================================
  5. Changes in the interface :
  6. changed meaning :
  7. getmult -- renamed to degree
  8. groebfactorize -- renamed to groebfactor, now allows constraints
  9. switch lazy -- now chooses between Mora's and Lazard's
  10. approaches
  11. removed :
  12. - idealintersect (use matintersect instead)
  13. - homstbasis (off lazy now starts Lazard's approach)
  14. - setecart (incorporated into setring)
  15. changed parameter list :
  16. - setring!*(vars,tord,tag,ecart)
  17. - setring(vars,tord,tag[,ecart])
  18. - resolve!*(m,d)
  19. - groebfactor!*(m,con)
  20. - in general model were exchanged with base elements
  21. changed return code structure :
  22. - getring (in accordance with setring)
  23. - mod!* (returns a pair (NF . pol. unit))
  24. - all symbolic primary decompositions
  25. (lists of 2-element lists instead of pairs)
  26. New facilities :
  27. switch
  28. hardzerotest
  29. do simplification for each zerotest of base coefficients
  30. factorunits
  31. detectunits
  32. (deleting unit factors under a nonnoetherian term order from
  33. base polynomials)
  34. 14.5.93 cali!=ecart becomes local to each ring and was removed as
  35. global variable. This changes ring_define and derivates of
  36. them.
  37. ring_ecart added, ring_checkecart, ring_2a changed.
  38. The algebraic mode proc. "setecart" is incorporated into
  39. "setring" (and hence removed). "setring" now may be called
  40. with 3 (standard ecart) or 4 arguments.
  41. "getring" returns also the ecart.
  42. 16.5.93 lazystbasis returns now (gb . syz . nil)
  43. setecart!* changes only the ecart vector.
  44. getmult is now degree.
  45. 19.5.93 'dpfn became 'dp!=fn in dpoly.
  46. primarydecomposition : Now it handles gbases and hence
  47. submodulep works properly for detecting superfluous
  48. components.
  49. 21.5.93 listtest and listminimize added to unify
  50. minset (removed)
  51. groeb!=crit*
  52. groeb!=test*
  53. matop_redtest (removed)
  54. matop_reduce (removed)
  55. prime!=redtest (removed)
  56. prime!=reduce (removed)
  57. 22.5.93 A new version of the groebner factorization package was
  58. incorporated, that uses constraints.
  59. Hilbert series now have also denominator in accordance with
  60. the ecart vector. moid_hf2dim now computes the pole order,
  61. not the degree of the denominator.
  62. 23.5.93 varopt = heuristic variable optimization
  63. mo_2list added and mo_varexp, mo_linear changed.
  64. 28.5.93 fctrf supplied with "where !*factor=t" to guarantee correct
  65. execution in the modular case.
  66. 10.6.93 red_bas added.
  67. prime!=zeroprimes and prime!=zeroprimes2 corrected to handle
  68. unit ideal properly.
  69. moid_hf2dim corrected : mvar f doesn't exist if denr f=1 .
  70. 11.6.93 dp_unit!? : test for bc_unit removed.
  71. switches !*factorunits (find them by factorization) and
  72. !*detectunits (detect base elements of the form monomial *
  73. unit) added.
  74. bas_deleteunits and dp_deleteunits added.
  75. 14.6.93 models were changed to base elements since we need also
  76. auxiliary information in several places for best choises
  77. (as e.g. the ecart). This concerns
  78. red_subst
  79. red_redpol
  80. mora_redpol
  81. dp_simp (it became dp_simp with another syntax and
  82. bas_simpelement)
  83. groeb_spol
  84. red_divtest
  85. moid updated to handle also vector moideals where it is
  86. possible. This concerns
  87. moid_sum
  88. moid_red
  89. moid_member
  90. 18.6.93 groeb_stbasis and primarydecomposition!* etc. now return lists.
  91. 5.7.93 bc_zero!? modified introducing the switch "hardzerotest".
  92. 6.7.93 idealintersect removed.
  93. matintersect changed to one GB computation.
  94. dpmat_det added.
  95. 9.7.93 moid_from_bas : bas_zerodelete added
  96. new syntax : red_divtest(base list, monomial)
  97. 12.7.93 idealquotient and modulequotient changed to allow prereduction
  98. of the divisor.
  99. 13.7.93 matstabquot(m,id) added.
  100. 15.7.93 moid_max added.
  101. unmixedradical and eqhull added.
  102. 19.7.93 setring changed, ring_from_a added.
  103. 20.7.93 resolve!*(m,d) with d = length of the required chain.
  104. all procedures in module prime updated to compute gbasis!*
  105. after the change to new coordinates.
  106. 22.7.93 module prime corrected to compute the correct bc_lcm of lc for
  107. the recontraction ideal.
  108. genmat added.
  109. 23.7.93 syzygies for zero elements added.
  110. 26.7.93 ring degree tests corrected. Primary decomposition supplied with
  111. ring_rlp term orders to guarantee, that precomputed gbases remain
  112. gbases after ring change.
  113. codim and codim!* added.
  114. idealquotient#!*, modulequotient#!*, annihilator#!* (#=1,2)
  115. with different methods added.
  116. 27.7.93 dp_pseudodivmod added.
  117. 28.7.93 minors added.
  118. 3.9.93 strcat added to the header module.
  119. ring_from_a : default ecart now becomes
  120. either first tord
  121. (provided tord exists and all weights are positive)
  122. or (1 .. 1).
  123. 7.9.93 dp_tcecart, dp_deletecomp added.
  124. tangentcone!* added.
  125. mod changed to return true reductum.
  126. bc_diff corrected (difff isn't s.f's difference !)
  127. dpgcd and dpgcd!* added.
  128. 8.9.93 dpgcd!* for unit polynomials simplified.
  129. 9.9.93 groebfactorize becomes groebfactor to avoid name conflict
  130. with the groebner package.
  131. Implementation changed to a version with constraint lists
  132. and ascending easydim problem list sort criterion.
  133. 10.9.93 groeb_updatePL discards (0 . 0)-pairs,
  134. bas_setrelations doesn't change elements with bas_nr=0,
  135. groeb_mingb discards element with bas_nr=0.
  136. dpmat_rowdegrees returns degrees only with nr>0.
  137. red_interreduce and mora_interreduce now take base lists.
  138. 12.9.93 all stuff in newcali.red embedded into local copies of global
  139. cali variables.
  140. 16.9.93 resolve(m[,d]) changed. dim, hilbseries, bettinumbers,
  141. gradedbettinumbers modified.
  142. setmonset, getmonset added.
  143. 29.9.93 ideal2mat -> ideal2mat!*
  144. list2mat -> ideal2mat
  145. mat2list -> flatten
  146. setrules, getrules, setrules!*, bc!=simp and cali!=rules added
  147. and bcsf changed appropriately.
  148. 7.10.93 groeb!=groebsyz -> groeb_innerstbasis
  149. mora!=homstbasis replaces homstbasis!* and is incorporated as
  150. one of the branches of !*lazy, called by mora_stbasis.
  151. dp_homogenize and dp_dehomogenize now treat also the rep
  152. part.
  153. mod!* -> matop_pseudmod
  154. The new mod!* now returns pairs (NF . pol. unit) as the
  155. algebraic interface mod.
  156. minors, genmat, matjac, dpmat_det -> scripts_det, varopt
  157. moved to the module scripts.
  158. module scripts added.
  159. 19.10.93 analytic_spread corrected.
  160. bas_sieve : bas-zerodelete inserted.