Dear all

I am facing to run the following expression for an arbitrary values of M, k and alpha.

u := simplify(sum(sum(c[p, q]*2^((K-1)*(1/2))*(sum(sum(sum(sum(2^((K-1)*(p-i-j+q-k-l))*GAMMA(p-i-j+1)*x^(p-i-j-alpha)*(1-p)^j*(1-q)^l*g[i]*binomial(p-i, j)*binomial(p, i)*binomial(p-k, l)*binomial(q, k)/GAMMA(p-i-alpha-j+1), l = 0 .. q-k), k = 0 .. q), j = 0 .. p-i-ceil(alpha)), i = ceil(alpha) .. p))/sqrt(2*(-1)^q*factorial(q)^2*g[2*q]/factorial(2*q)), q = 1 .. Delta), p = ceil(alpha) .. Delta));
FD := simplify(convert(%, StandardFunctions)); expand(radnormal(convert(FD, elementary)))

Please correct it and run it for M=10, k=1, alpha=0.5.

Hello,

I have a optimization question in the following picture.

Question: find matrix T(t). 

I writed a maple code. Could you view it ? You think that it is right?

The code file I writed: maple_code_of_theory.mw

 It is really very important for me. Can you help me?

Thank you. 

,Hello everyone 

...I need code for save maple's project like a video

Thankyou

Hi all. I need to solve a large number of PDEs (partial differential equations) symbolically and simultaneously, to find the linearly independant answers for all of them, I use

ans := pdsolve({seq(PDE[i]=0,i=1..d)});

The PDEs are all linear first order and it is very easy to solve them one by one by hand, but in some cases I have 100 PDEs or more, so Maple is either very slow or doesn't work. For d=120, it was evaluating for hours without a result.

For example I have d=120 PDEs, and 200 variables. It works for d=30 of them (takes 13 minutes on my 16GB RAM  windows 7 computer). So if I do this:

ans1 := pdsolve({seq(PDE[i]=0,i=1..30)});

ans2 := pdsolve({seq(PDE[i]=0,i=31..60)});

ans3 := pdsolve({seq(PDE[i]=0,i=61..90)});

ans4 := pdsolve({seq(PDE[i]=0,i=91..120)});

Then how can I have only one vector of the linearly independent answers of all of them?

And in general, is Maple supposed to do this kind of calculations at all?

If yes, do you have any ideas on how to improve this procedure? 

If not, do you know in which software or programming package I can solve a large number of PDEs symbolically?

Your help is much appreciated. 

If you have a list that is too large the list will go off the screen without a way of scrolling.

Is there a way around that?

Here's some test code

with(Maplets):
with(Elements):
maplet := Maplet([["Pick a color:  ", ListBox['LB1'](sort(["blue", "red", "wheat", "yellow", "brown", "gold", "plum", "orange", "pink", "khaki", "magenta", "maroon", "white", "green", "aquamarine", "black", "gray", "navy", "coral", "cyan", "sienna", "tan", "turquoise", "violet", seq(i, i = "a" .. "z")], lexorder))], [Button("OK", Shutdown(['LB1'])), Button("Cancel", Shutdown())]]):
result := Maplets[Display](maplet);

The Maplets, Elements, ListBox (ListBox) example given on the help page doesn't work.  I use the button to transfer the page to a worksheet window but then when I execute them I get an error.  Below is the example given on the help page.  And following that is the errors given after execution.

How do I simulate the follow stochastic differential equations. Thanks very much!

dx=x*(5-2*x-3*y-z)dt+5x*dB1(t);

dy=y*(4-*x-5*y-2z)dt+4y*dB2(t);

dz=z*(2-5*x-7*y-2z)dt+2z*dB3(t);

I am attempting to minimize an objective function that is related to a p-median problem (facility location). Can somebody please tell me how to impose a constraint that comprises 0 or 1? For instance, I wish to assign the condition, x[i,j] = 0 or 1; in other words, x[i,j] = 1 if the point i is assigned to facilty located at point j; 0 otherwise.

Thanks in advance!

i need to find the graph of exp(v(r)) from 0 to 2e6.

i obtained the graph of v(r) by taking log but how to obtained in exp form

graph_of_exp_form_of_u(r).mw 

Hello,

I would like to know if it is possible to create a dll function from a maple function (a procedure) which would be directly usable in a excel sheet.

In other words, similary to the VBA function that it is possible to build in Excel, i would like to create a dll function that i could use in Excel.

If it is possible, can you help me to use a good process?

Thank you for your help and feedback.

I have four matrix equations

P1, P2, P3 are known 4x4 matrix.

A1 A2 A3 A4 are known 1x4 matrix.

x1 x2 x3 x4 are 1x1 known matrix.

U is 4x4 unknown matrix.

These equations are 

(A1^T*U*P1*A1) +( (P2*A1)^T*U*P1*A1) + ( (P3*A1)^T*U*A1) + ( ( P3*A 2)^T*U*P1*A1) + x1 =0;

(A2^T*U*P1*A2) +( (P2*A2)^T*U*P1*A2) + ( (P3*A2)^T*U*A2) + ( ( P3*A2 )^T*U*P1*A2) + x2 =0;

(A3^T*U*P1*A3) +( (P2*A3)^T*U*P1*A3) + ( (P3*A3)^T*U*A3) + ( ( P3*A3 )^T*U*P1*A3) + x3 =0;

(A4^T*U*P1*A4) +( (P2*A4)^T*U*P1*A4) + ( (P3*A4)^T*U*A4) + ( ( P3*A4 )^T*U*P1*A4) + x4 =0;

How can i find 4x4 matrix U by using these above four equations??

Thank you

First Question: How to define nx1 matrix Y:=(y1,y2,...,yn) ? (n is a Natural number while it is ungiven)

Second Question: How to derivative of matrix Y with respect to nx1 matrix X:=(x1,x2,...,xn) ?

My efforts for the first question:  (I know to define 6x1 matrix etc. , but I dont know to define nx1 matrix

restart: Matrix(1..6,1,symbol=y) 

My efforts for the second question:

restart; with(VectorCalculus);
Matrix([x^2, x*y, x*z]);
Jacobian([x^2, x*y, x*z], [x, y, z]);

Can you help me? 

I'm looking for the Maplets package for Maple 7 that was available on the old mapleprimes.  Does anyone have it?

I did not realize Maple 2016, since Maple 2015 actually, had stopped Windows XP support. 

      Inspired by the theme
http://www.mapleprimes.com/questions/219995-Finding-A-Convinient-Parametrization-Of-Surfaces
Examples in the Mathematica did Alexander Bannikov.
It is equidistant radius 0.1 to the surface

   (x1 ^ 2 + x2 ^ 2-0.4) ^ 2 + (x3 + sin (x1 * x2 + x3)) ^ 4-0.1 = 0;

https://vk.com/doc7819263_439405418?hash=af46d61d8aad95f70b&dl=9f245f5b6b68b47075

and an example of parameterization the same surface

https://vk.com/doc7819263_439432143?hash=36cf31d52c97e2e373&dl=7e4fa17a771dffb331

As I have understood from the words of Alexander Bannikov, parameterization was performed using the functions: RegionFunction, ContourPlot3D, ClippingPlanes.

It turns out that Maple functions inferior?