2018-02-07 20:30:45 -0600 received badge ● Famous Question (source) 2015-11-29 17:24:58 -0600 received badge ● Notable Question (source) 2015-11-29 17:24:58 -0600 received badge ● Popular Question (source) 2014-05-08 04:01:40 -0600 received badge ● Supporter (source) 2013-07-11 01:42:41 -0600 answered a question maximum element of a matrix I tried to do this a while ago but couldn't do it in one step. I just went through all the columns and got their maximum. I also needed to find the location of the maximum. Example for a matrix M with type 'sage.matrix.matrix_real_double_dense.Matrix_real_double_dense' MAX_val=0 for i in range(len(M.columns())): if (MAX_val< max(M.column(i))): MAX_val=max(M.column(i))  MAX_val is then the maximum value in the matrix. I hope it was helpful. I ll follow to see if there is a better way. 2013-07-09 03:10:12 -0600 commented answer How to prevent memory leak when solving a linear system of equations using left_kernel ? I added my code in the question. I tried to upload the matrix for you but I do not have enough karma 2013-07-08 23:48:28 -0600 commented answer How to prevent memory leak when solving a linear system of equations using left_kernel ? I am new to this system. How can I paste a code in the comment part. In the answer part I can just click on "Insert code" icon. 2013-07-08 05:17:33 -0600 commented answer How to prevent memory leak when solving a linear system of equations using left_kernel ? I start with a list of vectors and then transform it to a matrix. So I write mat=matrix(W,mat) instead of mat=matrix(mat). where: m=6 q=2^m P=GF(q,'a') W. = PolynomialRing(P) 2013-07-08 05:16:19 -0600 answered a question How to prevent memory leak when solving a linear system of equations using left_kernel ? I solved my problem by changing the type of the elements from Symbolic ring to Univariate Polynomial Ring in x over Finite Field in a of size 2^6. However, if it remained as a matrix with elements from the Symbolic ring. The leak would still exist. 2013-07-08 05:09:49 -0600 commented answer How to prevent memory leak when solving a linear system of equations using left_kernel ? I changed the type of the elements inside the matrix from Symbolic ring to Univariate Polynomial Ring in x over Finite Field in a of size 2^6. Now it works fine without a leak. I do not know why. Thanks for the help. You gave me the idea to change it. What should I do now that I have my problem solved. Also I would like to point out the problem when it was Symbolic? 2013-07-08 04:50:39 -0600 received badge ● Editor (source) 2013-07-08 04:33:34 -0600 commented answer How to prevent memory leak when solving a linear system of equations using left_kernel ? I tried it before but it didnt help. This is the result I get when I use your code: (using my mat of course) 1133.46875 1153.5234375 1174.0078125 1178.21875 1198.9296875 ..... 2013-07-08 04:33:02 -0600 received badge ● Nice Question (source) 2013-07-08 04:16:18 -0600 received badge ● Student (source) 2013-07-08 02:00:19 -0600 asked a question How to prevent memory leak when solving a linear system of equations using left_kernel ? I am having a problem when running the left_kernel function multiple times. Every time I call the function It takes a new part of the memory although I do not create new variables. I tried finding out where does the memory disappear, but without any luck. here is an example code:  sage: mat 69 x 70 dense matrix over Symbolic Ring (type 'print mat.str()' to see all of the entries) sage: get_memory_usage() #memory check before call 1170.34765625 sage: Inter_mat=mat.transpose() sage: Solution=Inter_mat.left_kernel() sage: get_memory_usage() #memory check after 1st call 1190.5390625 sage: Inter_mat=mat.transpose() sage: Solution=Inter_mat.left_kernel() sage: get_memory_usage() #memory check after 2nd call 1194.73828125 sage: Inter_mat=mat.transpose() sage: Solution=Inter_mat.left_kernel() sage: get_memory_usage() #memory check after 3rd call 1217.76953125  As you can see every time I call the function, the memory usage increases. Is there a way to release the memory that was used in a previous call ? My program stops after a few iterations because of lack of memory. Update: (Creating the matrix "mat") mat=[] for Coord in range(len(M_col)): if(M[M_row[Coord],M_col[Coord]]!=0): s=M[M_row[Coord],M_col[Coord]] if(s==1): temp_v=vector(Poly)(x=a^M_col[Coord],y=FIELDinfoBook[M_row[Coord]]) mat.append(vector(W,temp_v)) else: up=[i for i in range(s)] down=list(up) down.reverse() for Cup in range(s): for Cdown in range(s): if(up[Cup]+down[Cdown]