Hello everybody. I'm a newbies here. I would be glad if anyone of you here could please help me to create a maple code to perform a full pivoting where it permits both row and column exchange.The code is to be used to any kinds of nxn square matrix..Thank you..:)

I recently upgraded to Microsoft Excel 2007 and have tried unsuccessfully to tie in to Maple through the ADD-IN function within Excel. A note at the bottom of the spreadsheet says "Initializing Maple..." but nothing happens and the sheet locks up. Any suggestions?

looking for the fastest complex number arithmetics... Hi all, I am looking for the fastest complex number arithmetics. There is one part of my program which needs complex number arithmetics. The final result is a real number. So I had two choices: (1) Using the C++ class, and do all the operations in complex domain, and finally extract out the real part of the result. (2) Calculate the real part of result in closed-form by hand, and program everything in C/C++ in real domain. I used to do (2). And I used Maple to help me obtain the real part of the complex-valued expressions in closed form and generate the C code. The speed is about 10x faster than (1).

f := piecewise( is(floor(x)::odd), 1, 0 ): seq( f(n), n=-5..5 ); plot( f, -5..5 ); produces (Maple 11) the expected output (sequence alternates 1 and 0 - plot is a square wave). Replace the definition of f by f := piecewise( floor(x)::odd, 1, 0 ): and the seq command still operates as expected but the plot shows f=1 between 1 and 2 but otherwise 0. Does anybody know what is going on here? It's probably not important but I am confused. Toby

Hi folks! Does anybody know if Matlab and Maple and Mathematica works well and stable on Vista? How about speed on Vista? Thanks!

Suppose I have two lists of equal length, namely List1 and List2, whose elements are numbers from the list M=[0,.1,.2,.3,.4,.5,.6,.7,.8,.9,1]: Both the lists have to satisfy following condition: List1[x]+List2[x]

I have been attempting to use Maple 8 to compute the limit of a function defined by a procedure (rather than as a piecewise function). For example, consider the following procedure. f := proc(x) if is(x,numeric) then if x > 1 then 1; elif x <> returns undefined. limit( f(x),x=1,right) --> returns undefined. When I use a piecewise definition, all is well: f := x->piecewise( x>1, 1, x

Sorry, but I don't understand why Maple produces two different answers. (I make many analysis calculations, some expressions [math functions] come directly, e.g. 5x-3, some by Maple e.g. by series command.)

s:=x-1/2*x^2+1/3*x^3+O(x^4);

                               1  2   1  3    / 4\
                           x - - x  + - x  + O\x /
                               2      3           
t:=series(ln(1+x),x,4);

                               1  2   1  3    / 4\
                           x - - x  + - x  + O\x /
                               2      3           
nops(s);

My laptop is broken and I am seriously considering purchasing a new laptop. I mainly use the laptop to do all kinds of programming, including Matlab, C/C++, Fortran, Maple, Mathematica, etc. I am wondering if anybody can tell some experiences about speed performance of Maple on Core Duo Dual Core processors? Are the computations on these computers really faster? I recall a few months ago I had tested a Monte Carlo program in Matlab on my friend's new Intel Quad Core (4 cpus). He paid $6000 for a desktop like that. The speed was not improved at all.

This one? int(log(c*exp(k*s)-d), s= 0 .. t) assuming (t>0, c>0, k>0, d>0) Thanks!

I'm trying to get the simple form of sum{k=1 to n} _2k C _k... I've tried to use Pascal's triangle, the gamma function, etc... but I couldn't get it... Somebody help~ My guess is _2k C _k is equal to binomial(2k,k). I used Maple... and the answer is ... as I see, a complex number!

F:=binomial(2*k,k);
                              binomial(2 k, k)
DefiniteSummation(F,k=1..n);

         (1/2)                                                               
    4 I 3                                            /[       3]            \
- -------------- - binomial(2 n + 2, n + 1) hypergeom|[1, n + -], [n + 2], 4|

Hello, I´m trying to create a maplets, but crash out with problem, I don´t now how to create in a smart way a method for count the number of varibles, I did that in the following lines: for Num from 1 to 1E6 do > A[Num]:=assigned(u[Num]): > if A[Num]=true then > N:=Num > end if; > end do: u[k] is a vector, and N, obviously the number of them. because I guess that the user, don´t want introduce more than a million of vectors, I don´t like that way. If somebody know the answer to my (maybe silly) question, please, explain it. Please replace this text with the link to your file.

I am trying to write a procedure which takes a list of (linear) expressions in two variables and a list of assumptions on the two variables and returns all of the possible orderings of those expressions. To my dismay, the assuming facility does not seem to be working properly. I using Maple 9 on a Windows System. The following input illustrates the problem. coulditbe(mU > 1-u) assuming mU true Maple returns true! The first assumption alone eliminates the possibility of this being true. What's going wrong and how do I get this to work? If you wish, you can plot these assumptions and though at least two are redundant, there is a feasible region.

Can maple be run without the gui? Some maple command I run are taking a long time to complete and apparently I am running out of ram(I only have 2gb on the machine where maple is installed). But, I also have a cluster of quad opterons each with 16gb of ram, but these machines have no video system. Can maple be run in bash shell??

Hi I am looking for eigenvectors of a messy jacobian matrix, maple is taking its sweet time with this (but still probably faster than me ;)) I have access to a 250 node(dual and quad opteron) cluster, is there anyway to run maple in parallel? If not will maple see a speed up when run on a dual proc or dual core workstation?