Macaulay2 Engine
Loading...
Searching...
No Matches
◆
points()
template<typename CoeffRing>
Matrix
*
PointsComputation
< CoeffRing >::points
(
const
PolynomialRing
*
R
,
const typename CoeffRing::ring_type *
K
,
const
DMat
< CoeffRing > *
Pts
,
Matrix
*&
result_std_monoms
)
static
Definition at line
54
of file
points.cpp
.
59
{
60
// Declare and initialize our variables
61
// int nvars = R->n_vars();
62
// int npoints = Pts->n_cols();
63
64
// MatrixConstructor gbG(R->make_FreeModule(1), 0);
65
// DMat<CoeffRing> *P = new DMat<CoeffRing>(K, npoints, npoints+1);
66
// DMat<CoeffRing> *PLU = new DMat<CoeffRing>(K, npoints, npoints+1);
67
// MonomialIdeal *inG = new MonomialIdeal(R);
68
// VECTOR(monomial) stdG;
69
// monom_int_list monoms_todo(R);
70
71
// int next_col = 0;
72
// MES Place the monomials [0,0,vp], ..., [0,nvars-1,vp] onto monom list
73
// MES Make the first column of P, PLU all ones.
74
75
// The main loop
76
#if 0
77
// while (monoms_todo.remove(old,x,vp))
78
// {
79
// // First, see if this monomial is in inG, if so, continue.
80
//
81
// // Place this monomial as the 'next_col' column of P, PLU.
82
//
83
// // LU1
84
//
85
// //
86
// }
87
#endif
88
// THIS STILL NEEDS TO BE WRITTEN!!
89
return
0;
90
}
References
Matrix
.
Referenced by
rawIdealOfPoints()
.
PointsComputation
Generated on
for Macaulay2 Engine by
1.15.0