1 This file records noteworthy changes.
3 1.6.6 (20 December 2015)
4 * Fix elusive bug in add::eval().
5 * Several minor performance enhancements.
8 * Fix pow(+(...),2).expand() where the sum contained roots of expressions.
9 * Speed-up pow(+(...),n).expand() where n > 3.
10 * Fix a crash in PolyLogs of rational numbers.
13 * Fix pow(+(...),2).expand() where the sum contained roots of rationals.
14 * Various improvements for info(info_flags::nonnegative).
15 * Make power::expand() (x*p)^c -> x^c * p^c, if p>0.
16 * Fix normal() where nested functions occur multiple times.
17 * Add optional explicit derivatives to functions and use it in abs(),
18 imag_part(), real_part().
19 * Evaluate abs(z)^(2n) -> z^n * conjugate(z)^n.
21 1.6.3 (27 November 2014)
22 * New expand_options::expand_transcendental. GiNaC will apply additional
23 rules when expanding expressions if this option is specified, i.e.
24 log(a*b) -> log(a) + log(b)
25 exp(a + b) -> exp(a)*exp(b)
26 * Functions can define a custom expand() and info() now.
27 * Automatically rewrite (x^{-1})^c -> x^{-c} for positive c.
28 * Transform abs(x)^n -> x^n if x is real and n is even.
29 * Improved power::info(): power with a real base and even exponent
30 reports that it's non-negative.
31 * Fixed spurious match failure due to expairseq::match() bug:
32 > match(sin(y)*exp(b)+sin(x)*exp(a), sin($0)*exp(a)+exp(b)*sin($1))
34 * Fixed power::is_polynomial() and mul::is_polynomial() computation.
35 * factor_univariate correctly handles polynomials over rationals (no
37 * Fixed an infinite loop in factor_multivariate due to incorrect handling
38 of polynomials having a leading coefficient being a sum with a non-trivial
40 * Fixed numeric evaluation of generalized multiple polylogarithms for real
41 and negative argument.
42 * Avoid calling log(1-x) in numeric evaluation of classical polylogarithm.
43 * Fixed numeric evaluation of multiple polylogarithms (correctly set
44 the signs of the imaginary parts in the intermediate expression).
45 * Fixed numeric evaluation of Nielsen polylogs for arguments close to
46 the 6th root of unity or its conjugate.
47 * Avoid infinite recursion in series expansion of logarithm.
48 * numeric::info(info_flags::nonnegative) correctly handles complex numbers
49 with non-zero imaginary part.
50 * Fixed several build issues:
51 - libreadline and dlopen() misdetection.
52 - multiple definition of symbol on MinGW.
53 - auto* tools and texinfo being unhappy in various ways.
54 * GiNaC can be built with CMake now.
56 1.6.2 (6 November 2011)
57 * Fixed the parser to read GiNaC::lst again.
58 * Fixed a compile warning (relevant to openSUSE build).
59 * Fixed a bug concerning the subsitutions in indexed expressions
60 (subs_options::no_index_renaming was ignored).
63 * Fixed several internal assertions for the debug version of GiNaC.
64 * More verbose report of (auto-)configuration problems.
65 * Fixed a compile problem with ginsh using gcc 4.6.
68 * Fixed compilation issues with clang.
69 * Fixed compilation issues with VC++.
70 * Fixed a segfault in fsolve() and improved its numerical algorithm.
71 * Fixed several memory leaks in power::eval().
72 * Fixed the substitution algorithm that led to wrong results (exp(log(x))->x).
73 * Fixed a bug in add:eval() (real_part() had returned wrong results).
74 * Fixed infinite loop bug when unarchiving realsymbol and possymbol.
75 * Fixed bugs in the GCD code.
76 * Fixed empty string bug in symbol::get_name().
77 * Fixed bugs concerning STL vector sizes that can potentially cause segfaults.
78 * Fixed a bug in is_polynomial().
79 * Removed autogen dependencies.
80 * Improved simplify_indexed() algorithm.
81 * Changed the connection between library version and package version.
82 * power::series() can handle now more expressions with singularities in the exponent.
83 * Added conjugate() methods to functions cosh, sinh, tanh.
86 * Changed default behaviour of conjugate() for user-defined functions to avoid
87 wrong evaluations. A user-defined conjugate_func must now be explicitly
89 * Fixed: Parser now handles abbreviations as advertized in the manual.
90 * Fixed two bugs in the GCD code (one infinite loop, one miscalculation).
91 * Fixed dangerous iterator use.
92 * Fixed a memory leak in excompiler.
93 * Fixed several syntax issues wrt to gcc 4.5 and wrt to compile option -std=cxx0x.
94 * Fixed a wrong URL and a texinfo problem in the manual.
95 * Added degree_vector() utility function.
98 * Fixed a bug in the GCD code (infinite loop in pgcd()).
99 * Fixed a bug in atan2() (division by zero error for atan2(x,0) if x is a
100 negative and composite term).
101 * Products now correctly set info_flags::negative and info_flags::negint.
103 1.5.6 (28 January 2010)
104 * Fixed compile problem with gcc 3.4.
105 * Improved excompiler: The ginac-excompiler script will only be installed if
106 excompiler is supported and enabled.
108 1.5.5 (04 November 2009)
109 * Correct libtool versioning.
111 1.5.4 (02 November 2009)
112 * Default parser now can again read in user defined classes.
113 * Add mul::info() and add::info() support for numeric info_flags (GiNaC now can
114 detect that the sum or product of a number of positive expressions is again a
115 positive expression).
116 * Fixed cast that caused compile error on 64bit machines.
117 * Fixed incorrect uses of STL iterators.
118 * Removed subdirectory debian.
119 * Output LaTeX-symbols using \mathrm, instead of \mbox.
122 * The parser now understands user-defined functions by default. The identifier
123 names can now contain underscores.
126 * Fixed documentation of return_type_info()
127 * Fixed cstdio include issue.
128 * GiNaC now requires at least version 1.2.2 of cln.
130 1.5.1 (25 February 2009)
131 * Fixed compiling problems with GNU g++ 3.4.
132 * Work around weird C++ RTTI behaviour on woe32 so GiNaC works on MinGW again.
134 1.5.0 (17 February 2009)
135 * Added polynomial factorization.
136 * New, faster (recursive descent) expression parser.
137 * Faster GCD computation.
138 * gcd() now allows the user to override (some of the) heuristics.
139 * Writing extensions classes is simpler now:
140 - Replaced custom RTTI by standard C++ RTTI.
141 - Definition of archiving methods now optional when declaring a new GiNaC class.
142 * Fixed recursion in polynomial divide that caused a significant slowdown in
144 * Improved lsolve() of systems containing non-numeric coefficients.
145 * Removed implicit conversions from cl_N to numeric.
146 * Improved configuration and compatibility.
149 * Fixed a bug in the multiple polylogarithms Li/G that caused imaginary parts
150 of the arguments to be ignored.
151 * Fixed archiving of complex numbers.
152 * Made the behaviour of class function more consistent with respect to
154 * Fixed bug in power::is_polynomial.
155 * Improved heur_gcd() so it can handle rational polynomials.
156 * Improved build scripts.
158 1.4.3 (04 April 2008)
159 * Fixed bug in numerical evaluation of multiple polylogarithms and
160 alternating multiple zeta values introduced in version 1.4.2.
161 * Nielsen polylog now invalidates its lookup tables in case the precision
162 (Digits) has been changed.
163 * Added new checks for recent bugs in the numerical evaluation of Li and zeta.
165 1.4.2 (03 April 2008)
166 * Fixed VPATH building of documentation.
167 * Fixed bug in numerical evaluation of multiple polylogarithms for arguments
168 equal to certain roots of unity (thanks to Jianqiang Zhao).
169 * Fixed check for memory leakage in parser.
170 * Made internal function coerce() standard compliant.
171 * Improved lsolve() of systems containing non-numeric coefficients.
172 * Improved automatic test programs. Now they work on MinGW and Cygwin as well.
174 1.4.1 (21 November 2007)
175 * Fixed memory leak in ginac_yylex().
176 * Fixed memory leaks in mul::eval() and power::eval().
177 * Fixed macro checking for version of libreadline (Mac OS X).
178 * Fixed broken preprocessor instruction in excompiler.cpp.
179 * Fixed broken module loading in excompiler.cpp.
180 * info(info_flags::has_indices) now works for sums and products.
181 * Improved mul::expand().
182 * Improved CLN output.
184 1.4.0 (31 August 2007)
185 * New tinfo mechanism.
186 * Removed rtt from class symbol.
187 * Faster archiving by adding a map from strings to indices in the atoms vector.
188 * Improved unarchiving: algorithms order N instead of order N^2.
189 * Added compile function, excompiler class.
191 * Added step function to GiNaCs built-in functions.
192 * Added is_polynomial() method.
193 * Added real_part() and imag_part() methods.
194 * Added matrix::is_zero_matrix() method.
195 * Added evalm() method to pseries class.
196 * Improved dummy index renaming.
197 * Many improvements for class clifford.
198 * New flag for positive symbols/numbers, added possymbol class.
199 * Added programming examples in doc/examples
201 1.3.8 (28 August 2007)
202 * Drop support of ginac-config and ginac.m4. Please use pkg-config instead.
203 * atan2(y,x) branch cut correction.
204 * Fixed bug in series expansion.
205 * Additional transformations for mul and power.
206 * Clifford units now honor representation labels.
207 * Correct csrc output for idx and fderivative.
208 * Improved handling of convergence transformationis for Li/G.
209 * Fix compilation issues with prereleases of GCC 4.3.
210 * info_flags::expanded added.
211 * input_parser also accepts pow().
212 * texinfo.tex removed from package.
214 1.3.7 (05 February 2007)
215 * Fixed bug in expansion of power.
216 * Fixed bugs in functions S() (infinite loop), H() and zeta() (wrong results).
217 * Rebuilt bison related files with bison version 2.3 (fixes parse error bugs).
218 * Improved power::eval().
219 * Improved libreadline detection.
221 1.3.6 (13 December 2006)
222 * Better worst case behavior in heuristic gcd.
223 * Improved collecting for sparse multivariate polynomials.
224 * Improved collect_common_factors.
225 * Fixed bug in numerical evaluation of multiple polylogs.
226 * Fixed numerical integration of complex functions.
227 * Fixed bug in tensor::replace_contr_index().
229 1.3.5 (17 August 2006)
230 * Re-built bison related files that caused bugs with gcc 4.
231 * Fixed bugs in fderivative::match_same_type(), expairseq::match(),
232 expand_dummy_sum(), and expairseq::map().
233 * Fixed template specialization for class container to be gcc 4.2 compliant.
234 * Output in csrc mode is now -x instead of -1.0*x.
235 * Fixed tutorial and reference generation in html/pdf/ps format.
236 * Modified autotool configuration to allow for compilation on MinGW.
237 * Debian packaging files updated.
239 1.3.4 (12 April 2006)
240 * More general index dimensions are now possible.
241 * Improved algebraic substitutions.
242 * Fixed wrong matching in .has().
243 * Fixed bug in differentiation of a power.
244 * collect_common_factors also works with negative powers of common factors now.
245 * Code clean-up and preparations for upcoming cln 1.2.
247 1.3.3 (24 October 2005)
248 * Fixed bug occuring in algebraic substitutions with expressions involving
250 * Fixed bug that selected the wrong algorithm for determinants of purely
251 numeric matrices with at least one floating point element.
252 * Fixed bug in function H that caused an infinite recursion for arguments
254 * Fixed const-correctness in printing handler for GCC 4.0.2.
255 * Made lookup in adaptivesimpson precision-aware.
256 * Added series expansion for functions (classical) Li and S around x==0.
257 * Added fsolve() numerical univariate real-valued function solver.
258 * Added functions sub_matrix() and reduced_matrix().
259 * Small cleanups. Less warnings with latest GCC.
262 * GCD avoids to produce expanded expressions.
263 * Fixed bug in expanding expressions containing dummy indices.
264 * Fixed static initialization order bug.
265 * collect_common_factors now works with powers.
266 * Modernized configuration scripts.
269 * integral() and eval_integ() can be used from ginsh.
270 * Integrals can be series-expanded.
271 * Fixed a library initialization problem.
272 * GiNaC compiles from tarball even if lex/flex is missing.
273 * Fixed bugs in canonicalize_clifford(), clifford_prime() and clifford_to_lst().
274 * clifford_moebius_map(), remove_dirac_ONE() and LaTeX output of Clifford
275 objects now care about representation labels.
277 * Better output for slashed expressions
279 1.3.0 (19 October 2004)
280 * The Clifford classes have been generalized to allow working with Clifford
281 algebras generated by arbitrary symmetric tensors or matrices. Also, a lot
282 of new functions for Clifford algebras have been added, including
283 automorphisms and Moebius transformations. [V. Kisil]
284 * Added some basic symbolic and numeric integration facilities. [C. Dams]
285 * The multiple polylogarithm Li() now evaluates numerically for arbitrary
287 * New functions G(a,y) and G(a,s,y) added (another notation for multiple
290 1.2.4 (12 October 2004)
291 * Added ex::unitcontprim() to compute the unit, content, and primitive parts
292 of a polynomial in one go.
293 * binomial(n, k) evaluates for non-integer arguments n.
294 * Li(2,x) now evaluates for +-I.
296 * Fixed bug in Li(n,x) (if Li(2,x) was calculated with high precision the
297 enlargement of the look-up table caused a segmentation fault).
298 * Fixed another bug in the series expansion of powers, and a bug in
301 1.2.3 (13 August 2004)
302 * Added variants of dirac_trace() and color_trace() that take the trace over
303 more than one representation label by specifying a set or list of labels.
304 * diracgamma::contract_with() uses Chisholm identities in 4 dimensions to
305 produce more compact results.
306 * Fixed a bug in the series expansion of powers.
307 * The --enable-html-doc and --enable-ps-doc configure options are gone.
308 Documentation in HTML, DVI, PostScript, and PDF formats is now built with
309 "make html", "make dvi", "make ps", and "make pdf", respectively. The only
310 documentation that gets built by default are the tutorial in .info format
313 1.2.2 (3 August 2004)
314 * Added const_preorder_iterator and const_postorder_iterator classes (and
315 associated methods ex::pre/postorder_begin/end()) providing tree traversal
317 * Fixed the LaTeX output of the varidx class.
318 * Fixed bugs in series expansion and complex conjugation.
319 * (p.i*p.i).get_free_indices() returns the correct result () instead of (.i).
320 * Symbolic functions without any eval(), evalf() etc. functions now work
322 * integer_content(), content(), and primpart() now also work for polynomials
323 with rational coefficients (calculating the LCM of coefficients'
325 * Added method matrix::rank().
326 * Added function resultant().
327 * Added integer_content() function to ginsh.
329 1.2.1 (23 April 2004)
330 * Fixed infinite recursion in atan2_evalf() and improved atan2_eval().
331 * Added automatic evaluations for trigonometric functions with negative
332 arguments (e.g. sin(-2) -> -sin(2)).
333 * Fixed a static initialization order goof-up.
334 * Fixed various bugs in series expansion.
336 1.2.0 (19 March 2004)
337 * Added a structure<T> template class for the easy creation of user-defined
339 * Added support for (acyclic) visitors, to allow cleaner implementations of
340 algebraic algorithms.
341 * Added a const_iterator class that can be used instead of op()/nops().
342 * Completely revamped the implementation of expression output. It is now
343 possible to add new output formats, to change the behavior of predefined
344 formats at run-time, and to have different output styles for algebraic
346 * Symbols can be made non-commutative.
347 * Added a method ex::conjugate() and a function conjugate() for complex
348 conjugation. Symbols can be declared as real or complex-valued.
349 * Improved the speed of subs(), normal(), to_rational() and to_polynomial()
350 by the use of maps instead of lists. The old forms
351 subs(const lst & ls, const lst & lr, unsigned options)
352 to_rational/to_polynomial(lst & repl)
353 are still available for compatibility, but using the new forms
354 subs(const exmap & m, unsigned options)
355 to_rational/to_polynomial(exmap & repl)
356 is more efficient, especially when the number of replacements is large.
357 * quo(), rem(), prem(), sprem(), decomp_rational(), unit(), content(),
358 primpart() and matrix::charpoly() now take a "const ex &" instead of a
360 * Redundant expressions (two ex pointing to different objects are found to be
361 equal in compare()) are now actively deleted/fused to conserve memory and
362 speed up subsequent comparisons. This behavior can be suppressed on a
363 per-object level with status_flags::not_shareable. Lists and matrices are
364 not shareable by default.
365 * Lots of internal streamlining and optimizations.
366 * Caveats for class implementors:
367 - basic::copy() and basic::destroy() are gone; classes derived from
368 basic can use the defaults for the assignment operator and copy
370 - basic::subs(), basic::normal(), basic::to_rational() and
371 basic::to_polynomial() take 'exmap' objects instead of lists.
372 - basic::subs() now descends into subexpressions (if accessible via
373 nops()/op()/let_op()). If you have a custom implementation of subs()
374 that calls basic::subs() after substituting subexpressions, this needs
375 to be changed to a call to subs_one_level().
376 - lst::thislst() and exprseq::thisexprseq() renamed to thiscontainer().
377 - thiscontainer() and associated constructors now take a std::auto_ptr.
378 - Overloading basic::print() is now deprecated. You should use
379 print_func<>() class options instead.
381 1.1.7 (11 March 2004)
382 * Fixed a bug in canonicalize_clifford().
383 * Series expansion now works predictably. All terms with the exponent of the
384 expansion variable smaller than the given order are calculated exactly. If
385 the series is not terminating, the Order function is (at least) of the given
388 1.1.6 (22 January 2004)
389 * Added a function option "dummy()" which means "no options". This simplifies
390 the implementation of symbolic functions which are not to be further
392 * Removed a bug in the numerical evaluation of Li() that caused the system
393 to hang for certain parameter combinations.
394 * Fixed a bug in the calculation of hash values for indices that could lead
395 to wrong results or bogus error messages from simplify_indexed().
396 * Fixed a bug in the evaluation of harmonic polylogarithms for complex
397 arguments with positive imaginary part.
399 1.1.5 (5 November 2003)
400 * Harmonic polylogarithms now numerically evaluate for arbitrary arguments
401 (parameter must still be positive integers).
402 * The zeta function now can also be given a lst as a parameter in which case
403 it becomes a multiple zeta value. The use of mZeta is deprecated.
404 * The order of parameters for the multiple polylogarithm has been corrected.
405 * Documentation for the nested sums functions zeta, harmonic polylog, multiple
406 polylog, etc. has been added.
408 1.1.4 (17 October 2003)
409 * Lists and matrices can now be initialized from comma-separated lists of
410 expressions, like this:
420 This is both faster and produces much smaller code than the old constructors
421 lst(ex, ex, ...) and matrix(unsigned, unsigned, lst), especially in the case
422 of matrices, and is now the recommended way to create these objects.
423 * The function mZeta now evaluates much faster for arbitrary parameters. The
424 harmonic and multiple polylogarithms evaluate considerably faster and check
425 for convergence. The order of parameters for the harmonic polylogarithm
428 1.1.3 (22 August 2003)
429 * Added new symbolic functions for better integration with nestedsums:
430 (multiple) polylogarithm Li(), Nielsen's generalized polylogarithm S(),
431 harmonic polylogarithm H(), and multiple zeta value mZeta().
432 * New exhashmap<T> template intended as a drop-in replacement for
433 std::map<ex, T, ex_is_less> using GiNaC's hashing algorithms.
435 1.1.2 (11 August 2003)
436 * Fixed a bug in the unarchiving of sums and products: terms were not
437 reordered in a canonical way.
438 * Fixed a bug in normal()/numer_denom(): denominator was not made unit
439 normal if it was a simple number.
440 * Improved the speed of subs() in some cases.
443 * lst (and exprseq) provide iterators for read-only element access. For
444 sequential access this is one order faster than using op().
445 * Implemented relational::subs() (this was done in 1.0.9 but inadvertently
446 omitted from the 1.1 branch).
447 * pole_error and do_taylor are available to library users.
448 * Added on-line help and Tab-completion for print(), iprint(), print_latex()
449 and print_csrc() in ginsh.
452 * Removed deprecated macros is_ex_a, is_ex_exactly_a and friends for good.
453 * The scalar_products mechanism allows the specification of an index dimension.
454 * Removed dirac_gamma6/7().
455 * Added ex::to_polynomial().
456 * subs() accepts an optional "options" argument. The option
457 subs_option::subs_algebraic enables "smart" substitutions in products and
459 * Added stream manipulators "dflt", "latex", "python", "python_repr", "tree",
460 "csrc", "csrc_float", "csrc_double", "csrc_cl_N", "index_dimensions" and
461 "no_index_dimensions" to control the output format. Calling basic::print()
462 directly is now deprecated.
463 * Made the hashing more simple and efficient.
464 * Caveats for class implementors:
465 - basic::subs(): third argument changed from "bool" to "unsigned"
466 - unarchiving constructor and basic::unarchive(): "const" removed from
468 - basic::let_op() should only be implemented if write access to
469 subexpressions is desired
470 - simplify_ncmul() renamed to eval_ncmul()
471 - simplified_ncmul() renamed to hold_ncmul()
472 - nonsimplified_ncmul() renamed to reeval_ncmul()
474 1.0.14 (1 March 2003)
475 * Improved the C-source output: complex numbers are printed correctly (using
476 the STL complex<> template or cln::complex()), rational numbers use cl_RA()
477 in the CLN output, and small integers are printed in a more compact format
478 (e.g. "2.0" instead of "2.0000000e+00").
479 * function_options::set_return_type() and function_options::do_not_evalf_params()
482 1.0.13 (27 January 2003)
483 * Contracting epsilon tensors with Euclidean indices now works.
484 * Improved dummy index symmetrization in sums.
485 * Added dirac_gammaL/R(), which can be used instead of dirac_gamma6/7()
486 but are single objects, to allow for a more compact notation of Dirac
488 * Powers with negative numeric exponents are printed as fractions in the
490 * Added symbolic_matrix() for the convenient creation of matrices filled
492 * Added collect_common_factors() which collects common factors from the
494 * simplify_indexed() converts "gamma~mu*p.mu" to "p\".
496 1.0.12 (30 October 2002)
497 * Fixed a bug in power::expand() that could produce invalid expressions.
498 * The input parser no longer ignores extra data following accepted input.
499 * Improved the CLN C-source output (integers are printed as integers, and
500 floating point numbers include the precision).
501 * Fixed a problem in the LaTeX-output of negative fractions.
502 * Added print_latex() and print_csrc() to ginsh.
503 * The sprem() function is now public.
505 1.0.11 (18 September 2002)
506 * Fixed a possible memory corruption in contractions of indexed objects with
507 delta or metric tensors.
508 * Computing the derivative of a power series object with respect to a symbol
509 that is not the expansion variable now works correctly.
510 * Several bugfixes in code generation.
512 1.0.10 (24 July 2002)
513 * Powers of indexed objects are now parenthesized correctly in LaTeX output.
514 * Input parser handles indices (they have to be specified in the same list
516 * Added some limited support for subspaces in the idx and tensor classes.
517 * Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
518 sorted list containing two or more equal objects failed to return 0).
521 * simplify_indexed() now raises/lowers dummy indices to canonicalize the index
522 variance. This allows some simplifications that weren't possible before,
523 like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
524 * Implemented relational::subs().
525 * Fixed bug in simplify_ncmul() for clifford objects.
527 1.0.8 (31 March 2002)
528 * Improvements in memory usage of the expand() methods.
530 1.0.7 (18 March 2002)
531 * Fixed LaTeX output of indexed and matrix objects.
532 * Fixed matrix::pow(n) for n==0 and added helper functions to create unit
533 matrices "ex unit_matrix(unsigned, unsigned)".
536 * "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
538 1.0.5 (27 January 2002)
539 * (l)degree(s), coeff(s, n) and collect(s) were extended to accept expressions
540 of any class (except add/mul/ncmul/numeric) for "s". They should even work
541 if "s" is a "power" object, as long as the exponent is non-integer, but with
542 some limitations. For example, you can "collect(a*2^x+b*2^x, 2^x)" to get
543 "(a+b)*2^x", but "degree(2^(3*x), 2^x)" yields 0 instead of 3).
544 * Fixed a small output bug.
546 1.0.4 (24 January 2002)
547 * Speedup in expand().
548 * Faster Bernoulli numbers (Markus Nullmeier).
549 * Some minor bugfixes and documentation updates.
551 1.0.3 (21 December 2001)
552 * Fixed a bug where quo() would call vector::reserve() with a negative
554 * Fix several bugs in code generation.
556 1.0.2 (19 December 2001)
557 * Input parser recognizes "sqrt()", which is also used in the output.
558 * divide(a,b,q) only modifies q if the division succeeds; also, divide(a,b,a)
560 * Fixed small bug in dummy index renaming which could cause it to not
561 recognize renamable indices in some cases.
562 * power::degree() and power::ldegree() throw an exception when encountering
563 a non-integer exponent.
564 * Add output-support for Python bindings.
566 1.0.1 (22 November 2001)
567 * Function sqrfree() handles a few more cases now.
568 * Class relational has real canonical ordering now.
569 * Handle obscene libreadline version numbers when building ginsh.
571 1.0.0 (6 November 2001)
572 * Some internal reorganization resulting in a general speed-up.
573 * The last 3 evaluated expressions in ginsh are now referred to with the
574 tokens '%', '%%' and '%%%'. The old '"', '""' and '"""' remain for
575 compatibility but may be removed in a future version of GiNaC.
577 0.9.4 (20 September 2001)
578 * Functions have better support for external scripting languages.
579 * Interface cleanups and bugfixes.
580 * Fix silly bug in evalf() that prevented things like 2^Pi being computed.
582 0.9.3 (16 August 2001)
583 * series expansion now much more consistent for small order expansion.
584 * lsolve() accepts algorithmic hint as parameter.
587 * Epsilon tensor is more functional.
588 * simplify_indexed() is better at detecting expressions that vanish for
590 * Several little bugfixes and consistency enhancements.
593 * Ctors of class numeric are not explicit any more. All built-in callers for
594 pseudofunctions are now templated and default to ex arguments which relaxes
595 the need for explicit ctors.
596 * New functions/methods:
598 - remove_first(), remove_last(), sort() and unique() for lists
599 - symmetrize_cyclic()
601 * Instead of just totally symmetric or antisymmetric, complex symmetries
602 can now be defined for indexed objects. Symmetries are described by a
603 tree of "symmetry" objects that is constructed with the sy_none(),
604 sy_symm(), sy_anti() and sy_cycl() functions. The symmetry of a function
605 with respect to its arguments can also be defined (this is currently
606 only used for the Beta function).
607 * Generalized map() to take a function object instead of a function pointer.
608 This allows passing an arbitrary number of additional state to the
609 function being called.
610 * color_trace(), dirac_trace(), diff(), expand(), evalf() and normal() work
611 better with container classes, e.g. using color_trace() on a relation will
612 take the trace on both sides, using diff() on a matrix differentiates every
614 * diff() works properly with non-commutative products and indexed objects.
615 * New option flag "expand_function_args" for expand().
616 * Supplement some (now deprecated) macros by inlined template functions:
617 - is_of_type(foo, type) -> is_a<type>(foo)
618 - is_ex_of_type(foo, type) -> is_a<type>(foo)
619 - is_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
620 - is_ex_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
621 - ex_to_foobar(baz) -> ex_to<foobar>(baz)
622 * rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
624 * Small bugfixes in pattern matching.
625 * Updated libtool to version 1.4.
628 * In the output and in ginsh, lists are now delimited by { } braces, and
629 matrices are delimited by single [ ] brackets.
630 * simplify_indexed() renames dummy indices so, e.g., "a.i*a.i+a.j*a.j" gets
631 simplified to "2*a.i*a.i" (or "2*a.j*a.j").
632 * New functions/methods:
633 - canonicalize_clifford() (helpful when comparing expressions containing
635 - symmetrize() and antisymmetrize()
636 - numer_denom() (return numerator and denominator in one call)
637 - map() (apply function to subexpressions)
638 - evalm() (evaluate sums, products and integer powers of matrices)
639 * Added a new function match() for performing pattern matching. subs() and
640 has() also accept patterns as arguments. A pattern can be any expression,
641 optionally containing wildcard objects. These are constructed with the
642 call "wild(<unsigned>)" and are denoted as "$0", "$1" etc. in the output
644 * Positive integer powers of non-commutative expressions (except matrices)
645 are automatically expanded.
646 * Removed cint subdirectory, ginaccint is a separate package now due to
647 packaging considerations.
648 * Several little bugfixes.
651 * color and clifford classes are functional and documented.
652 * New "spinidx" class for dotted/undotted indices.
653 * Predefined spinor metric tensor (created by spinor_metric()).
654 * Symbols can have a LaTeX name, e.g. symbol s("s", "\\sigma");
655 * LaTeX output of indexed objects is much nicer.
656 * Fixed some build problems (with recent libreadline).
657 * Semantics of arithmetic operators now follows the C++ rules more strictly.
659 0.8.2 (24 April 2001)
660 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() work with
661 non-symbols as the second argument in ginsh.
662 * the argument to collect() can be a list of objects in which case the
663 result is either a recursively collected polynomial, or a polynomial in
664 a distributed form with terms like coeff*x1^e1*...*xn^en, as specified by
665 the second argument to collect().
666 * Several bugfixes (including a nasty memory leak in .normal()).
667 * class matrix: solve() doesn't call algorithms redundantly any more and
668 inverse() falls back to solve() which works in more general cases.
670 0.8.1 (16 April 2001)
671 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() can now
672 be used with constants, functions and indexed expressions as well, so you
673 can use it to collect by powers of Pi or sin(x), or to find the coefficient
676 - it only works with symbols, constants, functions and indexed expressions,
677 trying to find the coefficient of, e.g., "x^2" or "x+y" won't work;
678 - it does not know about dummy index summations; the coefficient of
679 gamma~0 in p.mu*gamma~mu should be p.0 but is returned as 0;
680 - using coeff(), tcoeff(), lcoeff() or collect() on elements of
681 noncommutative products might return wrong or surprising results.
682 * subs() no longer only substitutes symbols and indices but performs a more
683 general "syntactic substitution", i.e. it substitutes whole objects in sub-
684 expressions. You can subs((a+b)^2,a+b==3) and get 9, but subs(a+b+c,a+b==3)
687 - substituting numerics (subs(expr, 2==4)) will not replace then in all
688 occurences; in general, you shouldn't substitute numerics, though.
689 * Added preliminary (re)implementations of color and clifford classes.
690 * simplify_indexed(): contraction of symmetric and antisymmetric tensors
692 * Replaced the various print*() member functions by a single print() that
693 takes a print_context object that determines the output formatting. This
694 should make it easier to add more output types, such as LaTeX output,
695 which is based on work by Stefan Weinzierl.
696 * Added functions to retrieve the properties stored in archive objects
697 outside of unarchive() (for printing or debugging purposes).
698 * Some bugfixes (indexed objects, archive writing).
699 * .collect() on non-polynomials is now algebraically correct.
701 0.8.0 (24 March 2001)
702 * Complete revamp of indexed objects. Instead of multiple classes for
703 indexed things and their indices there is now only one "indexed" class
704 and two types of indices: "idx" for simple indices and "varidx" for
705 indices with variance. There are predefined delta, epsilon and metric
706 tensors, and a function simplify_indexed() that performs canonicalization
707 and dummy index summations. Matrix objects can be indexed for doing simple
709 * Added an option "expand_indexed" to expand() to perform expansion of
710 indexed objects like (a+b).i -> a.i + b.i
711 * Renamed get_indices() to get_free_indices(), which no longer returns
712 dummy indices and checks the consistency of indices in sums.
713 * sqrfree() factorization fixed and improved syntactically.
714 * subs() works on matrices.
715 * Matrices can be constructed from flat list of elements; diagonal matrices
716 can be constructed from list of diagonal elements with diag_matrix().
717 * Fixed memory leak in expand().
718 * Operator% for objects of class ncmul has gone. Use operator* now for that
719 case too, which is much more natural.
721 0.7.3 (28 February 2001)
722 * Several bugfixes and minor performance tunings.
723 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
724 * Closed many in-source documentation gaps.
726 0.7.2 (17 February 2001)
727 * Several bugfixes in power series expansion, one of them critical.
729 0.7.1 (7 February 2001)
730 * Fix problems with Cint that were caused by CLN's overloaded operator new.
731 * Fix compilation errors with GCC3.
732 * normal() handles large sums of fractions better and normalizes the exponent
733 of power expressions.
734 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
735 * Some bugfixes of series expansion around branch cuts of special functions.
737 0.7.0 (15 December 2000)
738 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
739 actual representation any more. This is a speedup.
740 * mul::expand() was reengineered to not allocate excess temporary memory.
741 * Non-integer powers of a symbol are treated as constants by (l)degree() and
742 coeff(). Using these functions on an expression containing such powers used
743 to fail with an internal error message. The side-effect is that collect()
744 can be used on expressions which are not polynomials.
745 * Added a man page for the ginac-config script.
746 * Ctor of numeric from char* honors Digits.
748 0.6.4 (10 August 2000)
749 * Complete revamp of methods in class matrix. Some redundant (and poor)
750 implementations of elimination schemes were thrown out. The code is now
751 highly orthogonal, more flexible and much more efficient.
752 * Some long standing and quite nasty bugs were discovered and fixed in the
753 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
756 * Derivatives are now assembled in a slightly different manner (i.e. they
757 might 'look' different on first sight). Under certain circumstances this
758 can result in a dramatic speedup because it gives hashing a better chance,
759 especially when computing higher derivatives.
760 * Some series expansions of built-in functions have been reengineered.
761 * The algorithm for computing determinants can be chosen by the user. See
762 ginac/flags.h and ginac/matrix.h.
763 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
764 proper series expansion.
765 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
766 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
769 * ginaccint.bin is now launched by a binary program instead of by a scripts.
770 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
772 * Several minor bugfixes.
775 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
776 * Several bugfixes in target install.
779 * IMPORTANT: Several interface changes make programs written with GiNaC
780 much clearer but break compatibility with older versions:
781 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
782 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
783 - gamma() -> tgamma() (The true Gamma function, there is now also
784 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
785 - EulerGamma -> Euler
786 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
787 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
788 library version numbers.
789 * Expressions can be constructed from strings like this:
790 ex e("2*x+y", lst(x, y));
791 * ex::to_rational() provides a way to extend the domain of functions like
792 gcd() and divide() that only work on polynomials or rational functions (the
793 good old ex::subs() method reverses this process)
794 * Calling diff() on a function that has no derivative defined returns the
795 inert derivative function "Derivative".
796 * Several new timings in the check target. Some of them may be rather rude
797 at your machine, feel free to interrupt them.
799 0.5.4 (15 March 2000)
800 * Some algorithms in class matrix (notably determinant) were replaced by
801 less brain-dead ones and should now have much better performance.
802 * Checks were completely reorganized and split up into three parts:
803 a) exams (small regression tests with predefined input)
804 b) checks (lenghty coherence checks with random input)
805 c) timings (for coherence and crude benchmarking)
806 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
807 * Expanded expressions now remember they are expanded to prevent
808 superfluous expansions.
809 * Small bugfixes and improvements in the series expansion.
811 0.5.3 (23 February 2000)
812 * A more flexible scheme for registering functions was implemented,
813 allowing for remembering, too.
816 0.5.2 (16 February 2000)
817 * Mainly fixes a bug in the packaging of release 0.5.1.
819 0.5.1 (14 February 2000)
820 * Fixes a small number of bugs.
822 0.5.0 (7 February 2000)
823 * Expressions can be written ("archived") to files and read therefrom.
824 * Addition of GiNaC-cint, which lets you write complete programs in
825 an interactive shell-like manner in your favoured programming
828 0.4.1 (13 December 1999)
829 * Series Expansion of Gamma function and some other trigonometric
830 functions at their poles works now.
831 * Many more evaluations of special functions at points where
833 * info_flags::rational doesn't return true for complex extensions
834 any more---use info_flags::crational for the old behaviour.
835 info_flags::integer and -::cinteger work similarly, the same
836 holds for types like info_flags::rational_polynomial.
838 0.4.0 (26 November 1999)
839 * First public release.