Hi,

I'm searching for the third differential equation that will transform the following two equations non-autonomous system into a three equations autonomous one:

diff(x(t),t)=-x(t)+2*(m*t+n)*y(t)-2*k*(m*t+n)²

diff(y(t),t)=-y(t)+k*m-(m*t+n)*((x(t)/2)-1)

 

diff(z(t),t)= ...

 

Regards,

Johnny

Maple_17_fault.mwA piece of code presented in attached file can be easily calculated with Maple 13 and ancient (Pentium M) laptop. While Maple 17 and modern PC with Core i7 3770K and 32GB RAM on board unable to do the same. What's wrong? Do I need to make some settings of Maple 17? Can I install Maple 13 and Maple 17 on the same PC? Will not any conflicts occur? Thank you.

Hi,

     I would like to plot a potential on a sphere, with colours and equipotential lines too. I can easily get the colours with this

f:=(psi-Pi/2)^2 + (theta-.5)^2;
plot3d( 1,psi=0....2*Pi,theta=0..Pi,coords=spherical,scaling=constrained, style=patchnogrid, color =f ,lightmodel=none,contours = 60,numpoints=6000);

but cant get the contours to be the level sets of f.  I tried 2dcontour, contourplot3d, etc, but in spherical cordinates...

How to solve with maple using integration by parts the integral?int(sec(x)^(n),x);

Hy, I am trying to design a game with maple. For that I simulated the 6 rolls with the random function. Now I'd like to display them on 6 different buttons. I desgined the buttons, but I can only manage to get a fixed expression on them (like "dice"), but no variable. My idea is to take the element of a list (6 rolls in one list) and display it on the button. Can anybody help me please? Thanx!

Dear,i meet a problem in Physics package.i can't find why i got two different answers.

restart; with(Physics); Setup(mathematicalnotation = true);Setup(op = {C});

Cp := Dagger(C);

alg := %Commutator(Cp, C) = -1;

Setup(alg)

S := sqrt(N-(Dagger(C)+sqrt(N)*conjugate(eta))*(C+sqrt(N)*eta)):

eq1 := collect(expand(op(1, S)), N):

xi = op(1, eq1);

f := map(simplify, map(proc (x) options operator, arrow; x*sqrt(xi) end proc, convert...

Hi

I have problem with solve polynomial...maple can't manage with it.

My polynomial :

1-r+4*r^12*x^12+16*r^6*x^4-8*r^7*x^6+2*r^8*x^8+24*r^6*x^2-36*r^7*x^4+24*r^8*x^6-6*r^9*x^8-24*r^7*x^2+60*r^8*x^4-80*r^9*x^6+60*r^10*x^8-24*r^11*x^10-x+8*r^4*x^2-4*r^5*x^4-16*r^5*x^2+6*r^4+2*r^2-6*r^5-r^7+4*r^6+8*r^8*x^2-28*r^9*x^4+56*r^10*x^6-70*r^11*x^8+56*r^12*x^10-28*r^13*x^12+8*r^14*x^14-r^15*x^16-5*r^3

 

I'm getting for *good roots* and something "1/4(RootOf(.......

I've tried a few different ways to change the axis label size but am a bit lost. I'm new to the maple environment.

 

How to transform between permutation group and linear transformation matrix in maple

is there a command like gap

gap> i:=IsomorphismPermGroup(G); 

to find permutation group which has isomorphism

Hello,

I have a small Finite Element program in Maple. I want to accelerate the Matrix assembly. For Matlab this works like described here (http://milamin.sourceforge.net/technical-notes/sparse-matrix-assembly) under "Triplet Sparse Storage". There, two indexing Vectors are used to place the values into a sparse Matrix with the Matlab function sparse. If index pairs are duplicate, they are added.

 

Now I want to ask if this is also possible in Maple?...

I have following lists

a,a,a,b,c
b,b,b,c,e
a,c,e,e,e
a,a,a,b,c
b,b,b,c,e
a,c,e,e,e
a,a,a,b,c
b,b,b,c,e
a,c,e,e,e
a,a,a,b,c

I want to write the bare rewrite rules for these so that if any list is given as input these rules produce the next one. It is obvious every third is same as first.

Hi all,

Say i have two Vectors:

V1:=Vector(2,[a,b]);

V2:=Vector(4,[d,b,e,a]);

and how do I get

V3:=Vector([d,e]);

?? I currectly use a crude way using 'set' operations:

V3:=convert(V2,set) minus convert(V1,set);

V3:=convert(V3,Vector); # Does not work straightford, so

V3:=convert(V3,list):
V3:=convert(V3,Vector); # Which works,

 

Also, is there a strightforward way to which elements are the same and their indices?

Let us consider the group of elements {(a,b,c,d): a::integer,b::integer,c::integer,d::integer,a+b+c+d=0, a=c mod 12} with the component-wise addition. How to represent it in Maple? Is it possible? What I know is

restart;

with(GroupTheory):

CyclicGroup(infinity);     

GroupTheory:-CyclicGroup(infinity, form = "fpgroup")

G := DirectProduct(CyclicGroup(infinity), CyclicGroup(infinity), CyclicGroup(infinity), CyclicGroup(infinity));

I need three orthogonal unit vectors, k, i, and j. I give the first two vectors, k=[sqrt(2)-1,-1,1] and i=[1,sqrt(2)-1,0], then use crossproduct to produce the third vector j=crossprod(k,i) . But it fails to produce the correct vector since dotprod(j,k) is not 0. 

I have a two-variable matrixfunction A(x,y) with entries A_i,j(x,y).
I want to use mtaylor for each entries and the result to store in a matrix B.
Is it possible to do using the map command?
If not, what methods do exist?
(Instead of typing mtaylor for each entires.)

Sandor