@acer Your technique doesn't work the way that you expect it to. The 5 of the outer evalf supercedes the Digits used by the inner evalf, so the inner evalf is being done at 5-digits precision. Here's a test that shows this:

x:= 1+1e-6:  y:= 1+2e-6:
evalf[5](evalf(y-x));
                               0.
evalf(y-x):  evalf[5](%);
                            0.000001

So, evalf violates the usual rule that arguments are evaluated before being passed!

Your attempt to write Maple code doesn't shed much light on your problem. I think that you should take a step back, forget about Maple, and try to describe your problem mathematically. You're trying to solve a differential equation, right? ordinary or partial? numeric or symbolic solution? You mentioned Poincare's theorem (in an earlier version of this Question). You mentioned a change of variables. Now put it all together into a clear mathematical statement of the problem.

@gtbastos Do you want all 4x4 matrices of 0s and 1s of rank 3 or 4 over GF(3)? Or do you want all 4x4 matrices of rank 3 or 4 over GF(3)?

@Carl Love Your system contains no derivatives taken with respect to x. So it's a system of ODEs, not PDEs. So it should be solved numerically with dsolve, treating x as a parameter. Parameters in BVPs in Maple are handled by specifying one additional BC per parameter.

@Carl Love Your error is caused by your double use of square brackets on IBC. You have square brackets where you set the value of IBC, and you have them around IBC in the pdsolve command.

If you fix that problem, then you get an error because none of the IBCs set the value of x. That means that you'll need to rethink this problem. Also note that the trivial solution f(x,y) = 0 = g(x,y) is a solution to this problem. This is the only solution that a numerical solver will find.

@Kitonum Simpler: plot(<x | y>);

@karolin In order that all the intersections appeared neatly in the interior of the plot, I stretched the plot's viewing range of x and y a little on each side. The amount of stretch on each side is 1/3 the distance between the min and max. With the way that I did it, you should be able to reuse the plot command without change for other sets of curves.

@brian bovril The command that you need is

MM[MM[`+tour dists`] =~ min(MM[`+tour dists`])];

You say that you need "to find the area enclosed between the two". But two straight lines can't possibly enclose any area. There must be at least one more boundary curve. Often one of the boundaries is one of the coordinate axes. In this case, that could be the x-axis. But don't assume this! If the problem doesn't explicitly state this, the proper answer is to state that the problem is improperly posed.

You claim that you're using Maple 8, which is a very old version. The ability to solve delay differential equations was only recently added to Maple AFAIK.

The given Matlab code can't possibly do anything useful. Perhaps you should take a step back and describe your overall goal.

@brian bovril This is an ideal application for the new data structure DataFrame, which is somewhat between a Matrix and a table.

Regarding the specific uneven length list problem: You need to use add~ rather than  add.

If you don't want to bother me, then display your worksheets in your posts rather than simply attaching a worksheet.
 

Download Tours_CL_between.mw

@tomleslie A vector space is built on top of an underlying number system called a field. Usually the field is the real or complex numbers. But all that's required for a field are closure of the operations addition, multiplication, and subtraction; closure of division on the set minus zero; commutivity and associativity of both addition and multiplication; and distributivity of multiplication over addition. The smallest possible field has just two elements, 0 and 1. (Here, 0 and 1 are symbols related to, but not identical to, the usual 0 and 1. You could just as well use false for 0 and true for 1.) The multiplication is the same as usual. The addition is the same as usual except that 1+1 = 0. (If you recognize this as Boolean algebra with + = xor, * = and, 0 = false, 1 = true, then you've recognized correctly.) This field is often called GF(2), GF standing for (Evariste) Galois field, and 2 because it has 2 elements. It turns out that (upto isomorphism) this is the only possible field with 2 elements. This is the field over which the OP is considering matrix operations.

@Joe Riel When used with datatype= float[8], Modular uses the extremely well-optimized Basic Linear Algebra Subprograms (BLAS). There's no theoretic reason why float[8] is faster than integer[8]; it's simply that far more work has been to optimize it, down to the hardware level.

@Joe Riel Using datatype= float[8] with LinearAlgebra:-Modular is much faster than datatype= integer. The package is also slightly faster using order= C_order.