would you please help me? 

I have a big problem in differentiating with maple! 

here is my equation. 

L := (alpha, beta, theta,alpha(t),beta(t),theta(t))

how can I find diff(L, alpha) ? 

L=(1/2)*I[a]*(diff(alpha(t), t))^2+(1/2)*I[b]*(diff(beta(t), t))^2+(1/2)*I[c]*(diff(theta(t), t))^2+(1/2)*m[3]*(b^2*(diff(beta(t), t))^2+(1/4)*C^2*(diff(theta(t), t))^2+b*c*(diff(beta(t), t...

Hi, friends

The physics package was provided a good tool to compute Commutator or anticommutator relations. Here, I met some problems.

Example 1:

      restart: with(Physics):Setup(mathematicanotaion=true):

      Setup (op={p[x],p[y]},p[z]):

      alg:=%commutator(p[z],p[x])=2p[x], %commutator(p[z],p[y])=-2p[y], %commutator(p[x],p[y])= p[z]

Hi

I am attempting to do a least squares regression with two variable (HK and S) generating my curve.  The equations are extremely tempermental and won't allow maple to solve them using normal methods, so I'm resorting to numerical methods to minimize the least squares.

I am attempting to create a dataset that I can search for the minimum of "k" and have it tell me what "i" and "j" values I used to get there.  The code below is the basic idea, the...

Hi All,

Is using the NAG package the right way to go about creating the delaunay triangulation of a set of points in 3 dimensions. My points all lie on a surface in R^3.

Thanks. 

I have looked at the maple help for the ErrorPlot function, but i can't make it work for my plot. 

I have the following procedure:

K := 1.; Xrng := [seq(dt*i, i = 0 .. ntime)];

value := array(1 .. ntime+1);

ave := array(1 .. ntime+1);

for j to ntime+1 do:

discountfactor := exp(-r*j*dt);

Stot := 0.;

Stot1 := 0.;

for i to npath do:

Spath := max(Spot[i][j]-K, 0);

Stot := Stot+Spath;

When I use pdsolve to solve a system of PDEs, and tell it to use HINT='*', does the solution I get ONLY contain those obtainable by separation of variables, or does it use separation of variables as a starting point and deliver the general solution? And how can I tell?

Dear all,

I wrote some simple functions in Maple 13, called "myproc" file,

and used startup code (edit-->startup code) to initialize it in a worksheet by: read "myproc";

Now I am using Maple 14, it does not work, says, "unable to read", sort of thing.

I have also tried to rename the file to myproc.m and read "myproc.m";

does not work either.

Is there any compatibility problem?

Thanks.

casper

I was wondering if there's a simple way to add something like an interpolation loop to a procedure. For example, say I have a function of 2 vars which is expensive to compute, f(x,y). I can use option cache to speed up points which are already computed, but is there an easy way to interpolate between them using ArrayInterpolation? That is, if f varies on scales of order 1, if I have calculated it at 0.1, 0.2, then It can be guessed with a spline at 0.15 accurately enough. What...

I have the following procedure that generates Sierpinski's triangle:

seirpinski := proc (n)
> local Mat, Vector1, Vector2, Vector3,
> Prob1, Prob2, Q, prob, counter, fractalplot;
> Mat := linalg[matrix]([[.5, 0.], [0., .5]]);
> Vector1 := linalg[vector]([0, 0]);
> Vector2 := linalg[vector]([0, 0.5]);
> Vector3 := linalg[vector]([0.5, 0]);
> Prob1 := .333; Prob2 := .333;
> Q := linalg[vector]([0, 0]);
> writedata("fractaldata", [[Q[1...

I guess someone is kidding with me...

I want unsubscribing of this s... place!

I have this non-linear ODE in q(p):

ode := diff(q(p), p) = (q(p)-a*p)/(p-a*q(p))*(p^(-b)-1)/q(p)^(-b);

for some real parameters a and b, it may be solved in exact form for the special value a=1.

Is there any hope of getting a closed-form solution or of expressing the solution in a neat way for the case 0<a<1? even some specific value of a would be of interest, e.g. a=1/2.

dsolve(eval(ode,{a=1}));

let us consider the series

y = a_0 - sum(a_i,i=1..n)

here the terms a_i are defined recurrsively as follows

a_i = (a_(i-1) -4*ln(x)/ln(10) + 4/10 + 4*ln(a_(i-1)) )/ ( 1+ 4/(a_(i-1) * ln(10)))

how can i program this in maple. so i can...

what is the general sum formula for the following seires (we may notice from these few terms it has a pattern)

f:=x->x^3:
y[1]:=0.5:
y[3]:=subs(x=y[1],f(x)):
i := 2:
y[i] := y[i-1]-(y[1]-y[2+1])*(1/2):
i:=1:
g[i] := (y[i+1]-y[i+2])*x/(y[i]-y[i+1])+(y[i+2]*y[i]-y[i+1]*y[i+1])/(y[i]-y[i+1]):
g[i] := unapply(g[i], x):
h[i] := unapply(solve(y = g[i](x), x), y):
for i from 2 by 1 to 7 do
g[i]:=(f@h[i-1])(x);
g[i]:=unapply(g[i],x);
y[i+2]:=subs(x=y[i+1],g[i](x));
s:=solve(z=g[i](x),x);
h[i]:=unapply(s[1],z);
end do:

for i from -1 by -1 to -8 do