March 2001 - GiNaC-devel

polynomial arithmetic over ginac
by Parisse Bernard 23 May '01

23 May '01

I have now a little bit improved the package of my polynomial and rational fractions utilities over GiNaC (0.6.4) It provides now gcd normalization, factor (square-free and rational roots), partfrac & integrate (assuming factor works on the denominator), for example: integrate '1/(x^4-1)^5' returns -1155/8192*log(1+x)-1155/4096*atan(x)+1155/8192*log(-1+x)+1/2048*(-893*x-1375*x^9+1755*x^5+385*x^13)*(-1+x^4)^(-4) # Time for (integrate)0.04 You can retrieve and test it at ftp://fourier.ujf-grenoble.fr/pub/hp48/giac.tgz Bye, Bernard Parisse

4 9

lt-exams test is running forever
by Pearu Peterson 02 Apr '01

02 Apr '01

Hi! In my Alpha(ev56) Linux box (with RH6.1, gcc 2.95.2, the latest GiNaC from CVS, CLN-1.1, GMP-3.1.1) the lt-exams test is running already 15 hours: <snip> GiNaC will now take an exam with specific input (like a pupils' exam): examining several historic failures just out of paranoia.......... Any ideas why? Pearu

2 2

Large archive problem
by Will Woods 31 Mar '01

31 Mar '01

Hi, I am working with large matrices (~100x100) and had trouble with restoring archives of them. I wrote the attached test program which just adds the same expression to an archive n times (with a unique name each time). For any n, the expression can always be retrieved from the original archive. But reloading it from file into a new archive object only succeeds for n<108 (in this case - other size expressions have different limits). Great package though. Our problem solution went from several hours under Macsyma to just 36 seconds with GiNaC! Will System: GiNaC 0.8.0 CLN 1.1.0 Linux Mandrake 7.2 AMD 700Mhz 128Mb

2 2

Re: Minse
by Ka-Ping Yee 28 Mar '01

28 Mar '01

On Sat, 24 Mar 2001, Pearu Peterson wrote: > > Dear Ka-Ping Yee, > > I am writing a GiNaC (www.ginac.de) interface to Python and by now I have > wrapped most of the GiNaC library. Now I looking for > (preferably GPL,LGPL) tools that can render mathematical formulae to be > displayed on text screens. I just learned about the Minse and it seems to > me that it does exactly what is needed in PyGiNaC. Hi! This sounds like a pretty neat project. It would be cool if my MINSE work could help you in this endeavour. > I am writing to you to ask if you are interested in sharing Minse code in > this project? Only the part that renders a formula to a text is needed. I have put up a preliminary source distribution on my home page (http://www.lfw.org/ping/) It is not documented but i hope you will be able to find your way around it. Download both .tar.gz archives; each one unpacks separately. The "glyphd" archive is the renderer; run "make" there and try ./textren text.cfg lat1 5 It will accept typesetting expressions such as @bar(a + b,@rad(3)) The "minse" archive is the stylesheet engine. It will accept MINSE expressions and turn them into typesetting expressions for the rendering machinery. Try running ./ftext in that directory and typing in MINSE expressions, e.g. skuld[1029]% ./ftext =: a + b -> a + b =: a/b -> a --- b =: 'lim((f(x+h)-f(x))/h, h .approach 0) -> f(x + h) - f(x) lim ----------------- h -> 0 h -- ?!ng I never dreamt that i would get to be The creature that i always meant to be But i thought, in spite of dreams, You'd be sitting somewhere here with me.

1 0

For the brave and adventurous...
by Richard B. Kreckel 24 Mar '01

24 Mar '01

...there is some great new compiler food! It's called GiNaC-0.8.0, it is completely fat- and cholesterol-free and available at every good grocery shop next to you. For the not so brave and adventurous, Debian and RedHat pre-cooked servings are expected to follow next week (well maybe). Here is the summary from the NEWS file: * Complete revamp of indexed objects. Instead of multiple classes for indexed things and their indices there is now only one "indexed" class and two types of indices: "idx" for simple indices and "varidx" for indices with variance. There are predefined delta, epsilon and metric tensors, and a function simplify_indexed() that performs canonicalization and dummy index summations. Matrix objects can be indexed for doing simple linear algebra. * Added an option "expand_indexed" to expand() to perform expansion of indexed objects like (a+b).i -> a.i + b.i * Renamed get_indices() to get_free_indices(), which no longer returns dummy indices and checks the consistency of indices in sums. * sqrfree() factorization fixed and improved syntactically. * subs() works on matrices. * Matrices can be constructed from flat list of elements; diagonal matrices can be constructed from list of diagonal elements with diag_matrix(). * Fixed memory leak in expand(). * Operator% for objects of class ncmul has gone. Use operator* now for that case too, which is much more natural. Happy hacking -richy. -- Richard Kreckel <Richard.Kreckel(a)Uni-Mainz.DE> <http://wwwthep.physik.uni-mainz.de/~kreckel/>

1 0

Re: CLN 1.1
by Richard B. Kreckel 20 Mar '01

20 Mar '01

Hi there, <swear> Has anybody noticed that Majordomo was written by a bunch of brain-dead morons? When anybody mentioned the word "unstable" in a mail it gets sorted out and ends up as a Majordomo error because they match against the regular expression "/\buns\w*b/i" which is obviously meant for "unsubscribe" but matches other stuff, too. I have deleted the most idiotic patterns from the check and hope it works better now, but if anybody has a good alternative for Majordomo I would like to hear about it. Sorry for being inpolite but it just overcomes you when you have a look at those scripts. It is unbelievable! </swear> Now to Julian's question: I hope to package and upload it today or tomorrow. Some people are also eager for Cint and I have sorted out most problems with Masaharu now which so far prevented a reasonable packaging. I don't know yet how that is going to work out, though. As for the library versioning, no that is ok. The numbers attached to the filenames are a priori unrelated to the library version number. If you find this irritating, please have a look at the info page provided by libtool. Sorry, I do not know why you get "checking for CLN - version >= 1.1.0... no". I have just installed cln_1.1.0-2_i386.deb and cln-dev_1.1.0-2_i386.deb and run configure and it works fine. Could you please investigate by having a look at config.log and find out why the test program "failed to compile or link"? (By manually creating that test program and try to get it running.) Regards -richy. PS: I assume that you are running i386 since the build daemon usually takes some days or weeks? -- Richard Kreckel <Richard.Kreckel(a)Uni-Mainz.DE> <http://wwwthep.physik.uni-mainz.de/~kreckel/> ---------- Forwarded message ---------- Date: Mon, 19 Mar 2001 12:43:58 +0100 From: owner-ginac-devel(a)thep.physik.uni-mainz.de To: ginac-devel-approval(a)thep.physik.uni-mainz.de Subject: BOUNCE ginac-devel(a)ThEP.Physik.Uni-Mainz.DE: Admin request of type /\buns\w*b/i at line 2 Admin request of type /\buns\w*b/i at line 6 >From kreckel(a)thep.physik.uni-mainz.de Mon Mar 19 12:43:56 2001 Received: from mailgate1.zdv.Uni-Mainz.DE (mailgate1.zdv.Uni-Mainz.DE [134.93.8.56]) by zino.physik.uni-mainz.de (8.9.3/8.9.3/Debian 8.9.3-21) with ESMTP id MAA22673 for <ginac-devel(a)zino.physik.uni-mainz.de>; Mon, 19 Mar 2001 12:43:56 +0100 Received: from antoinette.snu.ac.kr (mail(a)antoinette.snu.ac.kr [147.46.115.122]) by mailgate1.zdv.Uni-Mainz.DE (8.11.0/8.10.2) with ESMTP id f2JBhpV08288 for <ginac-devel(a)zino.physik.uni-mainz.de>; Mon, 19 Mar 2001 12:43:52 +0100 (MET) Received: from stoev by antoinette.snu.ac.kr with local (Exim 3.22 #1 (Debian)) id 14ey4Z-00084x-00 for <ginac-devel(a)zino.physik.uni-mainz.de>; Mon, 19 Mar 2001 20:43:39 +0900 Date: Mon, 19 Mar 2001 20:43:33 +0900 From: Julian Stoev <stoev(a)users.sourceforge.net> To: ginac-devel(a)thep.physik.uni-mainz.de Subject: Re: CLN 1.1 Message-ID: <20010319204333.A18940(a)antoinette.snu.ac.kr> References: <Pine.LNX.4.10.10103191123400.16602-100000(a)galileo.fis.unipr.it> <Pine.LNX.4.21.0103191146350.26620-100000(a)higgs.physik.uni-mainz.de> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.3.12i In-Reply-To: <Pine.LNX.4.21.0103191146350.26620-100000(a)higgs.physik.uni-mainz.de>; from kreckel(a)zino.physik.uni-mainz.de on Mon, Mar 19, 2001 at 12:02:04PM +0100 Sender: Julian Stoev <stoev(a)antoinette.snu.ac.kr> Is there a hope for ginac Debian unstable packages appearing somewhere on the ftp? And BTW, I don't know why, but the names of the cln libs in Debian unstable are: -rw-r--r-- 1 root root 3098108 Mar 16 04:44 libcln.a -rw-r--r-- 1 root root 636 Mar 16 04:44 libcln.la lrwxrwxrwx 1 root root 15 Mar 19 20:24 libcln.so -> libcln.so.1.0.0 lrwxrwxrwx 1 root root 15 Mar 19 20:24 libcln.so.1 -> libcln.so.1.0.0 -rw-r--r-- 1 root root 940300 Mar 16 04:44 libcln.so.1.0.0 Shouldn't these be 1.1.0 libraries? when I start the configure of ginac, I get checking for CLN - version >= 1.1.0... no *** Could not run CLN test program, checking why... *** The test program failed to compile or link. See the file config.log for the *** exact error that occured. This usually means CLN was incorrectly installed *** or that you have moved CLN since it was installed. In the latter case, you *** may want to edit the cln-config script: /usr/bin/cln-config. I am with Debian unstable updated daily. On Mon, Mar 19, 2001 at 12:02:04PM +0100, Richard B. Kreckel wrote: |Bingo! We keep seeing a lot of those problems. Please upgrade your |compiler to GCC 2.95.2 or GCC 2.95.3. If your are running RedHat, please |see <http://www.ginac.de/lists/ginac-devel/msg00083.html>.

3 3

CLN 1.1
by Stefan Weinzierl 19 Mar '01

19 Mar '01

Dear Richy, I was planning to upgrade to GiNaC-0.7 and CLN-1.1, but I ran into a small problem: CLN-1.1 does not build out of the box on my system. After configure and make, in the "test" subdirectory: c++ -O exam.o exam_I.o exam_RA.o exam_SF.o exam_FF.o exam_DF.o exam_LF.o exam_I_gcd.o exam_I_sqrtp.o ../src/.libs/libcln.so -lm -o .libs/exam -Wl,--rpath -Wl,/usr/local/lib exam_I.o: In function `test_integer_plus(void)': exam_I.o(.text+0xc1): undefined reference to `default_print_flags' Runnnig nm -u on src/.libs/libcln.so.1.0.0 shows me that default_print_flags is indeed unresolved, together with some other symbols, which I suspect should be better resolved: ... cl_class_bignum cl_class_complex cl_class_dfloat cl_class_ffloat cl_class_fixnum cl_class_gvector_integer cl_class_gvector_number cl_class_lfloat cl_class_modint_ring cl_class_ratio cl_class_sfloat cl_class_string cl_class_svector_number cl_class_svector_ringelt cl_class_univpoly_ring default_print_flags ... I have a slight suspicion that it might be the compiler. The compiler I'm using is gcc 2.91.66 Best regards, Stefan

2 1

sqrfree
by Parisse Bernard 11 Mar '01

11 Mar '01

Hi, Doing some tests with square-free factorization, I believe I have found a bug. Let e by (x+y)^2*(x-y) expanded and call sqrfree(e,x). You do not get the original expression, it remains expanded. If y is replaced by 1 it seems it works. Bernard

3 3

So what shall we buy? (Porting GiNaC)
by Richard B. Kreckel 07 Mar '01

07 Mar '01

>From the macho-computing-on-macho-machines-dept. Let me briefly report on some newer timings I ran on some nifty up-to-date machines using the timings in GiNaC 0.7.3. The competitors were: an IA-64 (Itanium) machine running at 733MHz, a cheap off-the-shelve Athlon system with 800MHz and a newer Alpha 21264A (known as EV67) running at 677MHz clock speed. All had mind-boggling amounts of memory. The IA64 and the Athlon were running under Linux, the Alpha under Compaq's Tru64. The compiler used was GCC 2.95.2 except on the Itanium where I had to use a newer GCC 3.0 snapshot from CVS. Two tests were omitted because there seem to be bugs in the exception handling of the IA64 compiler and for obscure reasons the Alpha program chose to crash on one test (you won't believe how many compiler problems one sees when doing this kind of stuff). As we all know, computer algebra in practice tends to be code that does a lot branches giving good branch prediction a real chance. Also, the floating point unit usually idles a lot. So, we can expect the Alpha processor to run far from optimal performance. Although the GNU compiler is known not to generate good EPIC code and the IA64 processor is not yet released anyways and the final hardware might differ from the one used here, I find the Itanium timings rather disappointig. For your personal edification and without further apologies here are the numbers: commutative expansion and substitution (a.k.a. Denny Fliegner's test) size IA64 Athlon 21264A Ratio 50 0.13 0.07 0.06 1.85 / 1.00 / 0.85 100 0.64 0.35 0.29 1.82 / 1.00 / 0.82 200 3.01 1.719 1.41 1.75 / 1.00 / 0.80 determinant of univariate symbolic Vandermonde matrices dim IA64 Athlon 21264A Ratio 6x 6 0.02 0.006 0.01 3.33 / 1.00 / 1.66 8x 8 0.21 0.11 0.13 1.91 / 1.00 / 1.18 10x10 2.09 1.01 1.25 2.07 / 1.00 / 1.24 determinant of polyvariate symbolic Toeplitz matrices dim IA64 Athlon 21264A Ratio 6x 6 0.12 0.065 0.07 1.85 / 1.00 / 1.08 7x 7 0.56 0.30 0.35 1.86 / 1.00 / 1.67 8x 8 2.42 1.32 1.53 1.83 / 1.00 / 1.16 Lewis-Wester test A (divide factorials) IA64 Athlon 21264A Ratio 0.2 0.095 0.05 2.11 / 1.00 / 0.52 Lewis-Wester test B (sum of rational numbers) IA64 Athlon 21264A Ratio 0.025 0.009 0.009 2.78 / 1.00 / 1.00 Lewis-Wester test C (gcd of big integers) IA64 Athlon 21264A Ratio 0.25 0.11 0.075 2.27 / 1.00 / 0.68 Lewis-Wester test D (normalized sum of rational fcns) IA64 Athlon 21264A Ratio 0.6 0.369 0.33 1.62 / 1.00 / 0.92 Lewis-Wester test E (normalized sum of rational fcns) IA64 Athlon 21264A Ratio 0.59 0.299 0.29 1.97 / 1.00 / 0.96 Lewis-Wester test F (gcd of 2-var polys) IA64 Athlon 21264A Ratio 0.07 0.036 0.04 1.94 / 1.00 / 1.11 Lewis-Wester test G (gcd of 3-var polys) IA64 Athlon 21264A Ratio 1.97 1.159 1.02 1.70 / 1.00 / 0.88 Lewis-Wester test H (det of 80x80 Hilbert) IA64 Athlon 21264A Ratio 6.49 3.689 4.07 1.75 / 1.00 / 1.10 Lewis-Wester test I (invert rank 40 Hilbert) IA64 Athlon 21264A Ratio 2.43 1.31 1.56 1.85 / 1.00 / 1.19 Lewis-Wester test J (check rank 40 Hilbert) IA64 Athlon 21264A Ratio 1.26 0.62 0.74 2.03 / 1.00 / 1.19 Lewis-Wester test K (invert rank 70 Hilbert) IA64 Athlon 21264A Ratio 15.5 8.62 9.66 1.79 / 1.00 / 1.12 Lewis-Wester test L (check rank 70 Hilbert) IA64 Athlon 21264A Ratio 7.44 3.54 4.02 2.10 / 1.00 / 1.14 Lewis-Wester test M1 (26x26 sparse, det) IA64 Athlon 21264A Ratio 0.34 0.179 0.19 1.90 / 1.00 / 1.06 timing Lewis-Wester test N (poly at rational fcns) IA64 Athlon 21264A Ratio 817.6 674.399 568.7 1.21 / 1.00 / 0.84 timing Lewis-Wester test P (det of sparse rank 101) IA64 Athlon 21264A Ratio 1.45 0.959 0.64 1.51 / 1.00 / 0.67 timing Lewis-Wester test P' (det of less sparse rank 101) IA64 Athlon 21264A Ratio 5.51 3.12 2.42 1.77 / 1.00 / 0.78 timing Lewis-Wester test Q (charpoly(P)) IA64 Athlon 21264A Ratio 111.07 70.18 52.04 1.58 / 1.00 / 0.74 timing Lewis-Wester test Q' (charpoly(P')) IA64 Athlon 21264A Ratio 225.23 151.34 105.65 1.49 / 1.00 / 0.70 Now let's all rush and get ourselves some Athlons for doing computer algebra. If they only had dual boards...

1 0