Home
last modified time | relevance | path

Searched refs:NbColumns (Results 1 – 25 of 164) sorted by relevance

1234567

/dports/math/polylib/polylib-5.22.5/source/kernel/
H A Dcompress_parms.c122 int a = A->NbColumns;
123 int b = B->NbColumns;
163 Matrix_subMatrix(U, a+b, z, U->NbColumns, U->NbColumns, I);
208 Matrix_subMatrix(Eqs, 0, Eqs->NbColumns-1, rk, Eqs->NbColumns, &C);
346 assert ((*newM)->NbColumns==M->NbColumns - elimParms[0]);
394 unsigned int nbVars = (*M)->NbColumns - (*C)->NbColumns;
568 S = Matrix_Alloc(M->NbColumns, M->NbColumns);
593 int b = B->NbColumns;
656 int nbVars = M->NbColumns-Ctxt->NbColumns;
709 Ctxt->NbColumns-1);
[all …]
H A DSolveDio.c105 for (j = 0; j < A->NbColumns-1; j++) in SolveDiophantine()
123 min=(hermi->NbRows <= hermi->NbColumns ) ? hermi->NbRows : hermi->NbColumns ; in SolveDiophantine()
135 k2 = temp->NbColumns; in SolveDiophantine()
192 *X = Vector_Alloc(M->NbColumns-1); in SolveDiophantine()
194 if (rank == hermi->NbColumns) in SolveDiophantine()
198 *U = Matrix_Alloc(hermi->NbColumns, hermi->NbColumns-rank); in SolveDiophantine()
260 for (j = 0; j < L->NbColumns; j++) in RearrangeMatforSolveDio()
269 if (j == L->NbColumns) { in RearrangeMatforSolveDio()
282 for (i = 0; i <L->NbColumns; i++) in RearrangeMatforSolveDio()
287 for (i = 0;i <A->NbColumns; i++) in RearrangeMatforSolveDio()
[all …]
H A DMatop.c126 for (j = 0; j < Src->NbColumns; j++) in Matrix_Copy()
197 for (j = 0; j < X->NbColumns; j++) { in PutRowLast()
216 for (j = 0; j < X->NbColumns; j++) { in PutRowFirst()
277 for (j = 0; j < M->NbColumns; j++) in AddANullRow()
350 M->NbColumns-1-Columnnumber); in RemoveColumn()
374 if (M->NbRows <= M->NbColumns) { in findHermiteBasis()
395 for (j = 0; j < C->NbColumns; j++) in findHermiteBasis()
398 if (j == C->NbColumns) { in findHermiteBasis()
412 dim = C->NbColumns; in findHermiteBasis()
415 for (i = 0; i < C->NbColumns; i ++) in findHermiteBasis()
[all …]
H A Dmatrix_addon.c35 view->NbColumns = P->Dimension+2; in constraintsView()
58 (*Eqs) = Matrix_Alloc(nb_eqs, M->NbColumns); in split_constraints()
65 for(j=0; j< M->NbColumns; j++) in split_constraints()
71 for(j=0; j< M->NbColumns; j++) in split_constraints()
143 for (j=0; j< (*inverse)->NbColumns; j++) in mtransformation_inverse()
160 assert(new_dim>=M->NbColumns); in mtransformation_expand_left_to_dim()
161 assert(M->NbRows==M->NbColumns); in mtransformation_expand_left_to_dim()
204 polyh->p[i][polyh->NbColumns-1], infl); in mpolyhedron_inflate()
227 polyh->p[i][polyh->NbColumns-1], defl); in mpolyhedron_deflate()
272 for (k=1; k<Victim->NbColumns; k++) { in eliminate_var_with_constr()
[all …]
H A DLattice.c86 if (value_ne(A->p[i][A->NbColumns-1],B->p[i][B->NbColumns-1])) in sameAffinepart()
490 if (X->NbRows != X->NbColumns) { in LatticeIntersection()
495 if (Y->NbRows != Y->NbColumns) { in LatticeIntersection()
600 value_oppose(Dio->p[i][Dio->NbColumns-1],A->p[i][A->NbColumns-1]); in MakeDioEqforInter()
601 value_oppose(Dio->p[i+A->NbRows-1][Dio->NbColumns-1],B->p[i][A->NbColumns-1]) ; in MakeDioEqforInter()
1191 Dio = Matrix_Alloc(G->NbRows, G->NbColumns+L->NbColumns-1); in LatticePreimage()
1216 Result = Matrix_Alloc (G->NbColumns, G->NbColumns); in LatticePreimage()
1253 if (m->NbRows != m->NbColumns) in IsLattice()
1493 if (value_gt(L1[0]->p[i][L1[0]->NbColumns-1],L2[0]->p[i][L1[0]->NbColumns-1])) in AffinePartCompare()
1496 if (value_lt(L1[0]->p[i][L1[0]->NbColumns-1],L2[0]->p[i][L1[0]->NbColumns-1])) in AffinePartCompare()
[all …]
H A Dmatrix_permutations.c70 assert(transf->NbRows==transf->NbColumns); in mtransformation_permute()
90 for (j= 1; j< polyh->NbColumns; j++) { in mpolyhedron_permute()
107 (*Cp) = Matrix_Alloc(C->NbRows, C->NbColumns); in Constraints_permute()
110 assert((*Cp)->NbRows == C->NbRows && (*Cp)->NbColumns==C->NbColumns); in Constraints_permute()
114 for (j= 1; j< C->NbColumns; j++) { in Constraints_permute()
143 assert (start>0 && end < Eqs->NbColumns-1); in eliminable_vars()
150 Eqs->NbColumns*Eqs->NbColumns); in eliminable_vars()
161 assert (!Vector_IsZero(Eqs->p[i], Eqs->NbColumns)); in eliminable_vars()
215 int nb_vars = Eqs->NbColumns-nb_parms-2; in find_a_permutation()
218 Eqs->NbColumns-1); in find_a_permutation()
[all …]
H A Dmatrix.c57 Mat->NbColumns=NbColumns; in Matrix_Alloc()
80 p += NbColumns; in Matrix_Alloc()
144 fprintf(Dst,"%d %d\n", NbRows=Mat->NbRows, NbColumns=Mat->NbColumns); in Matrix_Print()
145 if (NbColumns ==0) { in Matrix_Print()
241 nc = H->NbColumns; in hermite()
442 nc = A->NbColumns; in right_hermite()
516 nc = A->NbColumns; in left_hermite()
770 Vector_Normalize_Positive(&S->p[i][0],S->NbColumns,S->NbColumns-1); in rat_prodmat()
791 NbColumns=Mat->NbColumns; in Matrix_Vector_Product()
823 NbColumns=Mat->NbColumns; in Vector_Matrix_Product()
[all …]
H A DNormalForms.c590 for (j = 0 ; j < A->NbColumns; j++) in ConvertPolMattoDarMat()
633 v = Identity(A->NbColumns); in Smith()
636 *V = Identity(A->NbColumns); in Smith()
640 A->NbRows, A->NbColumns, 1); in Smith()
679 darte_identite = (Value *)malloc(sizeof(Value) * A->NbColumns* A->NbColumns); in Hermite()
680 darte_id_inv = (Value *) malloc(sizeof(Value) * A->NbColumns*A->NbColumns); in Hermite()
681 for (i=0; i< A->NbColumns * A->NbColumns; i++) in Hermite()
683 for (i=0; i< A->NbColumns * A->NbColumns; i++) in Hermite()
691 tempU = ConvertDarMattoPolMat(darte_identite, A->NbColumns, A->NbColumns); in Hermite()
709 for (i=0; i< A->NbColumns * A->NbColumns; i++) in Hermite()
[all …]
/dports/math/barvinok/barvinok-0.41.5/polylib/source/kernel/
H A Dcompress_parms.c122 int a = A->NbColumns; in linearInter()
123 int b = B->NbColumns; in linearInter()
163 Matrix_subMatrix(U, a+b, z, U->NbColumns, U->NbColumns, I); in linearInter()
208 Matrix_subMatrix(Eqs, 0, Eqs->NbColumns-1, rk, Eqs->NbColumns, &C); in Equalities_integerSolution()
346 assert ((*newM)->NbColumns==M->NbColumns - elimParms[0]); in Constraints_removeElimCols()
394 unsigned int nbVars = (*M)->NbColumns - (*C)->NbColumns; in Constraints_fullDimensionize()
568 S = Matrix_Alloc(M->NbColumns, M->NbColumns); in affine_periods()
593 int b = B->NbColumns; in Equalities_intModBasis()
656 int nbVars = M->NbColumns-Ctxt->NbColumns; in Constraints_Remove_parm_eqs()
709 Ctxt->NbColumns-1); in Constraints_Remove_parm_eqs()
[all …]
H A DSolveDio.c105 for (j = 0; j < A->NbColumns-1; j++) in SolveDiophantine()
123 min=(hermi->NbRows <= hermi->NbColumns ) ? hermi->NbRows : hermi->NbColumns ; in SolveDiophantine()
135 k2 = temp->NbColumns; in SolveDiophantine()
192 *X = Vector_Alloc(M->NbColumns-1); in SolveDiophantine()
194 if (rank == hermi->NbColumns) in SolveDiophantine()
198 *U = Matrix_Alloc(hermi->NbColumns, hermi->NbColumns-rank); in SolveDiophantine()
260 for (j = 0; j < L->NbColumns; j++) in RearrangeMatforSolveDio()
269 if (j == L->NbColumns) { in RearrangeMatforSolveDio()
282 for (i = 0; i <L->NbColumns; i++) in RearrangeMatforSolveDio()
287 for (i = 0;i <A->NbColumns; i++) in RearrangeMatforSolveDio()
[all …]
H A DMatop.c126 for (j = 0; j < Src->NbColumns; j++) in Matrix_Copy()
197 for (j = 0; j < X->NbColumns; j++) { in PutRowLast()
216 for (j = 0; j < X->NbColumns; j++) { in PutRowFirst()
277 for (j = 0; j < M->NbColumns; j++) in AddANullRow()
350 M->NbColumns-1-Columnnumber); in RemoveColumn()
374 if (M->NbRows <= M->NbColumns) { in findHermiteBasis()
395 for (j = 0; j < C->NbColumns; j++) in findHermiteBasis()
398 if (j == C->NbColumns) { in findHermiteBasis()
412 dim = C->NbColumns; in findHermiteBasis()
415 for (i = 0; i < C->NbColumns; i ++) in findHermiteBasis()
[all …]
H A Dmatrix_addon.c35 view->NbColumns = P->Dimension+2; in constraintsView()
58 (*Eqs) = Matrix_Alloc(nb_eqs, M->NbColumns); in split_constraints()
65 for(j=0; j< M->NbColumns; j++) in split_constraints()
71 for(j=0; j< M->NbColumns; j++) in split_constraints()
143 for (j=0; j< (*inverse)->NbColumns; j++) in mtransformation_inverse()
160 assert(new_dim>=M->NbColumns); in mtransformation_expand_left_to_dim()
161 assert(M->NbRows==M->NbColumns); in mtransformation_expand_left_to_dim()
204 polyh->p[i][polyh->NbColumns-1], infl); in mpolyhedron_inflate()
227 polyh->p[i][polyh->NbColumns-1], defl); in mpolyhedron_deflate()
272 for (k=1; k<Victim->NbColumns; k++) { in eliminate_var_with_constr()
[all …]
H A DLattice.c86 if (value_ne(A->p[i][A->NbColumns-1],B->p[i][B->NbColumns-1])) in sameAffinepart()
490 if (X->NbRows != X->NbColumns) { in LatticeIntersection()
495 if (Y->NbRows != Y->NbColumns) { in LatticeIntersection()
600 value_oppose(Dio->p[i][Dio->NbColumns-1],A->p[i][A->NbColumns-1]); in MakeDioEqforInter()
601 value_oppose(Dio->p[i+A->NbRows-1][Dio->NbColumns-1],B->p[i][A->NbColumns-1]) ; in MakeDioEqforInter()
1191 Dio = Matrix_Alloc(G->NbRows, G->NbColumns+L->NbColumns-1); in LatticePreimage()
1216 Result = Matrix_Alloc (G->NbColumns, G->NbColumns); in LatticePreimage()
1253 if (m->NbRows != m->NbColumns) in IsLattice()
1493 if (value_gt(L1[0]->p[i][L1[0]->NbColumns-1],L2[0]->p[i][L1[0]->NbColumns-1])) in AffinePartCompare()
1496 if (value_lt(L1[0]->p[i][L1[0]->NbColumns-1],L2[0]->p[i][L1[0]->NbColumns-1])) in AffinePartCompare()
[all …]
H A Dmatrix_permutations.c70 assert(transf->NbRows==transf->NbColumns); in mtransformation_permute()
90 for (j= 1; j< polyh->NbColumns; j++) { in mpolyhedron_permute()
107 (*Cp) = Matrix_Alloc(C->NbRows, C->NbColumns); in Constraints_permute()
110 assert((*Cp)->NbRows == C->NbRows && (*Cp)->NbColumns==C->NbColumns); in Constraints_permute()
114 for (j= 1; j< C->NbColumns; j++) { in Constraints_permute()
143 assert (start>0 && end < Eqs->NbColumns-1); in eliminable_vars()
150 Eqs->NbColumns*Eqs->NbColumns); in eliminable_vars()
161 assert (!Vector_IsZero(Eqs->p[i], Eqs->NbColumns)); in eliminable_vars()
215 int nb_vars = Eqs->NbColumns-nb_parms-2; in find_a_permutation()
218 Eqs->NbColumns-1); in find_a_permutation()
[all …]
H A Dmatrix.c57 Mat->NbColumns=NbColumns; in Matrix_Alloc()
80 p += NbColumns; in Matrix_Alloc()
144 fprintf(Dst,"%d %d\n", NbRows=Mat->NbRows, NbColumns=Mat->NbColumns); in Matrix_Print()
145 if (NbColumns ==0) { in Matrix_Print()
241 nc = H->NbColumns; in hermite()
442 nc = A->NbColumns; in right_hermite()
516 nc = A->NbColumns; in left_hermite()
770 Vector_Normalize_Positive(&S->p[i][0],S->NbColumns,S->NbColumns-1); in rat_prodmat()
791 NbColumns=Mat->NbColumns; in Matrix_Vector_Product()
823 NbColumns=Mat->NbColumns; in Vector_Matrix_Product()
[all …]
H A DNormalForms.c590 for (j = 0 ; j < A->NbColumns; j++) in ConvertPolMattoDarMat()
633 v = Identity(A->NbColumns); in Smith()
636 *V = Identity(A->NbColumns); in Smith()
640 A->NbRows, A->NbColumns, 1); in Smith()
679 darte_identite = (Value *)malloc(sizeof(Value) * A->NbColumns* A->NbColumns); in Hermite()
680 darte_id_inv = (Value *) malloc(sizeof(Value) * A->NbColumns*A->NbColumns); in Hermite()
681 for (i=0; i< A->NbColumns * A->NbColumns; i++) in Hermite()
683 for (i=0; i< A->NbColumns * A->NbColumns; i++) in Hermite()
691 tempU = ConvertDarMattoPolMat(darte_identite, A->NbColumns, A->NbColumns); in Hermite()
709 for (i=0; i< A->NbColumns * A->NbColumns; i++) in Hermite()
[all …]
/dports/math/cloog/cloog-cloog-0.20.0/source/
H A Dmatrix.c46 CloogMatrix *cloog_matrix_alloc(unsigned NbRows, unsigned NbColumns) in cloog_matrix_alloc() argument
58 matrix->NbColumns = NbColumns; in cloog_matrix_alloc()
60 if (!NbRows || !NbColumns) { in cloog_matrix_alloc()
73 q = (cloog_int_t *)malloc(NbRows * NbColumns * sizeof(cloog_int_t)); in cloog_matrix_alloc()
86 for (j = 0; j < NbColumns; j++) { in cloog_matrix_alloc()
90 q += NbColumns; in cloog_matrix_alloc()
104 int size = matrix->NbRows * matrix->NbColumns; in cloog_matrix_free()
130 for (j = 0; j < M->NbColumns; ++j) { in cloog_matrix_print_structure()
148 fprintf(foo, "%d %d\n", m->NbRows, m->NbColumns); in cloog_matrix_print()
/dports/math/barvinok/barvinok-0.41.5/
H A Dsemigroup_holes.cc29 M = Matrix_Alloc(generators->NbColumns + 1, 1 + generators->NbRows + 1); in compute_cone()
32 value_set_si(M->p[0][M->NbColumns - 1], 1); in compute_cone()
33 for (int i = 0; i < generators->NbColumns; ++i) { in compute_cone()
72 for (row = col = 0; col < H->NbColumns; ++col) { in compute_lattice_gf()
116 M = Matrix_Alloc(generators->NbRows + generators->NbColumns, in compute_semigroup_gf()
117 1 + generators->NbColumns + generators->NbRows + 1); in compute_semigroup_gf()
120 value_set_si(M->p[i][1 + generators->NbColumns + i], -1); in compute_semigroup_gf()
121 for (int j = 0; j < generators->NbColumns; ++j) in compute_semigroup_gf()
124 for (int i = 0; i < generators->NbColumns; ++i) { in compute_semigroup_gf()
131 gf = barvinok_enumerate_e_series(S, generators->NbColumns, in compute_semigroup_gf()
H A Dskewed_genfun.cc13 matrix2zz(T, m, T->NbRows, T->NbColumns); in print()
18 matrix2zz(eq, m, eq->NbRows, eq->NbColumns); in print()
23 matrix2zz(div, m, div->NbRows, div->NbColumns); in print()
34 Inner_Product(eq->p[i]+1, params, eq->NbColumns-2, eq->p[i]); in coefficient()
45 Inner_Product(div->p[i], params, div->NbColumns-1, &tmp); in coefficient()
46 if (!mpz_divisible_p(tmp, div->p[i][div->NbColumns-1])) { in coefficient()
H A Dscarf.cc72 B = Matrix_Alloc(2, A->NbColumns); in normalize_matrix()
99 tmp, factor, B->NbColumns); in normalize_matrix()
159 tmp, factor, B->NbColumns); in normalize_matrix()
180 tmp, factor, B->NbColumns); in normalize_matrix()
232 B->NbColumns); in normalize_matrix()
243 B->NbColumns); in normalize_matrix()
346 for (int k = 0; k < M->NbColumns; ++k) in print()
424 b_offset = Vector_Alloc(A->NbColumns); in shrunk_polyhedron()
694 B->NbColumns); in add()
705 B->NbColumns); in add()
[all …]
H A Dlattice_point.cc288 Vector_Copy(vertex_res, point, Rays_res->NbColumns); in lattice_point_fixed()
309 Vector_Copy(M->p[i], M2->p[i], M->NbColumns); in Matrix_AddRowColumn()
310 value_set_si(M2->p[M->NbRows][M->NbColumns], 1); in Matrix_AddRowColumn()
433 unsigned nparam = V->NbColumns-2; in lattice_point_fractional()
444 matrix2zz(V, vertex, V->NbRows, V->NbColumns-1); in lattice_point_fractional()
457 matrix2zz(T, RT, T->NbRows, T->NbColumns); in lattice_point_fractional()
561 V->Vertex->NbColumns--; in relative_coordinates()
564 V->Vertex->NbColumns++; in relative_coordinates()
581 unsigned nparam = V->Vertex->NbColumns - 2; in lattice_point()
664 unsigned nparam = V->Vertex->NbColumns - 2; in lattice_point_fixed()
[all …]
H A Dpolysign_isl.c24 eq = isl_mat_alloc(ctx, n, M->NbColumns - 1); in extract_equalities()
28 for (j = 0; j < M->NbColumns - 1; ++j) { in extract_equalities()
49 ineq = isl_mat_alloc(ctx, n, M->NbColumns - 1); in extract_inequalities()
53 for (j = 0; j < M->NbColumns - 1; ++j) { in extract_inequalities()
75 assert(D->Dimension == T->NbColumns - 1); in isl_polyhedron_affine_sign()
154 dim = isl_space_set_alloc(ctx, 0, C->NbColumns - 2); in isl_constraints_opt()
159 for (i = 0; i < C->NbColumns - 2; ++i) { in isl_constraints_opt()
163 v = isl_val_int_from_gmp(ctx, obj[C->NbColumns - 2]); in isl_constraints_opt()
H A Dutil.c58 unsigned NbRows, NbColumns; in Polyhedron_Read() local
73 M = Matrix_Alloc(NbRows,NbColumns); in Polyhedron_Read()
458 for (; i < m->NbColumns; ++i) { in unimodular_complete_1()
1641 if (M->NbColumns == 1) { in left_inverse()
1665 *Eq = Matrix_Alloc(H->NbRows - H->NbColumns, 2 + U->NbColumns); in left_inverse()
1667 Vector_Copy(U->p[H->NbColumns+i], (*Eq)->p[i]+1, U->NbColumns); in left_inverse()
1668 Inner_Product(U->p[H->NbColumns+i], t->p, U->NbColumns, in left_inverse()
1669 (*Eq)->p[i]+1+U->NbColumns); in left_inverse()
1672 ratH = Matrix_Alloc(H->NbColumns+1, H->NbColumns+1); in left_inverse()
1673 invH = Matrix_Alloc(H->NbColumns+1, H->NbColumns+1); in left_inverse()
[all …]
H A Dhilbert.c20 zmatrix = createMatrix(M->NbColumns-2, M->NbRows); in Matrix2zsolve()
22 for (j = 0; j < M->NbColumns-2; ++j) { in Matrix2zsolve()
67 Matrix *H = Matrix_Alloc(T->NbRows+1, T->NbColumns+1); in homogenize()
70 Vector_Copy(T->p[i], H->p[i], T->NbColumns); in homogenize()
71 value_set_si(H->p[T->NbRows][T->NbColumns], 1); in homogenize()
157 M3 = Matrix_Alloc(M2->NbRows, M2->NbColumns); in Cone_Hilbert_Basis()
165 M = Matrix_Alloc(M3->NbRows, T->NbColumns); in Cone_Hilbert_Basis()
259 value_set_si(LP->p[dim][LP->NbColumns-1], -1); in Cone_Hilbert_Integer_Hull()
260 for (k = 0; k < LP->NbColumns-2; ++k) { in Cone_Hilbert_Integer_Hull()
266 obj = Vector_Alloc(LP->NbColumns-1); in Cone_Hilbert_Integer_Hull()
/dports/math/cloog/cloog-cloog-0.20.0/source/matrix/
H A Dconstraintset.c116 unsigned len = matrix->NbColumns - 2; in cloog_constraint_set_defining_inequalities()
179 return constraints->M.NbColumns - 2; in cloog_constraint_set_total_dimension()
373 equal->constraints->M.NbColumns-1); in cloog_equal_update()
503 if (level == matrix->NbColumns-1) in cloog_constraint_set_normalize()
532 for (j=1;j<matrix->NbColumns;j++) { in cloog_constraint_set_normalize()
567 for (j=0;j<matrix->NbColumns;j++) in cloog_constraint_set_copy()
693 matrix->NbColumns, level, nb_par); in cloog_constraint_set_simplify()
694 for (j=0;j<matrix->NbColumns;j++) in cloog_constraint_set_simplify()
709 if (k == matrix->NbColumns) in cloog_constraint_set_simplify()
710 { for (k=0;k<matrix->NbColumns;k++) in cloog_constraint_set_simplify()
[all …]

1234567