- GiNaC-list - ginac.de

Release 1.0.1 just hit the shelves
by Richard B. Kreckel 22 Nov '01

22 Nov '01

Okay, before heading off to Japan with Christian we spun version 1.0.1, which fixes a few things: * Function sqrfree() handles a few more cases now. * Class relational supports real canonical ordering now (thanks to Pearu). * Handle obscene libreadline version numbers when building ginsh. This release is compatible with version 1.0.0 where compatibility is defined as on the interface and binary levels. Some computational results might differ, though, as for instance sqrfree(-y*z*x+z*x^2+z^2*x-y*z^2) will now fully factorize to z*(z+x)*(-y+x) and not get stuck with (z^2+x*z)*(x-y). Remember that we are gone for the next twelve days, so don't bother reporting bugs. IOW: We officially declare this version bug-free till then. Happy hacking -richy. -- Richard B. Kreckel <Richard.Kreckel(a)Uni-Mainz.DE> <http://wwwthep.physik.uni-mainz.de/~kreckel/>

1 0

Summations
by Brandon Barker 17 Nov '01

17 Nov '01

Hello everyone. I've mailed this list before and have taken the advice obtained from it to write a numerical integration program for some of my needs, and GiNaC seems to be the best way for me to accomplish this. First of all, I have only had Calculus 2, and am just now taking the equivalent of a first semester in Computer Science course using C++ (self study - my high school doesn't offer Comp Science, and I don't know any programmers in my area, so I have to rely on on-line resources - like you people, sorry :-/ ) so this may explain why I found latter parts of the GiNaC tutorial harder to comprehend and also the fact that I'm somewhat new to C/C++ (though I've done a lot of reading, w/o much coding and hacking one tends to forget). I'm actually attempting to write my first C++ program to do Numerical Integration, but I'm having trouble doing this and I wanted to know if someone could show me the source to a simple program using GiNaC to find the summation (for example) of f(x)=x^2 on the interval [1,2] with n=4 (where n == number of intervals). Of course, a=1, b=2, n=4, and integrand=x^2 should all be variables excepted by the summation function. Once I find out how to implement something simple like this, I think I'll be well on my way to writing the program. Once I get it finished, I'll put it up on SourceForge (by finished I mean something that works and isn't too embarrassing). Many thanks in advance, Brandon Barker

2 1

Integration
by Brandon Barker 08 Nov '01

08 Nov '01

Hello. First I'd like to thank the GiNaC team for the great software. As a high school student taking AP Calculus BC and AP Computer Science AB I find it very interesting, and it looks like it will be a lot of fun. I've been using Matlab for a few weeks, and, after reading about GiNaC I decided it would be interesting to write my first program using GiNaC to solve problems with Newton's Law of Cooling. But then I saw that GiNaC could not perform Integration, but I did find it on the ToDo list. I understand that it will be very difficult to implement, but why the urgency rated as very low? I can understand if this is because other things like Polynomial Factorization must be implemented first, but not because Integration is not valued. Please tell me if this is the reason urgency for Integration is low, because, personally, many of the projects I would write involve integration. Thanks, Brandon Barker

2 1

Breaking News
by Richard B. Kreckel 06 Nov '01

06 Nov '01

MAINZ, Germany, November 6, 2001 (for immediate release) The GiNaC hackers, the leading providers of advanced mathematical software solutions for research and industrial applications, loudly announce the availability of GiNaC version 1.0. GiNaC stands for "GiNaC is not a CAS", i.e. not a Computer Algebra System. This is reminiscent to the term GNU, which stands for "GNU is not Unix", yet GNU systems widely define Unix today. It is a C++ class-library that allows certain common symbolic manipulations to be expressed directly in that language. "This release is going to change a whole lot of things" says Richard Kreckel, vice president of GiNaC's PR department. "Competing closed-source systems like Mathematica and Maple must be considered obsolete now and will surely soon fall into oblivion -- Macsyma already has." Asked whether GiNaC can really compete with all the fancy features and gimmicks found in those systems he replied: "Hey, there is always room for version 2.0 and the next generation!" Alexander Frink, vice president of GiNaC's sales department, could not be reached for a statement. He was reckoned to be busy encashing donations from millions of joyous users overwhelmed with enthusiasm. GiNaC is free software and licensed under the GNU general public license (GPL). "Having a truly scalable symbolic system is going to solve many of todays problems" says Christian Bauer, vice president of the research and development department. "Applications range from pure maths and physics over geological surveys, long-term stock options and wheather forecasts to such fields as wine-making and Japanese cuisine." The newly released version 1.0 contains "absolutely no significant changes relative to the last version whatsoever" according to Bauer. Asked how he sees further development he crypticly proclaimed "We are simply going to do what we did with the Macintosh: We emulate all other systems, including their bugs." Instructions how to download and install GiNaC on a computer system can be found at <http://www.ginac.de/Download.html>. Also, it comes pre-bundled with several distributions of the popular Linux operating system as well as with FreeBSD. Because of this dominant position on the consumers' computer desktops the US department of justice (DOJ) is considering filing an antitrust law-suit. "Okay, Microsoft got away with this practice, but we are not going to tolerate imitators", said DOJ attorney general John Ashcroft at a meeting with press. Germany's foreign minister Joschka Fischer delayed his trip to meet Palestinian president Jassir Arafat to stop in Mainz and congratulate the GiNaC folks for their release on behalf of Germany's chancellor Gerhard Schroeder. IT-industry friendly Mr. Schroeder was said to be busy "getting the beast installed" on his PC. "This new release is going to have a tremendous impact on global stability" Mr. Fischer said. "We have observed how politicians and suspected terrorists alike have become addicted to GiNaC and been converted to coding machines -- in a noble sense. Wherever they find a PC they start emitting mesmeric steams and then the miracle of code generation happens."

1 0

Release 0.9.4 just hit the net
by Richard B. Kreckel 21 Sep '01

21 Sep '01

Okay, that's it. No 500M$ unveiling event for this release of GiNaC, we're afraid, but you are still welcome to go out in the streets and deliver this message of joy to the masses: * Functions have better support for external scripting languages. * Interface cleanups and bugfixes. * Fix silly bug in evalf() that prevented things like 2^Pi being computed. Cheers -richy.

1 0

compilation problem
by chrisd＠catv7250.extern.kun.nl 03 Sep '01

03 Sep '01

Hello everybody, I have just compiled the new GiNaC at my place. This took a bit more time than I expected because of the following compiler error c++ -DHAVE_CONFIG_H -I. -I. -I.. -I/usr/local/include -g -O2 -c numeric.cpp -fPIC -DPIC -o .libs/numeric.lo /usr/include/g++-v3/bits/stl_construct.h: In function `void std::_Construct(_T1*, const _T2&) [with _T1 = cln::cl_RA, _T2 = cln::cl_RA]': numeric.cpp:128: instantiated from here /usr/include/g++-v3/bits/stl_construct.h:78: no matching function for call to `cln::cl_RA::operator new(unsigned int, void*&)' /usr/local/include/cln/rational_class.h:35: candidates are: static void* cln::cl_RA::operator new(unsigned int) /usr/local/include/cln/rational_class.h:36: static void* cln::cl_RA::operator new(unsigned int, cln::cl_RA*) make[2]: *** [numeric.lo] Error 1 make[2]: Leaving directory `/home/chrisd/download/GiNaC-0.9.3/ginac' make[1]: *** [all-recursive] Error 1 make[1]: Leaving directory `/home/chrisd/download/GiNaC-0.9.3' make: *** [all-recursive-am] Error 2 So, the file numeric.cpp does not compile. I also found the source of the error. If I comment out all calls to vector<cln::cl_RA>::push_back(cln::cl_RA) the error messages disappear. All calls to this function happen inside the function const numeric bernoulli(const numeric &nn) and there are two of these calls. I use gcc 3.0.1 and cln 1.1. Hopefully maintainers find this information usefull to correct the error or come up with a work around. Greetings, Chris Dams

2 1

None
by Richard B. Kreckel 16 Aug '01

16 Aug '01

We are psyched to announce GiNaC 0.9.3. This release is even more fat-, meta-tag-, cholesterol- and bug-free than earlier versions: * Series expansion is now much more consistent for very small order expansion, giving some users unprecedented expressiveness and * lsolve() accepts an algorithmic hint as parameter so one can squeeze out ultimate performance. Get your copy as long as our supply of this groundbreaking product lasts!

1 0

ginsh compilation with gcc2.96 -- readline 4.2
by Vladimir Dyadichev 12 Aug '01

12 Aug '01

Hello I would like to compile GiNaC on my Linux system with gcc 2.96 . I have libreadline v 4.2 installed on my system but it seems that g++ do not like readline header files. Consequently the ginsh fails to compile (library itself compiles OK). Any suggestions ??? Thanks in advance. Vladimir Here is part of configure output: checking for readline/readline.h... yes checking for readline/history.h... yes checking for tgetent... no checking for tgetent in -lncurses... yes checking for readline in -lreadline... yes checking for version of libreadline... unknown The part of config.log corresponding to that failure configure:5993: c++ -o conftest -g -O0 conftest.C -lreadline -lncurses 1>&5 configure:6022: checking for version of libreadline configure:6050: c++ -o conftest -g -O0 conftest.C -lreadline -lncurses 1>&5 In file included from /usr/include/readline/keymaps.h:37, from /usr/include/readline/readline.h:36, from configure:6038: /usr/include/readline/rltypedefs.h:48: `rl_command_func_t' declared with an exception specification/usr/include/readline/rltypedefs.h:51: `rl_compentry_func_t' declared with an exception specificatio /usr/include/readline/rltypedefs.h:52: `rl_completion_func_t' declared with an exception specificatin /usr/include/readline/rltypedefs.h:54: `rl_quote_func_t' declared with an exception specification /usr/include/readline/rltypedefs.h:55: `rl_dequote_func_t' declared with an exception specification/usr/include/readline/rltypedefs.h:57: `rl_compignore_func_t' declared with an exception specificatin /usr/include/readline/rltypedefs.h:59: `rl_compdisp_func_t' declared with an exception specificationusr/include/readline/rltypedefs.h:62: `rl_hook_func_t' declared with an exception specification /usr/include/readline/rltypedefs.h:65: `rl_getc_func_t' declared with an exception specification /usr/include/readline/rltypedefs.h:70: `rl_linebuf_func_t' declared with an exception specification/usr/include/readline/rltypedefs.h:73: `rl_intfunc_t' declared with an exception specification /usr/include/readline/rltypedefs.h:75: `rl_icpfunc_t' declared with an exception specification /usr/include/readline/rltypedefs.h:76: `rl_icppfunc_t' declared with an exception specification /usr/include/readline/rltypedefs.h:78: `rl_voidfunc_t' declared with an exception specification /usr/include/readline/rltypedefs.h:79: `rl_vintfunc_t' declared with an exception specification /usr/include/readline/rltypedefs.h:80: `rl_vcpfunc_t' declared with an exception specification /usr/include/readline/rltypedefs.h:81: `rl_vcppfunc_t' declared with an exception specification In file included from /usr/include/readline/readline.h:37, from configure:6038: /usr/include/readline/tilde.h:55: `tilde_hook_func_t' declared with an exception specification configure: failed program was: #line 6031 "configure" #include "confdefs.h" #ifdef __cplusplus extern "C" void exit(int); #endif #include <stdio.h> #include <sys/types.h> #include <readline/readline.h> main() { FILE *fd; fd = fopen("conftest.out", "w"); fprintf(fd, "%s\n", rl_library_version); fclose(fd); return 0; } The compilation of ginsh fails with exactly the same error messages: make[2]: Вход в каталог `/home/vlad/src/GiNaC-0.9.2/ginsh' sed -n -f ./ginsh_fcn_help.sed <ginsh.1 >ginsh_fcn_help.c sed -n -f ./ginsh_op_help.sed <ginsh.1 >ginsh_op_help.c c++ -DHAVE_CONFIG_H -I. -I. -I.. -I./../ginac -I../ginac -DIN_GINAC -g -O2 -c ginsh_parser.cc In file included from /usr/include/readline/keymaps.h:37, from /usr/include/readline/readline.h:36, from ginsh.h:36, from ginsh_parser.yy:41: /usr/include/readline/rltypedefs.h:48: `rl_command_func_t' declared with an exception specification/usr/include/readline/rltypedefs.h:51: `rl_compentry_func_t' declared with an exception specification <etc>

3 2

GiNaC memory leak?
by Marko Riedel 08 Aug '01

08 Aug '01

Greetings. I am sending some code that I wrote in order to solve a differential equation. You run the compiled program with a command-line argument telling it what terms to use. Interesting values are e.g. 10, 14, 16 and 19. (The higher values take some time to compute.) Warning! When you run the program on the higher values, it starts consuming huge amounts of memory. On a SuSE Linux machine the OS eventually kills the process. What is going on here? The program solves a system of equations with a 1000 x 1000 approx. coefficient matrix. What is all the memory being used for? Take, say 32 bytes per entry; the system should then allocate about 32M of memory. In fact it tries to allocate more than 512M of memory! Best regards, Marko Riedel ---------------------------------------------------------------------- #include <stdio.h> #include <fstream> #include <ginac/ginac.h> using namespace std; using namespace GiNaC; static symbol u("u"); static symbol z("z"); static symbol l1("l1"); static symbol l2("l2"); static symbol phi("phi"); static void extracteqs(ex eq, lst *l) { int i, j; ex c1, c2; for(i=eq.ldegree(z); i<=eq.degree(z); i++){ c1=eq.coeff(z, i); for(j=eq.ldegree(u); j<=eq.degree(u); j++){ c2=c1.coeff(u, j); if(is_ex_of_type(c2, numeric)){ if(c2!=0){ cerr << "inconsistency: " << i << " " << j << endl; exit(-1); } } else{ (*l).append(c2==0); cerr << (*l).nops() << endl; } } } } int main(int argc, char **argv) { int maxcoeff, i, j; if(argc!=2){ cout << argv[0] << " <maxcoeff>" << endl; exit(-1); } sscanf(argv[1], "%d", &maxcoeff); if(maxcoeff<1){ cout << "argument " << maxcoeff << " out of range" << endl; exit(-2); } ex rt, lf1, lf2; lst vs; rt=0; lf1=0; lf2=0; for(i=0; i<maxcoeff; i++){ for(j=0; j<maxcoeff; j++){ symbol a; rt+=a*pow(z, i)*pow(u, j); vs.append(a); if(i<maxcoeff-6 && j<maxcoeff-6){ symbol b, c; lf1+=b*pow(z, i)*pow(u, j); lf2+=c*pow(z, i)*pow(u, j); vs.append(b); vs.append(c); } } } cerr << rt << endl; cerr << lf1 << endl; cerr << lf2 << endl; cerr << vs << endl; ex s, sf, sf1, sf2; sf=pow(1-u, 11)*pow(1-z, 7)*pow(1-z*u, 7); sf1=pow(1-u, 9)*pow(1-z, 5)*pow(1-z*u, 5); sf2=pow(1-u, 10)*pow(1-z, 2)*pow(1-z*u, 2); s=rt/sf1+ lf1*u*log(1/(1-z))/sf2+ lf2*log(1/(1-z*u))/sf2; ex f, rz, rzv, rzu, rzvu; f=(u-u*u*z*z)/pow(1-z, 2)/pow(1-z*u, 2); rz=1/pow(1-z, 2); rzv=1/pow(1-z, 2); rzu=rz.subs(z==z*u); rzvu=rzv.subs(z==z*u); ex t1, t2, t3, t4, t5, t6, t7, t8, t9; t1=6*u*u*rzu *f; t2=6*u*u*rzvu*f; t3=6*u*u*rzu *phi; t4=6*u*u*rzu *rz; t5=6*u*u*rzvu*rz; t6=6*u*u*rzu *rzv; t7=6* rz *f; t8=6* rzv *f; t9=6* rz *phi; ex rhs1, rhs2; rhs1=(t1+t2+t4+t5+t6+t7+t8).normal(); rhs2=(t3+t9).normal(); ex eq, eq1; eq=(s.diff(z, 2)-rhs1-rhs2.subs(phi==s)) .subs(lst(log(1/(1-z))==l1, log(1/(1-z*u))==l2)) .expand(); eq1=0; for(i=0; i<eq.nops(); i++){ eq1+=(eq.op(i)*sf).normal().expand(); cerr << "expand: " << i << " " << eq.nops() << endl; } ex leq1=eq1.coeff(l1, 1), leq2=eq1.coeff(l2, 1); eq1=eq1.subs(lst(l1==0, l2==0)); lst ceqs; ex s0=(s.subs(z==0)*pow(1-u, 9)).normal(); ex sz0=(s.diff(z).subs(z==0)*pow(1-u, 9)).normal(); ex i0=(u*pow(1-u, 9)).expand(); ex iz0=((4*u+4*u*u)*pow(1-u, 9)).expand(); cerr << "extract initial: 1" << endl; extracteqs(s0-i0, &ceqs); cerr << "extract initial: 2" << endl; extracteqs(sz0-iz0, &ceqs); cerr << "extract: 1" << endl; extracteqs(eq1, &ceqs); cerr << "eqs: " << ceqs.nops() << endl; cerr << "extract: 2" << endl; extracteqs(leq1, &ceqs); cerr << "eqs: " << ceqs.nops() << endl; cerr << "extract: 3" << endl; extracteqs(leq2, &ceqs); cerr << "eqs: " << ceqs.nops() << endl; ex sl; cerr << "solving: " << ceqs.nops() << " " << vs.nops() << " ..." << endl; try{ sl=lsolve(ceqs, vs); } catch(exception &e){ cerr << e.what() << endl; exit(-3); } cout << sl << endl; lst zlist; for(i=0; i<vs.nops(); i++){ zlist.append(vs.op(i)==0); } ex result; result=s.subs(sl).subs(zlist); cout << result << endl; archive a; a.archive_ex(result, "result"); char fname[80]; sprintf(fname, "fixedpoints%d.gar", maxcoeff); ofstream out(fname); out << a; out.close(); }

2 2

GiNaC 0.9.2 around
by Alexander Frink 31 Jul '01

31 Jul '01

Hi all, I apologize for the laziness of my co-workers who produced no more than 3 entries in the news section for GiNaC 0.9.2. But ok, it is summer time and very hot in Germany, so we hope to be more productive again in the future... Forced to write something before they let me go to the next beer-garden Alex * Epsilon tensor is more functional. * simplify_indexed() is better at detecting expressions that vanish for symmetry reasons. * Several little bugfixes and consistency enhancements. -- Alexander Frink E-Mail: Alexander.Frink(a)Uni-Mainz.DE Institut fuer Physik Phone: +49-6131-3923391 Johannes-Gutenberg-Universitaet D-55099 Mainz, Germany

1 0