/dports/math/fricas/fricas-1.3.7/src/input/ |
H A D | bezout.input | 18 testEquals("parts(subresultants(p, q)$T)", "[4, -2]") 21 testcase "subresultants" 34 testEquals("parts(subresultants(A,B)$T2)", "[res, 3*t^4*x+t^3-27*t+4]")
|
/dports/math/py-sympy/sympy-1.9/sympy/polys/tests/ |
H A D | test_subresultants_qq_zz.py | 1 from sympy import var, sturm, subresultants, prem, pquo 43 assert subresultants_sylv(p, q, x) == subresultants(p, q, x) 98 assert subresultants_bezout(p, q, x) == subresultants(p, q, x) 224 assert subresultants_pg(p, q, x) == subresultants(p, q, x) 240 assert subresultants_amv_q(p, q, x) == subresultants(p, q, x) 274 assert subresultants_amv(p, q, x) == subresultants(p, q, x) 306 assert subresultants_rem(p, q, x) == subresultants(p, q, x) 322 assert subresultants_vv(p, q, x) == subresultants(p, q, x) 338 assert subresultants_vv_2(p, q, x) == subresultants(p, q, x)
|
H A D | test_polytools.py | 14 subresultants, 1864 assert F.subresultants(G) == [F, G, H] 1865 assert subresultants(f, g) == [f, g, h] 1866 assert subresultants(f, g, x) == [f, g, h] 1867 assert subresultants(f, g, (x,)) == [f, g, h] 1868 assert subresultants(F, G) == [F, G, H] 1869 assert subresultants(f, g, polys=True) == [F, G, H] 1870 assert subresultants(F, G, polys=False) == [f, g, h] 1872 raises(ComputationFailed, lambda: subresultants(4, 2))
|
H A D | test_polyclasses.py | 217 assert f.subresultants(g) == [f, g, h]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Algebraic_kernel_d/ |
H A D | Curve_pair_analysis_2.h | 651 if(! this->ptr()->subresultants) { in subresultants() 655 return this->ptr()->subresultants.get(); in subresultants() 658 Polynomial_2& subresultants(size_type i) const { in subresultants() function 661 return subresultants()[i]; in subresultants() 791 Polynomial_2 sres = subresultants(k); in create_event_slice_at_rational() 1559 std::vector<Polynomial_2>& subresultants in compute_subresultants() local 1560 = this->ptr()->subresultants.get(); in compute_subresultants() 1565 if(CGAL::degree(subresultants[i]) < i) { in compute_subresultants() 1571 push_back(subresultants[i][i]); in compute_subresultants() 1575 if(CGAL::degree(subresultants[i]) < i-1) { in compute_subresultants() [all …]
|
/dports/math/z3/z3-z3-4.8.13/src/api/python/z3/ |
H A D | z3poly.py | 12 def subresultants(p, q, x): function
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/api/python/z3/ |
H A D | z3poly.py | 11 def subresultants(p, q, x): function
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/polys/ |
H A D | __init__.py | 6 exquo, half_gcdex, gcdex, invert, subresultants,
|
H A D | euclidtools.py | 279 h = ff.subresultants(fg)[-1] 296 h = F.subresultants(G)[-1] 305 h = f.subresultants(g)[-1]
|
H A D | polytools.py | 1443 def subresultants(self, other): 1458 result = F.subresultants(G) 2840 def subresultants(f, g, *gens, **args): 2858 result = F.subresultants(G)
|
/dports/math/fricas/fricas-1.3.7/src/algebra/ |
H A D | bezout.spad | 49 subresultants : (UP, UP) -> IndexedVector(UP, 0) 50 ++ subresultants(p, q) returns a vector of subresultants of p and q, 190 subresultants(p, q) ==
|
H A D | intrf.spad | 6 ++ This package computes the subresultants of two polynomials which is needed 43 -- this returns the chain of non null subresultants ! 44 -- we rebuild subresultants from this, using Fundamental PRS Theorem.
|
/dports/math/maxima/maxima-5.43.2/share/contrib/sarag/ |
H A D | aliases.mac | 24 /* The method chosen by default is the one with the subresultants */ 35 /* The method chosen by default is the one with the subresultants */
|
H A D | rootCounting.mac | 98 /* Part concerning the computation of signed subresultants */ 527 /* Part concerning signed subresultants coefficients */ 657 /* Cauchy Index in an interval computed by subresultants */ 664 /* Tarski Query by subresultants */ 671 /* Number of roots on an interval by signed subresultants */
|
/dports/math/fricas/fricas-1.3.7/pre-generated/src/algebra/ |
H A D | BEZOUT2.lsp | 70 '((|subresultants|
|
H A D | BEZOUT.lsp | 579 (215 . |subresultants|) (221 . |bezoutResultant|) 582 '#(|sylvesterMatrix| 249 |subresultants| 255 |subSylvesterMatrix| 600 '((|subresultants|
|
/dports/math/py-sympy/sympy-1.9/sympy/polys/ |
H A D | __init__.py | 67 invert, subresultants, resultant, discriminant, cofactors, gcd_list,
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/tests/polys/ |
H A D | test_euclidtools.py | 142 assert R(1).subresultants(R(0)) == [1] 154 assert f.subresultants(g) == [f, g, a, b, c, d] 162 assert f.subresultants(g) == [f, g, a] 170 assert f.subresultants(g) == [f, g, a] 233 assert R(1).subresultants(R(0)) == [1] 253 assert f.subresultants(g) == [f, g, a, b] 266 assert f.subresultants(g) == [f, g, a]
|
/dports/math/py-Diofant/Diofant-0.13.0/docs/internals/ |
H A D | polys.rst | 172 To see how subresultants are associated with remainder sequences 223 This construction of subresultants applies to any `j` between 227 The properties of subresultants are as follows. Let `n_0 = \deg(f)`, 270 The implication of this discovery is that the scalar subresultants 273 Completing the last step we obtain all non-zero scalar subresultants,
|
/dports/math/py-sympy/sympy-1.9/doc/src/modules/polys/ |
H A D | reference.rst | 36 .. autofunction:: subresultants
|
H A D | internals.rst | 421 To see how subresultants are associated with remainder sequences 472 This construction of subresultants applies to any `j` between 476 The properties of subresultants are as follows. Let `n_0 = \deg(f)`, 519 The implication of this discovery is that the scalar subresultants 522 Completing the last step we obtain all non-zero scalar subresultants,
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/ |
H A D | __init__.py | 50 subresultants, swinnerton_dyer_poly, symmetric_poly,
|
/dports/math/py-sympy/sympy-1.9/sympy/ |
H A D | __init__.py | 75 subresultants, resultant, discriminant, cofactors, gcd_list, gcd,
|
/dports/math/fricas/fricas-1.3.7/pre-generated/target/share/spadhelp/ |
H A D | RealClosure.help | 58 and subresultants methods usually work best. Beta versions of the
|
/dports/math/fricas/fricas-1.3.7/pre-generated/target/share/hypertex/pages/ |
H A D | RECLOS.ht | 72 quite slow for high degree polynomials and subresultants methods usually work
|