Home
last modified time | relevance | path

Searched refs:pivotrow (Results 1 – 25 of 51) sorted by relevance

123

/dports/math/polymake/polymake-4.5/lib/core/include/internal/
H A Dsparse_linalg.h36 for (auto pivotrow = entire(rows(M)); !pivotrow.at_end(); ++pivotrow) { in det() local
37 if (pivotrow->empty()) in det()
40 auto pivot = pivotrow->begin(); in det()
41 const Int pr = pivotrow.index(); in det()
70 for (auto pivotrow = entire(rows(M)); !pivotrow.at_end() && col < n_cols; ++pivotrow) { in reduce() local
71 if (pivotrow->empty()) continue; in reduce()
73 auto pivot = pivotrow->begin(); in reduce()
76 (*pivotrow) /= pivotelem; in reduce()
78 auto in_col = cross_direction(pivotrow->begin()); in reduce()
83 M.row(r2) -= (*pivotrow) * factor; in reduce()
[all …]
/dports/math/highs/HiGHS-cfe064e/src/ipm/basiclu/src/
H A Dlu_garbage_perm.c30 lu_int *pivotrow = this->pivotrow; in lu_garbage_perm() local
45 pivotrow[put] = pivotrow[get]; in lu_garbage_perm()
50 memmove(pivotrow, pivotrow+put, m*sizeof(lu_int)); in lu_garbage_perm()
H A Dlu_residual_test.c31 const lu_int *pivotrow = this->pivotrow; in lu_residual_test() local
68 ipivot = pivotrow[k]; in lu_residual_test()
79 ipivot = pivotrow[k]; in lu_residual_test()
89 ipivot = pivotrow[k]; in lu_residual_test()
102 ipivot = pivotrow[k]; in lu_residual_test()
126 ipivot = pivotrow[k]; in lu_residual_test()
137 ipivot = pivotrow[k]; in lu_residual_test()
H A Dlu_build_factors.c134 lu_int *pivotrow = this->pivotrow; in lu_build_factors() local
207 pivotrow[k] = -1; in lu_build_factors()
217 pivotrow[pinv[i]] = i; in lu_build_factors()
231 assert(pivotrow[k] >= 0); in lu_build_factors()
270 i = pivotrow[k]; in lu_build_factors()
280 ipivot = pivotrow[k]; in lu_build_factors()
374 i = pivotrow[k]; in lu_build_factors()
392 i = pivotrow[k]; in lu_build_factors()
415 i = pivotrow[k]; in lu_build_factors()
432 memcpy(this->p, pivotrow, m*sizeof(lu_int)); in lu_build_factors()
H A Dlu_matrix_norm.c20 const lu_int *pivotrow = this->pivotrow; in lu_matrix_norm() local
43 ipivot = pivotrow[k]; in lu_matrix_norm()
H A Dlu_solve_dense.c17 const lu_int *pivotrow = this->pivotrow; in lu_solve_dense() local
52 ipivot = pivotrow[k]; in lu_solve_dense()
120 ipivot = pivotrow[k]; in lu_solve_dense()
H A Dlu_solve_sparse.c24 const lu_int *pivotrow = this->pivotrow; in lu_solve_sparse() local
259 ipivot = pivotrow[k]; in lu_solve_sparse()
H A Dlu_solve_for_update.c24 const lu_int *pivotrow = this->pivotrow; in lu_solve_for_update() local
333 ipivot = pivotrow[k]; in lu_solve_for_update()
H A Dbasiclu_get_factors.c44 memcpy(rowperm, this.pivotrow, m*sizeof(lu_int)); in basiclu_get_factors()
/dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_highs/src/ipm/basiclu/src/
H A Dlu_garbage_perm.c30 lu_int *pivotrow = this->pivotrow; in lu_garbage_perm() local
45 pivotrow[put] = pivotrow[get]; in lu_garbage_perm()
50 memmove(pivotrow, pivotrow+put, m*sizeof(lu_int)); in lu_garbage_perm()
H A Dlu_residual_test.c31 const lu_int *pivotrow = this->pivotrow; in lu_residual_test() local
68 ipivot = pivotrow[k]; in lu_residual_test()
79 ipivot = pivotrow[k]; in lu_residual_test()
89 ipivot = pivotrow[k]; in lu_residual_test()
102 ipivot = pivotrow[k]; in lu_residual_test()
126 ipivot = pivotrow[k]; in lu_residual_test()
137 ipivot = pivotrow[k]; in lu_residual_test()
H A Dlu_build_factors.c134 lu_int *pivotrow = this->pivotrow; in lu_build_factors() local
207 pivotrow[k] = -1; in lu_build_factors()
217 pivotrow[pinv[i]] = i; in lu_build_factors()
231 assert(pivotrow[k] >= 0); in lu_build_factors()
270 i = pivotrow[k]; in lu_build_factors()
280 ipivot = pivotrow[k]; in lu_build_factors()
374 i = pivotrow[k]; in lu_build_factors()
392 i = pivotrow[k]; in lu_build_factors()
415 i = pivotrow[k]; in lu_build_factors()
432 memcpy(this->p, pivotrow, m*sizeof(lu_int)); in lu_build_factors()
H A Dlu_matrix_norm.c20 const lu_int *pivotrow = this->pivotrow; in lu_matrix_norm() local
43 ipivot = pivotrow[k]; in lu_matrix_norm()
H A Dlu_solve_dense.c17 const lu_int *pivotrow = this->pivotrow; in lu_solve_dense() local
52 ipivot = pivotrow[k]; in lu_solve_dense()
120 ipivot = pivotrow[k]; in lu_solve_dense()
H A Dlu_solve_sparse.c24 const lu_int *pivotrow = this->pivotrow; in lu_solve_sparse() local
259 ipivot = pivotrow[k]; in lu_solve_sparse()
H A Dlu_solve_for_update.c24 const lu_int *pivotrow = this->pivotrow; in lu_solve_for_update() local
333 ipivot = pivotrow[k]; in lu_solve_for_update()
H A Dbasiclu_get_factors.c44 memcpy(rowperm, this.pivotrow, m*sizeof(lu_int)); in basiclu_get_factors()
/dports/security/libecc/libecc-0.14.0/include/libecc/
H A Dpolynomial.h1357 unsigned int pivotrow; in polynomial() local
1362 if (++pivotrow == m) in polynomial()
1365 pivotrow = 0; in polynomial()
1368 for (pivotrow = (m + 1) / 2; pivotrow < wipecol; ++pivotrow) in polynomial()
1369 if (matrix[pivotrow].test(wipecol) && !pivotted.test(pivotrow)) in polynomial()
1382 if (matrix[pivotrow].test(wipecol) && !pivotted.test(pivotrow)) in polynomial()
1385 if (pivotrow == m) in polynomial()
1389 pivotrow = wipecol; in polynomial()
1393 pivotted.set(pivotrow); in polynomial()
1401 if (pivotrow == wipecol) in polynomial()
[all …]
/dports/math/vinci/vinci-1.0.5/
H A Dvinci_lass.c42 rational *pivotrow; /* copy of pivot row */ variable
586 memcpy(&pivotrow[0], A+row*(d+1), sizeof(rational)*(d+1));
590 if (fabs(pivotrow[i])>=MIN_PIVOT_LASS) {col=i; break;};
592 if (fabs(pivotrow[i])>fabs(pivotrow[col])) col=i;
602 mi=1.0/pivotrow[col];
603 for (i=0; i<=d; i++) pivotrow[i]*=mi;
617 *realp2=(*realp1)-pivotrow[j]*mi;
664 pivotrow = (rational *) my_malloc ((G_d + 1) * sizeof (rational));
/dports/math/polylib/polylib-5.22.5/source/kernel/
H A Dmatrix.c230 int nc, nr, i, j, k, rank, reduced, pivotrow; in hermite() local
274 pivotrow = rank; in hermite()
282 pivotrow = i; in hermite()
287 if (pivotrow != rank) { in hermite()
288 Vector_Exchange(H->p[pivotrow],H->p[rank],nc); in hermite()
290 Vector_Exchange(U->p[pivotrow],U->p[rank],nr); in hermite()
292 Vector_Exchange(Q->p[pivotrow],Q->p[rank],nr); in hermite()
295 fprintf(stderr,"Exchange rows %d and %d -----------\n", rank+1, pivotrow+1); in hermite()
/dports/math/barvinok/barvinok-0.41.5/polylib/source/kernel/
H A Dmatrix.c230 int nc, nr, i, j, k, rank, reduced, pivotrow; in hermite() local
274 pivotrow = rank; in hermite()
282 pivotrow = i; in hermite()
287 if (pivotrow != rank) { in hermite()
288 Vector_Exchange(H->p[pivotrow],H->p[rank],nc); in hermite()
290 Vector_Exchange(U->p[pivotrow],U->p[rank],nr); in hermite()
292 Vector_Exchange(Q->p[pivotrow],Q->p[rank],nr); in hermite()
295 fprintf(stderr,"Exchange rows %d and %d -----------\n", rank+1, pivotrow+1); in hermite()
/dports/lang/mosml/mosml-ver-2.10.1/examples/paulson/
H A Dsample3.sml94 fun pivotrow [row] = row : real list function
95 | pivotrow (row1::row2::rows) =
97 then pivotrow(row1::rows)
98 else pivotrow(row2::rows);
114 let val p::prow = pivotrow rows
/dports/lang/mosml/mosml-ver-2.10.1/src/compiler/test/
H A Dsample3.sml94 fun pivotrow [row] = row : real list function
95 | pivotrow (row1::row2::rows) =
97 then pivotrow(row1::rows)
98 else pivotrow(row2::rows);
114 let val p::prow = pivotrow rows
/dports/science/berkeleygw/BGW-2.0.0/Common/qhull/
H A Dgeom.c582 realT *ai, *ak, *rowp, *pivotrow; in qh_gausselim() local
615 pivotrow= rows[k] + k; in qh_gausselim()
616 pivot= *pivotrow++; /* signed value of pivot, and remainder of row */ in qh_gausselim()
619 ak= pivotrow; in qh_gausselim()
/dports/science/afni/afni-AFNI_21.3.16/src/qhulldir/
H A Dgeom.c582 realT *ai, *ak, *rowp, *pivotrow; in qh_gausselim() local
615 pivotrow= rows[k] + k; in qh_gausselim()
616 pivot= *pivotrow++; /* signed value of pivot, and remainder of row */ in qh_gausselim()
619 ak= pivotrow; in qh_gausselim()

123