MaplePrimes Questions

Hello.

I want to use units in my calculations, but i recieved an error. I have attached my file. Could you please help me to solve it?

Thank you.

Download Prestressed_Concrete.mwPrestressed_Concrete.mw

A calculation I am currently doing has gotten to the stage where the time taken to integrate is just too much.
I have attached a minimal working example Maple script showing an example of the integration which is very messy. When this is run it takes ~ 10 seconds on my machine which is no issue. However the polynomial sum in this example is only a small version, and it can get, much, much larger. To the point it takes over a day to calculate (but it does evaluate).

The reason for this is that the boole integration method does not scale well with more terms in the sum. It beats the other methods for small sums (like in the example) but when the sum gets larger is not that good. The Riemann method appears to be the best for larger sums, but once again is still slow.

Is there any way to speed this up? As the Boole method is fast for this example and gives a good answer, I was thinking to break the much larger sums into smaller seperate sums and then process them all seperately with the Boole method and add up all the results?

Large_sum_integration.mw

 

Any feedback would be appreciated :)

Hello,

I would like to simplify a trigonometric equation that I obtain with a vectorial closure (in mechanics)

Here the equation that I would like to simplify 

eq_liaison := (-sin(p(t)+g(t))*cos(a(t))-sin(b(t))*sin(a(t))*cos(p(t)+g(t)))*l2[1]+((-sin(p(t)+g(t))*cos(a(t))-sin(b(t))*sin(a(t))*cos(p(t)+g(t)))*cos(th(t))+(-cos(p(t)+g(t))*cos(a(t))+sin(a(t))*sin(b(t))*sin(p(t)+g(t)))*sin(th(t)))*l3[1]+(-sin(a(t))*sin(g(t))*sin(b(t))+cos(a(t))*cos(g(t)))*xb[1]+sin(a(t))*cos(b(t))*yb[1]+(sin(a(t))*sin(b(t))*cos(g(t))+cos(a(t))*sin(g(t)))*zb[1]+x(t)-xp(t) = 0

Do you have ideas so as to simplify again this expression ?

This expression can still be simplified. You can find here the result expected :

 

I find surprising that I have so many difficulties to make trigonometric simplications with the trigonometric functions.

I attached the code 

Download TrigoTransformVectorialEquations.mwTrigoTransformVectorialEquations.mw

Thank you for your help

The solution should show the procedure.
But without tutor.

 

Problem.mw

 

Atte.

Lenin Araujo Castillo

 

Hi everyone, I got a problem. I'm a new user and I'm getting to know this beautiful software.

The problem is that when I enter a function in math mode (the easyest with simple inputs I guess), once I right click and plot only the cartesian plot is shown, without the actual function. 

What should I try? Math without plots is boring... :)

 

Thank you!

Hello

I am new to Maple. I am solving the differential equation with the given initial condition. I am getting some error. Can anyone help me please.

 

Thanks

maple_help.mw

I have the following question:

Illustrate how the sequence N->R de fined by n ->n^2/n^2 + 31n + 228 can be shown to be
within a given epsilon > 0 of its limiting value x0.
(a) use an appropriate conditional statement to find N such that abs (xn -􀀀 x0) < epsilon for every n>=N
and produce an appropriate list of the data points (n,xn) to illustrate
this

I found N but without using any CONDITIONAL STATEMENT.Can you help me find N using IF FOR WHILE?

Hello All,

 

I am running Maple 18 on Ubuntu 14.04.4 with x86_64 architecture. When running the xmaple command for a specific user, the java loading window takes about 5-10 minutes to appear. With other users, it takes around 15 seconds. All users are running the same xmaple script, I did not see and conflicting environment variables.

 

I was wondering if the community had any other ideas as to what could be causing this slow response?

 

Thank you in advance,

Michael

 

 

 

 

 

 

Hello,

I receive this message when I try to store the package that I have created as a table

 

Do you have some ideas how I can correct my code so as to store efficiently my package ?

Thanks a lot for your help

Consider the following:

conv1 := (x) -> eval(x, tau*f(t) = f(-t)):     # Using eval
conv2 := (x) -> algsubs(tau*f(t) = f(-t),x):   # Using algsubs
expr := Vector([
     tau*f(t),
   I*tau*f(t)
]);
conv1(expr),
conv2(expr);

I would have expected both components of expr to have been transformed, just as they do if algsubs is used, but the second component containing the imaginary unit I as well is not. Why not? Note that if I is replaced by any real number, then the substitution works quite as expected. Why should going from real to complex numbers change things fundamentally?

Additional note: Even though algsubs works above, I would like to avoid using it because the actual system I have contains more than a hundred substitutions to (potentially) be made, and algsubs can only take one at a time, in constrast to eval which in principle can take indefinitely (though finitely, of course) many at a time.

PS: In case the reader is wondering, tau is supposed to be a time reversal operator acting on some time-dependent function f(t).

 

I have an equation as shown below.  In this i need to get the value of 'a' for each 'omega'.  'omega' range from 0 to 2 with increment 0.01

And save all the values of 'a' as a column matrix named 'result'.

 

!!!  Please help  !!!

0.4e-3*a^2*omega^2+(-2.1739*a+a*omega^2+(1.495414012*(sqrt(a^2+.2916)*EllipticE(sqrt(a^2/(a^2+.2916)))-.2916*EllipticK(sqrt(a^2/(a^2+.2916)))/sqrt(a^2+.2916)))/a)^2-0.1e-3 = 0

 

Download problem_1.mw

 

 

Hello,

In a worksheet, I have defined several long procedures. In order to simplify my worksheet, I would like define thes procedures in a package so as to call theses procedures from the package. It should enable to improve the readability of my worksheet.

However, i have never make a custom package. Can you detail me the main steps so as to create a custom package ?

Thanks a lot for your help.

 

I am interested in efficiently plotting a grid of squares where each square is coloured. 

 

From what I understand I can do this using plotting primitives. For example,

P1 := Array( 1..4, 1..2, [[0,0],[1,0],[1,1],[0,1]],storage=rectangular, order=C_order, datatype=float[8] );

P2 := Array( 1..4, 1..2, [[1,1],[2,1],[2,2],[1,2]],storage=rectangular, order=C_order, datatype=float[8] );

PLOT( POLYGONS(P1,P2), COLOUR(RGB,1,0,0,0,1,0)  );

plots one red and one green unit sqaure.

 

I am interested however in plotting millions of squares.  Is there a way to efficiently store the sequence required for the POLYGONS and COLOUR primitive?  Ideally I want to store them as arrays.

Dear All

Is there anybody who is working on contruction of optimal Lie algebra using Maple packages like DifferentialGeometry and LieAlgebra, I tried to find commands for constructing algebra in these packages but could not find such commands. I am sure these are only package that might help me. Following is Lie algebra whose optimal system is required:

 

with(PDEtools, SymmetryCommutator, InfinitesimalGenerator):

S[1], S[2], S[3], S[4], S[5], S[6], S[7], S[8], S[9], S[10], S[11] := [_xi[x] = 0, _xi[y] = 0, _xi[t] = 0, _eta[u] = 0, _eta[v] = 1], [_xi[x] = 0, _xi[y] = t, _xi[t] = 0, _eta[u] = 0, _eta[v] = x], [_xi[x] = 0, _xi[y] = y, _xi[t] = 2*t, _eta[u] = -2*u, _eta[v] = -v], [_xi[x] = 0, _xi[y] = 0, _xi[t] = 0, _eta[u] = 0, _eta[v] = t], [_xi[x] = 0, _xi[y] = 0, _xi[t] = 0, _eta[u] = 1, _eta[v] = y], [_xi[x] = 0, _xi[y] = 0, _xi[t] = 1, _eta[u] = 0, _eta[v] = 0], [_xi[x] = 1, _xi[y] = 0, _xi[t] = 0, _eta[u] = 0, _eta[v] = 0], [_xi[x] = t, _xi[y] = 0, _xi[t] = 0, _eta[u] = 1, _eta[v] = 0], [_xi[x] = y, _xi[y] = 0, _xi[t] = 0, _eta[u] = 0, _eta[v] = 2*x], [_xi[x] = x, _xi[y] = 0, _xi[t] = -t, _eta[u] = 2*u, _eta[v] = 2*v], [_xi[x] = 0, _xi[y] = 1, _xi[t] = 0, _eta[u] = 0, _eta[v] = 0]

[_xi[x] = 0, _xi[y] = 0, _xi[t] = 0, _eta[u] = 0, _eta[v] = 1], [_xi[x] = 0, _xi[y] = t, _xi[t] = 0, _eta[u] = 0, _eta[v] = x], [_xi[x] = 0, _xi[y] = y, _xi[t] = 2*t, _eta[u] = -2*u, _eta[v] = -v], [_xi[x] = 0, _xi[y] = 0, _xi[t] = 0, _eta[u] = 0, _eta[v] = t], [_xi[x] = 0, _xi[y] = 0, _xi[t] = 0, _eta[u] = 1, _eta[v] = y], [_xi[x] = 0, _xi[y] = 0, _xi[t] = 1, _eta[u] = 0, _eta[v] = 0], [_xi[x] = 1, _xi[y] = 0, _xi[t] = 0, _eta[u] = 0, _eta[v] = 0], [_xi[x] = t, _xi[y] = 0, _xi[t] = 0, _eta[u] = 1, _eta[v] = 0], [_xi[x] = y, _xi[y] = 0, _xi[t] = 0, _eta[u] = 0, _eta[v] = 2*x], [_xi[x] = x, _xi[y] = 0, _xi[t] = -t, _eta[u] = 2*u, _eta[v] = 2*v], [_xi[x] = 0, _xi[y] = 1, _xi[t] = 0, _eta[u] = 0, _eta[v] = 0]

(1)

G[1] := InfinitesimalGenerator(S[1], [u(x, y, t), v(x, y, t)]); 1; G[2] := InfinitesimalGenerator(S[2], [u(x, y, t), v(x, y, t)]); 1; G[3] := InfinitesimalGenerator(S[3], [u(x, y, t), v(x, y, t)]); 1; G[4] := InfinitesimalGenerator(S[4], [u(x, y, t), v(x, y, t)]); 1; G[5] := InfinitesimalGenerator(S[5], [u(x, y, t), v(x, y, t)]); 1; G[6] := InfinitesimalGenerator(S[6], [u(x, y, t), v(x, y, t)]); 1; G[7] := InfinitesimalGenerator(S[7], [u(x, y, t), v(x, y, t)]); 1; G[8] := InfinitesimalGenerator(S[8], [u(x, y, t), v(x, y, t)]); 1; G[9] := InfinitesimalGenerator(S[9], [u(x, y, t), v(x, y, t)]); 1; G[10] := InfinitesimalGenerator(S[10], [u(x, y, t), v(x, y, t)]); 1; G[11] := InfinitesimalGenerator(S[11], [u(x, y, t), v(x, y, t)])

proc (f) options operator, arrow; diff(f, v) end proc

 

proc (f) options operator, arrow; t*(diff(f, y))+x*(diff(f, v)) end proc

 

proc (f) options operator, arrow; y*(diff(f, y))+2*t*(diff(f, t))-2*u*(diff(f, u))-v*(diff(f, v)) end proc

 

proc (f) options operator, arrow; t*(diff(f, v)) end proc

 

proc (f) options operator, arrow; diff(f, u)+y*(diff(f, v)) end proc

 

proc (f) options operator, arrow; diff(f, t) end proc

 

proc (f) options operator, arrow; diff(f, x) end proc

 

proc (f) options operator, arrow; t*(diff(f, x))+diff(f, u) end proc

 

proc (f) options operator, arrow; y*(diff(f, x))+2*x*(diff(f, v)) end proc

 

proc (f) options operator, arrow; x*(diff(f, x))-t*(diff(f, t))+2*u*(diff(f, u))+2*v*(diff(f, v)) end proc

 

proc (f) options operator, arrow; diff(f, y) end proc

(2)

``

 

Download Lie_Algebra_Classification.mwLie_Algebra_Classification.mw

   
 

 

 

   

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(2)
 

``

Regards

Hello, guys

         I am a totally new comer in this erea. I get a new module file and want to implement it into maple,here is the link:

         http://cpc.cs.qub.ac.uk/summaries/ADWE

         After I downloaded the package, I didn't know the next step and I can't find a perfect solution to this case, maybe it is too easy.

         Can some cool guys can help me, THX.

First 1155 1156 1157 1158 1159 1160 1161 Last Page 1157 of 2434