Hello fellow digitheads, I'm running the spanking new Maple 12 and I would like to graph the rather harmless expression for wave motion a sin(x - v*t) When I type it in and bring up the Plot Builder assistant it gives me the option (among many) of making one variable the animation variable and the other two "slidable". When I hit "Plot" an "Interactive Parameter Maplet" pops up where I can slide the value of those parameters while it cycles through the animation.

Is there a way for Maple to make GET or POST HTTP requests?

If there are no direct Maple commands, has anyone written a package to do this possibly on top of the Sockets package?

Phil Yasskin

Hi all, im just starting with maple, mostly teaching myself how to code, but as you can see, i require some assistance.

ok, so, the basis of this program is to recreate the chaos game, check-out wikipedia if you want to know more, the chaos game is a basic and easy way to make the sierpinski triangle.

my problem is getting multiple plots on the same graph (see my code below)

the plots are in a loop, so each time the loop executes, a new point will be plotted on the original graph (the one right at the beginning that makes a triangle.

In the recent discussion about patching, a question about patching a function f including local variables of a module or another function was discussed. For example, let it be defined as

A:=proc() global f,t; local x,y,z;
f:=()->x+y();
y:=()->z;
t:=()->x+z;
x,z:=0,1;
NULL end:
A();

Now,

op(f);
                            () -> x + y()
f();
                                  1

How to change it so that it would return 2 instead of 1, without reassigning it?

hi

i've 40 samples which i should split up in 5 classes with a width of 0.5

i used TallyInto for doing this:

with(Statistics):with(ArrayTools):with(plots): with(plottools):
A:= <10.1, 10.6, 10.9, 10.0, 10.4, 10.5, 9.7, 10.5, 10.4, 10.1, 10.8, 9.2, 10.2, 10.3, 10.5, 9.2, 10.2, 10.5, 9.4, 10.2, 9.6, 10.2, 9.7, 10.2, 10.8, 9.9, 10.5, 10.6, 9.8, 10.7, 11.2, 10.8, 9.0, 10.0, 10.5, 10.4, 11.4,10.4, 10.1, 10.4>;
TallyInto(A, [9.0..9.5,9.6..10.0, 10.1..10.5, 10.6..11.0, 11.1..11.5], bins=5);

I´ve got problems with solving this task! Please help me with the solutions. Maybe someone knows how it works. I solved it from 1-4 and don´t know 5-8

Thanks

Tim

The Crank - rocker consists of rocker 1, coupler 2 and rocker 4. It´s connected with swivel joints. The rack is fixed.
We look at the  point mass m in A and the torsion spring (with damper) in B0. The weight and the inert force because of the motion affect in A (vx,vy ax,ay). All other components are without mass, rotary inertia could also been disregarded.

I have the following equation: -(1/12)*x+1 = sqrt(x-6)+0.5

Right click -> Solve -> Obtain solutions for -> x, only returns 1 of the solutions (6.), but I know there's another solution as well (+/- root) from the quadric formula. I already set the _EnvAllSolutions=true variable, which did not help.

Why doesn't Maple return both solutions and how to get it to do that?

Hi

When I run the attached code (basically just a big loop that doesnt do anything) it terminates early (when i is about 4600).

On my computer I get the error message "kernel connection lost".

On other computers it just stops.

It seems to be quite memory intensive but I don't understand why it terminates. normally if i run a large loop it may take a long time but it will get there eventually. I dont understand why this terminates in the middle.

 

any ideas would be great!

thanks

I was running the BirthdayPi procedure that was somewhere here in mapleprimes. 

I replaced the string evalf(.. _BigPi   with evalf(Pi, 1000000) and ran the procdure.  I hit the stop hand because it was taking too long then I ran it again with a different number.  shortly after it said kernel connection lost. 

I just upgraded my memory from 1Gb to 2.5 Gb (ie I removed 2 of the 4  512 Mb chips and replaced those with 1 Gb chips).  Could that have something to do with it?

Hi all. I m using maple 11. I plot a figure with loglogplot the problem is that the number of points at the low part of the x axis is very low. I increase the number of points but because it is a logaritmic plot the step is still too large for the low numbers but too small for the high numbers. Any ideas how to solve this? Thank you in advance.

This is one sort of Maple inconsistency that interests me. Why should the first example behave like evalf(Int(...)) and call `evalf/int` while the second example does not?

As we write a maple program to do whatever operation is, is it possible (in maple) to measure howmany operations per second was performed to achieve the desired result. Or in case of the iterative methods, how can we measure the speed by means of  iterations/second and/or the total time used to achieve the result. Is this kind of performance measurements possible in Maple?.

Thanks.

I was looking at the timelimit command in Maple, and wonder about whether it might be improved .

The help-page ?timelimit says that it suspends its checks while within builtin functions. It says that, inside builtins, the time limit is "ignored".

But Maple has a lot of builtins. And significant portions of the work may go on within them. Does this make the timelimit() function not useful, from a practical point of view?

What if timelimit were to make checks whenever garbage collection (gc) ocurred? That's a safe point, no? And gc can happen within some builtins? Or what if time checks were made at the same frequency that interrupt requests were checked? Those can happen within some builtins, at safe points.

Those were my thoughts, until I tried it. The command anames(builtin) shows that rtable() is a builtin. But I have found that timelimit will function within at least some rtable() calls.

I was reminded of this by another thread.

It is faster to add in-place a large size storage=sparse float[8] Matrix into a new empty storage=rectangular float[8] Matrix than it is to convert it that way using the Matrix() or rtable() constructors.

Here's an example. First I'll do it with in-place Matrix addition. And then after that with a call to Matrix(). I measure the time to execute as well as the increase in bytes-allocated and bytes-used.

> with(LinearAlgebra):

> N := 500:
> A := RandomMatrix(N,'density'=0.1,
>                   'outputoptions'=['storage'='sparse',
>                                    'datatype'=float[8]]):

> st,ba,bu := time(),kernelopts(bytesalloc),kernelopts(bytesused):

> B := Matrix(N,'datatype'=float[8]):
> MatrixAdd(B,A,'inplace'=true):

> time()-st,kernelopts(bytesalloc)-ba,kernelopts(bytesused)-bu;
                            0.022, 2489912, 357907

I've got a weighted undirected graph with 166 nodes and 191 edges. When using EdgeConnectivity I get a strange message:

Error, (in GraphTheory:-EdgeConnectivity) invalid input: GraphTheory:-VertexConnectivity expects its 1st argument, G, to be of type GRAPHLN, but received GRAPHLN(undirected, unweighted, V, A, `GRAPHLN/table/5`, 0)

Who can help?