/dports/math/gap/gap-4.11.0/pkg/polenta-1.3.9/lib/ |
H A D | jordan.gi | 20 ## Maybe later: Install a method for this. 163 pol := g_rec.poly; 186 ## from the same radical series. 187 ## Attach to G the radical series all other meta information that you
|
/dports/math/gap/gap-4.11.0/pkg/forms/doc/ |
H A D | forms.tex | 254 !gapprompt@gap>| !gapinput@poly := r.1^2 + r.2 * r.3;| 798 !gapprompt@gap>| !gapinput@poly := r.1*r.2+r.3*r.4;| 1233 !gapprompt@gap>| !gapinput@poly := r.1^2 + r.2^2 + r.3^2;| 1241 !gapprompt@gap>| !gapinput@poly := Z(3)^2*r.1^2+r.2^2+r.3*r.4;| 1385 !gapprompt@gap>| !gapinput@poly := -r.1*r.2+Z(3^2)*r.3^2+r.4^2;| 1430 !gapprompt@gap>| !gapinput@poly := r.1*r.5-r.2*r.6+r.3*r.4;| 1847 the radical of the associated bilinear form is non-trivial. Note that 1914 The radical of the form \mbox{\texttt{\mdseries\slshape f}} 1929 !gapprompt@gap>| !gapinput@poly := r.1^2 + r.2 * r.3;| 2440 and the dimension of the radical. [all …]
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/polys/ |
H A D | polytools.py | 3345 if method == 'sqf': 3348 rep = poly.rep 3353 rep = poly.rep 3397 func = getattr(poly, method + '_list') 3423 if method == 'sqf': 3838 f = factor_terms(f, radical=True) 3917 poly = dict(poly.set_domain(opt.domain).rep) 4012 G = _groebner(polys, ring, method=opt.method) 4032 return [poly.as_expr() for poly in self._basis] 4159 poly = dict(poly.set_domain(opt.domain).rep) [all …]
|
/dports/math/py-sympy/sympy-1.9/sympy/polys/ |
H A D | polytools.py | 5918 def _sorted_factors(factors, method): argument 5920 if method == 'sqf': 5965 func = getattr(poly, method + '_list') 5990 if method == 'sqf': 5997 def _symbolic_factor(expr, opt, method): argument 6039 fp = _sorted_factors(fp, method) 6040 fq = _sorted_factors(fq, method) 6682 f = factor_terms(f, radical=True) 6893 polys = [ring.from_dict(poly.rep.to_dict()) for poly in polys if poly] 6895 G = _groebner(polys, ring, method=opt.method) [all …]
|
/dports/math/curv/curv-0.5/issues/ |
H A D | Reactive_If | 30 curv> poly = parametric n :: int_slider(3,12) = 5 in regular_polygon n 31 curv> poly 43 1| poly = parametric n :: int_slider(3,12) = 5 in regular_polygon n 56 The if phrase is being executed using If_Else_Op::exec(), and this method 96 This is a radical change.
|
/dports/math/polymake/polymake-4.5/demo/ |
H A D | apps_fulton.ipynb | 397 "polymake has a method to reconstruct a polytope from a regular fan / projective toric variety." 693 "$radical = $toric->RADICAL;\n", 694 "print join(\"\\n\", @{$radical->GENERATORS});" 772 … possible to retrieve the following datatypes from Singular: `int`, `intmat`, `intvec` and `poly`." 781 "singular_eval(\"poly p = x_2^2-x_0*x_1\");\n",
|
/dports/math/py-sympy/sympy-1.9/sympy/solvers/ |
H A D | solvers.py | 1447 poly = None 1474 if poly is None: 1476 if poly is None: 1790 if poly is not None: 1791 polys.append(poly) 2458 def det_quick(M, method=None): argument 2477 return M.det(method=method) if method else M.det() 3298 eq = powdenest(factor_terms(eq, radical=True, clear=True)) 3306 poly = eq.as_poly() 3312 poly = eq.as_poly(*gens) [all …]
|
/dports/textproc/texi2html/texi2html-5.0/test/singular_manual/d2t_singular/ |
H A D | presolve_lib.tex | 35 * idealSplit:: intersection of the ideals has the same radical as id 329 findvars(id [,any] ); id=poly/ideal/vector/module/matrix, any=any type 384 hilbvec(id[,c,o]); id=poly/ideal/vector/module/matrix, c,o=strings,@* 450 tolessvars(id [,s1,s2] ); id poly/ideal/vector/module/matrix, 527 see proc @code{gauss_row} from 'matrix.lib' for a different method 576 id=poly/ideal/vector/module,@* 650 id=poly/ideal/vector/module,@* 771 id=poly/ideal/vector/module,@* 898 @*has the same radical as id
|
/dports/math/py-Diofant/Diofant-0.13.0/docs/release/ |
H A D | notes-0.9.rst | 49 * Removed ``get_domain()`` method of :class:`~diofant.polys.polytools.Poly`, use :attr:`~diofant.po… 51 * Removed ``as_content_primitive()`` method of :class:`~diofant.core.basic.Basic`, see :pull:`529`. 57 * Make ``matches()`` method for :class:`~diofant.core.basic.Basic` - private, see :pull:`557`. 84 * Correct implementation of the trial method (uses Gröbner bases) in :func:`~diofant.polys.numberfi… 141 * :sympyissue:`8710` geometry's encloses method fails for non-polygons 159 * :sympyissue:`12345` nonlinsolve (solve_biquadratic) gives no solution with radical 163 * :sympyissue:`12400` polytool.poly() can't raise polynomial to negative power? 165 * :sympyissue:`12522` BooleanTrue and Boolean False should have simplify method 235 * :sympyissue:`10829` subs method gives wrong result for powers
|
/dports/textproc/texi2html/texi2html-5.0/test/singular_manual/ |
H A D | reference.tex | 1972 i.e., the radical of the intersection coincides with the radical of the input 1974 In many (but not all!) cases this is already a decomposition of the radical 4695 @cindex resolution, La Scala's method 5781 the second module on (by the standard basis method). 6141 weighted sugar method. 6983 If a 3rd argument 'n' is given the n-th method is used 7535 a heuristically chosen method. 7548 @code{lres} (La'Scala's method), see @ref{lres}. 7551 @code{sres} (Schreyer's method), see @ref{sres}. 7554 @code{mres} (classical method), see @ref{mres}. [all …]
|
H A D | examples.tex | 312 proc mil (poly g) 930 poly h1; 1577 chosen method. 1585 method. The input needs to be homogeneous. 1591 method. 1597 method. The input has to be a standard basis. 1603 method. 2587 // Use the second method, 2875 // the radical. We use the Characteristic set methods 2916 radical(J); [all …]
|
H A D | general.tex | 2320 Algorithm, i.e., their intersection has the same radical as the original ideal. It need not 2334 method. 2408 chosen method. 2414 method. The input needs to be homogeneous. 2418 method. 2422 method. The input has to be a standard basis. 2426 method. 2957 @code{poly}, 3112 number(poly(3)); 3304 @expansion{} poly [all …]
|
/dports/math/py-sympy/sympy-1.9/doc/src/modules/solvers/ |
H A D | solveset.rst | 311 * After the invert, the equations are checked for radical or Abs (Modulus), 312 then the method ``_solve_radical`` tries to simplify the radical, by 318 * If none of the above method is successful, then methods of polynomial is 321 - The method to solve the rational function, ``_solve_as_rational``, is 322 called. Based on the domain, the respective poly solver 326 - The underlying method ``_solve_as_poly`` solves the equation using 395 Consider the equation `|x| = n`. A naive method to solve this equation
|
/dports/math/gap/gap-4.11.0/pkg/forms/lib/ |
H A D | forms.gi | 287 if IsZero(poly) then 328 if IsZero(poly) then 613 ## This method finds the polynomial associated to 622 return poly; 628 ## This method finds the polynomial associated to 638 return poly; 644 ## This method finds the polynomial associated to 659 return poly; 2972 # t just a natural number! Bugfix: look at the method for \^ 3239 # Let <f> be a form on V(n,q), with radical R, a k-dimensional subspace [all …]
|
/dports/math/maxima/maxima-5.43.2/tests/ |
H A D | rtestint.mac | 383 * Tests parse-integrand, method-by-limits, dintegrate, 384 * method-radical-poly, intsubs. 407 * Tests method-by-limits, dintegrate, method-radical-poly, intsubs. 572 /* Tests method-by-limits, zto1, batap-inf */ 592 /* Tests method-by-limits, zto1, batap-inf */ 600 /* Tests method-by-limits, zto1, batap-inf */ 611 /* Tests method-by-limits, dintlog */ 640 /* Tests method-by-limits, dintlog, dintbypart, ztoinf, batapp */ 657 /* Tests dintegrate, method-by-limits, method-radical-poly */
|
/dports/math/maxima/maxima-5.43.2/share/algebra/charsets/ |
H A D | charsets-orig.mac | 31 /* of polynomial equations. It is based on the method of charac- # */ 564 /* the index set of a poly (or a poly set f) wrt ord */ 588 /* the initial of poly p wrt ord */ 921 /* the basic set of poly set ps */ 945 /* the char set of poly set ps */ 1542 /* the char series of poly set ps */ 1761 /* using new factorization method if m=1, Hu-Wang's method if m=-1 */ 2391 /* -- a new method of Wang */ 3073 /* -- Hu-Wang's method */ 3641 /* radical ideal membership test - is zero(ps/g) empty? */ [all …]
|
H A D | charsets.mac | 31 /* of polynomial equations. It is based on the method of charac- # */ 576 /* the index set of a poly (or a poly set f) wrt ord */ 600 /* the initial of poly p wrt ord */ 933 /* the basic set of poly set ps */ 957 /* the char set of poly set ps */ 1548 /* the char series of poly set ps */ 1767 /* using new factorization method if m=1, Hu-Wang's method if m=-1 */ 2406 /* -- a new method of Wang */ 3074 /* -- Hu-Wang's method */ 3645 /* radical ideal membership test - is zero(ps/g) empty? */ [all …]
|
H A D | charsets.maple | 35 # of polynomial equations. It is based on the method of charac- # 650 # the index set of a poly (or a poly set f) wrt ord 673 # the initial of poly p wrt ord 1018 # the basic set of poly set ps 1080 # the char set of poly set ps 1733 # the char series of poly set ps 1981 # using new factorization method if m=1, Hu-Wang's method if m=-1 2771 # -- a new method of Wang 3561 # -- Hu-Wang's method 4211 # radical ideal membership test - is zero(ps/g) empty? [all …]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/packages/ |
H A D | EdgeIdeals.cpkg5 | 157 PD := [radical(I) | I In FrbPrimaryDecomposition(CoverI)]; 237 -- each vertex poly vanishes as X, so G(X) = 0. Contradiction! 396 -- getCliques = method(); 423 -- getEdge = method(); 644 -- isEdge = method(); 658 -- isForest = method(); 691 -- isGraph = method(); 702 -- isLeaf = method(); 737 -- isPerfect = method(); 786 -- lineGraph = method(); [all …]
|
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/packages/ |
H A D | EdgeIdeals.cpkg5 | 157 PD := [radical(I) | I In FrbPrimaryDecomposition(CoverI)]; 237 -- each vertex poly vanishes as X, so G(X) = 0. Contradiction! 396 -- getCliques = method(); 423 -- getEdge = method(); 644 -- isEdge = method(); 658 -- isForest = method(); 691 -- isGraph = method(); 702 -- isLeaf = method(); 737 -- isPerfect = method(); 786 -- lineGraph = method(); [all …]
|
/dports/math/py-mathics/Mathics3-2.2.0/mathics/packages/DiscreteMath/ |
H A D | RSolve.m | 366 method, rsolvec, if, sf, methods, 386 {method, rsolvec, if, sf} = 389 methods = Switch[method, 425 RSolve::method = 704 poly = (Head[General::poly] === $Off); variable 712 If[!poly, On[General::poly]]; 1990 (* numerator is a radical of a polynomial in z *) 1992 (* numerator is NOT a radical of a polynomial in z *) 2011 ] (* num is a radical of a polynomial in z *) 3848 poly[x]. [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/geometry/ |
H A D | old-geometry.tex | 68 The method is not automatic, since one often needs a good feeling how 77 who proved 512 geometry theorems with this mechanized method, see also 654 \[{\tt poly:= }\ p^4\,r^4 - 2\,p^2\,q^2\,r^2\,s^2 - 763 where $rad\ I(F)$ is the radical of the ideal generated by $F$. Even 903 belongs to the radical of the ideal $I$ in this special extension of 1257 poly:=p4\_circle(A,B,C,P);\\[6pt] 1262 $poly$ that the given points are on a common circle. $con$ is a 1264 \formel{poly\cdot {\rm collinear}(A,B,C)^2. }
|
/dports/graphics/dataplot/dataplot-2c1b27601a3b7523449de612613eadeead9a8f70/lib/help/ |
H A D | dpdicf.tex | 237 BRAD() CH/SY Write/draw larger radical 299 CHEB0(X) FUNC Compute Chebychev poly 1st kind & ord 0 300 CHEB1(X) FUNC Compute Chebychev poly 1st kind & ord 1 302 CHEB2(X) FUNC Compute Chebychev poly 1st kind & ord 2 303 CHEB3(X) FUNC Compute Chebychev poly 1st kind & ord 3 304 CHEB4(X) FUNC Compute Chebychev poly 1st kind & ord 4 305 CHEB5(X) FUNC Compute Chebychev poly 1st kind & ord 5 306 CHEB6(X) FUNC Compute Chebychev poly 1st kind & ord 6 476 DEHAAN AN-CO Generalized Pareto estimation using DeHaan method 651 EMBED PC-CO Alternative method for generating multiplot plots per page [all …]
|
H A D | dpdirf.tex | 491 DEHAAN AN-CO Generalized Pareto estimation using DeHaan method 655 EMBED PC-CO Alternative method for generating multiplot plots per page 1493 CHEB0(X) FUNC Compute Chebychev poly 1st kind and order 0 1494 CHEB1(X) FUNC Compute Chebychev poly 1st kind and order 1 1495 CHEB2(X) FUNC Compute Chebychev poly 1st kind and order 2 1496 CHEB3(X) FUNC Compute Chebychev poly 1st kind and order 3 1497 CHEB4(X) FUNC Compute Chebychev poly 1st kind and order 4 1498 CHEB5(X) FUNC Compute Chebychev poly 1st kind and order 5 1499 CHEB6(X) FUNC Compute Chebychev poly 1st kind and order 6 1582 BRAD() CH/SY Write/draw larger radical [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/alg/ |
H A D | simp.red | 800 % ******* The "radical simplifier" section ****** 803 % Simplifies radical expressions. 892 form) and radical part (a list of prefix expressions). The whole 937 x := quotf(u,comfac!-to!-poly y); % We need *exp on here. 1366 % method as sub-branch. 1396 x := comfac!-to!-poly comfac u;
|