ConstrainedSolverT.cc 31.7 KB
Newer Older
Henrik Zimmer's avatar
Henrik Zimmer committed
1
2
/*===========================================================================*\
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
3
 *                               CoMISo                                      *
Henrik Zimmer's avatar
Henrik Zimmer committed
4
 *      Copyright (C) 2008-2009 by Computer Graphics Group, RWTH Aachen      *
Henrik Zimmer's avatar
Henrik Zimmer committed
5
 *                           www.rwth-graphics.de                            *
Henrik Zimmer's avatar
Henrik Zimmer committed
6
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
7
8
 *---------------------------------------------------------------------------* 
 *  This file is part of CoMISo.                                             *
Henrik Zimmer's avatar
Henrik Zimmer committed
9
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
10
11
12
13
 *  CoMISo is free software: you can redistribute it and/or modify           *
 *  it under the terms of the GNU General Public License as published by     *
 *  the Free Software Foundation, either version 3 of the License, or        *
 *  (at your option) any later version.                                      *
Henrik Zimmer's avatar
Henrik Zimmer committed
14
15
16
17
 *                                                                           *
 *  CoMISo is distributed in the hope that it will be useful,                *
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of           *
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the            *
Henrik Zimmer's avatar
Henrik Zimmer committed
18
 *  GNU General Public License for more details.                             *
Henrik Zimmer's avatar
Henrik Zimmer committed
19
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
20
21
 *  You should have received a copy of the GNU General Public License        *
 *  along with CoMISo.  If not, see <http://www.gnu.org/licenses/>.          *
Henrik Zimmer's avatar
Henrik Zimmer committed
22
 *                                                                           *
Henrik Zimmer's avatar
Henrik Zimmer committed
23
\*===========================================================================*/ 
Henrik Zimmer's avatar
Henrik Zimmer committed
24
25


26
27
28
29
30
31
//=============================================================================
//
//  CLASS MISolver - IMPLEMENTATION
//
//=============================================================================

32
#define COMISO_CONSTRAINEDSOLVER_C
33
34
35
36
37
//== INCLUDES =================================================================

#include "ConstrainedSolver.hh"
#include <gmm/gmm.h>
#include <float.h>
Henrik Zimmer's avatar
Henrik Zimmer committed
38
#include <CoMISo/Utils/StopWatch.hh>
39
40
41

//== NAMESPACES ===============================================================

42
namespace COMISO {
43
44
45
46

//== IMPLEMENTATION ==========================================================


David Bommes's avatar
David Bommes committed
47
48
49
template<class RMatrixT, class CMatrixT, class VectorT, class VectorIT >
void 
ConstrainedSolver::
David Bommes's avatar
David Bommes committed
50
solve_const(	 const RMatrixT& _constraints,
David Bommes's avatar
David Bommes committed
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
		 const CMatrixT& _A, 
		 VectorT&  _x,
		 const VectorT&  _rhs,
		 const VectorIT& _idx_to_round,
		 double    _reg_factor,
		 bool      _show_miso_settings,
		 bool      _show_timings )
{
  // copy matrices
  RMatrixT constraints( gmm::mat_nrows(_constraints), gmm::mat_ncols(_constraints));
  gmm::copy(_constraints, constraints);

  CMatrixT A( gmm::mat_nrows(_A), gmm::mat_ncols(_A));
  gmm::copy(_A, A);

  // ... and vectors
  VectorT  rhs(_rhs);
  VectorIT idx_to_round(_idx_to_round);

  // call non-const function
  solve(constraints,
	A,
	_x,
	rhs,
	idx_to_round,
	_reg_factor,
	_show_miso_settings,
	_show_timings);
}


82
83
84
//-----------------------------------------------------------------------------


David Bommes's avatar
David Bommes committed
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
template<class RMatrixT, class VectorT, class VectorIT >
void 
ConstrainedSolver::
solve_const( RMatrixT& _constraints,
	     RMatrixT& _B, 
	     VectorT&  _x,
	     VectorIT& _idx_to_round,
	     double    _reg_factor,
	     bool      _show_miso_settings,
	     bool      _show_timings )
{
  // copy matrices
  RMatrixT constraints( gmm::mat_nrows(_constraints), gmm::mat_ncols(_constraints));
  gmm::copy(_constraints, constraints);

  RMatrixT B( gmm::mat_nrows(_B), gmm::mat_ncols(_B));
  gmm::copy(_B, B);

  // ... and vectors
  VectorIT idx_to_round(_idx_to_round);

  // call non-const function
  solve(constraints,
	B,
	_x,
	idx_to_round,
	_reg_factor,
	_show_miso_settings,
	_show_timings);
}


//-----------------------------------------------------------------------------


120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
template<class RMatrixT, class VectorT, class VectorIT >
void 
ConstrainedSolver::
solve(
    RMatrixT& _constraints,
    RMatrixT& _B, 
    VectorT&  _x,
    VectorIT& _idx_to_round,
    double    _reg_factor,
    bool      _show_miso_settings,
    bool      _show_timings )
{
  int nrows = gmm::mat_nrows(_B);
  int ncols = gmm::mat_ncols(_B);
  int ncons = gmm::mat_nrows(_constraints);

  if( _show_timings) std::cerr << __FUNCTION__ << "\n Initial dimension: " << nrows << " x " << ncols << ", number of constraints: " << ncons << std::endl;
 
  // StopWatch for Timings
139
  COMISO::StopWatch sw, sw2; sw.start(); sw2.start();
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204

  // c_elim[i] = index of variable which is eliminated in condition i
  // or -1 if condition is invalid
  std::vector<int> c_elim( ncons);

  // apply sparse gauss elimination to make subsequent _constraints independent
  make_constraints_independent( _constraints, _idx_to_round, c_elim);
  double time_gauss = sw.stop()/1000.0; sw.start();

  // eliminate conditions and return column matrix Bcol
  gmm::col_matrix< gmm::rsvector< double > > Bcol( nrows, ncols);

  // reindexing vector
  std::vector<int>                          new_idx;

  eliminate_constraints( _constraints, _B, _idx_to_round, c_elim, new_idx, Bcol);
  double time_eliminate = sw.stop()/1000.0; sw.start();

  if( _show_timings) std::cerr << "Eliminated dimension: " << gmm::mat_nrows(Bcol) << " x " << gmm::mat_ncols(Bcol) << std::endl;

  // setup and solve system
  double time_setup = setup_and_solve_system( Bcol, _x, _idx_to_round, _reg_factor, _show_miso_settings);

  //  double time_setup_solve = sw.stop()/1000.0; sw.start();
  
  // restore eliminated vars to fulfill the given conditions
  restore_eliminated_vars( _constraints, _x, c_elim, new_idx);

  double time_resubstitute = sw.stop()/1000.0; sw.start();

  //  double time_total = sw2.stop()/1000.0;

  if( _show_timings) std::cerr << "Timings: \n\t" <<
    "Gauss Elimination  " << time_gauss          << " s\n\t" <<
    "System Elimination " << time_eliminate      << " s\n\t" <<
    "Setup              " << time_setup          << " s\n\t" <<
   // "Setup + Mi-Solver  " << time_setup_solve    << " s\n\t" <<
    "Resubstitution     " << time_resubstitute   << " s\n\t" << std::endl << std::endl;
    //"Total              " << time_total          << std::endl;
}


//-----------------------------------------------------------------------------


template<class RMatrixT, class CMatrixT, class VectorT, class VectorIT>
void 
ConstrainedSolver::
solve(
    RMatrixT& _constraints,
    CMatrixT& _A, 
    VectorT&  _x,
    VectorT&  _rhs,
    VectorIT& _idx_to_round,
    double    _reg_factor,
    bool      _show_miso_settings, 
    bool      _show_timings )
{
  int nrows = gmm::mat_nrows(_A);
  int ncols = gmm::mat_ncols(_A);
  int ncons = gmm::mat_nrows(_constraints);

  if( _show_timings) std::cerr << __FUNCTION__ << "\n Initital dimension: " << nrows << " x " << ncols << ", number of constraints: " << ncons << std::endl;

  // StopWatch for Timings
205
  COMISO::StopWatch sw, sw2; sw.start(); sw2.start();
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224

  // c_elim[i] = index of variable which is eliminated in condition i
  // or -1 if condition is invalid
  std::vector<int> c_elim( ncons);

  // apply sparse gauss elimination to make subsequent _conditions independent
  make_constraints_independent( _constraints, _idx_to_round, c_elim);
  double time_gauss = sw.stop()/1000.0; sw.start();

  // re-indexing vector
  std::vector<int>                          new_idx;

  gmm::csc_matrix< double > Acsc;
  eliminate_constraints( _constraints, _A, _x, _rhs, _idx_to_round, c_elim, new_idx, Acsc);
  double time_eliminate = sw.stop()/1000.0;

  if( _show_timings) std::cerr << "Eliminated dimension: " << Acsc.nr << " x " << Acsc.nc << std::endl;

  // create MISO solver
225
  COMISO::MISolver miso;
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
  // show options dialog
  if( _show_miso_settings)
    miso.show_options_dialog();

  sw.start();
  miso.solve( Acsc, _x, _rhs, _idx_to_round);
  double time_miso = sw.stop()/1000.0; sw.start();

  // restore eliminated vars to fulfill the given conditions
  restore_eliminated_vars( _constraints, _x, c_elim, new_idx);

  double time_resubstitute = sw.stop()/1000.0; sw.start();
  double time_total = time_gauss + time_eliminate + time_miso + time_resubstitute;
  if( _show_timings) std::cerr << "Timings: \n\t" <<
    "\tGauss Elimination  " << time_gauss          << " s\n\t" <<
    "\tSystem Elimination " << time_eliminate      << " s\n\t" <<
    "\tMi-Solver          " << time_miso           << " s\n\t" <<
    "\tResubstitution     " << time_resubstitute   << " s\n\t" << 
    "\tTotal              " << time_total          << std::endl << std::endl;
}


//-----------------------------------------------------------------------------


template<class RMatrixT, class VectorIT >
void 
ConstrainedSolver::
make_constraints_independent(
    RMatrixT&         _constraints,
		VectorIT&         _idx_to_round,
		std::vector<int>& _c_elim)
{
259
  COMISO::StopWatch sw;
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
  // number of variables
  int n_vars = gmm::mat_ncols(_constraints);

  // TODO Check: HZ added 14.08.09 
  _c_elim.clear();
  _c_elim.resize( gmm::mat_nrows(_constraints), -1);

  // build round map
  std::vector<bool> roundmap( n_vars, false);
  for(unsigned int i=0; i<_idx_to_round.size(); ++i)
    roundmap[_idx_to_round[i]] = true;

  // copy constraints into column matrix (for faster update via iterators)
  typedef gmm::wsvector<double>      CVector;
  typedef gmm::col_matrix< CVector > CMatrix;
  CMatrix constraints_c;
  gmm::resize(constraints_c, gmm::mat_nrows(_constraints), gmm::mat_ncols(_constraints));
  gmm::copy(_constraints, constraints_c);

  // for all conditions
  for(unsigned int i=0; i<gmm::mat_nrows(_constraints); ++i)
  {
    // get elimination variable
    int elim_j = -1;
284
    int elim_int_j = -1;
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299

    // iterate over current row, until variable found
    // first search for real valued variable
    // if not found for integers with value +-1
    // and finally take the smallest integer variable

    typedef typename gmm::linalg_traits<RMatrixT>::const_sub_row_type CRowT;
    typedef typename gmm::linalg_traits<RMatrixT>::sub_row_type       RowT;
    typedef typename gmm::linalg_traits<CRowT>::const_iterator        RIter;

    // get current condition row
    CRowT row       = gmm::mat_const_row( _constraints, i);
    RIter row_it    = gmm::vect_const_begin( row);
    RIter row_end   = gmm::vect_const_end( row);
    double elim_val = FLT_MAX;
300
    double max_elim_val = -FLT_MAX;
301

Henrik Zimmer's avatar
   
Henrik Zimmer committed
302
303
304
305
306
    // new: gcd
    std::vector<int> v_gcd;
    v_gcd.resize(gmm::nnz(row),-1);
    int n_ints(0);

307
308
309
310
311
312
    for(; row_it != row_end; ++row_it)
    {
      int cur_j = row_it.index();
      // do not use the constant part
      if(  cur_j != n_vars - 1 )
      {
313
        // found real valued var? -> finished (UPDATE: no not any more, find biggest real value to avoid x/1e-13)
314
315
        if( !roundmap[ cur_j ])
        {
316
317
318
319
320
321
          if( fabs(*row_it) > max_elim_val)
          {
            elim_j = cur_j;
            max_elim_val = fabs(*row_it);
          }
          //break;
322
323
        }
        else
324
        {
325
          double cur_row_val(fabs(*row_it));
Henrik Zimmer's avatar
   
Henrik Zimmer committed
326
327
328
329
330
331
332
333
334
          // gcd
          // if the coefficient of an integer variable is not an integer, then
          // the variable most problably will not be (expect if all coeffs are the same, e.g. 0.5)
          if( (double(int(cur_row_val))- cur_row_val) != 0.0)
              std::cerr << __FUNCTION__ << " Warning: coefficient of integer variable is NOT integer!" << std::endl;

          v_gcd[n_ints] = cur_row_val;
          ++n_ints;

335
336
          // store integer closest to 1, must be greater than epsilon_
          if( fabs(cur_row_val-1.0) < elim_val && cur_row_val > epsilon_)
337
          {
338
            elim_int_j   = cur_j;
Henrik Zimmer's avatar
   
Henrik Zimmer committed
339
            elim_val     = fabs(cur_row_val-1.0);
340
          }
341
        }
342
343
344
      }
    }

345
346
347
348
349
350
    // first try to eliminate a valid (>epsilon_) real valued variable (safer)
    if( max_elim_val > epsilon_)
    {}
    else // use the best found integer
      elim_j = elim_int_j;

351
352
353
    // if no integer or real valued variable greater than epsilon_ existed, then
    // elim_j is now -1 and this row is not considered as a valid constraint

354
355


Henrik Zimmer's avatar
   
Henrik Zimmer committed
356

357
358
359
    // store result
    _c_elim[i] = elim_j;
    // error check result
Henrik Zimmer's avatar
   
Henrik Zimmer committed
360
    if( elim_j == -1)
361
    {
Henrik Zimmer's avatar
   
Henrik Zimmer committed
362
363
      // redundant or incompatible?
      if( noisy_ > 0)
364
365
        if( fabs(gmm::mat_const_row(_constraints, i)[n_vars-1]) > epsilon_ )
          std::cerr << "Warning: incompatible condition:\n";
Henrik Zimmer's avatar
   
Henrik Zimmer committed
366
367
      //         else
      //           std::cerr << "Warning: redundant condition:\n";
368
    }
Henrik Zimmer's avatar
   
Henrik Zimmer committed
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
    else
      if(roundmap[elim_j] && elim_val > 1e-6) 
      {
        if( do_gcd_)
        {
          // perform gcd update
          bool gcd_ok = update_constraint_gcd( _constraints, i, elim_j, v_gcd, n_ints);
          if( !gcd_ok)
            if( noisy_ > 0)
              std::cerr << __FUNCTION__ << " Warning: GCD update failed! " << gmm::mat_const_row(_constraints, i) << std::endl;
        }
        else
        {
          if( noisy_ > 0)
            std::cerr << __FUNCTION__ << " Warning: NO +-1 coefficient found, integer rounding cannot be guaranteed. Try using the GCD option! " << gmm::mat_const_row(_constraints, i) << std::endl;
        }
      }

387
388
389
390
391

    // is this condition dependent?
    if( elim_j != -1 )
    {
      // get elim variable value
392
      double elim_val_cur = _constraints(i, elim_j);
393
394
395
396
397
398
399
400
401
402
403
404

      // copy col
      CVector col = constraints_c.col(elim_j);

      // iterate over column
      typename gmm::linalg_traits<CVector>::const_iterator c_it   = gmm::vect_const_begin(col);
      typename gmm::linalg_traits<CVector>::const_iterator c_end  = gmm::vect_const_end(col);

      for(; c_it != c_end; ++c_it)
        if( c_it.index() > i)
        {
          sw.start();
405
          add_row_simultaneously( c_it.index(), -(*c_it)/elim_val_cur, gmm::mat_row(_constraints, i), _constraints, constraints_c);
406
407
408
409
410
411
412
413
414
415
          // make sure the eliminated entry is 0 on all other rows and not 1e-17
          _constraints( c_it.index(), elim_j) = 0;
          constraints_c(c_it.index(), elim_j) = 0;
        }
    }
  }
}

//-----------------------------------------------------------------------------

Henrik Zimmer's avatar
   
Henrik Zimmer committed
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
template<class RMatrixT>
bool
ConstrainedSolver::
update_constraint_gcd( RMatrixT& _constraints, 
                       int _row_i, 
                       int& _elim_j,
                       std::vector<int>& _v_gcd,
                       int& _n_ints)
{
  // find gcd
  double i_gcd = find_gcd(_v_gcd, _n_ints);

  if( fabs(i_gcd) == 1.0)
    return false;
  
  // divide by gcd
  typedef typename gmm::linalg_traits<RMatrixT>::const_sub_row_type CRowT;
  typedef typename gmm::linalg_traits<CRowT>::const_iterator        RIter;

  // get current constraint row
  RIter row_it    = gmm::vect_const_begin( gmm::mat_const_row( _constraints, _row_i));
  RIter row_end   = gmm::vect_const_end( gmm::mat_const_row( _constraints, _row_i));

  for( ; row_it!=row_end; ++row_it)
  {
    int cur_j = row_it.index();
    _constraints(_row_i, cur_j) = (*row_it)/i_gcd;
  }
  int elim_coeff = abs(_constraints(_row_i, _elim_j));
  if( elim_coeff != 1)
    std::cerr << __FUNCTION__ << " Error: elimination coefficient " << elim_coeff << " will (most probably) NOT lead to an integer solution!" << std::endl;
  return true;
}

//-----------------------------------------------------------------------------
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523

template<class SVector1T, class SVector2T, class VectorIT, class SVector3T>
void 
ConstrainedSolver::
eliminate_constraints( 
    gmm::row_matrix<SVector1T>& _constraints,
    gmm::row_matrix<SVector2T>& _B, 
    VectorIT&                   _idx_to_round,
    std::vector<int>&           _c_elim,
    std::vector<int>&           _new_idx,
    gmm::col_matrix<SVector3T>& _Bcol)
{
  // copy into column matrix
  gmm::resize(_Bcol, gmm::mat_nrows(_B), gmm::mat_ncols(_B));
  gmm::copy( _B, _Bcol);

  // store columns which should be eliminated
  std::vector<int> elim_cols;
  elim_cols.reserve( _c_elim.size());

  for(unsigned int i=0; i<_c_elim.size(); ++i)
  {
    int cur_j = _c_elim[i];

    if( cur_j != -1)
    {
      double cur_val = _constraints(i,cur_j);

      // store index
      elim_cols.push_back(_c_elim[i]);

      // copy col
      SVector3T col = _Bcol.col(cur_j);

      // iterate over column
      typename gmm::linalg_traits<SVector3T>::const_iterator c_it   = gmm::vect_const_begin(col);
      typename gmm::linalg_traits<SVector3T>::const_iterator c_end  = gmm::vect_const_end(col);

      for(; c_it != c_end; ++c_it)
        add_row( c_it.index(), -(*c_it)/cur_val, gmm::mat_row(_constraints, i), _Bcol);
    }
  }

  // eliminate columns
  eliminate_columns( _Bcol, elim_cols);

  // TODO FIXME Size -1 ?!?!
  // init _new_idx vector
  _new_idx.resize(gmm::mat_ncols(_constraints));
  for(unsigned int i=0; i<_new_idx.size(); ++i)
    _new_idx[i] = i;

  // update _new_idx w.r.t. eliminated cols
  gmm::eliminate_vars_idx( elim_cols, _new_idx, -1);

  // update _idx_to_round (in place)
  std::vector<int> round_old(_idx_to_round);
  unsigned int wi = 0;
  for(unsigned int i=0; i<_idx_to_round.size(); ++i)
  {
    if(_new_idx[ _idx_to_round[i]] != -1)
    {
      _idx_to_round[wi] = _new_idx[_idx_to_round[i]];
      ++wi;
    }
  }
  
  // resize, sort and make unique
  _idx_to_round.resize(wi);

  std::sort(_idx_to_round.begin(), _idx_to_round.end());
  _idx_to_round.resize( std::unique(_idx_to_round.begin(), _idx_to_round.end()) -_idx_to_round.begin());

524
525
526
527
528
529
530

  if( noisy_ > 2 )
  {
    std::cerr << __FUNCTION__ << "remaining         variables: " << gmm::mat_ncols(_Bcol) << std::endl;
    std::cerr << __FUNCTION__ << "remaining integer variables: " << _idx_to_round.size() << std::endl;
    std::cerr << __FUNCTION__ << std::endl;
  }
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
}


//-----------------------------------------------------------------------------


template<class SVector1T, class SVector2T, class VectorIT, class CSCMatrixT>
void 
ConstrainedSolver::
eliminate_constraints(
    gmm::row_matrix<SVector1T>& _constraints,
    gmm::col_matrix<SVector2T>& _A, 
    std::vector<double>&        _x, 
    std::vector<double>&        _rhs, 
    VectorIT&                   _idx_to_round,
    std::vector<int>&           _v_elim,
    std::vector<int>&           _new_idx,
    CSCMatrixT&                 _Acsc)
{
550
  COMISO::StopWatch sw;
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
  sw.start();
  // define iterator on matrix A and on constraints C
  typedef typename gmm::linalg_traits<SVector2T>::const_iterator  AIter;
  typedef typename gmm::linalg_traits<SVector1T>::const_iterator  CIter;

  // store variable indices to be eliminated
  std::vector<int> elim_varids;
  elim_varids.reserve( _v_elim.size());

  for( unsigned int i=0; i < _v_elim.size(); ++i)
  {
    int cur_j = _v_elim[i];

    if( cur_j != -1)
    {
      double cur_val = _constraints(i, cur_j);

      // store index
      elim_varids.push_back(_v_elim[i]);

      // copy col
      SVector2T col ( _A.col( cur_j));

      // get a reference to current constraint vector 
      SVector1T& constraint( _constraints.row(i));

      // add cur_j-th row multiplied with constraint[k] to each row k
      // iterator of matrix column
      AIter col_it, col_end;
      
      // iterator of constraint
      CIter con_it  = gmm::vect_const_begin( constraint);
      CIter con_end = gmm::vect_const_end( constraint);

      // constraint rhs
      double constraint_rhs = constraint[ constraint.size()-1];

      //std::cerr << "constraint_rhs " << constraint_rhs << std::endl;
      // temporarliy set last element to zero (to avoid iterator finding it)
      constraint[ constraint.size()-1] = 0;

      double cur_rhs = _rhs[cur_j];

      // loop over all constraint entries over all column entries
      // should not hit last element (rhs) since set to zero
      for ( ; con_it != con_end; ++con_it )
      {
        col_it  = gmm::vect_const_begin( col );
        col_end = gmm::vect_const_end( col );
        for ( ; col_it != col_end; ++col_it )
          _A( con_it.index(), col_it.index() ) -= ( *col_it )*(( *con_it )/cur_val);

        _rhs[con_it.index()] -= cur_rhs * (( *con_it )/cur_val);
      }

      // TODO FIXME must use copy col (referens sometimes yields infinite loop below no col_it++?!?)
      SVector2T col_ref = _A.col(cur_j);
      
      // add cur_j-th col multiplied with condition[k] to each col k
      col_it  = gmm::vect_const_begin( col_ref );
      col_end = gmm::vect_const_end( col_ref );

      // loop over all column entries and over all constraint entries
      for ( ; col_it != col_end; ++col_it )
      {
        con_it  = gmm::vect_const_begin( constraint );
        con_end = gmm::vect_const_end( constraint );

        for ( ; con_it != con_end; ++con_it )
          _A( col_it.index(), con_it.index() ) -= ( *col_it )*(( *con_it )/cur_val);
        _rhs[col_it.index()] += constraint_rhs*( *col_it )/cur_val;
      }

      // reset last constraint entry to real value
      constraint[ constraint.size()-1] = constraint_rhs;
    }
  }
628
629
  if( noisy_ > 2)
    std::cerr << __FUNCTION__ << " Constraints integrated " << sw.stop()/1000.0 << std::endl;
630
631
632
633
634
635
636

  // eliminate vars
  _Acsc.init_with_good_format(_A);
  sw.start();
  std::vector< double > elim_varvals( elim_varids.size(), 0);
  gmm::eliminate_csc_vars2( elim_varids, elim_varvals, _Acsc, _x, _rhs);

637
638
  if( noisy_ > 2)
    std::cerr << __FUNCTION__ << " Constraints eliminated " << sw.stop()/1000.0 << std::endl;
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
  sw.start();
  // init _new_idx vector
  _new_idx.resize( mat_ncols(_constraints));
  for( unsigned int i=0; i<_new_idx.size(); ++i)
    _new_idx[i] = i;

  // update _new_idx w.r.t. eliminated cols
  gmm::eliminate_vars_idx( elim_varids, _new_idx, -1);

  // update _idx_to_round (in place)
  unsigned int wi = 0;
  for( unsigned int i=0; i<_idx_to_round.size(); ++i)
  {
    if(_new_idx[ _idx_to_round[i]] != -1)
    {
      _idx_to_round[wi] = _new_idx[_idx_to_round[i]];
      ++wi;
    }
  }

  // resize, sort and make unique
  _idx_to_round.resize(wi);

  std::sort(_idx_to_round.begin(), _idx_to_round.end());
  _idx_to_round.resize( std::unique(_idx_to_round.begin(), _idx_to_round.end()) -_idx_to_round.begin());
664
665
666

  if( noisy_ > 2)
    std::cerr << __FUNCTION__ << "Indices reindexed " << sw.stop()/1000.0 << std::endl << std::endl;
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
}


//-----------------------------------------------------------------------------


template<class RowT, class MatrixT>
void 
ConstrainedSolver::
add_row( int       _row_i,
	 double    _coeff,
	 RowT      _row, 
	 MatrixT&  _mat )
{
  typedef typename gmm::linalg_traits<RowT>::const_iterator RIter;
  RIter r_it  = gmm::vect_const_begin(_row);
  RIter r_end = gmm::vect_const_end(_row);

  for(; r_it!=r_end; ++r_it)
    _mat(_row_i, r_it.index()) += _coeff*(*r_it);
}

//-----------------------------------------------------------------------------


template<class RowT, class RMatrixT, class CMatrixT>
void 
ConstrainedSolver::
add_row_simultaneously(	int       _row_i,
			double    _coeff,
			RowT      _row, 
			RMatrixT& _rmat,
			CMatrixT& _cmat )
{
  typedef typename gmm::linalg_traits<RowT>::const_iterator RIter;
  RIter r_it  = gmm::vect_const_begin(_row);
  RIter r_end = gmm::vect_const_end(_row);

  for(; r_it!=r_end; ++r_it)
  {
    _rmat(_row_i, r_it.index()) += _coeff*(*r_it);
    _cmat(_row_i, r_it.index()) += _coeff*(*r_it);
709
710
711
712
713
    if( _rmat(_row_i, r_it.index())*_rmat(_row_i, r_it.index()) < epsilon_squared_ )
    {
      _rmat(_row_i, r_it.index()) = 0.0;
      _cmat(_row_i, r_it.index()) = 0.0;
    }
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
  }
}


//-----------------------------------------------------------------------------


template<class CMatrixT, class VectorT, class VectorIT>
double 
ConstrainedSolver::
setup_and_solve_system( CMatrixT& _B,
			VectorT&  _x,
			VectorIT& _idx_to_round,
			double    _reg_factor,
			bool      _show_miso_settings)
{
730
731
  COMISO::StopWatch s1;
  COMISO::StopWatch sw; sw.start();
732
733
734
735
736
737
738
739
  unsigned int m = gmm::mat_nrows(_B);
  unsigned int n = gmm::mat_ncols(_B);

  s1.start();
  // set up B transposed
  CMatrixT Bt;
  gmm::resize( Bt, n, m);
  gmm::copy( gmm::transposed( _B), Bt);
740
741
  if( noisy_ > 1 )
    std::cerr << __FUNCTION__ << " Bt took " << s1.stop()/1000.0 << std::endl;
742
743
744
745
746
747
  s1.start();

  // setup BtB
  CMatrixT BtB;
  gmm::resize( BtB, n, n);
  gmm::mult( Bt, _B, BtB);
748
749
  if( noisy_ > 1 )
    std::cerr << __FUNCTION__ << " BtB took " << s1.stop()/1000.0 << std::endl;
750
  s1.start();
751

752
753
754
755
756
  // extract rhs
  std::vector< double > rhs( n);
  gmm::copy( gmm::scaled(gmm::mat_const_col( BtB, n - 1),-1.0), rhs);
  rhs.resize( n - 1);

757
758
  if( noisy_ > 1)
    std::cerr << __FUNCTION__ << " rhs extract resize " << s1.stop()/1000.0 << std::endl;
759
  s1.start();
760

761
762
763
  // resize BtB to only contain the actual system matrix (and not the rhs)
  gmm::resize( BtB, n - 1, n - 1);

764
765
  if( noisy_ > 1)
    std::cerr << __FUNCTION__ << " BtB resize took " << s1.stop()/1000.0 << std::endl;
766
767
  s1.start();
  _x.resize( n - 1);
768
769
  if( noisy_ > 1)
    std::cerr << __FUNCTION__ << " x resize took " << s1.stop()/1000.0 << std::endl;
770
771
772
773
774
775
776
777
778
779

  // regularize if necessary
  if(_reg_factor != 0.0)
    gmm::regularize_hack(BtB, _reg_factor);
  s1.start();

  // BtB -> CSC
  CSCMatrix BtBCSC;
  BtBCSC.init_with_good_format( BtB);

780
781
  if( noisy_ > 1)
    std::cerr << __FUNCTION__ << " CSC init " << s1.stop()/1000.0 << std::endl;
782
783
784
  double setup_time = sw.stop()/1000.0;
  
  // create solver
785
  COMISO::MISolver miso;
786
787
788
789
  // show options dialog
  if( _show_miso_settings)
    miso.show_options_dialog();

790
  COMISO::StopWatch misw;
791
792
793
  misw.start();
  // miso solve
  miso.solve( BtBCSC, _x, rhs, _idx_to_round);
794
795
  if( noisy_ > 1)
  std::cerr << __FUNCTION__ << " Miso Time " << misw.stop()/1000.0 << "s." << std::endl << std::endl;
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
  return setup_time;
}


//-----------------------------------------------------------------------------


template<class RMatrixT, class VectorT >
void 
ConstrainedSolver::
restore_eliminated_vars( RMatrixT&         _constraints,
			 VectorT&          _x,
			 std::vector<int>& _c_elim,
			 std::vector<int>& _new_idx)
{
  // restore original ordering of _x
  _x.resize(_new_idx.size());
  // last variable is the constant term 1.0
  _x.back() = 1.0;

  // reverse iterate from prelast element
  for(int i=_new_idx.size()-2; i>= 0; --i)
  {
    if( _new_idx[i] != -1)
    {
      // error handling
822
      if( i < _new_idx[i] && noisy_ > 0) std::cerr << "Warning: UNSAFE Ordering!!!\n";
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917

      _x[i] = _x[_new_idx[i]];
    }
  }

  // reverse iterate
  for(int i=_c_elim.size()-1; i>=0; --i)
  {
    int cur_var = _c_elim[i];

    if( cur_var != -1)
    {
      // get variable value and set to zero
      double cur_val = _constraints(i, cur_var);
      _constraints(i, cur_var) = 0.0;

      _x[cur_var] = -gmm::vect_sp(_x, _constraints.row(i))/cur_val;
    }
  }

  // resize
  _x.resize(_x.size()-1);
}


//-----------------------------------------------------------------------------


template<class RMatrixT, class VectorT, class VectorIT >
void 
ConstrainedSolver::
verify_mi_factored( const RMatrixT& _conditions,
		    const RMatrixT& _B, 
		    const VectorT&  _x,
		    const VectorIT& _idx_to_round )
{
  std::cerr << "######### Verify Constrained Solver Result ############\n";

  // create extended x vector
  std::vector<double> x(_x);
  x.resize(x.size()+1);
  x.back() = 1.0;

  // verify conditions
  std::vector<double> a(gmm::mat_nrows(_conditions));

  gmm::mult(_conditions, x, a);

  int conditions_not_ok = 0;
  for(unsigned int i=0; i<a.size(); ++i)
    if( a[i] > 1e-6)
    {
      ++conditions_not_ok;
    }

  if( conditions_not_ok == 0)
    std::cerr << "all conditions are ok!\n";
  else
    std::cerr << conditions_not_ok 
	      << " conditions are not fullfilled: " 
	      << std::endl;

  // verify rounding
  int roundings_not_ok = 0;
  for(unsigned int i=0; i<_idx_to_round.size(); ++i)
  {
    double d = _x[_idx_to_round[i]];
    if( fabs(d-round(d)) > 1e-6)
      ++roundings_not_ok;
  }
  
  if( roundings_not_ok)
    std::cerr << roundings_not_ok << " Integer variables are not rounded\n";
  else
    std::cerr << "all Integer roundings are ok\n";

  // evaluate energy
  VectorT Bx(x);
  gmm::mult(_B, x, Bx);
  std::cerr << "Total energy: " << gmm::vect_sp(Bx, Bx) << std::endl;

  std::cerr << "######### FINISHED ############\n";
}



//-----------------------------------------------------------------------------


template<class RMatrixT, class CMatrixT, class VectorT>
double 
ConstrainedSolver::verify_constrained_system( 
    const RMatrixT& _conditions,
    const CMatrixT& _A,
    const VectorT&  _x,
David Bommes's avatar
David Bommes committed
918
919
    const VectorT&  _rhs,
    double          _eps)
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
{
  typedef typename gmm::linalg_traits<RMatrixT>::const_sub_row_type RowT;
  typedef typename gmm::linalg_traits<RowT>::const_iterator RIter;

  VectorT Ax( _x.size());
  gmm::mult(_A, _x, Ax);

  gmm::add(_rhs, gmm::scaled(Ax, -1.0), Ax);
  double norm = gmm::vect_norm2(Ax);
  //std::cerr << __FUNCTION__ << ": Error residual: " << norm << " vector : " << Ax << std::endl;

  std::cerr << __FUNCTION__ << ": Checking constraints..." << std::endl;

  unsigned int row_cond = gmm::mat_nrows( _conditions);
  unsigned int col_cond = gmm::mat_ncols( _conditions);
  bool all_conditions_ok = true;
  for( unsigned int r = 0; r < row_cond; ++r)
  {
    double cond_value = 0.0;
    RowT row      = gmm::mat_const_row( _conditions, r);
    RIter row_it  = gmm::vect_const_begin( row);
    RIter row_end = gmm::vect_const_end( row);
    //std::cerr << "\t checking row : " << row << std::endl;

    for( ; row_it != row_end; ++row_it)
    {
      if( row_it.index() == col_cond -1)
        cond_value += (*row_it);
      else
        cond_value += _x[row_it.index()]*(*row_it);
    }
    //std::cerr << "\t Value is : " << cond_value << std::endl;
    //std::cerr << "--- --- --- --- ---\n";
David Bommes's avatar
David Bommes committed
953
    if( fabs(cond_value) > _eps)
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
    {
      std::cerr << "\t Error on row " << r << " with vector " << row << " and condition value " << cond_value << std::endl;
      all_conditions_ok = false;
    }
  }
  std::cerr << __FUNCTION__ << (all_conditions_ok? ": All conditions ok!" : ": Some conditions not ok!") << std::endl;
  return norm;
}

//-----------------------------------------------------------------------------


template<class RMatrixT, class CMatrixT, class VectorT, class VectorIT>
double
ConstrainedSolver::
verify_constrained_system_round( 
              const RMatrixT& _conditions,
              const CMatrixT& _A,
              const VectorT&  _x,
              const VectorT&  _rhs,
David Bommes's avatar
David Bommes committed
974
975
              const VectorIT& _idx_to_round,
	      double          _eps)
976
977
978
979
980
981
{
  // test integer roundings
  std::cerr << __FUNCTION__ << ": Testing integer roundings..." << std::endl;
  bool all_roundings_ok = true;

  for( unsigned int i = 0; i < _idx_to_round.size(); ++i)
David Bommes's avatar
David Bommes committed
982
    if(fabs(ROUND(_x[_idx_to_round[i]])-_x[_idx_to_round[i]]) != 0.0)
983
984
985
986
987
988
989
    {
      std::cerr << "\t Warning: variable " << _idx_to_round[i] << " was not rounded!" << " Value is = " << _x[_idx_to_round[i]] << std::endl;
      all_roundings_ok = false;
    }
  std::cerr << __FUNCTION__ << (all_roundings_ok? ": All roundings ok!" : ": Some roundings not ok!") << std::endl;

  // also test other stuff
David Bommes's avatar
David Bommes committed
990
  return verify_constrained_system(_conditions, _A, _x, _rhs, _eps);
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
}

//-----------------------------------------------------------------------------


template<class CMatrixT>
void 
ConstrainedSolver::eliminate_columns( CMatrixT& _M,
				      const std::vector< int >& _columns)
{
  // nothing to do?
  if( _columns.size() == 0) return;

  // eliminate columns in place by first copying to the right place
  // and a subsequent resize
  std::vector< int > columns( _columns);
  std::sort( columns.begin(), columns.end());

  std::vector< int >::iterator col_it  = columns.begin();
  std::vector< int >::iterator col_end = columns.end();

  int next_i = *col_it;
  for( int i = *col_it; i < (int)_M.ncols(); ++i)
  {
    if( col_it != col_end && i == *col_it)
    {
      ++col_it;
    }
    else
    {
      _M.col(next_i) = _M.col(i);
      ++next_i;
    }
  }
  gmm::resize( _M, _M.nrows(), _M.ncols() - columns.size());
}


//=============================================================================
1030
} // namespace COMISO
1031
//=============================================================================