Lines Matching defs:an
46 (non-)solution this class finds an optimal solution. The optimization
50 It does so by implementing an active set method algorithm. The basic idea
725 const int an = fVariableCount;
727 zero_matrix(fActiveMatrix, am, an);
747 independentRows, am, an);
766 // Which is an system we can solve:
771 bool independentColumns[an];
773 transpose_matrix(fActiveMatrix, aa, am, an);
775 independentColumns, an, am);
787 for (int i = 0; i < an; i++) {
877 const int an = fVariableCount;
882 transpose_matrix(fActiveMatrix, fTemp1, am, an);
883 bool success = qr_decomposition(fTemp1, an, am, tempD, Q);
890 const int zm = an;
891 const int zn = an - am;