- GiNaC-list - ginac.de

Can't compile
by Ricardo Cervera 19 Feb '03

19 Feb '03

Hello. I would be very pleased if you could help me since I can't compile GiNaC. It keeps asking for CLN when doing ./configure, although think it is well installed: *** The test program compiled, but did not run... Could you please give me any advice? Thanks a lot.

2 1

xloops
by Iain 07 Feb '03

07 Feb '03

Hi, What is happening with the port of xloops to GiNaC? Who, if anyone is working on it? -I __________________________________________________ Do you Yahoo!? Yahoo! Mail Plus - Powerful. Affordable. Sign up now. http://mailplus.yahoo.com

2 1

GiNaC 1.0.13 now available
by Christian Bauer 27 Jan '03

27 Jan '03

Hello! The GiNaC Development Group (which is effectively reduced to one member now) wishes everybody a Happy New Year (belatedly) and a Happy <insert-your- favorite-religiously-motivated-around-new-year-celebration-here>, and is proud to present GiNaC 1.0.13, the latest in C++-based made-for-physicists- but-useful-for-other-people-too computer algebra library technology. Now with these exciting new features: * Contracting epsilon tensors with Euclidean indices now works. * Improved dummy index symmetrization in sums. * Added dirac_gammaL/R(), which can be used instead of dirac_gamma6/7() but are single objects, to allow for a more compact notation of Dirac strings. * Powers with negative numeric exponents are printed as fractions in the LaTeX output. * Added symbolic_matrix() for the convenient creation of matrices filled with symbols. * Added collect_common_factors() which collects common factors from the terms of sums. * simplify_indexed() converts "gamma~mu*p.mu" to "p\". As usual, it's available from our FTP server: ftp://ftpthep.physik.uni-mainz.de/pub/GiNaC Happy computing, Christian -- / Coding on PowerPC and proud of it \/ http://www.uni-mainz.de/~bauec002/

1 0

Problem with symbol's default constructor?
by Roberto Bagnara 21 Jan '03

21 Jan '03

Hi all, there seems to be a problem with the default constructor of GiNaC::symbol. Here is a program that shows what happens: #include <ginac/ginac.h> #include <iostream> int main() { GiNaC::symbol s; std::cout << s << std::endl; } If this is executed under, e.g., emacs, it prints symbol0^@ that is, a NUL (ASCII 0) character is printed just after "symbol0". This is probably caused by the presence of " << std::end" in the following template function: template<class T> std::string ToString(const T & t) { std::ostringstream buf; buf << t << std::ends; return buf.str(); } IMHO, " << std::ends" should be simply erased. All the best Roberto -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it

2 1

behaviour of find method.
by Chris Dams 06 Jan '03

06 Jan '03

Hello everybody, I found out that the behaviour of the find method is not quite as advertised in the tutorial. The tutorial says: @example bool ex::find(const ex & pattern, lst & found); @end example works a bit like @code{has()} but it doesn't stop upon finding the first match. Instead, it appends all found matches to the specified list. Appending means adding at the end. However, the code of the ex::find() method includes the lines if (match(pattern)) { found.append(*this); found.sort(); found.unique(); return true; } This sorts the found-list so that a match will most of the time not end up at the end, not to mention what happens to any ordering of elements the found list had before calling the find() method. I would guess that this is because this implementation comes with potentially huge memory savings at the cost of speed because of uniquing after every object found. If this is the case, I can understand the implementation, but still the tutorial should describe the true behaviour. Groetjes, Chris

2 1

Horrendous increase in compile times (gcc 2.95.2 vs gcc 3.2 -- MinGW versions)
by Richard Haney 15 Dec '02

15 Dec '02

I switched from gcc 2.95.2 to 3.2 -- Mingw versions -- and got a horrendous increase in compile times in subdirectory 'ginac'. Free space on my c: drive is 495 MB. (My RAM is limited to 32 MB because it seems that the circuitry for memory expansion has failed.) Is the gcc 3.2 compiler bumping hard against swapping size limits? A look at the 'system monitor' software during compilation seems to say that only 72 MB is used for swapping. Or is there something else that's causing this horrendous slowdown (like a bad compiler design in upgrading from 2.95.2 to 3.2 maybe?)? Here are a couple of tables with relevant info (listing object files with file sizes and creation times) for compiling in subdirectory ginac. Table 1 ***** * object modules created by gcc 3.2 in three continuous runs of make "--------" indicates interruption of make. (selected compile times in right hand column) (Making of power.o, operators.o, and the last ten minutes of numeric.o were done at a slower processor speed powered by an auxiliary battery. The rest of the makes were done at normal high speed using ac power; high speed is nominally 380 MHz, per user's manual; lower speed value unknown.) 1451471 Wed Dec 11 19:12:08 2002 power.o 914349 Wed Dec 11 18:17:08 2002 operators.o 1630236 Wed Dec 11 18:09:32 2002 numeric.o 1.3 hrs 1763843 Wed Dec 11 16:49:42 2002 normal.o 1.5 hrs 1351462 Wed Dec 11 15:18:02 2002 mul.o 1736244 Wed Dec 11 14:37:12 2002 matrix.o 1326684 Wed Dec 11 13:29:20 2002 inifcns_gamma.o 948098 Wed Dec 11 12:57:22 2002 inifcns_zeta.o 1675190 Wed Dec 11 12:53:10 2002 inifcns_trans.o 1415743 Wed Dec 11 11:47:16 2002 inifcns.o 1530210 Wed Dec 11 11:06:18 2002 function.o --------------------------------------------------------------------- 944331 Tue Dec 10 18:03:02 2002 fail.o 1359025 Tue Dec 10 17:58:14 2002 exprseq.o 1475200 Tue Dec 10 17:22:22 2002 expairseq.o --------------------------------------------------------------------- 885881 Tue Dec 10 14:56:32 2002 expair.o 3.2 min 967914 Tue Dec 10 14:53:18 2002 ex.o 8.5 1055734 Tue Dec 10 14:44:48 2002 constant.o 16.2 1124770 Tue Dec 10 14:28:34 2002 basic.o 20.3 1374322 Tue Dec 10 14:08:18 2002 archive.o 30.7 1203797 Tue Dec 10 13:37:38 2002 add.o Table 2 ***** * Object modules created by gcc 2.95.2 with continuous operation of make (selected compile times in right hand column) (normal high processor speed using ac power; high speed is nominally 380 MHz, per user's manual.) 274186 Tue Oct 08 17:25:36 2002 operators.o 1820796 Tue Oct 08 17:24:36 2002 numeric.o 7.1 min 1792847 Tue Oct 08 17:17:32 2002 normal.o 5.5 min 894707 Tue Oct 08 17:12:00 2002 mul.o 1581044 Tue Oct 08 17:10:10 2002 matrix.o 839184 Tue Oct 08 17:07:32 2002 inifcns_gamma.o 307886 Tue Oct 08 17:06:04 2002 inifcns_zeta.o 1572996 Tue Oct 08 17:05:06 2002 inifcns_trans.o 1034273 Tue Oct 08 17:01:40 2002 inifcns.o 1155709 Tue Oct 08 16:59:14 2002 function.o 188153 Tue Oct 08 16:57:44 2002 fail.o 744889 Tue Oct 08 16:57:02 2002 exprseq.o 1094132 Tue Oct 08 16:56:00 2002 expairseq.o 105948 Tue Oct 08 16:54:24 2002 expair.o 0.7 min 257110 Tue Oct 08 16:53:42 2002 ex.o 0.7 min 378665 Tue Oct 08 16:52:58 2002 constant.o 1.0 min 479942 Tue Oct 08 16:51:58 2002 basic.o 1.0 min 972535 Tue Oct 08 16:50:58 2002 archive.o 1.0 min 561407 Tue Oct 08 16:49:58 2002 add.o ================== Here is also a summary of similar results for compiling CLN modules: Statistics for gcc 3.2 v 2.95.2 for CLN object modules ********** *** *** ****** *** ****** ******* gcc 2.95.2 compilation of cln modules in subdir src: ****** Average compile time for the second through 27th module is 19 seconds. Average object module size for the first 27 modules is 18,896 bytes. Average object module size for all 855 modules is 67,125 bytes. -------------------------------- gcc 3.2 compilation of cln modules in subdir src: *** Average compile time for the second through 27th module is 2.3 minutes. Average object module size for the first 27 modules is 254,008 bytes. Average object module size for all 855 modules is 198,708 bytes. What can I do to get CLN & GiNaC built reasonably well? I again tried to make libreadline with gcc 2.95.2 (using new things I've learned) because 2.95.2 seems at present to be the best bet, but I still run into problems. It seems I need a new set of header files (and maybe gcc 2.95.2 libraries) or, preferably, a gcc 2.95.2 libreadline.a for win32 (i.e., MinGW). That would allow me to continue with using gcc 2.95.2. Richard Haney __________________________________________________ Do you Yahoo!? Yahoo! Mail Plus - Powerful. Affordable. Sign up now. http://mailplus.yahoo.com

2 1

why is GiNaC::symbol commutative??
by smilauer＠volny.cz 03 Dec '02

03 Dec '02

Hello, subject explains it all. I would like to use symbols to represent matrices. Obvious solution (replacing symbols via some_ex.sub(some_symbol==some_matrix) does not work for multiplication of matrices. Other ways to do it? Thanks. Vaclav. (If I understand it right, upon replacement of one matrix, one has matrix*symbol; symbol is supposed to be a scalar, so we have commutative multiplication; then the other symbol is also substituted for a matrix, so one gets exception "non-commutative scalar".)

2 1

Automatic evaluation/simplification
by Roberto Bagnara 13 Nov '02

13 Nov '02

Yes, the FAQ says it is completely automatic. However, is there a way to switch it off? Forgive me for the very imprecise question. The situation is as follows: we have some monster expressions where we need to substitute a few thousands of symbol's occurrences with something else. We did that by implementing our own recursive tree traversal. However, we estimate that more than 80% of the time is spent in attempted simplifications by GiNaC (which we know are deemed to fail). Is there any way to implement this substitution process so as to avoid this big overhead? Thanks in advance Roberto -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it

2 1

Spam filter installed
by Christian Bauer 11 Nov '02

11 Nov '02

Hello! SpamAssassin 2.20 is now installed on all GiNaC and xloops mailing lists, so the amount of advertisements relayed over the lists should decrease considerably. Since SpamAssassin uses a set of heuristics to identify spam, there's of course still a chance that some of it may get through. There's also the chance that valid mail will accidentally be classified as spam. In any case, all potential spam mails will be reviewed by us, and valid messages will be resent to the lists, so there shouldn't be any information loss. Bye, Christian -- / Coding on PowerPC and proud of it \/ http://www.uni-mainz.de/~bauec002/

1 0

Missing namespace qualification in GiNaC 1.0.12
by Roberto Bagnara 30 Oct '02

30 Oct '02

It seems the patch below was not included in 1.0.12. Was the problem fixed in a different way? All the best Roberto -- Prof. Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it diff -c -d -r1.1.1.1 function.h *** ginac/function.h 29 Sep 2002 13:26:57 -0000 1.1.1.1 --- ginac/function.h 29 Sep 2002 14:02:48 -0000 *************** *** 416,422 **** } #define is_ex_the_function(OBJ, FUNCNAME) \ ! (GiNaC::is_exactly_a<GiNaC::function>(OBJ) && GiNaC::ex_to<GiNaC::function>(OBJ).get_serial() == function_index_##FUNCNAME) } // namespace GiNaC --- 416,422 ---- } #define is_ex_the_function(OBJ, FUNCNAME) \ ! (GiNaC::is_exactly_a<GiNaC::function>(OBJ) && GiNaC::ex_to<GiNaC::function>(OBJ).get_serial() == GiNaC::function_index_##FUNCNAME) } // namespace GiNaC

2 1