I am new to Maple. I need to measure the time complexity of computing the GCD for a set of 1024-bit numbers. I have an equation as:

O(nm × log^2 m × log log m). Where n is the number of bits in the numbers in my set (say, 1024-bit) and m is the number of times I am going to do a computation. How can I perform this computation in Maple ?

helo

i want an exaact answer(numeral) of an equation but I can't maple answer a realation that include sin,cos,root,z how can i simplify that to a number

Hi

Is there a way of importing data in NetCDF format into Maple 15? This format is very widely used in atmospheric sciences as a data standard for experimental data such as satellite-derived data.

Thanks

if rsolve is solving difference equation for L(x) in summation(L*z^n, n=0..infinity)

can i use double encapsulation to solve for summation(L*z^n/n!, n=0..finity)

step 1 use rsolved result of a given classic difference equation times z^n/n! * t^n

step 2 then summation step 1 and use celine method to change into difference equation again

step 3 solve this new difference equation

then i imagine L should be L*z^n/n!

but i am not sure...

restart;
with(SumTools):
an := -n+L;
bn := -x+L;
gen := Summation(Product(an, L=0..k-1)*Product(bn, L=0..k-1)/k!*(-1/a)^k, k=0..infinity);
genfun1 := subs(a=z,simplify(gen));
genfun2 := exp(z)*(1-(z/mu))^x;

correct is genfun2

but using famous hypergeom of charlier written in many books and papers, it can not summation to a correct generating function

Based on past releases, after Dec 31 any hope of a 16.03 update becomes very very slim. 

You see, any last issued updates (back to Maple 11) have all happened before the turn of the new year.  And should we make it into the new year without one last update then we can almost be certain that Maplesofts focus is all on the next major release, Maple 17.

There is always hope, that a few more loose ends can be tied up before the next major release, however...

Hello,

I am working on a project where Maple's output is fed to another software which requires all it's input in specific format. So, I want to print this expression,say

y=+2.*x+.2, in this software, but it takes input as

y=2*x+0.2, So now I have to change

+2. to 2.0 or 2 (if it's starting of the equation)

-2. to -2.0

.2 to 0.2

Is there any way to convert all the numbers in the equation to...

use the formula provided in

http://en.wikipedia.org/wiki/Hermite_polynomials

and run in Maple

Restart;
with(SumTools):
Hn := n!*Summation(((-1)^(n/2-l))/((2*l)!*(n/2-l)!)*((2*x)^(2*l)),l=0..n/2);
genfun := Summation(Hn/n!*z^n,n=0..infinity);

but result is not exp(2*x*t - t^2)

1. I use your previous reply on V_G derive  on other characteristic function, but most are undefined

or complicated solution or can not evaluate, why?

for example

charc := 1+i*X/(i*X-1);
int(exp(-I*X*u)*charc, X = -infinity .. infinity);

it got this complicated thing
piecewise(Im(1/i) = 0, undefined, int(exp(-I*X*u)*(1+i*X/(i*X-1)), X = -infinity .. infinity, method = _UNEVAL))

Density := int(exp(-I*X*u)*charc, X = -infinity .. infinity);

Hi,

I'm running a 2D parameter sweep from Maple 15 on a MapleSim 5 model. The output is stored in a 2D matrix.  I've encountered two problems:

1) when I graph it with matrixplot the z-axis values are fine but I can't figure out how to change the x-axis and y-axis values from the matrix indices to the actual values of the swept parameters. 

2) When the parameter sweep begins I get a warning about storing the values in a matrix.  Maple...

I would like some help in order to build the following algorithm (Gianni-Kalkbrener) on Maple.

I have a cyclic-5 problem of the following polynomials

L := [a*b*c*d+b*c*d*e+c*d*e*a+d*e*a*b+e*a*b*c, a*b+b*c+c*d+d*e+e*a, a+b+c+d+e, a*b*c*d*e-1, a*b*c+b*c*d+c*d*e+d*e*a+e*a*b]

I found the Grobner basis of that using:

GrobnerBasisOfL := Basis(L, tdeg(a, b, c, d, e))

Then, I have found the FGLM of the Basis using:

Hi im using maple 16 and defined a vector field that is lengthy below,

(and yes i defined with(VectorCalculus), and SetCoordinates(cartesian(x,y,z)) (x,y,z is subscripted)

And i am using a type of line integral for the work of a particle's path through a force field which i defined here as Z.

Hello,

I'm trying to fit some of my research data to a polynomial.   I can do this, but what I need to know is how Maple is calculating the standard errors.  In other words. I need to know the underlying forumla Maple is using for these standard errors.

Is there any documentation on this anywhere?  

For reference, the Maple command I am using is:
LinearFit([Z^(-2),Z^(-3),Z^(-4),Z^(-5),Z^(-6),Z^(-7),Z^(-8),Z^(-9)],X,P2,Z,output=standarderrors); 

http://en.wikipedia.org/wiki/Hodge_theory
H(M) = ker(d_k) / im(d_k-1)

would like to see the example of calculation of H(M) above

eqn := y^2 = x^3 + a*x  + b

where a and b are summation of things, or constant

if use convert(eqn, ratpoly) to get a ratpoly

can it be used to guess gf using guessgf directly?

or

convert ratpoly to differential equation and then calculate eigenfunction and calculate generating function?