It seems to be a bug here:

restart;with(Iterator):M := CartesianProduct([1,2],[a,b],[c,d,e], rank=3):n:=0: for v in M do n:=n+1: print(n,v); end do:

1, [2 b c] 2, [2 b d]Error, (in unknown) improper op or subscript selector

# for rank=9 ==> [list, b, e] ??

Hi,

I posted a problem the other day to do with this specific problem and the issues got sorted out:)

The aim of the program is to find the catenary by iteration...

It's majorly diverging though and i'm not sure why.

Any ideas?

Thanks,

Rach

Trying_to_get_the_Ca.mw

Hi everyone,

I recently posted about a problem I had with an iterative scheme in 2 dimensions.. someone answered that and it worked perfectly:)

I've now moved on to a slightly more complicated version. It's in 3d but only the r and z values will be used in the iteration (trying to get the catenary)

so it's not as hard as the main problem that I'm building towards.

Basically, I'm having trouble converting the points to polar coordinates and assigning them each a [j...

Hey,

I know this might seem a bit trivial but I'm trying to get Maple to use iteration to get the shortest path between two points given initial conditions that aren't a straight line. (I'm learning how to do it in the simplest form before moving on to a 3D problem.)

So I have a initial set of points that are to be moved during the process and split them into their x and y components so there's a set of x[j]'s and y[j]s.Then I defined a couple of procedures to use in the iteration.

Hi Everyone:)

I'm doing a mini project at the moment and I'm pretty stuck with how to go about something on Maple...

My aim is to get the catenoid from an initial cylinder by use of an iterative method.

To find the minimal surface r=g(θ,z) - the catenoid - I want to minimise the Dirichlet integral (in cylindrical polar coordinates)

The latest version of the Iterator package is now available at the Maplesoft Application Center. It provides a new export, MultiPartition, extensions to existing exports, and options to most exports for transforming the output to a more desirable form. The help pages have been improved, with some hopefully interesting examples. Here is one, showing how it can be used to write a procedure for solving a generalized ...

Maple 16 introduces the ?ModuleIterator method, which can be assigned in a module so that it can be used in a for-loop, or in the seq, add, and mul procedures.ModuleIterator should return two procedures. The first (referred to as hasNext) is a predicate that returns true if the iterator is not finished. The second (referred to as ...

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.

Error occurred during PDF generation. Please refresh the page and try again