I installed maple 12 as root user successfully. But sometimes simple command like
1+1 or any command takes a long time to complete. After a long delay maple
displays result. It's happening very often and it's annoying. I'm using Debian
Etch, kernel 2.16.8-custom.

Hi Everybody: I've a question about "convolution". How can I afford the convolution of different scaled functions?... In Example: F (2*X/T) in convolution with G ( X/T ) ? Is this equals to : Int ( F(2*w/T) * G((X-w)/T), w=-infinity.. infinity)? Am I wrong?... The particular problem is : Convolution of ( T*Triangle(2*X/T) ) with ( shah( X/T ) ), with Shah (x) = Sum( Dirac (x-n), n= - infinity.. infinity). Thanks for helping!

Hi everybody,

I am totally new to Maple, therefore the code I submit could be very inefficient. A few comments

help me here:

suppose we have:

h(x):=(x^n)/(sqrt(1+x^m))-log(1+x):

how can we find the best values of m and n such that h(x) > 0

one can show that for m = n = 1

h(x) > 0.

one may solve this by first finding the derivative of h(x)

diff(h(x),x)

and then solving

solve(diff(h(x),x),[m,n] )> 0

we may assume x > 0

which one is easier to decrypt  Vignere of length 6 or 2X2 affine matrix???

Hello

I'm interested in passing programs from Fortran to Maple, I have some queations:

 

1) Is it true that maple can only understand functions, and doesn't understand subroutines?

2) If Fortran function uses commands like "exp" "max" etc, is it okay?

3) If Fortran function uses external libraries (.lib, .dll) do I need to combine then somehow with the dll file I'm preparing for Maple? How?

I am trying to solve the following function for 'r' and 'theta' at various values of 'a' and 'zeta' in order to detemine the saddle points (r,theta). I have tried the following and it works fine! However, the process takes quite a long time. I was wondering if there is another method...say Newtons Method or otherwise to go about solving the two simultaneous equations (eq1,eq2) for (r,theta)?

Thanks

Robert

a:=1: zeta:=1:

I have a physics problem that I hope to get help from this forum. The question is like this:

 I have figure here but I cannot paste it. Anyway I will try to make an explanation of where the points in the circle are located.

 

I have 103 tables ( aal_l,  abf_l  etc )  which each has columns D, T, O, H, C  etc 

I want to exctract column C for all 103 table and store the result in a matrix

 

I know how to extract column C for one table

 

convert(connection:-ExecuteQuery("select C from aal_l", 'output' = Array), Matrix)

 

but how can it be done for multiple tables ...?

Hi,

in Maple 12 (worksheet mode), the box Maple draws around a plot to allow the user to resize the plot using the mouse appears in all my plots far too big if I label the axis. Before labelling the axes, the box has the appropriate size, but as soon as I label the axis, the box becomes far too big resulting in my plot being very small while the bos goes from one end of the screen to the other.

Any help on that?

Thank you very much in advance,

Ben

 

I loaded a 1600*3 matrix into Maple 12  from my mysql datbase on my computer and it took 3 minutes to load it .

I assume that the speed will be increase significantly if I had a fast internet connection ( both up and down ).

My Internet connection (tcp / ip) is extremly slow !!    Is this correct ?   Are there any other way to speed up the data exchange ?

 

Hi,

I am a relatively new user of Maple, and I try to solve numerically the following PDE system :

> pde01 := diff(c(z, t), t) = (diff(c(z, t), z, z))-(diff(c(z, t), z))+k*(a-c(z, t));

> pde02 := diff(b(z, t), t) = (diff(b(z, t), z, z))-(diff(b(z, t), z))+k*(a-b(z, t));

> cl1 := c(0, t) = piecewise(t <= 0.3, 100, 0.3 < t and t <=0 .5, 200, 0.5 < t, 100);

> cl2 := c(l, t) = b(l, t);

> cl3 := (D[1](c))(l, t) = (D[1](b))(l, t);

> cl4 := b(L, t) = a;

Hi can someone please help me . My program gives me the correct solution but it crashes afterwards. Can anyone tell me whats wrong with the program please.

 

Hello, I am currently using Nelder Mead for an optimization problem. I used the following code taken out of the Maple Library (www.maplesoft.com/applications/app_center_view.aspx?CID=1&SCID=18&AID=1198) Concerning this code I have 2 questions: 1. The optimized values I get are sometimes negative. My solution should be limited on positive optimization values. I am not sure how to implement this. 2. The optimization is running quite slowly. Any suggestions how to improve the running time? Here are the most important parts of the code:

graph the surface, tangent line and normal line for:

xy + yz + xz = 3 (1,1,1). choose the domain so that avoid the extraneous vertical planes.