Hello everybody

I need to simplify (or even approximate ) a huge expression which is a two-variable function of x and t,

including  SinCos and Exp. ( it's length is like 10 pages ! )

I tried everything but nothing worked.

Please HELP !

it starts like this:

Q(x,t):=

Hello, 

I am just starting to learn about maple.

I have a graph of two functions and would like to find the range that they agree within

 a certain percentage using fsolve() and format the interval as a list. 

The part that is throwing me off is the within a certain value part.  Thanks in advance!

where is wrong?

illegal use of a formal parameter

evolf := proc(z, f, terminal_counter)
h1 := z + f;
h2 := z - f;
h3 := z*f;
h4 := z+diff(f,x);
h5 := z-diff(f,x);
h6 := z*diff(f,x);
h7 := subs(x=z, f);
N := 7;
test := [h1, h2, h3, h4, h5, h6, h7];
print(test);
fitness := [0, 0, 0, 0, 0, 0, 0];

if terminal_counter > 5 then
    return fitness;
end if;

total_fitness := 0;
for i from 1 to N do

I've been using LagrangeMultipliers to solve a problem. Solutions returned involve RootOf.

What I want to do is extract the expression within RootOf() so that I can do fsolve() on that.

The expr from RootOf is a 6th order polynomial in _Z.

I've tried convert(RootOf(...), radical), but it doesn't work very well on polyhnomials of order greater than or equal 5.

Any suggestion(s) for this extraction that I want ?

A := C/H/k*Q/R1/R2/(-1+R1)*(Q*R2*R1-R1*R2+1)-2*C*Q*(R1*R2+1)/H/k/(-1+R1)/R1/R2;

plot14:= plot(subs({Q=6,R2=8.75,k=4,C=1.96,H=7},A),R1=0..1,color=blue):

display(plot14,view=-15..10);

points:=op([1,1],plot14):

writedata("c:/khan/plotdata.txt",points,float);

Error, (in writedata) Bad data found undefined

Any one there?

I would like to pay  attention  to the PhD thesis by John Baber in an actual field of complex analysis done with Maple: http://arxiv.org/PS_cache/arxiv/pdf/1106/1106.4737v1.pdf . It should be noticed that the usage of Maple is an essential tool of this work (for example, see p. 28, 43, and around), not a fashion trend.

Hi all,

I've just downloaded and installed the Maple 13.02 update, and when I go into the Maple Portal, I am finding that it sometimes locks up when I click on a hyperlink. When I say "locks up", I mean it simply stops responding.

It is 64-bit Maple running in a 64-bit Win 7 environment.

The only thing that I can think of is that the issue is related to Java somehow (which is what Maple is based on, correct ?)

thanks,
Andrew J Fortune,

I'm working on a 3D program that plots stars, star clusters and other objects of interest against a model of the Milky Way. The guts of this program create a few hundred points (< 2000) that represent stars, and move them a little bit in random directions to create a cloud effect. Then the animate procedure rotates them about the center of the galaxy. I would like to add more stars and do more things with them, but I am encountering a very sluggish editor, suggesting that Maple is imposing a memory limit. The Activity Monitor says that Maple is using 140 MB, so gigabytes of RAM remain available. Furthermore, if I save the plot as an animated gif, I can run half a dozen copies simultaneously in separate browser windows without encountering noticeable slowdown. But I can't elaborate the program without better performance from the editor.

The program is written in the Document interface. I tried saving it to the classic interface, but that didn't seem to help, and I found it difficult to edit.

Ideas sought.

The problem has been discussed in mapleprimes before, but I have not come across a neat solution. Perhaps there is one. What is the state of the art for exporting 3D graphics (plot3d, etc.) with Maple 15?

What I think I know is this: standard GUI has a completely new way of treating 2D graphics but has an outdated way of rendering 3D, while the classic GUI, though no longer developed, for some reason typically renders better 3D graphics.

I used to export graphics...

> restart;
> with(LinearAlgebra);
> with(linalg);
> with(ArrayTools);
> n := 2; p := vector([2, 3, 3]);

> x := vector(n, []);
> x0 := vector(n, []);
> st := vector(n, []);
> for i to n do x0[i] := 0; st[i] := -1 end do;
> f := (x[1]-p[1])^2+p[3]*(x[2]-p[2])^2;
                          ...

Dear all,

I have encoutered a funny problem with Optimization package. I minimize some long stuff (lets call it A) and get an answer, e.g.

[.116553990209052046e-19, [n = 4.24568325257496060, rhocut = 1.66125593854788400, m = 2.00000021862965971, rho = .956914761577446150]]

then i just do

evalf(subs(n = 4.24568325257496060, rhocut = 1.66125593854788400, m = 2.00000021862965971, rho = .956914761577446150, A));

and i get

> restart;
> with(LinearAlgebra);
> with(linalg);
> with(ArrayTools);
> n := 2;
> x := vector(n, []);
> x0 := vector(n, []);
> st := vector(n, []);
> for i to n do x0[i] := 0; st[i] := -1 end do;
> f := proc (x) options operator, arrow; x[1]^2-4*x[1]+x[2]^2-2*x[2] end proc;
         2                2 ...

I tried a partial differential equation example from a Robert Lopez example.  The answer shows a nice smooth graphical representation of heat transfer. 

However why does my method here, using numeric pdsolve, not produce the same results? 

Also pdsolve using numeric does not use the default timestep of 1/20.  Explicitly telling Maple to use timestep of 1/20 produces a different graph telling me that the default value is not being used in pdsolve.

Hello,

I have recently been toying around with nonlinear fitting for as part of a research job and I've been having problems getting nonlinear fit to:

1) work

2)create a good fit.

Here is my input:

> with(Statistics); with(plots); with(LinearAlgebra);
> list1 := Vector([0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70,
 75, 80, 85, 90, 95, 100, 105, 110, 115, 120, 125, 130,
 135, 140, 145, 150, 155, 160, 165, 170,...

In coding theory, there are parity-check codes whose parity-check matrices H are generated via column permutations. For instance, the LDPC codes constructed in Gallager's 1962 IRE Trans paper uses the following H matrix:

[ X1 ]

[ X2 ]

[ .... ]

[ Xn ]

where submatrices X2 .. Xn are just random column permutations of X1. However, to make the codes efficient in decoding, there is one restriction which requires that any two row vectors in...