I refer to a specific solution using the label. I get two equations after using solve, and I want to introduce them in another system to solve applied again.

Please explain me why it happens:

with(LinearAlgebra);

MatrixInverse(`<|>`(`<,>`(a, c), `<,>`(b, d)));

Error, MatrixInverse is not a command in the LinearAlgebra package

WHY? Whats wrong, please explain me?

The greatest benefits from bringing Maple into the classroom are realized when the static pedagogy of a printed textbook is enlivened by the interplay of symbolic, graphic, and numeric calculations made possible by technology.  It is not enough merely to compute or check answers with Maple.  To stop after noting that indeed, Maple can compute the correct answer is not a pedagogical breakthrough.

It has been a while since my last post, mostly because of a combination of getting Maple 14 ready to ship and a lack of meaty topics to write about. I am trying to get back into the habit of posting more regularly. You can help me achieve my goal by posting questions about parallel programming. I'll do my best to answer. However for now, I'll give a brief overview of the new parallel programming features in Maple 14.

A new function has been added to the Task Programming Model. The Threads:-Task:-Return function allows a parallel algorithm implemented on top of the Task Programming Model to perform an early bail out. Lets imagine that you have implemented a parallel search. You are looking for a particular element in a large set of data. Using the Task Programming Model, you've created a bunch of tasks, each searching a particular subset of the data. However one of the first tasks to execute finds the element you are looking for. In Maple 13, there was no built in way of telling the other tasks that the result have been found and they they should not execute. In Maple 14, the Return function allows one task to specify a return value (which will be returned from Threads:-Task:-Start) and signal the other tasks that the algorithm is complete and that additional tasks should not be executed. Tasks that are already running will still run to completion, but tasks that have not started executing will not be started.

You may have noticed that there is a race condition with Return. What happens if two tasks both call Return in parallel? Only one of the values will become the value that is passed to Threads:-Task:-Start. I suppose I could say the "first" value is the one that is used, but really, what does that mean? If you call Return, then the value passed to Return should be an acceptable result for the algorithm.  If you call Return more than once, any of those values should be valid, thus it shouldn't matter which one becomes the return value.  That said, the Return function does give some feedback. In the task that succeeds in having its value accepted, Return will return true. In all other tasks that call Return, it will return false. This allows the code to know if a particular result was or was not accepted.

Maple 14 also adds the Task Programming Model to the C External Calling API. This means that you can write your algorithms in C and make use of the Task Programming Model. The C API is similar to the Maple API, with a few differences. In particular, you need to create each child task individually, instead of as a single call to Continue, as you would in Maple. As well, because it is C code, you need to worry about a few details like memory management that are handled automatically in Maple.  Using External Call is fairly advanced, so I won't go into too much detail here.  If you'd like to see more details of using the Task Programming Model in External Calling, I can write a seperated post dedicated to that.

As with every release of Maple, we spent some time trying to make our existing functionality faster and more stable. For parallel programming, we reduced the overhead of using the Task Programming Model, as well as reducing the locking in the kernel (which should help improve parallelism). Of course many bugs have been fixed, which should make parallel programming more reliable in Maple 14.

Since the FIFA World Cup final is approaching quickly, I have created this animated Netherlands flag.  It is for my Dutch acquaintances to cheer for their favourite team during game.

with(plots):
p := [ seq( 
          plot( [ seq((1/4)*sin(x+`if`(j > i, 1, 0))+1+2*i, i = 0 .. 3) ],
              x = 0 .. 2*Pi, y = 0 .. 8, 
              color = [white, blue, white, red], filled = true, axes = none), 
          j = [0, 1, 2, 3, 4, 3, 2, 1])

Hey Guys,

I am trying to plot a graph using the following code:

with(plots); restart;
a := sum(m^i*exp(-m)/factorial(i), i = 0 .. c);
l := [];
for c from 0 to 40 do
l := [op(l), a]
end do;
plotlist := [seq(plot(l[n], m = 0 .. 40), n = 1 .. nops(l))];
plots[display](plotlist);

I would like to plot this fuction as a loglogplot.  Can anyone help me with this?

Thanks in Advance

Hi guys,

I am dealing with a function, kappa:=6*log(R)/(R^2). To plot this, I use the command plot([kappa,R,R=0.99..6]).

However, I want the first branch of the graph to be coloured in fully, and the second branch to be dashed. Is this possible? I think I need to split the graph in 2 using the command line.

Thanks in advance

Hi,

i want a first order condition as which expresses the optimal l as a function of q and a

I did this

diff((q*l^(1/3)*q)*(1-l)^(1/2)+(1-a)*(1-q*l^(1/3))*q*(1-l)^(1/2)+a*(1-q*(1-l)^(1/2))*q*l^(1/3), l)

and got

(1/3)*q^2*sqrt(1-l)/l^(2/3)-(1/2)*q^2*l^(1/3)/sqrt(1-l)-(1/3)*(1-a)*q^2*sqrt(1-l)/l^(2/3)-(1/2)*(1-a)*(1-q*l^(1/3))*q/sqrt(1-l)+(1/2)*a*q^2*l^(1/3)/sqrt(1-l)+(1/3)*a*(1-q*sqrt(1-l))*q/l^(2/3)

which i think is right

Just for fun, I'm reviving the Maple soccer ball in anticipation of the FIFA final. You can make a simple animation by adding the option viewpoint=[circleleft] to the display command.

with(plots):
geom3d[TruncatedIcosahedron](p);
V := evalf(geom3d[faces](p));
display(seq(polygonplot3d(V[i], color = `if`(nops(V[i]) = 5, black, white)), i = 1 .. 32), scaling = constrained);

Hello,

I have 3 points:

A:=<a,b,c>;

B:=<e,f,g>;

C:=<h,i,j>;

Please show me what is wrong: plane(p1,[A,B,C],[x,y,z])

how to make a plane with these points.

error: Error, (in geom3d:-Equation) wrong type of argument

Thanks a lot!

I suppose this topic has come across many peoples minds at one time or another and I've only taken this number for granted and with a grain of salt.  I have become curious as to what other Maple users would run the memory usage up to? 

For myself I find on average usually running below 10Mb or so.  I suppose this is average, for me, but I haven't usually created large worksheets, I don't think I've ever let it run over 40Mb. ...

hi dear friends

i want to solve this int with numeric methods such that doesn't contain erf function

thanks alot

(my function is e1, and I want to calculate the int of e1)

Here is yet another finesse (new to me) in getting better performance for some floating-point computation involving the Statistics package.

> restart:

> X:=Statistics:-RandomVariable('Normal'(0,1)):

st:=time():
seq(Statistics:-Quantile(X,1/i,numeric),i=2..10000):
time()-st;[%%][-1];
                                    6.786
                                -3.719016485

> restart:

> X:=Statistics:-Distribution(Normal(0,1)):

Hi everyone, I just created my account in mapleprimes but I regularly find solutions to my problems searching through the posts, however, this time I was not so lucky.

I have the following problem in Maple: I have defined two procedures, A(v::array) and At(v::array) which perform simple algebraic tasks on 2x1 arrays. Then, I redefined the operation `+` when acting on two such arrays using overload. This new definition for addition does not correspond to normal matrix...

With the idea developed by Robert Israel on the