Hello,

I've written a code that I'd ultimately like to process in parallel over a grid of parameters, but before I can even think of doing that, I need to find a workaround for the memory allocation issues I'm having. Probably due to the way that it's written, Maple's built in garbage collection isn't working very well (if at all), and the code allocates another 100 MB or so every 10,000 iterations. Even if I content myself with running it for say 200,000 iterations,...

Hi, I have created over time a module with a number of procedures that are useful for me for certain calculations.

From time to time I am adding new stuff to it. Now I find that the thing has gotten long enough that (a) I need to do a lot of scrolling and (b) I forget where exactly certain procedures are in the file.

So I was trying to put in bookmarks that e.g. could carry the names of procedures, or sections of the whole thing. But Maple refuses to put more...

For the last few releases of Maple, we have been adding features to take advantage of multi-core processors.  Most of this work has focused on particular algorithms or on tools that allow users to author their own parallel code.  Although this was very useful for those users who were able to use those tools, many users did not see a performance improvement.  To help all users we need to integrate parallelism into the core algorithms of Maple.  In Maple 17 we have taken the first step towards general parallelism in the core algorithms by implementing a parallel garbage collector.

Could you please look at the following piace of code:

>assume(d::complex):
>z:=t=a/d:
>additionally(d≠0):
>z:=z*d;

The result of last command is

z:=d~t=d~*a/d~

that is not z:=d~t=a.

If I skip the command additionally(d≠0): then everything is good. However I need this command. Could you help to handle this problem?

amu^4+bmu^3+cmu^2+dmu+e=0

The unknown is mu

> int(abs(x), x = -1 .. 1);
                               1
> int(sign(x)*abs(x), x = -1 .. 1);
                               1
> int('sign(x)'*abs(x), x = -1 .. 1);

I would uninstall maple but i get the following error:

java.lang.IllegalArgumentException: No product for ID=16000347-aaa2-0000-99a9-b0cb0eddf46e

                at ZeroGgv.<init>(DashoA10*..)

                at ZeroGf3.c(DashoA10*..)

               ...

   Let GL(2,Z) be the  group of all the matrices of dimension 2 over the integers with the determinant equal to +/-1.
   A matrix M in GL(2,Z) is called primitive if M is not equal to K^n for any K in GL(2,Z) and any positive integer n >= 2.
   Is the matrix M:= Matrix([[27,5],[11,2]]) primitive? How to determine it in Maple?

Edit. GL(2,Z) instead of UL(2,Z).

I'm branching-off because I can't currently add a comment to the OP nor a reply to the follow-up messages (mapleprimes update bug so far confirmed with Opera, Firefox, and Chrome on both Windows7x64 and kUbuntu12). Mapleprimes administrators: feel free to move this post to where it belongs.

I think this is an awesome demonstration of Maple's plotting abilities. The first thing that comes to mind is that this worksheet could be used to promote the new Maple Player. 

I'm branching-off because I can't currently add a comment to the OP nor a reply to the follow-up messages (mapleprimes update bug so far confirmed with Opera, Firefox, and Chrome on both Windows7x64 and kUbuntu12). Mapleprimes administrators: feel free to move this post to where it belongs.

I think this is an awesome demonstration of Maple's plotting abilities. The first thing that comes to mind is that this worksheet could be used to promote the new Maple Player. 

Hello

I am solving an equation that has two piecewise functions on it. It seems that Maple ignore the second piecewise. If I include it or remove it  I will get the same solution. I tried to fix the problem but still cannot figure out why Maple ignores it.

This is Maple code:

restart;

with(plots);

with(DEtools);

eq := diff(x(t), t) = -piecewise(abs(x(t))-.5 > 0, abs(x(t))-.5, 0)-piecewise(0 > x(t) and x(t) > 1, 0, x(t) > 1, 1);

Salut,

Il est clair que la multiplicité d'intersection des courbes C1:=x^2-y*(x+y^2) et C2:=x*(x+y^2) au point (0:0:1) est égale à 7 ; I(C1,C2,(0:0:1))=7.

Mais l'extension student[intercept] fournie que 4 solution :

> with(student):
>            
> C1:=x^2-y*(x+y^2):
> C2:=x*(x+y^2):
> intercept(C1=0,C2=0,[x,y]);

   [[x = 0, y = 0...

Hello.

I have following peace of code:

>restart;
>assume(a::complex);
>z1:=t=conjugate(a)*b;
>z2:=a^2;
>a:=solve(z1,a);
>z2;

I need to get (conjugate(t))^2/b as a result of last operation but get a~^2. What do I have to change in code? Of course, I can skip

>assume(a::complex);

and it will get me exactly what I need. But I have to use this command for other reasons.

Thank you.

######################################

Hello,

First of all I just want to say that your forum is great and it helped me to find a lot of new stuff for Maple. I am yet still a beginner but …we all need to learn. So let’s get to my question. I have an equation with 2 variables - x and y. This is the equation

x = y*(25+2*x)^(2/3)/(25*(.566*(25*x)^(2/3)))

So… I know I can solve the equation for x and y and I can give it specific values for y and it solve it every time. When,...

Dear all,

I’m a beginner in Maple and I have problem in understanding the RootOf

my equations are shown below:

M1alone := (1/2)*hs*fm*sigma*mu/(Ps*sqrt(sqrt(M1/h0)/Ps+ts))-As*h0*mu^2/M1 = (1/2)*hs*mu^2/Ps-(1/2)*hs*mu:

> M1sol := isolate(M1alone, M1);

M1 = Ps^2*(-ts+RootOf((-hs*mu*Ps+hs*Ps^2)*_Z^5+hs*fm*sigma*_Z^4*Ps+(-2*hs*Ps^2*ts+2*hs*mu*ts*Ps)*_Z^3-2*hs*fm*sigma*ts*Ps*_Z^2+(hs*Ps^2*ts^2-2*As*mu-hs*mu*ts^2*Ps...