March 2004 - GiNaC-devel

series expansion.
by Chris Dams 27 Mar '04

27 Mar '04

Hello everybody, Question: what is the output of ex test=1+power(x,4)*sqrt(1+x*x); cout << test.series(x==0,2) << endl; Answer: Order(1) Question: Why? Answer: Because in the x-involving product order=2, degsum=4, ldegree of the sqrt is 0, the sqrt is expanded up to order -2 and Order(x^2)*Order(x^-2)=Order(1). Question: What is to be done now? Answer: Have a look at the attached patch. Bye, Chris Dams

2 1

Problem with series expansion
by Chris Dams 25 Mar '04

25 Mar '04

Hello, I found out that trying to calculate ex(sqrt(1+x*x)*sqrt(1+2*x*x)).series(x,2) throws an exception. This is because on the one hand the expansion of a multiplication tries to find the ldegree of every factor and on the other hand ldegree of a power throws if the base of the power contains the variable and the exponent is non-integer. A patch is included. Goodbye, Chris Dams

1 0

Re:build fails on cygwin (more details)
by fausap＠libero.it 23 Mar '04

23 Mar '04

Hello all, I have the same problem with latest cygwin and gcc 3.3.1 and ginac 1.2.0 Anyway, the fix for log2 (i.e. put int() before the log2 call in the file remember.cpp at line 153) works. Thanks! regards, fausto ---------- Initial Header ----------- >From : owner-ginac-devel(a)thep.physik.uni-mainz.de To : ginac-bugs(a)thep.physik.uni-mainz.de Cc : Date : Tue, 23 Mar 2004 09:07:39 -0500 Subject : build fails on cygwin (more details) > I finished build 1.2.0 on cygwin using gcc 3.2 20020927. > > All tests fail with segmentation faults and empty .out files. >

1 0

build fails on cygwin (more details)
by Paul Kienzle 23 Mar '04

23 Mar '04

I finished build 1.2.0 on cygwin using gcc 3.2 20020927. All tests fail with segmentation faults and empty .out files. Retreating to 1.1.7, most tests succeed. The only failure is with archive, which I don't need. Here is the test output: ----------several historic failures: (no output) ----------consistency of numeric types: (no output) ----------power laws: (no output) ----------consistency of symbolic functions: (no output) ----------consistency of nestedsums functions: (no output) ----------symbolic differentiation: (no output) ----------polynomial GCD computation: (no output) ----------rational function normalization: (no output) ----------series expansion: (no output) ----------symbolic matrix manipulations: (no output) ----------linear solve: (no output) ----------indexed objects: (no output) ----------color objects: (no output) ----------clifford objects: (no output) ----------archiving system: archiving/unarchiving delta.([[-1,0,0],[0,Euler,0],[0,0,atan(y^(-1)*x==-15/17*I)]]*delta.($7).x)~(g~2~(log(cos((128.0)*y^(-1)*x^(-1))))*ONE*{x,-11*y,(acos(6-10*I))+(-(26/3725-48/3725*I)*sqrt(65+120*I))*(-3+5*I+x)+((17364/13875625-652/13875625*I)*sqrt(65+120*I))*(-3+5*I+x)^2+Order((-3+5*I+x)^3)})-(2.4275000000000002132)*eps~*0~y+((abs(y))+(D[0](abs)(y))*(-y+x)+(1/2*D[0,0](abs)(y))*(-y+x)^2+(1/6*D[0,0,0](abs)(y))*(-y+x)^3+Order((-y+x)^4))+42*y^sin(Catalan*y)*ONE*x*eps.(1/2*y).0.(FAIL)-x~(-mu).(1+2*y)*T.x*(gamma~mu*gamma.mu)*(-I*f.y.x.2+d.y.x.2) erroneously returned delta.([[-1,0,0],[0,Euler,0],[0,0,atan(y^(-1)*x==-15/17*I)]]*delta.($7).x)~(g~2~(log(cos((128.0)*y^(-1)*x^(-1))))*ONE*{x,-11*y,(acos(6-10*I))+(-(26/3725-48/3725*I)*sqrt(65+120*I))*(-3+5*I+x)+((17364/13875625-652/13875625*I)*sqrt(65+120*I))*(-3+5*I+x)^2+Order((-3+5*I+x)^3)})-(2.4275000000000002132)*eps~*0~y+((abs(y))+(D[0](abs)(y))*(-y+x)+(1/2*D[0,0](abs)(y))*(-y+x)^2+(1/6*D[0,0,0](abs)(y))*(-y+x)^3+Order((-y+x)^4))+42*y^sin(Catalan*y)*ONE*x*eps.(1/2*y).0.(FAIL)-x~(-mu).(1+2*y)*T.x*(gamma~mu*gamma.mu)*(-I*f.y.x.2+d.y.x.2) ----------hash maps: (no output) ----------miscellaneous other things: (no output) Paul Kienzle pkienzle(a)nist.gov

1 0

build fails on cygwin
by Paul Kienzle 22 Mar '04

22 Mar '04

Compile GiNaC 1.2.0 on cygwin using gcc 3.2 20020927: ginac/remember.cpp table_size = 1 << log2(s); The compiler doesn't like the mixture of integer and double on operator<<. I used int(log2(s)). If this is also the place to report CLN build issues, version 1.1.5 */Makefile.in do not include LDFLAGS = @LDFLAGS@ so it couldn't find my version of libgmp.a. Paul Kienzle pkienzle(a)nist.gov

1 0

cygwin compiling problem
by fausap＠libero.it 22 Mar '04

22 Mar '04

Hello all, I'm trying to compile the last version of GINAC under Cygwin, with gcc 3.3.1 I receive this error: g++ -DHAVE_CONFIG_H -I. -I. -I.. -I/usr/local/include -g -O2 -MT remember.lo -M D -MP -MF .deps/remember.Tpo -c remember.cpp -DPIC -o .libs/remember.o remember.cpp: In constructor `GiNaC::remember_table::remember_table(unsigned int, unsigned int, unsigned int)': remember.cpp:153: error: invalid operands of types `int' and `double' to binary `operator<<' make[2]: *** [remember.lo] Error 1 make[2]: Leaving directory `/home/SAPORITO/GiNaC-1.2.0/ginac' make[1]: *** [all-recursive] Error 1 make[1]: Leaving directory `/home/SAPORITO/GiNaC-1.2.0' make: *** [all] Error 2 the gcc version is : Reading specs from /usr/lib/gcc-lib/i686-pc-cygwin/3.3.1/specs Configured with: /GCC/gcc-3.3.1-3/configure --with-gcc --with-gnu-ld --with-gnu- as --prefix=/usr --exec-prefix=/usr --sysconfdir=/etc --libdir=/usr/lib --libexe cdir=/usr/sbin --mandir=/usr/share/man --infodir=/usr/share/info --enable-langua ges=c,ada,c++,f77,pascal,java,objc --enable-libgcj --enable-threads=posix --with -system-zlib --enable-nls --without-included-gettext --enable-interpreter --enab le-sjlj-exceptions --disable-version-specific-runtime-libs --enable-shared --dis able-win32-registry --enable-java-gc=boehm --disable-hash-synchronization --verb ose --target=i686-pc-cygwin --host=i686-pc-cygwin --build=i686-pc-cygwin Thread model: posix gcc version 3.3.1 (cygming special) Any idea? thank in advance, Fausto

2 1

GiNaC 1.2.0 now available
by Christian Bauer 19 Mar '04

19 Mar '04

Hello! In an unforeseen turn of events, the GiNaC Group (who, by the way, don't endorse the use of recreational drugs, except for C++ templates and Pokemon movies) proudly presents GiNaC 1.2.0 "We don't have the funds for champagne but we're going to release anyway". (And we also finally leave CLN in the dust in terms of version numbers. Hah, in your face, Richy! :-) Compared to the last few 1.1.x releases, this one has a rather impressive list of changes, with the focus on improving GiNaC's extensibility: - Added a structure<T> template class for the easy creation of user-defined algebraic classes. - Added support for (acyclic) visitors, to allow cleaner implementations of algebraic algorithms. - Added a const_iterator class that can be used instead of op()/nops(). - Completely revamped the implementation of expression output. It is now possible to add new output formats, to change the behavior of predefined formats at run-time, and to have different output styles for algebraic functions. - Symbols can be made non-commutative. - Added a method ex::conjugate() and a function conjugate() for complex conjugation. Symbols can be declared as real or complex-valued. - Improved the speed of subs(), normal(), to_rational() and to_polynomial() by the use of maps instead of lists. The old forms subs(const lst & ls, const lst & lr, unsigned options) to_rational/to_polynomial(lst & repl) are still available for compatibility, but using the new forms subs(const exmap & m, unsigned options) to_rational/to_polynomial(exmap & repl) is more efficient, especially when the number of replacements is large. - quo(), rem(), prem(), sprem(), decomp_rational(), unit(), content(), primpart() and matrix::charpoly() now take a "const ex &" instead of a "const symbol &". - Redundant expressions (two ex pointing to different objects are found to be equal in compare()) are now actively deleted/fused to conserve memory and speed up subsequent comparisons. This behavior can be suppressed on a per-object level with status_flags::not_shareable. Lists and matrices are not shareable by default. - Lots of internal streamlining and optimizations. - Caveats for class implementors: - basic::copy() and basic::destroy() are gone; classes derived from basic can use the defaults for the assignment operator and copy constructor. [Roberto: this also means that annoying compiler warning is finally gone... :-] - basic::subs(), basic::normal(), basic::to_rational() and basic::to_polynomial() take 'exmap' objects instead of lists. - basic::subs() now descends into subexpressions (if accessible via nops()/op()/let_op()). If you have a custom implementation of subs() that calls basic::subs() after substituting subexpressions, this needs to be changed to a call to subs_one_level(). - lst::thislst() and exprseq::thisexprseq() renamed to thiscontainer(). - thiscontainer() and associated constructors now take a std::auto_ptr. - Overloading basic::print() is now deprecated. You should use print_func<>() class options instead. Most of the new features are explained in more detail in the tutorial. GiNaC 1.2.0 is not binary compatible to 1.1.x, so you have to recompile your stuff. It shouldn't be necessary to make any modifications to your sources when switching to 1.2, except when you implemented your own GiNaC classes (see above). As before, all 1.2.x releases will be (upwards) binary compatible to each other. There is a new CVS branch "ginac_1-2" for the 1.2.x series, and the CVS head branch will eventually become GiNaC 1.3 (or GiNaC 2.0, or GiNaC Advanced Datacenter Edition, or whatever). What's left to say? Ah, yes, download GiNaC 1.2.0 from ftp://ftpthep.physik.uni-mainz.de/pub/GiNaC Happy computing, Christian -- / Physics is an algorithm \/ http://www.uni-mainz.de/~bauec002/

1 0

GiNaC 1.1.7 now available
by Christian Bauer 11 Mar '04

11 Mar '04

Hello! We're proud to present GiNaC release 1.1.7 "Legacy of Taylor" in which we: - Fixed a bug in canonicalize_clifford(). - Series expansion now works predictably. All terms with the exponent of the expansion variable smaller than the given order are calculated exactly. If the series is not terminating, the Order function is (at least) of the given order. Predictably, this release can be downloaded from ftp://ftpthep.physik.uni-mainz.de/pub/GiNaC/ Never stop coding, Christian -- / Physics is an algorithm \/ http://www.uni-mainz.de/~bauec002/

1 0