[e9dfcf] | 1 | @comment -*-texinfo-*- |
---|
[341696] | 2 | @comment $Id$ |
---|
[e9dfcf] | 3 | @comment this file contains the News about Singular versions |
---|
| 4 | @comment Unix |
---|
| 5 | @ifclear VERSION |
---|
| 6 | @include version.texi |
---|
| 7 | @end ifclear |
---|
| 8 | |
---|
| 9 | @majorheading NEWS in SINGULAR::PLURAL @value{VERSION} |
---|
| 10 | |
---|
| 11 | @ifclear singularmanual |
---|
| 12 | @macro nref{what} |
---|
| 13 | \what\ |
---|
| 14 | @end macro |
---|
| 15 | @end ifclear |
---|
| 16 | |
---|
| 17 | @ifset singularmanual |
---|
| 18 | @macro nref{what} |
---|
| 19 | @ref{\what\} |
---|
| 20 | @end macro |
---|
| 21 | @end ifset |
---|
| 22 | |
---|
[a2ac51] | 23 | The current version @value{VERSION} is the second pre-release |
---|
| 24 | of the upcoming release series version 2-1. Therefore, some |
---|
| 25 | command names are still subject to change. |
---|
[e9dfcf] | 26 | |
---|
| 27 | Singular::Plural version 2-1 is generally much faster than any previous |
---|
| 28 | experimental version of Singular::Plural, due to a rewrite of major parts |
---|
[437efdf] | 29 | of the @sc{Singular} kernel (e.g., the kernel has a new memory manager |
---|
[a2ac51] | 30 | and a new polynomial arithmetic) and due to new and better implemented algorithms (e.g., for two-sided Groebner bases and generally, for computations |
---|
| 31 | in factor algebras). |
---|
[e9dfcf] | 32 | |
---|
[a2ac51] | 33 | Besides theses internal changes, Singular::Plural version 2-1 offers many new |
---|
| 34 | features and functionalities. |
---|
[e9dfcf] | 35 | |
---|
| 36 | @heading Efficiency Improvements |
---|
[437efdf] | 37 | The following table shows some timings which compare the efficiency of |
---|
| 38 | @sc{Singular}: Plural version 0-9-9 and @sc{Singular} version 2-1-2. |
---|
[e9dfcf] | 39 | All times are in seconds |
---|
| 40 | and were obtained on HP 160 workstation with 512 MB RAM running HP-UX 10.20. |
---|
| 41 | |
---|
| 42 | @multitable @columnfractions .50 .20 .20 .15 |
---|
| 43 | @item @strong{Example} @tab @strong{0-9} @tab @strong{2-1} @tab @strong{Speedup} |
---|
| 44 | @c @item @uref{http://www.singular.uni-kl.de/Benchmarks/Singular/mora_1.sing,,mora_1} @tab std @tab 32003,x(1..3),ds @tab 82 @tab 9.4 @tab 8.7 |
---|
| 45 | |
---|
| 46 | @item AnnFD-sl2-4 @tab 3.34 @tab 0.92 @tab 3.6 |
---|
| 47 | @item TwoGB-g2-3 @tab 24577 @tab 165 @tab 149 |
---|
| 48 | @item ucha4 @tab 12.9 @tab 8.5 @tab 1.5 |
---|
| 49 | @item ucha2 @tab 44.3 hrs @tab 9 hrs @tab 4.9 |
---|
| 50 | @end multitable |
---|
| 51 | |
---|
| 52 | @heading (Commutative) Factorizing algorithms revisited |
---|
| 53 | Starting with version 2-0-4, we use NTL (of Victor Shoup) for factoring |
---|
| 54 | univariate polynomials. The multivariate factoring code in libfac/factory |
---|
| 55 | does now also work over algebraic extension fields. |
---|
| 56 | |
---|
| 57 | @heading General Changes |
---|
| 58 | @table @asis |
---|
| 59 | @item @nref{Emacs user interface} |
---|
| 60 | the recommended interface for using @sc{Singular::Plural} |
---|
| 61 | @item @code{EPlural} |
---|
| 62 | new program for an out-of-the-box, pre-customized Emacs which runs |
---|
| 63 | Plural |
---|
| 64 | @item @nref{The online help system} |
---|
| 65 | choose in which browser the on-line help is displayed; |
---|
| 66 | @*wildcard expansion of help topics |
---|
| 67 | @*new layout of html manual pages |
---|
| 68 | @item @nref{Source code debugger} |
---|
| 69 | interactive debugging of procedures written in the @sc{Singular} |
---|
| 70 | language |
---|
[a2ac51] | 71 | @item http://www.singular.uni-kl.de/plural |
---|
| 72 | New WWW home-site of @sc{Plural} |
---|
[e9dfcf] | 73 | @end table |
---|
| 74 | |
---|
| 75 | @heading @sc{Singular::Plural} libraries |
---|
| 76 | |
---|
| 77 | @table @asis |
---|
[a2ac51] | 78 | @item @nref{lieA_lib} Plural definitions of several series of enveloping algebras of simple Lie algebras |
---|
[e9dfcf] | 79 | @end table |
---|
| 80 | |
---|
[a2ac51] | 81 | |
---|
[e9dfcf] | 82 | @heading Internal Changes |
---|
| 83 | @table @asis |
---|
| 84 | @item new data structures for monomials and polynomials |
---|
| 85 | Makes polynomial arithmetic significantly faster: Especially for block - |
---|
| 86 | or weighted orderings. |
---|
| 87 | Bucket representation of polynomials in std and NF; |
---|
| 88 | Ring change during std-related computations |
---|
| 89 | (resulting in more speed and less space consumption). |
---|
| 90 | @item new memory management |
---|
| 91 | Results is less memory usage, faster memory allocation/free, less |
---|
| 92 | fragmentation, much better locality of reference. |
---|
| 93 | @end table |
---|