- GiNaC-list - ginac.de

Ginac not collecting terms when multiplying powers (bug?)
by Jonathan Mills 20 Jul '15

20 Jul '15

Hello Consider this short programme: #include <iostream> #include <ginac/ginac.h> using namespace std; using namespace GiNaC; int main() { possymbol x("x"); cout << pow(4,x + 1) * pow(4,-1) << endl; } The result produced is: 1/4*4^(1+x), the expected output is 4^x. I can see that the documentation says these types of situations will only be handled if it is "safe", but having specified x as a positive value, I'm confused why this expression is not considered safe? All the best Jonathan

2 1

ginsh - p=1-norm of vector possible?
by Michael Lenz 07 Jul '15

07 Jul '15

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Hello everybody, for an ongoing research project I need to (auto-)generate an equation for a ILP that involves some fiddling with matrices, vectors and scalars, and finally taking the "p=1-norm" (or "1-norm", "sum-norm", ...) in order to retrieve my desired equation. Is there any chance I can trick ginsh into performing this operation or do I have to implement it in C++? Yours, Michael Lenz PS: I'd like to use ginsh in order to have my project's workflow as modular as possible -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQEcBAEBCAAGBQJVm5lYAAoJEMIC8hvSujFKvhgH/0prTe2zqjHieyaWM/ECVXBT leEGNVm9LuvS0f1tKDH40S6zlDzUU5qqwyjoMn+EbNzksCDixFiraqn6wp2fBRPI /i8qbsnGzh1QG6uDMkF3mxbM2P8Jor6tTDLlgzDgM9QU/pAKnthbmryrDXjt3bzR /2SfnhEdxMqzypbotCVGKuSu0Fdu+g3zWyp6yggwvMAo1LWtzW9tdO64v0+t+RpL jZpBmTtIei16RvBUxQF307GSybFlCX9kqWXPjATwixloPkyo4yJ3Dz/1uzos49OL JRUuYgP7gxCZrEDuUiOKOLKM3GFu6Z5MobcU5ReqVuYaXsCpxvwZkqF3vl5m/To= =eNjo -----END PGP SIGNATURE-----

1 0

Release 1.6.4
by Richard B. Kreckel 08 May '15

08 May '15

Hi, A new GiNaC release is out and available. These are the changes: * Fixed pow(+(...),2).expand() where the sum contained roots of rationals. * Various improvements for info(info_flags::nonnegative). * Make power::expand() (x*p)^c -> x^c * p^c, if p>0. * Fixed normal() where nested functions occur multiple times. * Add optional explicit derivatives to functions and use it in abs(), imag_part(), real_part(). * Evaluate abs(z)^(2n) -> z^n * conjugate(z)^n. Happy hacking -richy. -- Richard B. Kreckel <http://in.terlu.de/~kreckel/>

1 0

Bug in expand
by Isuru Fernando 07 May '15

07 May '15

Hi, I modified the first benchmark at http://www.ginac.de/csSC-0004015.pdf to, e = expanded value of (a0 + a1 + sqrt(3)*a2 + sqrt(3)*a3 + ... + sqrt(3)*a(n-1))^2 in e, substitute a0 with -sqrt(3)*a2 - sqrt(3)*a3 - ... - sqrt(3)*a(n-1) expand e again to obtain a1^2 For n = 4, I get, -3*a3^2+2*3*a2^2+a1^2-6*a2^2+3*a3^2 Or 3*a3^2-3*a2^2-3*a3^2+a1^2+3*a2^2 which is true, but not the expression I expected. Why are the terms 3*a2^2 and -3*a2^2, not canceled out immediately? Also a term like 2*3*a2^2 means there is some bug right? I am using ginac-1.6.3 on Ubuntu 14.10 with gcc-4.9.1. I am attaching the sample program. Isuru Fernando

2 1

compile_ex with more than two symbols in the expression
by William Silva 01 May '15

01 May '15

Dear all, Is there a way to use "compile_ex" with more than 2 free variables? I am generating several expressions using .diff() and would like to compile them into C functions and attach function pointers. Using the .subs() method is too slow for my code. Unfortunately my expressions contain more than just two symbolic variables. Ideally I would love to have a FUNCP_nP typedef that can accept a list or array of n symbolic variables and use a compile_ex function that accepts an lst of the symbols. I noticed that the FUNCP_CUBA typedef sort of does this, but I am not sure how to access the compiled function. Any help or pointers would be greatly appreciated! Best, Will S.

2 2

Re: [GiNaC-list] [GiNaC-devel] Symbolic Integration of exponential functions
by Matthias Reis 27 Apr '15

27 Apr '15

Dear Matthias, thanks a lot for your work. However, I have implemented a numeric workaround that does not need symbolic integration a few weeks ago. Since this approach works and I am running out of time with my PhD, I will unfortunately not be able to look further into ginac. At some point in the future maybe. Best regards and thanks again, Matthias Am Mon, 27 Apr 2015 16:27:43 +0200 schrieb Matthias Dellweg <dellweg(a)tp1.uni-duesseldorf.de>: > Am Mon, 27 Apr 2015 11:37:39 +0100 > schrieb "Vladimir V. Kisil" <kisilv(a)maths.leeds.ac.uk>: > > > Dear All, > > > > What is easy to do is to add to function class a primitive > > feature analogously to their knowledge of derivatives. Then, > > integral::eval_integ() may call such methods to evaluate simple > > integrals of plain functions. > > > > If this looks reasonable to be included in GiNaC, then I may write > > such a patch. > > > > Best wishes, > > Vladimir > > >>>>> On Sat, 14 Mar 2015 17:35:10 +0100, Matthias Reis > > >>>>> <matthias.reis(a)biologie.hu-berlin.de> said: > > > > MR> Dear all, as far as I understand, ginac cannot integrate > > MR> anything other than polynomials. How hard would it be (for > > MR> me maybe) to implement exponentials? What needs to be done? > > MR> This feature would be great for me. I just need to > > MR> integrate simple e^{x * constant} terms. > > > > MR> Best regards, Matthias > > Dear Matthias, > i have an implementation ready that integrates expressions like > step(x-a)*x^5*exp(b*x). > You can find it at https://bitbucket.org/mdellweg/ginac.git . > It just can not be done in the way described above, since it needs to > know stuff outside of exp(...). > I would love to hear comments on this. > Kindest regards, Matthias

1 0

Symbolic Integration of exponential functions
by Matthias Reis 27 Apr '15

27 Apr '15

Dear all, as far as I understand, ginac cannot integrate anything other than polynomials. How hard would it be (for me maybe) to implement exponentials? What needs to be done? This feature would be great for me. I just need to integrate simple e^{x * constant} terms. Best regards, Matthias

2 1

Re: [GiNaC-list] Piecewise function
by Vincent Huber 22 Apr '15

22 Apr '15

Dear Dr. Kisil Thank you for your answer I'll carefully read. Pr. C. Prud'homme has hacked our GiNaC fork to let people use this kind of expression. https://github.com/feelpp/feelpp/commit/547c08b66e5b6019ab258477ab19a329cdf… Now, the one that parse the string "(x<0.5)*1000+(x>0.5)*10:x:y" will find in the source file: f[0] = 10.0*(a[0]>5.0000000000000000e-01)+1000.0*(a[0]<5.0000000000000000e-01); Thank again for your quick answer ! All the best, VH 2015-04-22 18:50 GMT+02:00 Vladimir V. Kisil <kisilv(a)maths.leeds.ac.uk>: > Dear Vincent, > > You are right that GiNaC expression do not admit boolean > terms directly. However with your example you can proceed as follow (I > do understand that your actual target is much more complicated): > > 1. Use the step function from GiNaC: > > f=2*x*step(x)+3*x*step(-x). > > [but for x=0 you need take care as step(0)=.5] > > Of course, if you have a hundred points where the function changes the > expression, this becomes much more complicated > > 2. Define your own function of three variables S(a,b,x) such that > S(a,b,x)=1 for a<x<b and zero otherwise. GiNaC tutorial > contains a demonstration how make a user-defined function. Then, any > piece-wise function F will be a sum of terms f_i(x)*S(a_i,_b_i,x) > where f_i is the expression for F on [a_i,b_i] (assuming disjoint > partition. > > 3. Finally, you may derive your own class from GiNaC::basic to hold > your piece-wise function (again, GiNaC tutorial gives an example). As > I see it shall have two lists: one with points of the partition, > another with the respective expression. Then you add your custom > methods to operate this class. > > > The approaches are given in the order of increasing complexity, but > the efficiently shall grow in the same direction. > > Best wishes, > Vladimir > -- > Vladimir V. Kisil http://www.maths.leeds.ac.uk/~kisilv/ > Book: Geometry of Mobius Transformations http://goo.gl/EaG2Vu > Software: Geometry of cycles http://moebinv.sourceforge.net/ > >>>>> On Wed, 22 Apr 2015 16:47:13 +0200, Vincent Huber < > vincent.huber(a)cemosis.fr> said: > > VH> Hello Dr. Kisil, > > VH> The question from C. Trophime is not about evaluating the > VH> function but to define it. Feel++ <http://www.feelpp.org> is a > VH> Finite Element library that main goal is to solve the > VH> variational problem a(u,v)=f(v) that arises from a lot of > VH> physical problems. > > VH> We use GiNaC to dynamically define the right hand side of our > VH> problem, or our boundaries conditions and whatever can be > VH> expressed with it. > > VH> The question - I guess - can be explained like that : I would > VH> like to define > > VH> - > > VH> f(x) = 2*x if x>0 - > > VH> f(x) = 3*x if x<=0. > > VH> Thus, basically, I would like to write > > > VH> ex MyEx = (x<=0)?3*x:2*x > > VH> To my best knowledge, boolean expression are not handled in > VH> GiNaC, isn’t it ? > > VH> all the best, > > VH> Vincent H. -- Docteur Ingénieur de recherche CeMoSiS > VH> <http://www.cemosis.fr> - vincent.huber(a)cemosis.fr Tel: +33 (0)3 > VH> 68 8*5 02 06* IRMA - 7, rue René Descartes 67 000 Strasbourg > > VH> ---------------------------------------------------- > VH> Alternatives: > > VH> ---------------------------------------------------- > VH> _______________________________________________ GiNaC-list > VH> mailing list GiNaC-list(a)ginac.de > VH> https://www.cebix.net/mailman/listinfo/ginac-list > -- Docteur Ingénieur de recherche CeMoSiS <http://www.cemosis.fr> - vincent.huber(a)cemosis.fr Tel: +33 (0)3 68 8*5 02 06* IRMA - 7, rue René Descartes 67 000 Strasbourg

1 0

Piecewise function
by Vincent Huber 22 Apr '15

22 Apr '15

Hello Dr. Kisil, The question from C. Trophime is not about evaluating the function but to define it. Feel++ <http://www.feelpp.org> is a Finite Element library that main goal is to solve the variational problem a(u,v)=f(v) that arises from a lot of physical problems. We use GiNaC to dynamically define the right hand side of our problem, or our boundaries conditions and whatever can be expressed with it. The question - I guess - can be explained like that : I would like to define - f(x) = 2*x if x>0 - f(x) = 3*x if x<=0. Thus, basically, I would like to write ex MyEx = (x<=0)?3*x:2*x To my best knowledge, boolean expression are not handled in GiNaC, isn’t it ? all the best, Vincent H. -- Docteur Ingénieur de recherche CeMoSiS <http://www.cemosis.fr> - vincent.huber(a)cemosis.fr Tel: +33 (0)3 68 8*5 02 06* IRMA - 7, rue René Descartes 67 000 Strasbourg

2 1

Piecewise function
by Christophe Trophime 12 Mar '15

12 Mar '15

Hi, I am using GiNac within a Finite Element Library Feel++. I would to define piecewise function in GiNaC. Is this possible with latest version? Thank for any hints Best regard C. Trophime Christophe TROPHIME Research Engineer CNRS - LNCMI 25, rue des Martyrs BP 166 38042 GRENOBLE Cedex 9 FRANCE Tel : +33 (0)4 76 88 90 02 Fax : +33 (0) 4 76 88 10 01 Office U 19 M@il : christophe.trophime(a)lncmi.cnrs.fr

2 1