1 This file records noteworthy changes.
3 1.1.5 (5 November 2003)
4 * Harmonic polylogarithms now numerically evaluate for arbitrary arguments
5 (parameter must still be positive integers).
6 * The zeta function now can also be given a lst as a parameter in which case
7 it becomes a multiple zeta value. The use of mZeta is deprecated.
8 * The order of parameters for the multiple polylogarithm has been corrected.
9 * Documentation for the nested sums functions zeta, harmonic polylog, multiple
10 polylog, etc. has been added.
12 1.1.4 (17 October 2003)
13 * Lists and matrices can now be initialized from comma-separated lists of
14 expressions, like this:
24 This is both faster and produces much smaller code than the old constructors
25 lst(ex, ex, ...) and matrix(unsigned, unsigned, lst), especially in the case
26 of matrices, and is now the recommended way to create these objects.
27 * The function mZeta now evaluates much faster for arbitrary parameters. The
28 harmonic and multiple polylogarithms evaluate considerably faster and check
29 for convergence. The order of parameters for the harmonic polylogarithm
32 1.1.3 (22 August 2003)
33 * Added new symbolic functions for better integration with nestedsums:
34 (multiple) polylogarithm Li(), Nielsen's generalized polylogarithm S(),
35 harmonic polylogarithm H(), and multiple zeta value mZeta().
36 * New exhashmap<T> template intended as a drop-in replacement for
37 std::map<ex, T, ex_is_less> using GiNaC's hashing algorithms.
39 1.1.2 (11 August 2003)
40 * Fixed a bug in the unarchiving of sums and products: terms were not
41 reordered in a canonical way.
42 * Fixed a bug in normal()/numer_denom(): denominator was not made unit
43 normal if it was a simple number.
44 * Improved the speed of subs() in some cases.
47 * lst (and exprseq) provide iterators for read-only element access. For
48 sequential access this is one order faster than using op().
49 * Implemented relational::subs() (this was done in 1.0.9 but inadvertently
50 omitted from the 1.1 branch).
51 * pole_error and do_taylor are available to library users.
52 * Added on-line help and Tab-completion for print(), iprint(), print_latex()
53 and print_csrc() in ginsh.
56 * Removed deprecated macros is_ex_a, is_ex_exactly_a and friends for good.
57 * The scalar_products mechanism allows the specification of an index dimension.
58 * Removed dirac_gamma6/7().
59 * Added ex::to_polynomial().
60 * subs() accepts an optional "options" argument. The option
61 subs_option::subs_algebraic enables "smart" substitutions in products and
63 * Added stream manipulators "dflt", "latex", "python", "python_repr", "tree",
64 "csrc", "csrc_float", "csrc_double", "csrc_cl_N", "index_dimensions" and
65 "no_index_dimensions" to control the output format. Calling basic::print()
66 directly is now deprecated.
67 * Made the hashing more simple and efficient.
68 * Caveats for class implementors:
69 - basic::subs(): third argument changed from "bool" to "unsigned"
70 - unarchiving constructor and basic::unarchive(): "const" removed from
72 - basic::let_op() should only be implemented if write access to
73 subexpressions is desired
74 - simplify_ncmul() renamed to eval_ncmul()
75 - simplified_ncmul() renamed to hold_ncmul()
76 - nonsimplified_ncmul() renamed to reeval_ncmul()
79 * Improved the C-source output: complex numbers are printed correctly (using
80 the STL complex<> template or cln::complex()), rational numbers use cl_RA()
81 in the CLN output, and small integers are printed in a more compact format
82 (e.g. "2.0" instead of "2.0000000e+00").
83 * function_options::set_return_type() and function_options::do_not_evalf_params()
86 1.0.13 (27 January 2003)
87 * Contracting epsilon tensors with Euclidean indices now works.
88 * Improved dummy index symmetrization in sums.
89 * Added dirac_gammaL/R(), which can be used instead of dirac_gamma6/7()
90 but are single objects, to allow for a more compact notation of Dirac
92 * Powers with negative numeric exponents are printed as fractions in the
94 * Added symbolic_matrix() for the convenient creation of matrices filled
96 * Added collect_common_factors() which collects common factors from the
98 * simplify_indexed() converts "gamma~mu*p.mu" to "p\".
100 1.0.12 (30 October 2002)
101 * Fixed a bug in power::expand() that could produce invalid expressions.
102 * The input parser no longer ignores extra data following accepted input.
103 * Improved the CLN C-source output (integers are printed as integers, and
104 floating point numbers include the precision).
105 * Fixed a problem in the LaTeX-output of negative fractions.
106 * Added print_latex() and print_csrc() to ginsh.
107 * The sprem() function is now public.
109 1.0.11 (18 September 2002)
110 * Fixed a possible memory corruption in contractions of indexed objects with
111 delta or metric tensors.
112 * Computing the derivative of a power series object with respect to a symbol
113 that is not the expansion variable now works correctly.
114 * Several bugfixes in code generation.
116 1.0.10 (24 July 2002)
117 * Powers of indexed objects are now parenthesized correctly in LaTeX output.
118 * Input parser handles indices (they have to be specified in the same list
120 * Added some limited support for subspaces in the idx and tensor classes.
121 * Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
122 sorted list containing two or more equal objects failed to return 0).
125 * simplify_indexed() now raises/lowers dummy indices to canonicalize the index
126 variance. This allows some simplifications that weren't possible before,
127 like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
128 * Implemented relational::subs().
129 * Fixed bug in simplify_ncmul() for clifford objects.
131 1.0.8 (31 March 2002)
132 * Improvements in memory usage of the expand() methods.
134 1.0.7 (18 March 2002)
135 * Fixed LaTeX output of indexed and matrix objects.
136 * Fixed matrix::pow(n) for n==0 and added helper functions to create unit
137 matrices "ex unit_matrix(unsigned, unsigned)".
140 * "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
142 1.0.5 (27 January 2002)
143 * (l)degree(s), coeff(s, n) and collect(s) were extended to accept expressions
144 of any class (except add/mul/ncmul/numeric) for "s". They should even work
145 if "s" is a "power" object, as long as the exponent is non-integer, but with
146 some limitations. For example, you can "collect(a*2^x+b*2^x, 2^x)" to get
147 "(a+b)*2^x", but "degree(2^(3*x), 2^x)" yields 0 instead of 3).
148 * Fixed a small output bug.
150 1.0.4 (24 January 2002)
151 * Speedup in expand().
152 * Faster Bernoulli numbers (Markus Nullmeier).
153 * Some minor bugfixes and documentation updates.
155 1.0.3 (21 December 2001)
156 * Fixed a bug where quo() would call vector::reserve() with a negative
158 * Fix several bugs in code generation.
160 1.0.2 (19 December 2001)
161 * Input parser recognizes "sqrt()", which is also used in the output.
162 * divide(a,b,q) only modifies q if the division succeeds; also, divide(a,b,a)
164 * Fixed small bug in dummy index renaming which could cause it to not
165 recognize renamable indices in some cases.
166 * power::degree() and power::ldegree() throw an exception when encountering
167 a non-integer exponent.
168 * Add output-support for Python bindings.
170 1.0.1 (22 November 2001)
171 * Function sqrfree() handles a few more cases now.
172 * Class relational has real canonical ordering now.
173 * Handle obscene libreadline version numbers when building ginsh.
175 1.0.0 (6 November 2001)
176 * Some internal reorganization resulting in a general speed-up.
177 * The last 3 evaluated expressions in ginsh are now referred to with the
178 tokens '%', '%%' and '%%%'. The old '"', '""' and '"""' remain for
179 compatibility but may be removed in a future version of GiNaC.
181 0.9.4 (20 September 2001)
182 * Functions have better support for external scripting languages.
183 * Interface cleanups and bugfixes.
184 * Fix silly bug in evalf() that prevented things like 2^Pi being computed.
186 0.9.3 (16 August 2001)
187 * series expansion now much more consistent for small order expansion.
188 * lsolve() accepts algorithmic hint as parameter.
191 * Epsilon tensor is more functional.
192 * simplify_indexed() is better at detecting expressions that vanish for
194 * Several little bugfixes and consistency enhancements.
197 * Ctors of class numeric are not explicit any more. All built-in callers for
198 pseudofunctions are now templated and default to ex arguments which relaxes
199 the need for explicit ctors.
200 * New functions/methods:
202 - remove_first(), remove_last(), sort() and unique() for lists
203 - symmetrize_cyclic()
205 * Instead of just totally symmetric or antisymmetric, complex symmetries
206 can now be defined for indexed objects. Symmetries are described by a
207 tree of "symmetry" objects that is constructed with the sy_none(),
208 sy_symm(), sy_anti() and sy_cycl() functions. The symmetry of a function
209 with respect to its arguments can also be defined (this is currently
210 only used for the Beta function).
211 * Generalized map() to take a function object instead of a function pointer.
212 This allows passing an arbitrary number of additional state to the
213 function being called.
214 * color_trace(), dirac_trace(), diff(), expand(), evalf() and normal() work
215 better with container classes, e.g. using color_trace() on a relation will
216 take the trace on both sides, using diff() on a matrix differentiates every
218 * diff() works properly with non-commutative products and indexed objects.
219 * New option flag "expand_function_args" for expand().
220 * Supplement some (now deprecated) macros by inlined template functions:
221 - is_of_type(foo, type) -> is_a<type>(foo)
222 - is_ex_of_type(foo, type) -> is_a<type>(foo)
223 - is_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
224 - is_ex_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
225 - ex_to_foobar(baz) -> ex_to<foobar>(baz)
226 * rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
228 * Small bugfixes in pattern matching.
229 * Updated libtool to version 1.4.
232 * In the output and in ginsh, lists are now delimited by { } braces, and
233 matrices are delimited by single [ ] brackets.
234 * simplify_indexed() renames dummy indices so, e.g., "a.i*a.i+a.j*a.j" gets
235 simplified to "2*a.i*a.i" (or "2*a.j*a.j").
236 * New functions/methods:
237 - canonicalize_clifford() (helpful when comparing expressions containing
239 - symmetrize() and antisymmetrize()
240 - numer_denom() (return numerator and denominator in one call)
241 - map() (apply function to subexpressions)
242 - evalm() (evaluate sums, products and integer powers of matrices)
243 * Added a new function match() for performing pattern matching. subs() and
244 has() also accept patterns as arguments. A pattern can be any expression,
245 optionally containing wildcard objects. These are constructed with the
246 call "wild(<unsigned>)" and are denoted as "$0", "$1" etc. in the output
248 * Positive integer powers of non-commutative expressions (except matrices)
249 are automatically expanded.
250 * Removed cint subdirectory, ginaccint is a separate package now due to
251 packaging considerations.
252 * Several little bugfixes.
255 * color and clifford classes are functional and documented.
256 * New "spinidx" class for dotted/undotted indices.
257 * Predefined spinor metric tensor (created by spinor_metric()).
258 * Symbols can have a LaTeX name, e.g. symbol s("s", "\\sigma");
259 * LaTeX output of indexed objects is much nicer.
260 * Fixed some build problems (with recent libreadline).
261 * Semantics of arithmetic operators now follows the C++ rules more strictly.
263 0.8.2 (24 April 2001)
264 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() work with
265 non-symbols as the second argument in ginsh.
266 * the argument to collect() can be a list of objects in which case the
267 result is either a recursively collected polynomial, or a polynomial in
268 a distributed form with terms like coeff*x1^e1*...*xn^en, as specified by
269 the second argument to collect().
270 * Several bugfixes (including a nasty memory leak in .normal()).
271 * class matrix: solve() doesn't call algorithms redundantly any more and
272 inverse() falls back to solve() which works in more general cases.
274 0.8.1 (16 April 2001)
275 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() can now
276 be used with constants, functions and indexed expressions as well, so you
277 can use it to collect by powers of Pi or sin(x), or to find the coefficient
280 - it only works with symbols, constants, functions and indexed expressions,
281 trying to find the coefficient of, e.g., "x^2" or "x+y" won't work;
282 - it does not know about dummy index summations; the coefficient of
283 gamma~0 in p.mu*gamma~mu should be p.0 but is returned as 0;
284 - using coeff(), tcoeff(), lcoeff() or collect() on elements of
285 noncommutative products might return wrong or surprising results.
286 * subs() no longer only substitutes symbols and indices but performs a more
287 general "syntactic substitution", i.e. it substitutes whole objects in sub-
288 expressions. You can subs((a+b)^2,a+b==3) and get 9, but subs(a+b+c,a+b==3)
291 - substituting numerics (subs(expr, 2==4)) will not replace then in all
292 occurences; in general, you shouldn't substitute numerics, though.
293 * Added preliminary (re)implementations of color and clifford classes.
294 * simplify_indexed(): contraction of symmetric and antisymmetric tensors
296 * Replaced the various print*() member functions by a single print() that
297 takes a print_context object that determines the output formatting. This
298 should make it easier to add more output types, such as LaTeX output,
299 which is based on work by Stefan Weinzierl.
300 * Added functions to retrieve the properties stored in archive objects
301 outside of unarchive() (for printing or debugging purposes).
302 * Some bugfixes (indexed objects, archive writing).
303 * .collect() on non-polynomials is now algebraically correct.
305 0.8.0 (24 March 2001)
306 * Complete revamp of indexed objects. Instead of multiple classes for
307 indexed things and their indices there is now only one "indexed" class
308 and two types of indices: "idx" for simple indices and "varidx" for
309 indices with variance. There are predefined delta, epsilon and metric
310 tensors, and a function simplify_indexed() that performs canonicalization
311 and dummy index summations. Matrix objects can be indexed for doing simple
313 * Added an option "expand_indexed" to expand() to perform expansion of
314 indexed objects like (a+b).i -> a.i + b.i
315 * Renamed get_indices() to get_free_indices(), which no longer returns
316 dummy indices and checks the consistency of indices in sums.
317 * sqrfree() factorization fixed and improved syntactically.
318 * subs() works on matrices.
319 * Matrices can be constructed from flat list of elements; diagonal matrices
320 can be constructed from list of diagonal elements with diag_matrix().
321 * Fixed memory leak in expand().
322 * Operator% for objects of class ncmul has gone. Use operator* now for that
323 case too, which is much more natural.
325 0.7.3 (28 February 2001)
326 * Several bugfixes and minor performance tunings.
327 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
328 * Closed many in-source documentation gaps.
330 0.7.2 (17 February 2001)
331 * Several bugfixes in power series expansion, one of them critical.
333 0.7.1 (7 February 2001)
334 * Fix problems with Cint that were caused by CLN's overloaded operator new.
335 * Fix compilation errors with GCC3.
336 * normal() handles large sums of fractions better and normalizes the exponent
337 of power expressions.
338 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
339 * Some bugfixes of series expansion around branch cuts of special functions.
341 0.7.0 (15 December 2000)
342 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
343 actual representation any more. This is a speedup.
344 * mul::expand() was reengineered to not allocate excess temporary memory.
345 * Non-integer powers of a symbol are treated as constants by (l)degree() and
346 coeff(). Using these functions on an expression containing such powers used
347 to fail with an internal error message. The side-effect is that collect()
348 can be used on expressions which are not polynomials.
349 * Added a man page for the ginac-config script.
350 * Ctor of numeric from char* honors Digits.
352 0.6.4 (10 August 2000)
353 * Complete revamp of methods in class matrix. Some redundant (and poor)
354 implementations of elimination schemes were thrown out. The code is now
355 highly orthogonal, more flexible and much more efficient.
356 * Some long standing and quite nasty bugs were discovered and fixed in the
357 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
360 * Derivatives are now assembled in a slightly different manner (i.e. they
361 might 'look' different on first sight). Under certain circumstances this
362 can result in a dramatic speedup because it gives hashing a better chance,
363 especially when computing higher derivatives.
364 * Some series expansions of built-in functions have been reengineered.
365 * The algorithm for computing determinants can be chosen by the user. See
366 ginac/flags.h and ginac/matrix.h.
367 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
368 proper series expansion.
369 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
370 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
373 * ginaccint.bin is now launched by a binary program instead of by a scripts.
374 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
376 * Several minor bugfixes.
379 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
380 * Several bugfixes in target install.
383 * IMPORTANT: Several interface changes make programs written with GiNaC
384 much clearer but break compatibility with older versions:
385 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
386 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
387 - gamma() -> tgamma() (The true Gamma function, there is now also
388 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
389 - EulerGamma -> Euler
390 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
391 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
392 library version numbers.
393 * Expressions can be constructed from strings like this:
394 ex e("2*x+y", lst(x, y));
395 * ex::to_rational() provides a way to extend the domain of functions like
396 gcd() and divide() that only work on polynomials or rational functions (the
397 good old ex::subs() method reverses this process)
398 * Calling diff() on a function that has no derivative defined returns the
399 inert derivative function "Derivative".
400 * Several new timings in the check target. Some of them may be rather rude
401 at your machine, feel free to interrupt them.
403 0.5.4 (15 March 2000)
404 * Some algorithms in class matrix (notably determinant) were replaced by
405 less brain-dead ones and should now have much better performance.
406 * Checks were completely reorganized and split up into three parts:
407 a) exams (small regression tests with predefined input)
408 b) checks (lenghty coherence checks with random input)
409 c) timings (for coherence and crude benchmarking)
410 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
411 * Expanded expressions now remember they are expanded to prevent
412 superfluous expansions.
413 * Small bugfixes and improvements in the series expansion.
415 0.5.3 (23 February 2000)
416 * A more flexible scheme for registering functions was implemented,
417 allowing for remembering, too.
420 0.5.2 (16 February 2000)
421 * Mainly fixes a bug in the packaging of release 0.5.1.
423 0.5.1 (14 February 2000)
424 * Fixes a small number of bugs.
426 0.5.0 (7 February 2000)
427 * Expressions can be written ("archived") to files and read therefrom.
428 * Addition of GiNaC-cint, which lets you write complete programs in
429 an interactive shell-like manner in your favoured programming
432 0.4.1 (13 December 1999)
433 * Series Expansion of Gamma function and some other trigonometric
434 functions at their poles works now.
435 * Many more evaluations of special functions at points where
437 * info_flags::rational doesn't return true for complex extensions
438 any more---use info_flags::crational for the old behaviour.
439 info_flags::integer and -::cinteger work similarly, the same
440 holds for types like info_flags::rational_polynomial.
442 0.4.0 (26 November 1999)
443 * First public release.