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