1 This file records noteworthy changes.
4 * Complete revamp of indexed objects. Instead of multiple classes for
5 indexed things and their indices there is now only one "indexed" class
6 and two types of indices: "idx" for simple indices and "varidx" for
7 indices with variance. There are predefined delta, epsilon and metric
8 tensors, and a function simplify_indexed() that performs canonicalization
9 and dummy index summations.
10 * Added an option "expand_indexed" to expand() to perform expansion of
11 indexed objects like (a+b).i -> a.i + b.i
12 * Renamed get_indices() to get_free_indices(), which no longer returns
13 dummy indices and checks the consistency of indices in sums.
14 * sqrfree() factorization fixed and improved syntactically.
15 * subs() works on matrices.
16 * Fixed memory leak in expand().
17 * Operator% for objects of class ncmul has gone. Use operator* now for that
18 case too, which is much more natural.
20 0.7.3 (28 February 2001)
21 * Several bugfixes and minor performance tunings.
22 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
23 * Closed many in-source documentation gaps.
25 0.7.2 (17 February 2001)
26 * Several bugfixes in power series expansion, one of them critical.
28 0.7.1 (7 February 2001)
29 * Fix problems with Cint that were caused by CLN's overloaded operator new.
30 * Fix compilation errors with GCC3.
31 * normal() handles large sums of fractions better and normalizes the exponent
33 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
34 * Some bugfixes of series expansion around branch cuts of special functions.
36 0.7.0 (15 December 2000)
37 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
38 actual representation any more. This is a speedup.
39 * mul::expand() was reengineered to not allocate excess temporary memory.
40 * Non-integer powers of a symbol are treated as constants by (l)degree() and
41 coeff(). Using these functions on an expression containing such powers used
42 to fail with an internal error message. The side-effect is that collect()
43 can be used on expressions which are not polynomials.
44 * Added a man page for the ginac-config script.
45 * Ctor of numeric from char* honors Digits.
47 0.6.4 (10 August 2000)
48 * Complete revamp of methods in class matrix. Some redundant (and poor)
49 implementations of elimination schemes were thrown out. The code is now
50 highly orthogonal, more flexible and much more efficient.
51 * Some long standing and quite nasty bugs were discovered and fixed in the
52 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
55 * Derivatives are now assembled in a slightly different manner (i.e. they
56 might 'look' different on first sight). Under certain circumstances this
57 can result in a dramatic speedup because it gives hashing a better chance,
58 especially when computing higher derivatives.
59 * Some series expansions of built-in functions have been reengineered.
60 * The algorithm for computing determinants can be chosen by the user. See
61 ginac/flags.h and ginac/matrix.h.
62 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
63 proper series expansion.
64 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
65 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
68 * ginaccint.bin is now launched by a binary program instead of by a scripts.
69 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
71 * Several minor bugfixes.
74 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
75 * Several bugfixes in target install.
78 * IMPORTANT: Several interface changes make programs written with GiNaC
79 much clearer but break compatibility with older versions:
80 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
81 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
82 - gamma() -> tgamma() (The true Gamma function, there is now also
83 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
85 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
86 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
87 library version numbers.
88 * Expressions can be constructed from strings like this:
89 ex e("2*x+y", lst(x, y));
90 * ex::to_rational() provides a way to extend the domain of functions like
91 gcd() and divide() that only work on polynomials or rational functions (the
92 good old ex::subs() method reverses this process)
93 * Calling diff() on a function that has no derivative defined returns the
94 inert derivative function "Derivative".
95 * Several new timings in the check target. Some of them may be rather rude
96 at your machine, feel free to interrupt them.
99 * Some algorithms in class matrix (notably determinant) were replaced by
100 less brain-dead ones and should now have much better performance.
101 * Checks were completely reorganized and split up into three parts:
102 a) exams (small regression tests with predefined input)
103 b) checks (lenghty coherence checks with random input)
104 c) timings (for coherence and crude benchmarking)
105 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
106 * Expanded expressions now remember they are expanded to prevent
107 superfluous expansions.
108 * Small bugfixes and improvements in the series expansion.
110 0.5.3 (23 February 2000)
111 * A more flexible scheme for registering functions was implemented,
112 allowing for remembering, too.
115 0.5.2 (16 February 2000)
116 * Mainly fixes a bug in the packaging of release 0.5.1.
118 0.5.1 (14 February 2000)
119 * Fixes a small number of bugs.
121 0.5.0 (7 February 2000)
122 * Expressions can be written ("archived") to files and read therefrom.
123 * Addition of GiNaC-cint, which lets you write complete programs in
124 an interactive shell-like manner in your favoured programming
127 0.4.1 (13 December 1999)
128 * Series Expansion of Gamma function and some other trigonometric
129 functions at their poles works now.
130 * Many more evaluations of special functions at points where
132 * info_flags::rational doesn't return true for complex extensions
133 any more---use info_flags::crational for the old behaviour.
134 info_flags::integer and -::cinteger work similarly, the same
135 holds for types like info_flags::rational_polynomial.
137 0.4.0 (26 November 1999)
138 * First public release.