Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

hi!

two questions for the most expert among you:

question 1)

i want to evaluate a function A in a point identified by a number of variables that i have already numerically found from the solution of a sistem (let's say my solutions are S:={B=0.01, C=0.2, D:=0.3} ) but A also depends on another variable (Z) to which i want to assign a value

so i need to write eval(A,S) but also considering Z and it seems that eval(A,{S,Z=1}) doesn't work.

how do i tell maple to compute A considering both the solutions in S and Z=1?

question 2)

Hi:

exponentiating a matrix seems very slow. Consider this:

with(LinearAlgebra):

M:=RandomMatrix(10,10, generator=0.0..1.0):

st:=time():
MatrixExponential(M, -I*t):
time()-st;
                                   17.251

the same code takes ~0.1 second in MMA.

Here is my problem. I have some data in excel format organized in three columns of x, y, z values. I am able to import the data in maple via the assistant tool and create a 3d surface plot. Now I would like to create a 2d contour plot on the x-y plane and possibly put the 3d surface and the 2d controur plot together. Do you think this is doable without changing the data format? I have looked for other posts, but none of them seems to highlight the data format problem. Thanks in advance, regards, Man

I have a dataset list of points, representing location x,y and one for depth z. 

x:=[...]
y:=[...]
z:=[...]

What command is best for plotting a 3d surface out of those points?

All:

How do I make a 3D plot of a volume that is created when a planar surface is extruded in a direction that is peripendicular to the surface? 

For example, a plot of the volume that results when the region between x^2 and the x-axis from x=0 to x=2 is swept vertically in the z direction 5 units. 

Thanks,

Phil

Now I am using a method that kept trying polynomial to check whether it is primitive. This method works fine for not very large Galois field. But for large one, like GF(2^1024) or GF(2^2048), it is pretty slow. Is there a way to quickly find ONE primitive polynomial in GF(2^1024) or GF(2^2048)? Just one, not too many. Thanks Gepo Method I am using: findprim := proc (n, deg) F := NULL; i := 0; while i

Hi,

I try to calculate a contour integral(in fact it is the contour integral defined in the principle argument theorem) with a function that was given in my earlier entry here

y:=2.0;W:=(2^(z+3/2)*Pi)/(GAMMA(-z/2)*GAMMA(1/2-z/2)):V:=1.0;
  f:=1+((abs(V))^2/W^2)*(CylinderD(z,y)^2)*(CylinderD(z,-y)^2-CylinderD(z,y)^2);
 

I try to use this f in this contour integral as:

phi:=t→exp(I*t);

g:=(diff(f(phi(t)),t)/f(phi(t))) * diff(phi(t),t);

here I give f ` (z)/f(z) is g. And

 

Hi

I am trying to define a funciton I'd like to call approx3f that calculates the taylor expansion of a function f(x) around a point "a" up to 3 terms.  So i want this function to be able to recieve a funciton f(x) and a parameter "a" as its input.

I wrote this:

approx5f :=(f,a)-> f(a)+f'(a)*(x-a)+1/2*f''(a)*(x-a)^2

but i think my definition is wrong cuz it doesn't work.  How can i make maple understand f is a function and then input "a" in it and its derivatives.

Is there a general template to follow for extracting scientific data from a website? 

Hi all,

I was wondering how I would introduce the generalized hypergeometric function command in maple ? This is  like HypergeometricPFQ[ {{1 - \[Nu]/2}, {1}, {1, -(\[Nu]/2)}}, {{2, 3/2}, {}, {1 - \[Nu]/2}}, z^2/2, z^2/2]  in Mathematica but when I try to give it in maple I get error messages...

Thanks!

Hi guys! This is my first question in this forum. I'm a newuser so forgive me if my questions are really basic.

I wrote a non linear system with a number of unknowns and I want to find solutions for a set of values attached to x.

Let's say x:=[0.1, 0.2, 0.3]

I know I have to redefine x:=i and write a "do" command like

for i in x_   do s(i):=fsolve({independent equations},{unknowns to be numerically found})

and i have three sets of solutions s(0.1), s(0.2) and s(0.3)

i want to get compute the extended Euclidean of two polynomials and now I am using gcdex, but it takes too much time for big polynomial. For example: alias(a=RootOf(1+z^31+z^23+z^11+z^7+z^2+z^32)); gcdex(x^32,x^32+(a^15+a^11+a^6)*x^31+(a^13+a^10+a^3)*x^23+(a^11+a^7+a^2+1)*x^11+x^7+a^13+a^10+a^3+a^1+1,1,x's','t'); Is there a better way to do this? Thanks Gepo

Hello,

I am using Maple 13 under Linux and cannot seem to plot.  I get a message like

Error, (in plot) type `has_unit` does not exist
 

Furthermore, the Table, Plot, Drawing and Spreadsheet menus are greyed out so I cannot access them.  How can I rectify this?  Are these features disabled for some reason under Linux?

I have to write a program that takes a plain text; that characters are represented on 5 bits. My information vector is of the form W=[a,b,c,d]. the sent vector is of the form C=[x,y,a,z,b,c,d] where x,y,z are parity check elements. I don't know how to get my W

Our previous article described the design of fast algorithms for multiplying and dividing sparse polynomials. We have integrated these algorithms into the expand and divide commands of Maple 14. In this post I want to talk a bit about what you might see when you try Maple 14. Keep in mind that the product isn't released yet and I don't work for Maplesoft, so general disclaimers apply. Nevertheless, one of the first things you may notice is this.

task manager with maple 14

First 1816 1817 1818 1819 1820 1821 1822 Last Page 1818 of 2224