Mercurial > hg > smallbox
comparison Problems/Pierre_Problem.m @ 31:1b63e6a201a2
(none)
author | idamnjanovic |
---|---|
date | Tue, 29 Jun 2010 11:06:48 +0000 |
parents | 78c1e71cd269 |
children | 38d4fbf6ae24 |
comparison
equal
deleted
inserted
replaced
30:dc6aaa255836 | 31:1b63e6a201a2 |
---|---|
112 data.p = size(data.A,2); | 112 data.p = size(data.A,2); |
113 data.blocksize=blocksize; | 113 data.blocksize=blocksize; |
114 data.maxval=maxval; | 114 data.maxval=maxval; |
115 | 115 |
116 % keep coefficients matrix in sparse form and do not convert it to full. | 116 % keep coefficients matrix in sparse form and do not convert it to full. |
117 % geting around out of memory problem when converting big matrix from | 117 % getting around out of memory problem when converting big matrix from |
118 % sparse to full... (check SMALL_solve function) | 118 % sparse to full... (check SMALL_solve function) |
119 data.sparse=1; | 119 data.sparse=1; |
120 | 120 |
121 | 121 |