hi,

I am trying to implement some data-intensive algorithms like: comuting similarity scores, clustering etc. How efficient Maple is in doing these operations? I mean is it comparable to MATLAB in these operations? What toolboxes are useful in these? I am trying to build a recommender system.

I am using Maple18 and not sure if Maple has any advantage in implementing these type of algorithms over MATALB??

thanks

siba

I need to find the Killing vectors of a metric.

I initiate the session as

> restart;> with(DifferentialGeometry); with(Tensor); with(LieAlgebras);> DGsetup([t, r, z, phi], M);

and enter my metric as

M > g1 := evalDG(-dt &t dt ...);

I do not have an unknown function in my metric but I have two free parameters (e.g. a and b).

I use

M > K1 := KillingVectors(g1, parameters = [a, b]);

What is the distance between the trigonometrical polynomials of the form a0/2+a1*cos(Pi*x)+b1*sin(Pi*x) and the polynomials of degree at most 1, ie c0+c1*x, in the Chebyshev metrics on the interval [-1,1] and in the L^2 metrics on the same interval?

There are a lot of Maple applications in calculus,...

You must be logged into your Facebook account in order to share via Facebook.

Click the button below to share this on Google+. A new window will open.

You must be logged in to your Twitter account in order to share. Click the button below to login (a new window will open.)

Please log-in to your MaplePrimes account.

Wrong Email/Password. Please try again.

Error occurred during PDF generation. Please refresh the page and try again