Items tagged with indexing indexing Tagged Items Feed

Ok so i have a matrix M filled with complex roots of unity. I want to execute the following code but it seems to be failing to do so correctly

t:=exp(2 Pi I/11);

m := (i, j) -> M[(i mod 11)+1, (j mod 11)+1] ;  

mu :=(i,j)->(add(add(add(a[k]*a[m]*a[n]*t^(m)*m((i+k-m),(j+n-m))),n=0..10),m=0..10),k=0..10));


Something is wrong with my indexing of the matrix . or when the mod procs.

Hi, the display function in the simplex package gives us a nice breakdown of the form Ax<=b, but how do we extract the individual elements, i.e. the matrix A and vectors x and b? Normal indexing into the expression doesn't work, i.e. if for some set of constraints of the form 2x+3y<=21 we enter


this gives us a nice expression, but res[1] etc. doesn't work as we might hope (i.e. by returning the matrix A).


Hi, i am new to Maple. I was trying to solve some problem and came up with the following difficulty:

When i give input



and then do a_1 it gives the proper output as 




But whenever i try to do


I often have large matrices and have to grab only every nth column or row (for plotting

for example). So far I've been doing it this way:

nthColumns:=proc(v_m, v_n)  
v_m[..,[seq(i, i=1..rtable_size(v_m)[2], v_n)]]
nthRows:=proc(v_m, v_n) 
 v_m[[seq(i, i=1..rtable_size(v_m)[1], v_n)],..]

A := LinearAlgebra:-RandomMatrix(20, 20, outputoptions = [datatype = float[8]]);

Hi there,

 I have a piece of code that uses lists instead of vectors and recently, it crashed, it ran out of memory. Long story short, if I use vectors instead of lists, the performance is much better and optimal (this I knew but I was lazy to translate all my code). However, there's one single line that I cannot efficiently translate and it's the one that uses the function member(). Before, I had the following (it's an oversimplification of my code in order to easily discuss it in here):

This does not make any sense to me :-)

A := Matrix([[seq(i, i = 1 .. 10)], [seq(i, i = 11 .. 20)], [seq(i, i = 21 .. 30)]]):
A[.. -1,..] ;
A[.. -2,..] ;

You would assume that A[..-1,..] would remove the last row but that is not the case!
Instead you have to do A[..-2,..] he he it seems a bit odd!

I have a matrix (M) and it has both 0 and 1 as entries. I want to have a sequence/list of all indices associated with the entries equal to one (the others are irrelevant to me). I can use a nested for loop with an if statement, but I find that the easy way out and not very pretty. Is there is more sophisticated way, hopefully faster way of achieving this (using sequences, attributes, select/remove)?



Hi, I am a student (with some programming background) in desperate need of help.

How can I create a zero based array in Maple and display it?

I am having all kinds of trouble creating vectors and arrays in Maple (the help is cryptic). This is the closest I got:

>F := Array(0 .. 4, 0 .. 4, [0])


That creates a 5x5 array of zeros, with the upper left element indexed by (0,0) (right?).

How do I display the array?


I have some difficulties in manipulating matrices in Maple

For example, I have a matrice with 40 rows and 9 columns ans I want to extract the odd rows taking columns inchanged. The new matrice which has 20 rows and 9 columns must replace the old matrice

In Matlab, I do this with only one command: WTable=WTable(1:2:40,:);

Thanks in advance for help

Page 1 of 1