1 This file records noteworthy changes.
3 1.0.11 (18 September 2002)
4 * Fixed a possible memory corruption in contractions of indexed objects with
5 delta or metric tensors.
6 * Computing the derivative of a power series object with respect to a symbol
7 that is not the expansion variable now works correctly.
10 * Powers of indexed objects are now parenthesized correctly in LaTeX output.
11 * Input parser handles indices (they have to be specified in the same list
13 * Added some limited support for subspaces in the idx and tensor classes.
14 * Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
15 sorted list containing two or more equal objects failed to return 0).
18 * simplify_indexed() now raises/lowers dummy indices to canonicalize the index
19 variance. This allows some simplifications that weren't possible before,
20 like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
21 * Implemented relational::subs().
22 * Fixed bug in simplify_ncmul() for clifford objects.
25 * Improvements in memory usage of the expand() methods.
28 * Fixed LaTeX output of indexed and matrix objects.
29 * Fixed matrix::pow(n) for n==0 and added helper functions to create unit
30 matrices "ex unit_matrix(unsigned, unsigned)".
33 * "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
35 1.0.5 (27 January 2002)
36 * (l)degree(s), coeff(s, n) and collect(s) were extended to accept expressions
37 of any class (except add/mul/ncmul/numeric) for "s". They should even work
38 if "s" is a "power" object, as long as the exponent is non-integer, but with
39 some limitations. For example, you can "collect(a*2^x+b*2^x, 2^x)" to get
40 "(a+b)*2^x", but "degree(2^(3*x), 2^x)" yields 0 instead of 3).
41 * Fixed a small output bug.
43 1.0.4 (24 January 2002)
44 * Speedup in expand().
45 * Faster Bernoulli numbers (Markus Nullmeier).
46 * Some minor bugfixes and documentation updates.
48 1.0.3 (21 December 2001)
49 * Fixed a bug where quo() would call vector::reserve() with a negative
51 * Fix several bugs in code generation.
53 1.0.2 (19 December 2001)
54 * Input parser recognizes "sqrt()", which is also used in the output.
55 * divide(a,b,q) only modifies q if the division succeeds; also, divide(a,b,a)
57 * Fixed small bug in dummy index renaming which could cause it to not
58 recognize renamable indices in some cases.
59 * power::degree() and power::ldegree() throw an exception when encountering
60 a non-integer exponent.
61 * Add output-support for Python bindings.
63 1.0.1 (22 November 2001)
64 * Function sqrfree() handles a few more cases now.
65 * Class relational has real canonical ordering now.
66 * Handle obscene libreadline version numbers when building ginsh.
68 1.0.0 (6 November 2001)
69 * Some internal reorganization resulting in a general speed-up.
70 * The last 3 evaluated expressions in ginsh are now referred to with the
71 tokens '%', '%%' and '%%%'. The old '"', '""' and '"""' remain for
72 compatibility but may be removed in a future version of GiNaC.
74 0.9.4 (20 September 2001)
75 * Functions have better support for external scripting languages.
76 * Interface cleanups and bugfixes.
77 * Fix silly bug in evalf() that prevented things like 2^Pi being computed.
79 0.9.3 (16 August 2001)
80 * series expansion now much more consistent for small order expansion.
81 * lsolve() accepts algorithmic hint as parameter.
84 * Epsilon tensor is more functional.
85 * simplify_indexed() is better at detecting expressions that vanish for
87 * Several little bugfixes and consistency enhancements.
90 * Ctors of class numeric are not explicit any more. All built-in callers for
91 pseudofunctions are now templated and default to ex arguments which relaxes
92 the need for explicit ctors.
93 * New functions/methods:
95 - remove_first(), remove_last(), sort() and unique() for lists
98 * Instead of just totally symmetric or antisymmetric, complex symmetries
99 can now be defined for indexed objects. Symmetries are described by a
100 tree of "symmetry" objects that is constructed with the sy_none(),
101 sy_symm(), sy_anti() and sy_cycl() functions. The symmetry of a function
102 with respect to its arguments can also be defined (this is currently
103 only used for the Beta function).
104 * Generalized map() to take a function object instead of a function pointer.
105 This allows passing an arbitrary number of additional state to the
106 function being called.
107 * color_trace(), dirac_trace(), diff(), expand(), evalf() and normal() work
108 better with container classes, e.g. using color_trace() on a relation will
109 take the trace on both sides, using diff() on a matrix differentiates every
111 * diff() works properly with non-commutative products and indexed objects.
112 * New option flag "expand_function_args" for expand().
113 * Supplement some (now deprecated) macros by inlined template functions:
114 - is_of_type(foo, type) -> is_a<type>(foo)
115 - is_ex_of_type(foo, type) -> is_a<type>(foo)
116 - is_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
117 - is_ex_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
118 - ex_to_foobar(baz) -> ex_to<foobar>(baz)
119 * rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
121 * Small bugfixes in pattern matching.
122 * Updated libtool to version 1.4.
125 * In the output and in ginsh, lists are now delimited by { } braces, and
126 matrices are delimited by single [ ] brackets.
127 * simplify_indexed() renames dummy indices so, e.g., "a.i*a.i+a.j*a.j" gets
128 simplified to "2*a.i*a.i" (or "2*a.j*a.j").
129 * New functions/methods:
130 - canonicalize_clifford() (helpful when comparing expressions containing
132 - symmetrize() and antisymmetrize()
133 - numer_denom() (return numerator and denominator in one call)
134 - map() (apply function to subexpressions)
135 - evalm() (evaluate sums, products and integer powers of matrices)
136 * Added a new function match() for performing pattern matching. subs() and
137 has() also accept patterns as arguments. A pattern can be any expression,
138 optionally containing wildcard objects. These are constructed with the
139 call "wild(<unsigned>)" and are denoted as "$0", "$1" etc. in the output
141 * Positive integer powers of non-commutative expressions (except matrices)
142 are automatically expanded.
143 * Removed cint subdirectory, ginaccint is a separate package now due to
144 packaging considerations.
145 * Several little bugfixes.
148 * color and clifford classes are functional and documented.
149 * New "spinidx" class for dotted/undotted indices.
150 * Predefined spinor metric tensor (created by spinor_metric()).
151 * Symbols can have a LaTeX name, e.g. symbol s("s", "\\sigma");
152 * LaTeX output of indexed objects is much nicer.
153 * Fixed some build problems (with recent libreadline).
154 * Semantics of arithmetic operators now follows the C++ rules more strictly.
156 0.8.2 (24 April 2001)
157 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() work with
158 non-symbols as the second argument in ginsh.
159 * the argument to collect() can be a list of objects in which case the
160 result is either a recursively collected polynomial, or a polynomial in
161 a distributed form with terms like coeff*x1^e1*...*xn^en, as specified by
162 the second argument to collect().
163 * Several bugfixes (including a nasty memory leak in .normal()).
164 * class matrix: solve() doesn't call algorithms redundantly any more and
165 inverse() falls back to solve() which works in more general cases.
167 0.8.1 (16 April 2001)
168 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() can now
169 be used with constants, functions and indexed expressions as well, so you
170 can use it to collect by powers of Pi or sin(x), or to find the coefficient
173 - it only works with symbols, constants, functions and indexed expressions,
174 trying to find the coefficient of, e.g., "x^2" or "x+y" won't work;
175 - it does not know about dummy index summations; the coefficient of
176 gamma~0 in p.mu*gamma~mu should be p.0 but is returned as 0;
177 - using coeff(), tcoeff(), lcoeff() or collect() on elements of
178 noncommutative products might return wrong or surprising results.
179 * subs() no longer only substitutes symbols and indices but performs a more
180 general "syntactic substitution", i.e. it substitutes whole objects in sub-
181 expressions. You can subs((a+b)^2,a+b==3) and get 9, but subs(a+b+c,a+b==3)
184 - substituting numerics (subs(expr, 2==4)) will not replace then in all
185 occurences; in general, you shouldn't substitute numerics, though.
186 * Added preliminary (re)implementations of color and clifford classes.
187 * simplify_indexed(): contraction of symmetric and antisymmetric tensors
189 * Replaced the various print*() member functions by a single print() that
190 takes a print_context object that determines the output formatting. This
191 should make it easier to add more output types, such as LaTeX output,
192 which is based on work by Stefan Weinzierl.
193 * Added functions to retrieve the properties stored in archive objects
194 outside of unarchive() (for printing or debugging purposes).
195 * Some bugfixes (indexed objects, archive writing).
196 * .collect() on non-polynomials is now algebraically correct.
198 0.8.0 (24 March 2001)
199 * Complete revamp of indexed objects. Instead of multiple classes for
200 indexed things and their indices there is now only one "indexed" class
201 and two types of indices: "idx" for simple indices and "varidx" for
202 indices with variance. There are predefined delta, epsilon and metric
203 tensors, and a function simplify_indexed() that performs canonicalization
204 and dummy index summations. Matrix objects can be indexed for doing simple
206 * Added an option "expand_indexed" to expand() to perform expansion of
207 indexed objects like (a+b).i -> a.i + b.i
208 * Renamed get_indices() to get_free_indices(), which no longer returns
209 dummy indices and checks the consistency of indices in sums.
210 * sqrfree() factorization fixed and improved syntactically.
211 * subs() works on matrices.
212 * Matrices can be constructed from flat list of elements; diagonal matrices
213 can be constructed from list of diagonal elements with diag_matrix().
214 * Fixed memory leak in expand().
215 * Operator% for objects of class ncmul has gone. Use operator* now for that
216 case too, which is much more natural.
218 0.7.3 (28 February 2001)
219 * Several bugfixes and minor performance tunings.
220 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
221 * Closed many in-source documentation gaps.
223 0.7.2 (17 February 2001)
224 * Several bugfixes in power series expansion, one of them critical.
226 0.7.1 (7 February 2001)
227 * Fix problems with Cint that were caused by CLN's overloaded operator new.
228 * Fix compilation errors with GCC3.
229 * normal() handles large sums of fractions better and normalizes the exponent
230 of power expressions.
231 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
232 * Some bugfixes of series expansion around branch cuts of special functions.
234 0.7.0 (15 December 2000)
235 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
236 actual representation any more. This is a speedup.
237 * mul::expand() was reengineered to not allocate excess temporary memory.
238 * Non-integer powers of a symbol are treated as constants by (l)degree() and
239 coeff(). Using these functions on an expression containing such powers used
240 to fail with an internal error message. The side-effect is that collect()
241 can be used on expressions which are not polynomials.
242 * Added a man page for the ginac-config script.
243 * Ctor of numeric from char* honors Digits.
245 0.6.4 (10 August 2000)
246 * Complete revamp of methods in class matrix. Some redundant (and poor)
247 implementations of elimination schemes were thrown out. The code is now
248 highly orthogonal, more flexible and much more efficient.
249 * Some long standing and quite nasty bugs were discovered and fixed in the
250 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
253 * Derivatives are now assembled in a slightly different manner (i.e. they
254 might 'look' different on first sight). Under certain circumstances this
255 can result in a dramatic speedup because it gives hashing a better chance,
256 especially when computing higher derivatives.
257 * Some series expansions of built-in functions have been reengineered.
258 * The algorithm for computing determinants can be chosen by the user. See
259 ginac/flags.h and ginac/matrix.h.
260 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
261 proper series expansion.
262 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
263 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
266 * ginaccint.bin is now launched by a binary program instead of by a scripts.
267 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
269 * Several minor bugfixes.
272 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
273 * Several bugfixes in target install.
276 * IMPORTANT: Several interface changes make programs written with GiNaC
277 much clearer but break compatibility with older versions:
278 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
279 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
280 - gamma() -> tgamma() (The true Gamma function, there is now also
281 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
282 - EulerGamma -> Euler
283 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
284 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
285 library version numbers.
286 * Expressions can be constructed from strings like this:
287 ex e("2*x+y", lst(x, y));
288 * ex::to_rational() provides a way to extend the domain of functions like
289 gcd() and divide() that only work on polynomials or rational functions (the
290 good old ex::subs() method reverses this process)
291 * Calling diff() on a function that has no derivative defined returns the
292 inert derivative function "Derivative".
293 * Several new timings in the check target. Some of them may be rather rude
294 at your machine, feel free to interrupt them.
296 0.5.4 (15 March 2000)
297 * Some algorithms in class matrix (notably determinant) were replaced by
298 less brain-dead ones and should now have much better performance.
299 * Checks were completely reorganized and split up into three parts:
300 a) exams (small regression tests with predefined input)
301 b) checks (lenghty coherence checks with random input)
302 c) timings (for coherence and crude benchmarking)
303 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
304 * Expanded expressions now remember they are expanded to prevent
305 superfluous expansions.
306 * Small bugfixes and improvements in the series expansion.
308 0.5.3 (23 February 2000)
309 * A more flexible scheme for registering functions was implemented,
310 allowing for remembering, too.
313 0.5.2 (16 February 2000)
314 * Mainly fixes a bug in the packaging of release 0.5.1.
316 0.5.1 (14 February 2000)
317 * Fixes a small number of bugs.
319 0.5.0 (7 February 2000)
320 * Expressions can be written ("archived") to files and read therefrom.
321 * Addition of GiNaC-cint, which lets you write complete programs in
322 an interactive shell-like manner in your favoured programming
325 0.4.1 (13 December 1999)
326 * Series Expansion of Gamma function and some other trigonometric
327 functions at their poles works now.
328 * Many more evaluations of special functions at points where
330 * info_flags::rational doesn't return true for complex extensions
331 any more---use info_flags::crational for the old behaviour.
332 info_flags::integer and -::cinteger work similarly, the same
333 holds for types like info_flags::rational_polynomial.
335 0.4.0 (26 November 1999)
336 * First public release.