Home
last modified time | relevance | path

Searched refs:ideal (Results 251 – 275 of 9834) sorted by relevance

1...<<11121314151617181920>>...394

/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/
H A DSparsePolyOps-RadicalMembership.C66 bool RabinovichTrick(ConstRefRingElem f, ideal I) in RabinovichTrick()
73 I += ideal(ExtraGens); in RabinovichTrick()
80 I += ideal(ExtraGens); in RabinovichTrick()
94 return IsOne(ideal(newGens)); in RabinovichTrick()
100 bool IsInRadical(ConstRefRingElem f, const ideal& I) in IsInRadical()
120 bool IsInRadical(const ideal& I, const ideal& J) in IsInRadical()
150 long MinPowerInIdeal_naive(ConstRefRingElem f, const ideal& I) in MinPowerInIdeal_naive()
172 long MinPowerInIdeal(RingElem f, const ideal& I) in MinPowerInIdeal()
/dports/math/giacxcas/CoCoALib-0.99700/src/tests/
H A Dtest-HomomorphismOps1.C67 CoCoA_ASSERT_ALWAYS(ker(phi) == ideal(RingElem(R,"x-y"))); in program()
97 ideal I1(RingElem(R,"x^2-y^2")); in program()
103 CoCoA_ASSERT_ALWAYS(ker(phi2) == ideal(RingElem(RmodI1, "x-y"))); in program()
114 ideal I2(RingElem(S,"y+1")); // I2=<y+1> in S in program()
119 CoCoA_ASSERT_ALWAYS(ker(phi3) == ideal(RingElem(S, "y+1"))); in program()
131 I2 = ideal(RingElem(P2, "a^2+4*b^2-1")); in program()
143 CoCoA_ASSERT_ALWAYS(ker(phi4) == ideal(RingElems(P1, "y, x^2+z^2-1"))); in program()
152 I1 = ideal(RingElem(P1, "x^2+y^2+z^2-1")); in program()
158 CoCoA_ASSERT_ALWAYS(ker(psi2) == ideal(RingElem(Q1, "y"))); in program()
/dports/math/polymake/polymake-4.5/bundled/singular/apps/ideal/src/
H A DsingularIdeal.cc47 namespace ideal { in convert_number_to_Rational()
52 ::ideal singIdeal; in convert_number_to_Rational()
87 SingularIdeal_impl(const ::ideal i, const idhdl r) in convert_number_to_Rational()
134 ::ideal M = idInit(1); in convert_number_to_Rational()
140 ::ideal J = id_Copy(singIdeal,r); in convert_number_to_Rational()
162 ::ideal JquotM = idQuot(Jstd,M,true,true); in convert_number_to_Rational()
181 ::ideal res = id_Head(singIdeal,IDRING(singRing)); in convert_number_to_Rational()
217 ::ideal J = idInit(safe_cast(rhs.size()), 1); in convert_number_to_Rational()
349 SingularIdeal_impl toBeReduced(ideal, singRing); in convert_number_to_Rational()
373 ::ideal m = idInit(1,1); in convert_number_to_Rational()
[all …]
/dports/math/gap/gap-4.11.0/lib/
H A Dideal.gd17 ## <#GAPDoc Label="[1]{ideal}">
24 ## A <E>two-sided ideal</E> or simply <E>ideal</E> in a ring <M>R</M>
25 ## is both a left ideal and a right ideal in <M>R</M>.
32 ## whether a ring is an ideal in its parent.
56 ## structure from the additional closure properties of the ideal.
73 #T formed, it is again an ideal.
97 ## left, or right ideal, respectively,
119 ## <two-sided ideal in Integers, (1 generators)>
181 ## of the ideal, and once known they are stored in the ideal.
186 ## <two-sided ideal in ( Rationals^[ 3, 3 ] ), (1 generators)>
[all …]
/dports/cad/ghdl/ghdl-1.0.0/testsuite/vests/vhdl-ams/ashenden/compliant/frequency-modeling/
H A Dtb_opamp_2pole.vhd34 vio : entity work.v_sine(ideal)
50 R1in : entity work.resistor(ideal)
58 R1F : entity work.resistor(ideal)
66 Rload1 : entity work.resistor(ideal)
80 R2in : entity work.resistor(ideal)
88 R2F : entity work.resistor(ideal)
96 Rload2 : entity work.resistor(ideal)
110 Rin3R : entity work.resistor(ideal)
118 R3F : entity work.resistor(ideal)
126 Rload3R : entity work.resistor(ideal)
/dports/math/singular/Singular-Release-4-2-1/Singular/dyn_modules/gfanlib/
H A DgroebnerCone.h34 ideal polynomialIdeal;
45 groebnerCone(const ideal I, const ring r, const tropicalStrategy& currentCase);
46 …groebnerCone(const ideal I, const ring r, const gfan::ZVector& w, const tropicalStrategy& currentC…
47 …groebnerCone(const ideal I, const ring r, const gfan::ZVector& u, const gfan::ZVector& w, const tr…
48 groebnerCone(const ideal I, const ideal inI, const ring r, const tropicalStrategy& currentCase);
62 ideal getPolynomialIdeal() const { return polynomialIdeal; }; in getPolynomialIdeal()
H A DcontainsMonomial.cc9 poly checkForMonomialViaSuddenSaturation(const ideal I, const ring r) in checkForMonomialViaSuddenSaturation()
15 ideal M = idInit(1); in checkForMonomialViaSuddenSaturation()
22 ideal J = id_Copy(I,r); bool b; int k = 0; in checkForMonomialViaSuddenSaturation()
27 ideal Jstd = kStd(J,currRing->qideal,testHomog,&nullVector); in checkForMonomialViaSuddenSaturation()
28 ideal JquotM = idQuot(Jstd,M,true,true); in checkForMonomialViaSuddenSaturation()
29 ideal JquotMredJ = kNF(Jstd,currRing->qideal,JquotM); in checkForMonomialViaSuddenSaturation()
83 ideal Jold = idInit(k); in searchForMonomialViaStepwiseSaturation()
217 ideal I; poly monom; in checkForMonomial()
220 I = (ideal) u->CopyD(); in checkForMonomial()
226 I = (ideal) u->Data(); in checkForMonomial()
[all …]
/dports/math/reduce/Reduce-svn5758-src/packages/groebner/
H A Dhilberts.red131 <<x:=caadr ideal;
132 if cdadr ideal then ideal:={car ideal,cdadr ideal}
135 inline procedure notemptyideal ideal;cadr ideal;
137 inline procedure firstmon ideal;caadr ideal;
150 if ideal = theemptyideal()then rplaca(cdr(ideal),last)
151 else rplacd(car(ideal),last);
152 rplaca(ideal,last)end;
281 si:=splitideal(ideal,v);
333 <<m:=getnextmon ideal;
362 while notemptyideal(ideal)do
[all …]
H A Dhilbert2.red128 << x:=caadr ideal;
129 if cdadr ideal then ideal:={ car ideal,cdadr ideal }
132 smacro procedure notemptyideal ideal;cadr ideal;
134 smacro procedure firstmon ideal;caadr ideal;
147 if ideal = theemptyideal() then rplaca(cdr(ideal), last)
149 rplaca(ideal,last)end;
274 symbolic procedure npol ideal;
278 si:=splitideal(ideal,v);
330 << m:=getnextmon ideal;
359 while notemptyideal(ideal)do
[all …]
/dports/math/gap/gap-4.11.0/pkg/NumericalSgps-1.2.1/gap/
H A Dideals-affine.gd19 ## The representation of an ideal of an affine semigroup.
49 ## returns the ideal of S generated by l.
61 ## Returns a set of generators of the ideal I.
71 ## Returns the ambient semigroup of the ideal I.
80 ## Detects if the ideal I is contained in its ambient affine semigroup
132 ## Tests if the integer tuple n belongs to the ideal I.
142 ## n is a non negative integer tuple and I is an ideal
153 ## The argument I is an ideal of an affine semigroup
165 ## Given an ideal I of an affine semigroup S and an integer k
166 ## returns an ideal of the affine semigroup S generated by
[all …]
/dports/math/singular/Singular-Release-4-2-1/Singular/dyn_modules/partialgb/
H A Dpartialgb.cc8 static ideal idPartialGB (ideal h1, int k) in idPartialGB()
10 ideal s_h1; in idPartialGB()
28 ideal s_h3=kStd(s_h1,NULL,testHomog,&w,NULL,k); in idPartialGB()
56 ideal i1=(ideal)h->CopyD(); in partialStd()
/dports/textproc/texi2html/texi2html-5.0/test/singular_manual/d2t_singular/
H A Dntsolve_lib.tex21 * nt_solve:: find one real root of 0-dimensional ideal G
47 gls is a zerodimensional ideal with nvars(basering) = size(gls) (>1)
50 ideal, coordinates of one solution (if found), 0 else
61 ideal gls = x2+y2+z2-10, y2+z3+w-8, xy+yz+xz+w5 - 1,w3+y;
62 ideal ini = 3.1,2.9,1.1,0.5;
64 ideal sol = nt_solve(gls,ini,ipar);
88 a: ideal of numbers, coordinates of an approximation of a common
98 an ideal, coordinates of a better approximation of a zero of G
106 ideal i = x^2-1,y^2+x4-3,z2-y4+x-1;
107 ideal a = 2,3,4;
[all …]
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/gap/ideals/
H A Dideallam.gi52 InstallMethod(Length, "for a ideal orb",
124 # same method for inverse ideal orbs
132 # same method for inverse ideal orbs
140 # same method for inverse ideal orbs
148 InstallMethod(ViewObj, "for a ideal orb",
160 Print("ideal ");
330 # *ideal*; or
445 # *ideal*; or
553 InstallMethod(EvaluateWord, "for an ideal orb and an ideal word (Semigroups)",
588 # index of a generator of the ideal.
[all …]
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/packages/
H A Dapolarity.cpkg526 PrintLn " given a form F computes the ideal of derivations killing it.";
80 Temp:=ideal(one(RingOf(I[1])));
82 Temp:=intersect(Temp, ideal($.PerpOfForm(P)));
89 -- homegeneous part of the ideal I in degree D
102 -- homegenous part of degree D of the inverse system of the ideal I
111 -- given the form F, returns the ideal F^\perp
114 Id:=ideal($.InverseSystem(ideal(F),D));
117 Temp:=concat(Temp,$.HomogeneousPiece(colon(Id,ideal(indets(Kx))^J),D-J));
119 Return ideal(interreduced(concat(Temp, gens(ideal(indets(Kx))^(D+1)))));
127 -- ideal(z^3, y*z^2, x*z^2, y^2*z, x^3 - 6*x*y*z, x^2*z, y^3, x*y^2,
[all …]
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/packages/
H A Dapolarity.cpkg526 PrintLn " given a form F computes the ideal of derivations killing it.";
80 Temp:=ideal(one(RingOf(I[1])));
82 Temp:=intersect(Temp, ideal($.PerpOfForm(P)));
89 -- homegeneous part of the ideal I in degree D
102 -- homegenous part of degree D of the inverse system of the ideal I
111 -- given the form F, returns the ideal F^\perp
114 Id:=ideal($.InverseSystem(ideal(F),D));
117 Temp:=concat(Temp,$.HomogeneousPiece(colon(Id,ideal(indets(Kx))^J),D-J));
119 Return ideal(interreduced(concat(Temp, gens(ideal(indets(Kx))^(D+1)))));
127 -- ideal(z^3, y*z^2, x*z^2, y^2*z, x^3 - 6*x*y*z, x^2*z, y^3, x*y^2,
[all …]
/dports/math/cocoalib/CoCoALib-0.99712/src/tests/
H A Dtest-exbugs.C47 ideal I(foo); in OldBug1()
85 const ideal I1 = ideal(v); in redmine870()
88 const ideal I2 = ideal(v); in redmine870()
90 const ideal I3 = I1*I2; in redmine870()
91 const ideal I4 = I2*I1; in redmine870()
171 ideal I(zero(QQx)); in redmine1322()
179 ideal I1(RingElems(P, "x,y")); in redmine1379()
181 ideal I2(RingElems(P, "x,z")); in redmine1379()
183 ideal I3(RingElems(P, "y,z")); in redmine1379()
185 ideal I4(RingElems(P, "x,y,z")); in redmine1379()
[all …]
/dports/math/frobby/frobby-0.9.1/src/
H A DrandomDataGenerators.h42 void generateLinkedListIdeal(BigIdeal& ideal, size_t varCount);
48 void generateKingChessIdeal(BigIdeal& ideal, size_t rowsAndColumns);
54 void generateKnightChessIdeal(BigIdeal& ideal, size_t rowsAndColumns);
84 void generateTreeIdeal(BigIdeal& ideal, size_t varCount);
91 (BigIdeal& ideal, size_t varCount, size_t generatorCount);
H A DHilbertBasecase.h33 void computeCoefficient(Ideal& ideal);
41 Ideal* ideal; member
49 void freeIdeal(auto_ptr<Ideal> ideal);
53 bool canSimplify(size_t var, const Ideal& ideal, const Term& counts);
54 size_t eliminate1Counts(Ideal& ideal, Term& counts, bool& negate);
H A DIdeal.h38 Ideal(const Ideal& ideal);
197 bool operator==(const Ideal& ideal) const;
206 void insert(const Ideal& ideal);
248 void insertNonMultiples(const Exponent* term, const Ideal& ideal);
249 void insertNonMultiples(size_t var, Exponent e, const Ideal& ideal);
273 Ideal& operator=(const Ideal& ideal);
275 void swap(Ideal& ideal);
331 inline ostream& operator<<(ostream& out, const Ideal& ideal) {
332 ideal.print(out);
/dports/math/singular/Singular-Release-4-2-1/Singular/
H A Dextra.cc421 ideal F=(ideal)h->Data(); in jjSYSTEM()
439 ideal i = (ideal)h->Data(); in jjSYSTEM()
490 ideal q = (ideal)h->next->CopyD(); in jjSYSTEM()
1724 ideal arg1 = (ideal) h->Data(); in jjSYSTEM()
1740 ideal arg1 = (ideal) h->Data(); in jjSYSTEM()
1756 ideal arg1 = (ideal) h->Data(); in jjSYSTEM()
2326 ideal m=(ideal)h->Data(); in jjEXTENDED_SYSTEM()
2852 ideal G = (ideal) h->Data(); in jjEXTENDED_SYSTEM()
2881 ideal G = (ideal) h->Data(); in jjEXTENDED_SYSTEM()
2919 ideal G = (ideal) h->Data(); in jjEXTENDED_SYSTEM()
[all …]
/dports/cad/ghdl/ghdl-1.0.0/testsuite/vests/vhdl-ams/ashenden/compliant/subprograms/
H A Dtb_mixer.vhd38 v3 : entity work.v_sine(ideal)
47 v4 : entity work.v_sine(ideal)
56 v9 : entity work.v_sine(ideal)
65 v10 : entity work.v_sine(ideal)
74 R2 : entity work.resistor(ideal)
87 v14 : entity work.v_sine(ideal)
96 v15 : entity work.v_sine(ideal)
105 v16 : entity work.v_sine(ideal)
114 v17 : entity work.v_sine(ideal)
/dports/math/cocoalib/CoCoALib-0.99712/examples/
H A Dex-hilbert1.C36 ideal NewQueenMovesFrom(SparsePolyRing P, long Csb, long sq1, long sq2) in NewQueenMovesFrom()
48 return ideal(P, g); in NewQueenMovesFrom()
52 ideal NewQueenIdeal(SparsePolyRing P, long Csb) in NewQueenIdeal()
54 ideal I = ideal(zero(P)); in NewQueenIdeal()
75 ideal I = ideal(x[1], x[2], x[3]); in program()
82 ideal Queen7 = NewQueenIdeal(CsbRing7, 7); in program()
94 ideal Queen8 = NewQueenIdeal(CsbRing, 8); in program()
/dports/math/giacxcas/CoCoALib-0.99700/examples/
H A Dex-hilbert1.C36 ideal NewQueenMovesFrom(SparsePolyRing P, long Csb, long sq1, long sq2) in NewQueenMovesFrom()
48 return ideal(P, g); in NewQueenMovesFrom()
52 ideal NewQueenIdeal(SparsePolyRing P, long Csb) in NewQueenIdeal()
54 ideal I = ideal(zero(P)); in NewQueenIdeal()
75 ideal I = ideal(x[1], x[2], x[3]); in program()
82 ideal Queen7 = NewQueenIdeal(CsbRing7, 7); in program()
94 ideal Queen8 = NewQueenIdeal(CsbRing, 8); in program()
/dports/math/gap/gap-4.11.0/pkg/hap-1.25/lib/HapPrime/
H A Dpolynomials.gi254 "for empty ideal",
256 function(ideal, order)
264 function(ideal, order)
286 ideal[i], ideal{Difference([1..len],[i])}, order);
291 ideal[i] := ideal[len];
301 ideal[i] := ideal[i] / LeadingCoefficientOfPolynomial(ideal[i], order);
304 return ideal;
480 ideal[i] := ideal[len];
491 # Tidy up the ideal
492 ideal := ReduceIdeal(ideal, MonomialLexOrdering());
[all …]
/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/spectrum/examples/
H A Dwscript4 obj = bld.create_ns3_program('adhoc-aloha-ideal-phy',
6 obj.source = 'adhoc-aloha-ideal-phy.cc'
8 obj = bld.create_ns3_program('adhoc-aloha-ideal-phy-matrix-propagation-loss-model',
10 obj.source = 'adhoc-aloha-ideal-phy-matrix-propagation-loss-model.cc'
12 obj = bld.create_ns3_program('adhoc-aloha-ideal-phy-with-microwave-oven',
14 obj.source = 'adhoc-aloha-ideal-phy-with-microwave-oven.cc'

1...<<11121314151617181920>>...394