Maple 18 Questions and Posts

These are Posts and Questions associated with the product, Maple 18

Hi everybody:

I'm going to learn programming with maple 18, are there any good and new pdf files for learn it?

with regards...

 

Dear all,

I have to differential equations that I'd like to linearise, that is all higher order (>1) derivatives (like diff(uu[0],x$2)) and parameters (like beta^2) and the products of any derivatives with the parameters uu[0] and beta are zero (as they are assumed small).

The two equations considered are displayed below:

 

Up to now, I perform a very tedious substitution which is based on looking at the equations above and decide which terms I want to get rid of. Something like this, where K =1:KFBCLin:=simplify(eval(KFBC, [beta^3 = 0, beta^2 = 0,
seq(subs((diff(uu[n], x$3)) = 0),n=0..K),
seq(subs((diff(uu[n], x$2)) = 0),n=0..K),
seq(subs((diff(uu[n], t))*beta = 0),n=0..K),
seq(subs((diff(uu[n], x))^2 = 0),n=0..K),
seq(subs(g*diff(beta, x)*beta = 0),n=0..K),
seq(subs((d^2*diff(uu[n], x,t)*diff(beta,x)=0)),n=0..K),
seq(subs(-2*d*diff(uu[n], x,t)*beta*diff(beta,x)=0),n=0..K),
seq(subs((d^2*diff(uu[n], x$2,t)*beta=0)),n=0..K),
seq(subs((diff(uu[n], x)*uu[n])=0),n=0..K),
seq(subs((diff(uu[n], x)*uu[n]*beta)=0),n=0..K),
seq(subs((diff(uu[n], x)*uu[n]*d)=0),n=0..K),
seq(subs((diff(beta, x)*uu[n])=0),n=0..K),
seq(subs((diff(uu[n], x)*beta)=0),n=0..K)]));As there is a lack of automatisation, this procedure is not very helpful. Life would be easier if there was a command (or the like) that says "get rid of higher order derivatives".Any help is appreciated.Best regards,

 

Is there a way to make the first part of this look like the second picture depicted here? Also after intigration is there a way to make the highlighted posrtion not have an "ln(e)" parts and just have the exponetials and there constants?

Obviously I dont want to have to manually input this section everytime, is there some command I can use to achieve this goal?

Trying to get this function to work in Maple 18 

CharacteristicPolynomial(M,x)

I am trying to creat a way to solve matrix differential equations step by step.

 

I want to find numerically the limit lim(y[m](t),m = infinity), do you have an idea how to do implement it in maple?

 

 

"h:=0.000065;  Theta3(t):=sum(exp(-m^(2)*Pi^(2)*t),m=-100..100);  y[0](t)=1;  t>0;  m>=1;  y[m](t)=1-h*int(Theta3(s)(y[m-1](t-s))^(4),s=0..t);  "

0.65e-4

 

proc (t) options operator, arrow; sum(exp(-m^2*Pi^2*t), m = -100 .. 100) end proc

 

Error, (in y[m]) too many levels of recursion

 

0 < t

 

1 <= m

 

Error, (in y[m]) too many levels of recursion

 

``

 

Download recursive_integral.mw

I always find it difficult to debug maple codes. I'm used to the debug feature in programing laguages like C#, VB.Net, JAVA even MATLAB. They all have one thing in common which is the use of breakpoints. Breakpoints are inserted at different parts of a code so as to follow the program execution and to trace out errors. Is any similar feature in Maple? I only know the DEBUB() function and not that helpful to me.

Please, I have an error message which says Error, (in eul) illegal use of a formal parameter. I can't find the cause of the error. I got the result I wanted if i remove these lines eul := proc(x,y) , return yt: , end proc: and

yv := eul(x,y); that is if I consider the for..loop alone.

fxy := proc(x,y)
  return x/y;
end proc:

a := 0:
b := 1:
N := 10:
h := evalf((b-a)/N):
x := 0:
y := -2:
yt := Vector(3):

eul := proc(x,y)
    for j from 1 to 3 do
          y[j]:= y + h*fxy(x,y):
          x:= 0 + j*h:
          y := y[j]:
          yt[j] := y:
    end do:
    return yt:
end proc:
yv := eul(x,y);

hello

took this problem from a uk tv program.

4 dancers are initially at the 4 corners of a square, edge length 4 meters. every dancer moves towards the person on their left.

i want to know the equations of the spiral. the arc length of each path should be 4m.  also an animation of the 4 spirals would be great. 

dance.mw

under the heading "more spirals" the closest one is r(t)=1/t (decreasing modulus)

http://mathematische-basteleien.de/spiral.htm

 

Hello, 

      I am a student doing some self study over the summer trying to work through some of the John Taylor computer problems from his classcial mechanics book. Currently I hit a snag that most likely comes from the fact I am not well acquinted with Maple for solving IVP and DE's (we used Matlab in my DE class). I just need to know how I remove the following error:

Error, (in dsolve/numeric/SC/IVPsetup) initial conditions must be numeric

Here is a copy of my code:

R := 5;
5
g := 9.8;
9.8
deq1 := {diff(x(t), [`$`(t, 2)]) = -g*sin(x(t))/R, x(0) = 20};
/ d / d \ \
{ --- |--- x(t)| = -1.960000000 sin(x(t)), x(0) = 20 }
\ dt \ dt / /
dsol1 := dsolve(deq1, numeric);
Error, (in dsolve/numeric/SC/IVPsetup) initial conditions must be numeric

My hunch is that I need to set x'(0)=0 or something like I do not have enough intial values to solve the problem, but I could be wrong. Anyway anyone who can point out my mistake feel free to do so! Thank you!

I have started to use Maple 18 and I have found that my scale starts at 2.*10^16 for all functions I graph no matter if its 3D or 2D. Is there a way to change this scale?

Hi,

I would like to plot E2(t) , but It gives errors. How can I avoid the singularity and solve this problem?


restart: with(plots):
with(Student[NumericalAnalysis]):
g1:=(x,t)->(-sqrt(t)/(2*sqrt(Pi*r^3)))*(sin((r*(x-1)^(2)/(4*t))+(Pi/4))-sin((r*(x+1)^(2)/(4*t))+(Pi/4))):

g2:=(x,t)->int(g1(x,t),r=1..infinity);

g3:=(x,t) -> (diff(g2(x,t),t)):


g4:=(x,t) -> (diff(g2(x,t),x,x)):


g5:=(x,t) -> ((1/2)*(g3(x,t)^2+g4(x,t)^2)):


E2:=t->(int(g5(x,t),x=0..100)):

evalf(E2(0));
Error, (in g1) numeric exception: division by zero
evalf(E2(1));
Error, (in g3) invalid input: diff received 1, which is not valid for its 2nd argument
plot(E2(t),t=0..20);

Best regards,

 

Hej guys,

in some of my Maple worksheets I'm using Maples fit-function to obtain a rational function fit to some data, as I'm interested in the zeros of enumerator and denominator, I chose my fit function accordingly. Afterwards I need to extract the results (mainly the zeros) and do some more calculation steps with them. When evaluating rational functions of high degree, I noticed that my way of extracting the results (I'm using patmatch) becomes increasingly slow up to the point where it takes a couple of minutes to extract 10 numbers.
E.g. the following minimal example (download link at the bottom) takes more than 20 minutes on my machine (Maple 18.01 Build ID 935137; Red Hat Version 6.6 running on system with an i5-3570, 8 GB of RAM). Additionally, the calculation requires an unreasonable amount of RAM.
I can work around the problem to some degree by extracting the leading coefficient beforehand, resulting in a substantial speed up, still I think that there might be some error in the code or my usage of patmatch.

Is there another way to extract these numbers in a similarly simple fashion?

Cheers,

Sören


restart

a pathmatch with 9 variables requires roughly 200 MB of memory and takes about 7 s to finish on an i5-3570 CPU:

p := (1+x)*(2+x)*(3+x)*(4+x)*(5+x)/((11+x)*(12+x)*(13+x)*(14+x));

(1+x)*(2+x)*(3+x)*(4+x)*(5+x)/((11+x)*(12+x)*(13+x)*(14+x))

(1)

pattern := (a__1::realcons+x)*(a__2::realcons+x)*(a__3::realcons+x)*(a__4::realcons+x)*(a__5::realcons+x)/((b__1::realcons+x)*(b__2::realcons+x)*(b__3::realcons+x)*(b__4::realcons+x)); patmatch(p, pattern, 'la'); assign(la)

(a__1::realcons+x)*(a__2::realcons+x)*(a__3::realcons+x)*(a__4::realcons+x)*(a__5::realcons+x)/((b__1::realcons+x)*(b__2::realcons+x)*(b__3::realcons+x)*(b__4::realcons+x))

 

true

(2)

a__1; a__2; a__3; a__4; a__5; b__1; b__2; b__3; b__4

1

 

2

 

3

 

4

 

5

 

11

 

12

 

13

 

14

(3)

a pathmatch with 9 variables requires roughly 2.2 GB (!) of memory and takes about 20 min (!) to finish on an i5-3570 CPU:

q := 9*p;

9*(1+x)*(2+x)*(3+x)*(4+x)*(5+x)/((11+x)*(12+x)*(13+x)*(14+x))

(4)

a__1 := 'a__1':

(a__1::realcons+x)*(a__2::realcons+x)*(a__3::realcons+x)*(a__4::realcons+x)*(a__5::realcons+x)*a::realcons/((b__1::realcons+x)*(b__2::realcons+x)*(b__3::realcons+x)*(b__4::realcons+x))

 

true

(5)

a;

1

 

1

 

2

 

3

 

4

 

5

 

11

 

12

 

13

 

14

(6)

NULL

Download patmatch-breakdown.mw

I'm trying to plot the region bounded by the coordinate planes, the plane z=2-y and the cylinder x=4-y^2

This is what I have so far.  I want to know how to get rid of the portions of the planes and cylinder that are not enclosing the region.

restart;

with(plots);

xmin := 0;
xmax := 4;
ymin := 0;
ymax := 2;
zmin := 0;
zmax := 2;

a := plot3d([2-y], x = xmin .. xmax, y = ymin .. ymax, orientation = [40, 70], transparency = 0, color = green, filled = false, title = "");
%;

b := implicitplot3d([z = 0, y = 0, x = 0], x = xmin .. xmax, y = ymin .. ymax, z = zmin .. zmax, transparency = .5, axes = normal);
%;
c := implicitplot3d([x = -y^2+4], x = xmin .. xmax, y = ymin .. ymax, z = zmin .. zmax, transparency = .5, filled = true, axes = normal, color = blue, orientation = [45, 35]);


display(a, b, c);

A duck, pursued by a fox, escapes to the center of a perfectly circular pond. The fox cannot swim, and the duck cannot take flight from the water. The fox is four times faster than the duck. Assuming the fox and duck pursue optimum strategies, is it possible for the duck to reach the edge of the pond and fly away without being eaten? If so, how?

http://www.crazyforcode.com/fox-duck-puzzle/

there is an animation here

https://www.youtube.com/watch?v=Zw9cHEnhzWo

wonder if the equations of motion can be derived usingg maple and an animaton...?

First 56 57 58 59 60 61 62 Last Page 58 of 86