Jaqr

55 Reputation

3 Badges

3 years, 336 days

MaplePrimes Activity


These are replies submitted by Jaqr

@Rouben Rostamian  

You propose a very "radical" solution. Is there a more gentle solution?

Wouldn't Xorg be involved?

 

@Joe Riel 

So, do you think I need to contact the Maple support?

@Joe Riel 

Well, the volume of this partition (let's say A) is ridiculous: a free space of 15Gb for a total of 80Gb. It's a small 80GB partition that is not intended for file storage but is only reserved for the computer's linux operating system and the main softwares. Maple is also on this partition A. I'm going to use Gparted to further increase its volume but I would like to be sure about the diagnosis and how to manage the storage of temporary Maple files on other larger partitions (B, C, etc...) that do not contain the Maple application; the latter remains installed on the small main A partition.

@Carl Love 

I think I'm going to go to bed.

I must be very tired!

 

Thanks and sorry.

Hi,

Here is the code:

restart:
with(DifferentialGeometry):
with(LieAlgebras):
#
DGsetup([seq(cat(x,i),i=1..3)],R):
#
Lie_Generators := [D_x1*x1+D_x2*x2+D_x3*x3, D_x3*x1+D_x1*x3, -D_x1*x2+D_x2*x1, D_x3*x2+D_x2*x3, D_x1, D_x2, D_x3];
#
LieAlg:=LieAlgebraData(Lie_Generators);
#
DGsetup(LieAlg):
#
L:= evalDG([e1+a*e3,2*e2+b*e4,e1+3*e5]);
#
evalDG(add(eval(cat(e,i)),i=1..7));
evalDG(add(eval(L[i]),i=1..7));
evalDG(add(eval(c[i]*L[i]),i=1..7));
#
evalDG(sum(eval(cat(e,i)),i=1..7));
evalDG(sum(eval(L[i]),i=1..7));
evalDG(sum(eval(c[i]*L[i]),i=1..7));
#

 

The command evalDG(add(eval(c[i]*L[i]),i=1..7)); is also important for the sequel of the program I want to write.

Thanks.

Jaqr

@tomleslie 

Hi,

I used the code

L:= [e1+a*e3,2*e2+b*e4,e1+3*e5]

I indicated L= [e1+a*e3,2*e2+b*e4,e1+3*e5] symbollically. This is not the origin of the 'error'.

Jaqr

@Carl Love 

Hello Carl Love,

Sorry about this error: "useless" versus "unnecessary".  As you may have understood, I am not a native English speaker. And furthermore, if I believe some renowned linguists, contrary to what is often said, the English language is in fact a very difficult language to speak properly and one of the most difficult because it is the easiest to speak badly (W. Churchill)!

I remember your remark and I think it will remain engraved in my memory!

Thank you again Carl Love for your attention.

 

@Carl Love 

Hello Carl Love,

You are right.

For the moment, the tests I have done are going well. I think that indeed, the "primpart" is useless. I added it for a reason that I don't remember unfortunately.

 

Thank you very much again.

@Carl Love 

Thank you.

I am still testing the command. Nevertheless, I think it works well. But how can programming be like walking in a mist even with apparently correct commands or procedures.

Sincerely yours!

 

@Carl Love 

I am sorry Carl Love, with the list S :=

S:=[X[1], -X[1], -X[2], -2*X[1]-2*X[3]+X[4], 2*v*X[1]+2*v*X[3]+X[2]];
and V:= {X[1], X[2],X[3], X[4]}

An error occurs. The procedure is unable to evaluate the sign  and the procedure fails to apply. What happens?

I modified your code in such way:

RemoveUncommomFactors:= (S::{set,list}(algebraic), V::set(name))->
    map(primpart@(p-> sign(p)*p)@primpart, S, V):

Is this coherent?

 

Thanks

@Carl Love 

Thank you a lot! I will try to understand the part of code you add: '(p->sign(p,V)*p)@' that is mysterious to me at first sight.

But does it mean that you sequentially apply, first, primpart, and then, the function p -> sign(p,V)*p ?

I ignored that operator @. I learn!

Thank you again "Carl Love" !

@Carl Love 
Great! Thanks a lot. Anyway I found that un minus sign remains in some cases. It does not operate with the simple set S:={X,-X}...

Not easy!

@Carl Love 

Hello,

Thank you for your response. I will take your remarks into account in the future.

I will therefore answer your questions. In fact, I have polynomials with two categories of variables:

Category 1: the variables X1, X2,..., XN,

and a second category: the variables U1, U2,..., UK.

These polynomials are on the field of reals.

 I then consider the polynomials of the variables of category 1 having polynomial coefficients with the variables of the second category.

At the end of my calculations, I obtain sets or lists of such polynomials, and in these sets or lists there are redundancies from the point of view of the polynomials in the variables of category 1. More precisely, I obtain polynomials that differ only by one factor belonging to the polynomials in the variables of category 2. I would like to keep only the common polynomial part in the variables of category 1.

For example:

(3*U2-U4^4)*(X1+ U1^2*X2-(3*U2-1)*X3^2)

and


(4*U1-5*U2^2+U4)*(X1+ U1^2*X2-(3*U2-1)*X3^2)

I would then like to keep in my list or set only the polynomial:

(X1+ U1^2*X2-(3*U2-1)*X3^2).

Is my precision appropriate?

Thank you in advance.

@Mac Dude 

Hello!

Thank you for your answer.
I'm on Mac and using the "Preview" software allows conversion of png files to eps format via the file printing service.


It is a somewhat wobbly solution to say the least.

I'll do like you: do the figures with Mathematica, exponentially slower than Maple unfortunately. My image files take 10 times longer to be generated with Mathematica than with Maple.....: 3 minutes with Maple, half an hour with Mathematica...

Mathematica's "broom car" Maple problems...!

I can't believe Maple isn't solving this problem.

Thank you again.

Jaqr

@vv 

Hello

Thank you very much, unfortunately I forgot to say I'm on Mac. Nevertheless, I tried your procedure with a path in my user folder. It does not work. No files are registered.

Thank you again.

 

Jaqr

1 2 Page 1 of 2