- GiNaC-list - ginac.de

Include Guards
by Jason Dusek 22 Jan '05

22 Jan '05

In the FAQ, they discuss a problem with multiple inclusions of a header where global symbols are defined: ================================================ Q: I have various modules, some global variables and... A: ...and you are getting weird results with symbols not being identical? Imagine this situation: A file globals.h declares symbol x("x"). Two other modules #include "globals.h", do something with symbol x and return an expression ex containing the symbol to the caller (e.g. to main()). When the caller combines the two expressions there are really two different symbols both with the same print-name x. This may cause terms like x-x to stay around which will never be simplified to 0 because the system has no knowledge that the two symbols are supposed to be the same. How should it? After all the declarations really happend in different compilation units! ================================================ Can include guards solve this problem? Do I *have* to make that evil factory initializer thingy? -- _jason

4 8

pyginac: numeric vs. ex and a failing test case
by Matti Peltomäki 17 Jan '05

17 Jan '05

Hi, Although being mostly about PyGiNaC I send this message on this list since the problem itself has also to do with GiNaC and may be interesting. I've been playing around with PyGiNaC and I accidentally found out, that running bin/check_matricies.py sometimes shows a failing test case, which looks like below (the test case seems to be the same as the one in GiNaC's check/check_matrices.cpp with the same name) -- snip -- Running __main__.funny_matrix_determinants.__doc__ Trying: funny_matrix_determinants() Expecting: 'Funny' matrix determinant test passed. ***************************************************************** Failure in example: funny_matrix_determinants() from line #1 of __main__.funny_matrix_determinants Expected: 'Funny' matrix determinant test passed. Got: Determinant of 5 x 5 matrix [[0,25/9+100/81*a,0,-24/35-6/5*c,24/35+6/5*c],[-5/4*c**(-1)*a*(c+3*a)*(b+a),0,2,0,-5/4*c**(-1)*a*(c+3*a)*(b+a)],[8*b**3*(2.7182818284590452354+1/2*c)*a**(-1),8/49*c*a**(-1),0,0,8*b**3*(2.7182818284590452354+1/2*c)*a**(-1)],[0,0,0,c**(-1)*b**2,-c**(-1)*b**2],[0,0,c*b**(-2),0,0]] was not found to vanish! 'Funny' matrix determinant test failed. -- snip -- I traced this back to sparse_tree() generating sometimes (sub)expressions of the form cos(1), i.e. a function with an argument of type numeric. Trying this out gives >>> from ginac import *; >>> cos(numeric(1)) <cginac.numeric object at 0xb7dda4f4> >>> print cos(numeric(1)) 0.5403023058681397174 >>> so that numerically evaluating the cosine leads to truncation errors and the determinant is no more exactly zero. Now, this evaluation seems to be exactly what GiNaC does if a numeric is given as a parameter to a function. OTOH, if the parameter is an ex, no evaluation occurs, even if the exs wraps a numeric. The following code #include <iostream> #include <ginac/ginac.h> using namespace GiNaC; using namespace std; int main(void) { cout << cos(numeric(1)) << endl; cout << cos(ex(numeric(1))) << endl; return 0; } gives 0.5403023058681397174 cos(1) This does not cause the same failure in the GiNaC test case since sparse_tree returns an ex. However, in PyGiNaC the return value is unwrapped from ex to whatever type it is, and with a numeric, the problem above occurs. So, in the end, I'm left with the situation that I don't know how to symbolically present something like cos(1) in PyGiNaC. Is it possible in some way not obvious to me? Best regards, Matti -- Matti Peltomaki, Undergraduate Research Assistant Laboratory of Physics Helsinki University of Technology 040 7576977, room Y308B

2 1

Python bindings to GiNaC
by Ondrej Certik 13 Jan '05

13 Jan '05

Hello all, I wrote new Python bindings to ginac, because PyGiNaC (http://cens.ioc.ee/projects/pyginac/) seems to be dead and I wasn't able to even compile it. Currently I only support classes: basic, symbol, numeric, ex. But more can be done quite easily, unfortunately I probably won't have time to continue on it. More info at: http://ondrej.certik.cz/pyginac.php Does anyone of you would like to use ginac in python, or does everybody use c++/cint? Yours, Ondrej Certik

4 8

Re: [GiNaC-list] Python bindings to GiNaC
by CRAIGHS＠Nationwide.com 04 Jan '05

04 Jan '05

C++ Ondrej Certik <ondrej(a)certik.cz> T To: ginac-list(a)zino.physik.uni-mainz.de Sent by: cc: ginac-list-admin(a)zino.phys ik.uni-mainz.de bcc: Subject: [GiNaC-list] Python bindings to GiNaC 01/03/2005 08:53 AM Please respond to ginac-list Hello all, I wrote new Python bindings to ginac, because PyGiNaC (http://cens.ioc.ee/projects/pyginac/) seems to be dead and I wasn't able to even compile it. Currently I only support classes: basic, symbol, numeric, ex. But more can be done quite easily, unfortunately I probably won't have time to continue on it. More info at: http://ondrej.certik.cz/pyginac.php Does anyone of you would like to use ginac in python, or does everybody use c++/cint? Yours, Ondrej Certik _______________________________________________ GiNaC-list mailing list GiNaC-list(a)ginac.de http://thep.physik.uni-mainz.de/mailman/listinfo/ginac-list

1 0

indexed
by Andrea Bedini 09 Dec '04

09 Dec '04

Hi, I'm new to ginac, I'd like to know if is it possible to unroll indexed objects. As example, I would like to do something like this a_i a~i = (a_1)^2 + (a_2)^2 + (a_3)^2 + ... or just substituting a_i values in a_i * b~i a_i = =(1,0,0) a_i b~i -> b~1 Thanks a lot for your work.

2 1

Strange behaviour of archive
by Phil Stephens 02 Dec '04

02 Dec '04

I have found the archiving procedure to behave strangely and was wondering if anyone has also seen this or if they know the solution. I am using GiNaC-1.2.1 with cln-1.1.7. This is all compiled with cygwin. What happens is the following. I have a database that I wish to store both the index and the referenced expression in the archive. For small archives the numerical factors on my expressions remain rational and the sqrt's remain un-evalf()'d. Unfortunately, it seems that when my archive gets large the rational expressions and the sqrt()'s evaluate to real numbers. I have done the following to confirm all of this. My software is using the same algorithm with no code changed but using two different models. The models dictate the size of the database. When I save and load with the smaller model, all the rational and sqrts are returned properly. When I do so with the larger model, they all return as real numbers. I have used a viewgar-like program to confirm that they have indeed been saved as real values, rather than the rationals/sqrts for the larger model, but the expressions I give to archive_ex have not been evalf'd. Can anyone explain why this may happen or if this is intentional in the design (speed of archiving for example)? It seems to occur between creating the archive and saving it to a file. It isn't vital to my software, just an aesthetic thing that would be useful for users. Just as an idea (since I don't really know how to 'reproduce' this behaviour) the gar file for two models that work properly are 25KB and 205KB but for the one that doesn't work right it is 1.1 MB. Thanks for any help!

1 0

how to use ginac output in gsl at runtime
by Matei Stroila 21 Nov '04

21 Nov '04

Hello, Here is what I would like to do and I need a piece of advice on this. I want to use ginac to compute the gradient of a function so that I can use this gradient for the conjugate gradient method in gsl (the GNU scientific library). I succesfully computed the gradient and I can output its expression with "csrc_double" to a string. How can I use this expression in the definiton of a function at runtime? I guess other people had this problem too, to use a CAS library in conjuction with a numeric library, at runtime. Thanks a lot for any suggestion, Matei

1 1

code: extended gcd
by Ralf Stephan 20 Nov '04

20 Nov '04

Hello, please include the following snippet. Its application domain depends on that of quo() which is univariate, currently. It is tested but not heavily so. It is not optimized. Thanks, ralf Input: x,y rational polynomials Computes u,v,d such that ux+vy = gcd(x,y). /////////// Extended GCD ex xgcd (const ex& a, const ex& b, ex& u, ex& v, const symbol& s) { const ex& x = a.normal(); const ex& y = b.normal(); if (is_exactly_a<numeric>(x) && is_exactly_a<numeric>(y) && x.info(info_flags::integer) && y.info(info_flags::integer)) { cln::cl_I cu, cv, cr; cr = cln::xgcd (cln::the<cln::cl_I>(ex_to<numeric>(x).to_cl_N()), cln::the<cln::cl_I>(ex_to<numeric>(y).to_cl_N()), &cu, &cv); u = numeric(cu); v = numeric(cv); return numeric(cr); } if (is_exactly_a<numeric>(y) && y.info(info_flags::integer)) { u = 0; v = numeric(1)/y; return 1; } if (is_exactly_a<numeric>(x) && x.info(info_flags::integer)) { v = 0; u = numeric(1)/x; return 1; } if (x.info(info_flags::rational_polynomial) && y.info(info_flags::rational_polynomial)) { ex d, p, q; d = gcd (x, y); int dx = degree(x, s), dy = degree(y, s); if (dx < dy) { p = y; q = x; } else { p = x; q = y; } ex u1,u2,u3,v1,v2,v3,w1,w2,w3; u1 = p; u2 = 1; u3 = 0; v1 = q; v2 = 0; v3 = 1; while (!v1.is_zero()) { ex Q = quo (u1, v1, s); w1 = u1 - Q*v1; w2 = u2 - Q*v2; w3 = u3 - Q*v3; u1 = v1.expand(); u2 = v2.expand(); u3 = v3.expand(); v1 = w1.expand(); v2 = w2.expand(); v3 = w3.expand(); } u = (u2 / ((u1/d).normal())).expand(); v = (u3 / ((u1/d).normal())).expand(); //cerr << "CHK: " << (u*x+v*y).expand() << endl << flush; return d; } throw invalid_argument("xgcd(): not a rational polynomial"); }

4 11

normal() bug-or-feature
by varg＠thsun1.jinr.ru 18 Nov '04

18 Nov '04

Hello! Sometimes running normal() takes *really* long time. I've attached an example, at first glance it looks horrible, but in fact the expression equals zero. The root of the problem seems to be that gcd(e1, e2, &ca, &cb) returns cb in expanded form, as in: #include <iostream> #include <ginac/ginac.h> using namespace std; using namespace GiNaC; int main(int argc, char** argv) { symbol m1("m1"); symbol m2("m2"); symbol x("x"); ex e1 = pow(x,2)*pow(m1,2) - pow(x,2)*pow(m2,2); ex e2 = pow(pow(x,2)*pow(m1,2)-pow(x,2)*pow(m2,2),100); ex ca, cb, gc; gc = gcd(e1, e2, &ca, &cb, false); cout << c2 << endl; // this won't be just x^198*(m1^2-m2^2)^99. // (m1^2-m2^2)^99 gets expanded. cout << (e1/e2).normal() << endl; // won't print just x^(-198)*(m1^2-m2^2)^(-99), // (m1^2-m2^2)^99 gets expanded return 0; } so normal() in fact expands denominators. Is there any way to fix this bug/feature? Thanks in advance, Alexei.

2 2

Usage question
by Michael Ahern 18 Nov '04

18 Nov '04

Hello All, I have been investigating using GiNac to solve certain equations and was unsure of what is was capable of. Although I saw the lsovle() function for solving systems of linear equations, I was baffled as how to solve a non-linear equation of the form: 0 = deriv(sqrt( (X - x*t)^2 + (Y - y*t)^2 + (Z - z*t - Gt^2)^2 )) Alternatively, if it is not capable of solving such an equation, if you knew of a C/C++ library (short of matlab) that was capable. Thanks, -Mike __________________________________ Do you Yahoo!? Meet the all-new My Yahoo! - Try it today! http://my.yahoo.com

2 1