Unanswered Questions

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

I need to solve an ode of the type ay''+by'+cy=f(x) using cubic b spline.

can any one help me with the code or algorithm. Thanks

I need  some examples s.t. the computation of their lexicographic Groebner basis is heavy?

Thank you so much.

Plz help me! How to accelerate the calculation speed the following the program?

restart;
with(PDEtools); declare((u, W)(x, t)); KN := 10;
AFP := proc (C1, C2, C3, C4, H, KN, N) local ADM1, n, lambda, F, i, A0, A, U, W, u, L, R, NL, w, PDE1, IC1, d, Eq1, Eq2, Eq3, LI, trL, tr1, trN, Apr, AprK, trSol, Sol, AD; declare((u, W)(x, t)); ADM1 := proc (n) options operator, arrow; convert(subs(lambda = 0, value((Diff(F(Sum(lambda^i*U[i], i = 0 .. n)), `$`(lambda, n)))/factorial(n))), diff) end proc; A0[0] := F(U[0]); for n to KN do A0[n] := ADM1(n) end do; for n from 0 to KN do A[n] := convert(C1*(diff(subs({seq(U[i] = W[i](x, t), i = 0 .. KN)}, expand(subs(F(U[0]) = U[0]*exp(U[0]), A0[n]))), x)), diff)+convert(C2*subs({seq(U[i] = Diff(W[i](x, t), x), i = 0 .. KN)}, expand(subs(F(U[0]) = U[0]^2, A0[n]))), diff) end do; L := proc (w) options operator, arrow; diff(w(x, t), t) end proc; R := proc (w) options operator, arrow; C3*(diff(w(x, t), x)) end proc; NL := proc (w) options operator, arrow; C1*(diff(w(x, t)*exp(w(x, t)), t))-C2*(diff(w(x, t), x))^2 end proc; PDE1 := proc (w) options operator, arrow; L(w)-R(w) = -NL(w) end proc; IC1 := u(x, 0) = sum(2*(int(sin((d+1/2)*Pi*x/H), x = 0 .. H))*exp(-C4*(d+1/2)^2*Pi^2*t/H^2)*sin((d+1/2)*Pi*x/H)/H, d = 0 .. N); LI := proc (w) options operator, arrow; Int(w(x, t), t = 0 .. t) end proc; tr1 := u-rhs(IC1); Eq1 := LI(lhs(PDE1(u))) = LI(rhs(PDE1(u))); Eq2 := simplify(subs(lhs(Eq1) = tr1, Eq1)); trL := u = add(u[j](x, t), j = 0 .. KN); trN := LI(NL(u)) = Int(Sum(A[i], i = 0 .. KN), t = 0 .. t); Eq3 := subs(trL, lhs(Eq2)) = subs(trN, rhs(Eq2)); Apr[0] := u[0](x, t) = rhs(IC1); AprK := u[k+1](x, t) = -(Int(AD[k], t = 0 .. t)); for i from 0 to KN do Apr[i+1] := value(subs({seq(Apr[m], m = 0 .. i)}, subs({seq(W[m] = u[m], m = 0 .. i)}, subs(k = i, AD[i] = A[i], AprK)))) end do; trSol := {seq(Apr[i], i = 0 .. KN)}; value(subs(trSol, trL)) end proc;


 

Download AFP.mw

Ok i have used a diverse range of programming IDE now, but i am of course alot more comfortable the maple interface simply because of the amount of time i have spent on it, also it was my first "real" introduction to programming, but i was keen to trial and review of all the major CAS out on the market, but for a common purposed package within them they provide, for example the number theory package.

 

So the question is quite broad, im looking for suggestions for the most unbias way to go about this.

it would need to be a coauthored review with a representative writer for the seasoned user for each one right?


Is anyone running the 2016.1a patch on ubuntu 16.04?

A fresh installation starts up and works, but after I install the patch the installation seems broken:

cd /usr/local/maple2016/bin
./maple
/usr/local/maple2016/bin.X86_64_LINUX/mserver: error while loading shared libraries: libicuucmpl.so.56: cannot open shared object file: No such file or directory
maple: could not start mserver

it looks like my installation does not have libicuucmpl.so.56. I can see these however:
./bin.X86_64_LINUX/libicuucmpl.so.49.1.1
./bin.X86_64_LINUX/libicuucmpl.so
./bin.X86_64_LINUX/libicuucmpl.so.49

running xmaple has maple open, then stay unresponsive.

Here is the upgrade file, i've been trying to use:
md5sum ./Maple2016.1LinuxX64Upgrade.run
7502caaa65cc623d5d2574823eee9343  ./Maple2016.1LinuxX64Upgrade.run


Has anyone else encountered this problem?
thanks

I wondering if it is able to create a new symbol in maple, like it is possible to create a custom snippet in the pallets. Speceficly I am asking how to create a new symbol/charachter for 2D math. So if anyone knows please tell me :)

Hello everybody!

Please help me to solve the attached partial differential equation. I am getting an error. I do have its analytical solution and that works fine.

The error is as follows
Error, (in pdsolve/numeric/plot) unable to compute solution for t>HFloat(0.0):
solution becomes undefined, problem may be ill posed or method may be ill suited to solution

The worksheet is attached hereshortsngle.mw

Hi All,

When doing retart in a saved workbook get a no read access error link (see partial screen shot below). When the link is followed the message is there is no help for this error.

I am using Windows 10 64 bit and have full administrative prilvilages so I not sure what the problem is.

I have the same issue when I upload to the cloud.

In spite of message I can still do computations.

Any help in understanding this will be greatly appreciated.

Thanks,

 

Joe

 

In Maple V, Release 4 (1996):

 

T:=table():
i:=1:N:=5000;

for i from i to N  
do
   T[i]:=T[i+1]:
   T[i+1]:=1;
   eval(T[1]);
od:
print(i);

for i from i to N  
do
   T[i]:=T[i+1]:
   T[i+1]:=1;
   eval(T[1]);
od:
print(i);

I receive this output:

N := 5000
Error, too many levels of recursion
3607
5001

Can You explain this occurence, as well as the following one:

In Maple V, Release 4 (1996):

 

T:=table():
i:=1:N:=5000;

for i from i to N  
do
  T[i]:=T[i+1]:
  eval(T[1]);
od:
print(i);
 
for i from i to N  
do
  T[i]:=T[i+1]:
  eval(T[1]);
od:
print(i);;

gives:

N := 5000
Error, too many levels of recursion
3607
Error, too many levels of recursion
3607

How does one control allowance for recursion depth?

Hey,

I want to solve this equation and looking at the plot there are at least 3 solutions. I want the greatest/smallest negative solution. Unfortunately using solve with assumptions produces no results and solve without assumptions only finds two solutions.

Can you please help me?

#select greatest negative value from solution

restart:

expr:= ax*cos(lambda)+ay*sin(lambda)-(a+b*lambda)

ax*cos(lambda)+ay*sin(lambda)-b*lambda-a

(1)

ax:=1:ay:=2:a:=0.5:b:=0.25: #examplanatory values

plot(expr)

 

 

assume(-2*Pi<lambda,lambda<0): #does not work

 

sol_lambda:=[solve(expr=0,lambda, useassumptions)];# returns empty list even though without assumption one solution is found

Warning, solutions may have been lost

 

[]

(2)

sol_lambda:=[solve(expr=0,lambda)]; #returns only two solutions even though looking at the plot 3 are there

Warning, solve may be ignoring assumptions on the input variables.

 

Warning, solutions may have been lost

 

[2.190357220, -.2688724573]

(3)

sol_l_v:=evalb~(sol_lambda<~0); #dirty workaraound

[false, true]

(4)

sol_l_add:=[ListTools:-SearchAll(true,sol_l_v)] ; #this seems overly complicated

 

[2]

(5)

lambda:=sol_lambda[sol_l_add[-1]];  #to select the last entry

 

-.2688724573

(6)

expr; #test

 

0.

(7)

 


Download select_solution.mw

Thanks!

Honigmelone

Hi,

This is regarding numerical solution of a function and plot. I have a function in the form of f1(omega,arctan(f2(omega))), and i need to plot it with omega (as the expression is too long i cant insert it here). Now, if i am changing the range of omega in plot command then I am getting different plots for the small values of omega. Let's say if i change the range from 1..10 to 1..50 and look at the plot in the range of 1..3 then the plots looks different. Apart from this if i change the value of Digits  from 10 to 30 or 40 then every time i am getting an entire different  plot. As the expression if too long i cant convert it to Matlab expression and plot there. How to fix these issues. Please help me regarding this.

Regarding

Sunit

 

After using the Groebner and PolynomialIdeals packages, Maple goes into a long calculation when I make an entry of the form

name:=polynomial expression. This can take 10's of minutes for an expression of two lines. The only solution I have found is to save the sheet and restart it and enter the line name:= etc. before loading Groebner and PolynomialIdeals. This is most inconvenient. Is there a better workaround?

I would like compute the vertices of the convex hull of finitely many points in some \mathbb{R}^{n}, where the coordinates of these points could be rational numbers or irrational numbers like \sqrt{2}.

I know that PolyhedralSets[ConvexHull] is a direct command, however it does not support irrational numbers. But if I transform all coordinates into floating point numbers, for some rational numbers the rounding error would be large enough to affect the result. For example, after the transform some collinear points are no longer collinear.

Thanks!

 

 

 

USB and or RS232 porting from inside maple console. Title explains what i need, or how to port an externally built java app into the maple console, either which will engine my dispatch tonight

how to use Riemann matrix to output Riemann surface?

and plot this surface?

 

with(algcurves):
f:=y^3+2*x^7-x^3*y;
pm:=periodmatrix(f,x,y);
evalf(pm, 5);
rm:=evalf(periodmatrix(f,x,y,Riemann),10);
M := rm;
A := proc (x, y) options operator, arrow; RiemannTheta([x, y], M, [], 0.1e-1, output = list)[2] end proc;
plot3d(Re(A(x+I*y, 0)), x = 0 .. 1, y = 0 .. 4, grid = [40, 40]);

is this graph Riemann Surface?

if so, how to convert A into polynomials?

First 151 152 153 154 155 156 157 Last Page 153 of 334