Unanswered Questions

This page lists MaplePrimes questions that have not yet received an answer

for example, there is an expression exp1=(a+b)*(a+c),  I want to find all the position in DAG of a specific operand, such as 'a' ; also I want to find the position in the DAG of  sub-expression which type is '+' .
 is there any function in maple which can return the  integers indicating position of an operand or type in an expression? i.e. with this function, assume its name is 'find',then
find(exp1, a) will return  [1,1],[2,1];
find(exp1,'+') will return  [1,0],[2,0];


i got a problem to solve 2 nonlinear  pde equation that are not coupled but there is 8 coupled boundary condition. i can use pdsolve in maple.anyone can help me in numerical solving of these pdes?

This is using Maple 2018.2.1 and using Physics version MapleCloud 289 on windows 10, 64 bit with lots of RAM (64 GB). The call to timelimit hangs. Is there a workaround?


#and in new execution cell

pde :=  diff(w(x,y),x)-((k+1)*x^k*y^2- a*x^(k+1)*tan(x)^m*y + a*tan(x)^m )*diff(w(x,y),y) = 0;
cpu_time := timelimit(180,CodeTools[Usage](assign('sol',pdsolve(pde,w(x,y))),output='realtime'))






I'm a long-time Maple user and have used the CodeGeneration package in the past, but with a recent download of Maple 2018, I'm now getting an error I have never gotten before. Even when I do something simple (see below, for example), I get an error that reads "Error, (in clear) argument `` is incorrect or out of order". And I get this error no matter which language I choose. Any help would be much appreciated.

> with(CodeGeneration)

> R(exp(x))




Suppose that A is an nxn matrix over the finite field Z:=GF(2,q) for some q. I wan to get the smitform of A over Z. First I used the package  


and after that I applied the command 

S := SmithForm[Z](A)

but the mentioned command made some errors. In fact, I do not how to define commands igcdex, iquo, irem, sign and abs for SmithForm over finite fields.

Thanks for any suggestions 

I need to know how to submit a maple job in HPC cluster. I have a code which needs large memory to run. Thank you

how I can find solutions for non linear equations.

I want to find non zero solution.

thank you


Maple Worksheet - Error

Failed to load the worksheet /maplenet/convert/ZAH.mw .

Download ZAH.mw

I get this problem in a paper published in 2011. there is a table which compares the solution of a differential equation and gives the range of initial guesses. I got confused when saw maple and approximated maple, please any help me 

I'm attaching the link of paper. Please have a look at table 3. 


Dear all,
How can I input different spacesteps in numerical solution of PDE (Heat equation) with pdsolve of Maple?

For example, the x range is x=0..L,
and I'd like to solve the PDE with spacestep1=L/100 for x=0..a and spacestep2=L/10 for x=a..L.

Thank you in advance!

Why Maple doesn't calculate this and only rewrites it??



invlaplace(exp((0.2500000000e-1-2.500000000*sqrt(0.116e-3+.8*p-3.2*10^(-10)/(p+0.2e-4)))*x)/p, p, t);

iqt + aqxy + ibq (qq*x − q*qx) = 0. write this equation in maple

how i can solve the eqution by ritz methode codes?

I have an object in 6d I'd like to visualise. The region of 6d space I am interested in is described by these equations:

{f[10] = -(.2000000000*(5.*f[21]*f[20]*f[22]-5.*f[20]*f[22]^2+20.*f[20]*f[21]-20.*f[20]*f[22]+135.*f[20]+46.*f[21]))/(f[21]*(f[21]-1.*f[22])),
f[11] = -1.*f[22]-4.,
f[12] = -(1.*(f[22]^2+4.*f[22]-27.))/f[21],
f[20] = f[20],
f[21] = f[21],
f[22] = f[22]}

clearly the first three variables are dependant, and the latter three are independant. I'd like to graph the first three as the latter three vary between bounds and then colour the points on the output based on where they came from in the input, so i can get some intuition about what these equations mean.

Good day everyone.

Please can help me with this code on the taylor series expansion involving Fractional Differential Equation (FDE)? Particularlly, the lines highlighted blue and green respectively in relation to FDE.

Thank you and kind regards

P:=sum((a[k]*x^(k))/GAMMA(k+1-alpha), k=0..3):
assume(alpha>0,alpha < 1):
e1:=simplify(eval(P, x=q+h))=y[n+1]:
var:=seq(a[i], i=0..3):

Cc:=eval(<var>, solve(eval({M}),{var}) ):
for i from 1 to 4 do
end do:
E:=collect(Cf, [y[n+1], f[n], f[n+1],f[n+2]], recursive):
s2:=y[n+2]=simplify(eval(Cf, x=q+2*h)):
collect(%, [y[n+1], f[n], f[n+1],f[n+2]], recursive):

s1:=y[n]=simplify(eval(Cf, x=q)):
collect(%, [y[n+1], f[n], f[n+1],f[n+2]], recursive):

F[n]:=convert(taylor((D(y))(x), h = 0,12), polynom):
F[n+1]:=convert(taylor((D(y))(x+h), h = 0,12), polynom):
F[n+2]:=convert(taylor((D(y))(x+2*h), h = 0,12), polynom):




How do I plot the optimal control functions in an optimal control problem ?

1 2 3 4 5 6 7 Last Page 3 of 239