I have a Maple program that fits a nonlinear function with 9 parameters to a dataset that contains multiple records; each record gets fitted separately. The records are ordered by a certain experimental variable (an angle of a target). The initial parameters for each fit are the solutions of the previous fit; in this case I get relatively good initial estimates and not too much trouble fitting. I use Statistics:-NonLinearFit to do the actual fitting.

Since this is a bit time consuming and I need to do this a fair amount of times, I'd like to see if I can't speed his up by employing parallel programming.

One way to speed up a fit is to compute the sum of residuals in parallel; is there a way to do this in Maple?

Another way would be to run several fits at the same time. The problem I have with that in this case is that I use the results of the previous fit as starting values for the next fit. I might be able to increase the stride of this scheme; i.e. for 4 processes, use the result of fit 1 as starting point for fit 5; fit 2 for fit 6 etc. But before I embark on this non-trivial change; can Statistics:-NonLinearFit even be used in this way (i.e. is it thread safe)?? My fitting function is an actual function (as opposed to a procedure with local variables) so I don't think the function itself would cause trouble.

I could also contemplate the Grid package; except that I am concerned about the overhead moving the data over to each node (although it would all sit on one machine with 4 processors).

I realize that I may have to do some experimentation by myself, but if there is any experience out there I'd like to know about it...

Mac Dude

I see a document with maple graphics in it, but i don't see the maple code in the document.

Has the author protected his code ? I like to see the maple code used for the document ..how to read this maple code?

Note: try to find answer on the Maple site , but no idea where to find thisinformation on how to set up a document..frustrating.

I see two recent items on the web about Mathematica and the rosettacode.org site. One was a Wolfram Inc. corporate blog post, and the other a post on Wolfram's relatively new community site.

There are many items on the page of tasks still without a submitted Maple implementation. It would be nice to see interesting implementations of some remaining tasks, as contributions from the Maple user base. The tasks remaining are of very mixed difficulty levels.

To date there are only 132 entries on the page for Maple implementations of that site's programming tasks. (Of these about 40 were submitted by one member while about 80 were submitted by another member.)

acer

Is there a book or a place where to start learning programming in Maple from the very beginnings?

I have some experience with RealBasic (now Xojo) and C, so I am not a complete newbe but I am at loss with Maple and I have hard times following the help system to learn.

Thank you

Martina

Hi,

I have a mistake in these lines but I d'ont know the exact error. There is no numeric value of g(1,1)=4??????????????? Thanks for your help.

restart; vvv:=n^2+3*m; g:=(n,m)->vvv;g(1,1); No display of the value 4

This post is an index page for reading the Parallel Programming blog posts.

Greetings to all.

The multiplicative partition function is defined here at Wikipedia and was recently the subject of a discussion at Math Stackexchange.

I posted two solutions to the task of computing this function at the above page that use Maple code. One of them employs the Polya Enumeration Theorem and is of mostly theoretical interest as it cannot be used to effectively compute the function for n with many factors. I posted two additional implementations in order to remedy this defect, one of them in Maple and the other in Perl. I think the Maple implementation is easy enough to read not to require additional commentary. Note, however, that even though the Maple code and the Perl code implement the same algorithm (dynamic programming), the Maple version is dramatically slower than the Perl version and consumes a lot of memory. E.g. Maple takes 58 seconds for the value for 9! and Perl takes 1.5 seconds.

My question is, can someone explain this difference? Note that both are interpreted languages so there is no gain due to potential compilations.

Your commentary is appreciated.

This is with Maple 15 (X86 64 LINUX).

Best regards,

Marko Riedel

I made 3 years ago a SOKOBAN game using Maple for my Math/Programming class.

Here is a video of the application:

http://www.youtube.com/watch?v=l00l82_LK2Y

Have a nice day!

Everyone knows that Maple combines a smart user interface with a highly sophisticated mathematical engine, where common tasks are performed quickly and seamlessly with point, click and drag operations. Of equal importance, however, is the fact that Maple is also backed by a comprehensive programming language. Also called "Maple", this language combines elements from procedural languages (like C), functional languages (like Lisp) as well as object oriented languages (like C++...

hey friends I have solved linear equation numerically and in the end i have ploted pointplot graph where every point in graph is taken maunally. Please help me how to write code that at specific values of x required points from

Solution := backsub(S)

should automatically be ploted where x=i*h and h=1/32 where i varies from 0 to m.

Hi, how can I make a prodecure in Maple 16 that takes a function as a paremter and then manipulates with it?e.gTest := proc(f)return f(10):end proc And I can then run Test(f(x)) and get f(10) back?Thanks

Hello,

After we solved two equations we want to plot them with two sliders. I am trying to have two sliders for k and mu. I followed what this link suggested:

http://www.mapleprimes.com/questions/119732-How-To-Code-Sliders-To-Make-It-Easy

But I get this warning:

Warning, `p1` is implicitly declared local to procedure `myplot`

What is the command to have a programming loop record a piece of data everytime the loop runs? I want to record the components of a vector each time.

Thanks for any help.

This is for a code that analyzes composite laminates with many plys of varying orientation stacked on top of each other, and this is the first semester I've used Maple.

I'm solving for the roots of an equation which will always have a positive and a negative root, and I do this for each ply (could be 100 plies in a laminate). I want to collect the positive root for each ply, put them in a list or array, and then pick out the smallest value of all the plies ...

I've used the "unapply" command to calculate the several separarte transformation matrices (working a classical lamination theory problem in mechanics of composite laminates). I'm now having a problem using these values to perform further calculations. I've uploaded my file. Basically, I;ve got to calculate some matrices and use those to calcuate other matrices. Would anyone mind taking a look at it and letting me know if you have any suggestions...

You must be logged into your Facebook account in order to share via Facebook.

Click the button below to share this on Google+. A new window will open.

You must be logged in to your Twitter account in order to share. Click the button below to login (a new window will open.)

Please log-in to your MaplePrimes account.

Wrong Email/Password. Please try again.