Dear All

In following I tried to find symmetries of certain partial differential equation taken from paper "Group classification and exact solutions of generalized modified Boussinesq equation". But the determining equations are not matching with equations obtained in paper.

Download [1116]_Symmetries_Determination.mw[1116]_Group_classification_and_exact_solutions_of_generalized_modified_Boussinesq_equation.pdf

Regards

Good morning, I'm a student and I installed Maple 18 on my PC, as a "Single User Profile". Unfortunately, I had to buy another computer, so now I'm trying to install the program on my new one. Even if I enter my Purchase Code and my details, Maple says that no more activations are left in my account, even if the expiration date is on March 2020. Is it possible to activate again the program? 

Thank you,

Laura

hi...please help me for solve this nonlinear equations with pdsolve

thanksoffcenter2.mw

Download offcenter2.mw

Hello guys, i would like to do parallel computation in my code written in the Maple18. The question that can help me is:

Given a procedure that compute an function g, where g = f1+f2+f3+f4+f5+f6+f7+f8, i would like to compute all fi at same time.
Now, i´m using " grid:-seq('f[i]',[i=1,2,3,4,5,6,7,8])" and it works very well. However, i think that for my case an better solution should be;
Calculate the f1 in core 1, f2 in core 2, f3 in core 3 ... f8 in core 8 at same time, and after this, to sum all results(f1+f2+f3+..+f8). How i can do this?

Att,

Griffith.

Dear All

It is well known that the package "PDEtools" is helpful in finding infinitesimal transformations for PDEs which I illustrate as follow:

Download Writing_Vector_fields.mw

Regards

Here, I attached my maple code. I need to find root. I am using fsolve. But I am not geting the root. Please any one help me... to find the root.

Download root.mw

Hello guys,

I was just playing around with the Shanks transformation of a power series, when I noticed that polynomials aren't evaluated as I would expect.
I created this minimal working example; the function s should evaluate for z=0 to a[0], however it return simply 0.
Is there something I messed up?

Download evaluate_sum.mw

Thanks for your help,

Sören

Dear All

Using Lie algebra package in Maple we can easily find nilradical for given abstract algebra, but how we can find all the ideal in lower central series by taking new basis as nilradical itself?

Please see following;

Download [944]_Structure_of_Lie_algebra.mw

Regards

i'm using maple in a research but i want to add a recursive function h_m(t) in 2 case : if m is integer positive and not, 
la formule est donnée comme suit : 
  if (mod(m,1) = 0  and m>0) then  h:=proc(m,t)  local  t ;  h[0,t]:=t ;   for  i from -4 to  m  by  2 do  h [m,t]:= h[0, t]-(GAMMA(i/(2)))/(2*GAMMA((i+1)/(2)))*cos(Pi*t)*sin(Pi*t)  od:  fi:  end;
and i wanna to know how to programmate a Gaus Hypegeometric function. Thank You

Dear All

I have downloaded second version of DGApplications to work with abstract Lie algebra. The file is actually .mla file and it is executale(as when we open it, a prompt ask, "do you want to execute this file"), but when I press ok for execution, a file open with command like as

"march('open',"C:\\Users\\Manjit\\Downloads\\DGApplications.mla");",

what should I do after this, is it a some sort installation procedure. I keep all my Maple file in E drive with following path:

E:\Maple work\General Maple Workout

Please guide me in simple way, as I failed to install Maple package many times.

Regards

I'm trying to implement the QR algorithm to find the Eigenvalues of the input matrix which will be forwarded to another implementation (of the SVD alg.) to find the singular values. My implementation goes as follows:

1. feeding input: A::Matrix(datatype=float) # a bidiagonal matrix
2. construct input matrix for the QR alg. of matrix A and Z (zeros of size A): C := Matrix([[Z,Transpose(A)],[A,Z]], datatype=float); # therefore C should be symmetric
3. find the eigenvalues of matrix C with an implementation of the QR alg.:

for k from 1 to 400 do
Q, R := QRDecomposition(C);
C:=R.Q;
end do:

At this point, the eigenvalues of C should be placed in the diagonal of the matrix, but they're randomly placed around the diagonal, with only ~0 elements (like 2,xxx * 10^(-13)) in the diagonal.

If anyone knows how to resolve this, let the knowledge flow through. Any help will be appriciated, thanks in advance.

Please check why Maple is not returning location of Minima in following case:

Download Location_for_Max_Min.mw

Regards

i use the pdsolve to find the solutions of a system of partial differential equations,

but the result contains some indefinite integrals, how to simplify it further?

thank you

code:

eq1 := {6*(diff(_xi[t](x, t, u), u))-3*(diff(_xi[x](x, t, u), u)), 12*(diff(_xi[t](x, t, u), u, u))-6*(diff(_xi[x](x, t, u), u, u)), 2*(diff(_xi[t](x, t, u), u, u, u))-(diff(_xi[x](x, t, u), u, u, u)), diff(_eta[u](x, t, u), t)+diff(_eta[u](x, t, u), x, x, x)+(diff(_eta[u](x, t, u), x))*u, 18*(diff(_xi[t](x, t, u), x, u))+3*(diff(_eta[u](x, t, u), u, u))-9*(diff(_xi[x](x, t, u), x, u)), 6*(diff(_xi[t](x, t, u), x, x))+3*(diff(_eta[u](x, t, u), x, u))-3*(diff(_xi[x](x, t, u), x, x)), 6*(diff(_xi[t](x, t, u), x, u, u))+diff(_eta[u](x, t, u), u, u, u)-3*(diff(_xi[x](x, t, u), x, u, u)), 12*(diff(_xi[t](x, t, u), u))-6*(diff(_xi[x](x, t, u), u))+6*(diff(_xi[t](x, t, u), x, x, u))-6*(diff(_xi[t](x, t, u), u))*u+3*u*(diff(_xi[x](x, t, u), u))-3*(diff(_xi[x](x, t, u), x, x, u))+3*(diff(_eta[u](x, t, u), x, u, u)), 12*(diff(_xi[t](x, t, u), x))-6*(diff(_xi[x](x, t, u), x))+2*(diff(_xi[t](x, t, u), t))+2*(diff(_xi[t](x, t, u), x, x, x))-4*(diff(_xi[t](x, t, u), x))*u+2*(diff(_xi[x](x, t, u), x))*u+_eta[u](x, t, u)-(diff(_xi[x](x, t, u), t))+3*(diff(_eta[u](x, t, u), x, x, u))-(diff(_xi[x](x, t, u), x, x, x))};

simplify(pdsolve(eq1))

Hello,

Calculated a Grobasis basis. Used the 19 of the 29 equations to produce a Sylvester type matrix to get a univarite polynomial. The problem I am having is I can't produce a consistant matrix. I think the problem may lie in how I sort the equations. I have used this method once before and it worked to produce the result then. Run the worksheet and the run it again and most likely a different outcome occurs. I copy and pasted the polynmial list to make this worksheet. The coefficients are very long. Have annotated the worksheet to help explain.

Download Test_Equations_Matrix_Groebner.mw

Hi,

I have a linear mathematical model that is in deterministic form, but actually one of the input parameters has a stochastic nature and follows a log normal distribution function. and I need to include this in the formulation. Please help me with this questions:

1) Do I need to use stochastic programming methods to solve it? if yes, how?

2) How can I include the distribution function in my model?

3) Can I solve the these kinds of problems using Maple?