MaplePrimes Questions

OK, I want to plot 10-15 curves on the same coordinate system P. I generate and put the equations of said curves in an array with a procedure, but when plotting the array, I receive an array of plots, instead of the 10 curves on one coordinate system. Any ideas how can I do that?

 

The obvious solution, something like P:=plot (something) Q:=plot(other thing) display({P,Q}) obviously doesn't work for me.

the goal is write a for loop to iterate and get the power of a variable with degree function

i use nops and convert(F, list) can access each terms and variables

however y^2 can be convert to list [y,2] 

hope to add if condition to stop convert this.

how to do better?

i just guess...

r-x^4
u-(x^3)*y
v-x*y^3
w-y^4

Step 1
with(Groebner):
K := {r-x^4,u-(x^3)*y,v-x*y^3,w-y^4};
G := Basis(K, 'tord', degrevlex(r,u,v,w));

Step 2
G intersect k[r,u,v,w]

G2 := Basis({w*G[1],w*G[2],w*G[3],w*G[4],w*G[5],w*G[6],w*G[7],w*G[8],w*G[9],w*G[10],w*G[11],w*G[12],w*G[13],w*G[14], (1-w)*K[1], (1-w)*K[2], (1-w)*K[3], (1-w)*K[4]}, 'tord', degrevlex(r,u,v,w));

G2 has too much though include the correct solution

correct solution...
g1 := x^2-w*y;
g2 := x*y-w*z;
g3 := y^2-x*z;
S12 := SPolynomial(g1, g2, plex(x, y, z, w));
eq1:= S12 = u1*g1 + u2*g2 + u3*g3;
with(LinearAlgebra):
T:=GenerateMatrix([eq1],[u1,u2, u3],augmented);
S:=LinearSolve(T,free=t);

(u1,u2,u3) should be (0,0,-w);
 
the goal is find a u1,u2,u3 to make eq1 equal S12, where u1,u2,u3 should be in terms of x y z w
g3 := y^2-x*z;
X3 := LeadingPowerOfProduct(g3, plex(x,y,z,w));

X3 should be y^2

I noticed in math mode the alt windows shortcut codes won't work but in text mode it will, understandably.

ie.  alt-0125 }   alt-0254 þ   etc...

Is there a way to get maple to output the list of alt codes?

I am doing an algorithm that include a " for " loop, inside that loop in the first statement I assigned a certain matrix to a variable G and then the algorthim changes some elements in G but when the algorithm repeat the second step of the loop it uses the last resulted matrix of the previous step NOT the one that is defined in the first statement of the loop. I want it to start each step of the loop with the same value of the matrix. what should I do?

3*rho1 - 2*rho2 + rho3 - rho4 = -1

4*rho1 +   rho2 - rho3        = 5

original without cost function:

with(Groebner):
K := {y1-(x1^3)*(x2^4),y2-(x2^(1+2))*(w^2),y3-(x1^(1+1))*(w^1),y4-(x2^1)*w,(y1^1000)*(y2^1)*(y3^1)*(y4^100)- x1*x2*w + 1};
G := Basis(K, plex(x1, x2, w, y1, y2, y3, y4));
Reduce((x2^(5+1))*(w^1), G, plex(x1, x2, w, y1, y2, y3, y4));

after have cost function 1000*rho1 + rho2...

with(Groebner):
K := {y1-(x1^3)*(x2^4),y2-(x2^(1+2))*(w^2),y3-(x1^(1+1))*(w^1),y4-(x2^1)*w,x1*x2*w - 1};
G := Basis(K, plex(x1, x2, w, y1, y2, y3, y4));
Reduce((x2^(5+1))*(w^1), G, plex(x1, x2, w, y1, y2, y3, y4));
(1,1,0,2)

subs({rho1=1,rho2=1,rho3=0,rho4=2},3*rho1 - 2*rho2 + rho3 - rho4);
subs({rho1=1,rho2=1,rho3=0,rho4=2},4*rho1 +   rho2 - rho3       );

can also reduce with G8,G7

R1 := Reduce((x2^(5+1))*(w^1), {G[7...

I was trying to solve for the equilibrium points for a system of differential equations.  Solving for the last equation, I encountered an error that I can't seem to find anywhere else.  "Error, (in Engine:-Dispatch) not implemented yet: 13". The code is below if anyone wants to take a go a figuring what's up.  Thanks!

 

A:=Asource/muA;
Asource
-------
muA

(I'm french, scuse me about my bad english)

 

 

Hi everyone, 

 

I'm new with maple and I have a big question. I tried really hard for 2 days to find the answer but... 

 

My problem it's really simple, i think...

this is the end of the program where is my problem:
      dsn1 := dsolve(dfin, numeric); 
      dsn1(1);
      proc(x_rkf45)  ...  end;

Here is my sheet. non_linear_P2_last_q.mw

In this problem I have achieved every thing what I aimed, thnaks to the wonderful people here!!!

I am looking for a way to do it in a more structured way meaning the calculation of Jacobian in the attached sheet is somewhat manuel, though I wonder does maple has some other way?

Hi. I am creating a costum step and i did this

I am attempting to write a procedure for the numerical integration methods of the composite trapezoidal rule and Simpson's 1/3 rule, however the results that are being produced when I try to test the procedure are differing to the computed integral using the int command.

Here is my attempt so far:

 

> f:= x -> cos(x)*exp(-x/4):


> CompTrap:= proc(f,a,b,n)
local i, aa, h;
h:= (b-a)/n;
aa:= f(a)+f(b);

for i from 1 to n by 1 do

int(mul(sin(x/2^k)*2^k/x, k = 0 .. 123), x = 0 .. infinity) in closed form  with Maple?
I conjecture that the answer is Pi/2 and 123 can be replaced by any natural (i.e. ::posint) number.

First 1624 1625 1626 1627 1628 1629 1630 Last Page 1626 of 2428