comparison util/SMALL_solve.m @ 108:b14e1f6ee4be ver_1.1

Merge
author Ivan Damnjanovic lnx <ivan.damnjanovic@eecs.qmul.ac.uk>
date Wed, 18 May 2011 11:50:28 +0100
parents f6cc633fd94b
children 8e660fd14774
comparison
equal deleted inserted replaced
107:dab78a3598b6 108:b14e1f6ee4be
91 91
92 %% 92 %%
93 % Sparse representation time 93 % Sparse representation time
94 tElapsed=toc(tStart); 94 tElapsed=toc(tStart);
95 solver.time = cputime - start; 95 solver.time = cputime - start;
96 fprintf('Solver %s finished task in %2f seconds. \n', solver.name, solver.time); 96 fprintf('Solver %s finished task in %2f seconds (cpu time). \n', solver.name, solver.time);
97 fprintf('Solver %s finished task in %2f seconds. \n', solver.name, tElapsed); 97 fprintf('Solver %s finished task in %2f seconds (tic-toc time). \n', solver.name, tElapsed);
98 solver.time=tElapsed; 98 solver.time=tElapsed;
99 % geting around out of memory problem when converting big matrix from 99 % geting around out of memory problem when converting big matrix from
100 % sparse to full... 100 % sparse to full...
101 101
102 if isfield(Problem, 'sparse')&&(Problem.sparse==1) 102 if isfield(Problem, 'sparse')&&(Problem.sparse==1)