Home
last modified time | relevance | path

Searched refs:rterms (Results 1 – 8 of 8) sorted by relevance

/dports/math/py-Diofant/Diofant-0.13.0/diofant/simplify/
H A Dsqrtdenest.py780 rterms = {(): []}
790 rterms = [Add(*v) for v in rterms.values()]
794 rterms = list(reversed(list(ordered(rterms))))
799 if len(rterms) == 1 and not (rterms[0].is_Add and lcm > 2):
803 if len(rterms) == 1 and rterms[0].is_Add:
804 rterms = list(rterms[0].args)
828 eq = rterms[0]**lcm - (-rterms[1])**lcm
882 rterms.append(rterms.pop(0))
885 rterms.append(rterms.pop(1))
889 rterms[0], rterms[1] = rterms[1], rterms[0]
[all …]
H A Dradsimp.py667 def _num(rterms):
671 if len(rterms) == 2:
675 if len(rterms) == 3:
680 elif len(rterms) == 4:
688 elif len(rterms) == 1:
689 return sqrt(rterms[0][0])
777 rterms = [(Mul(*i), Add(*j)) for i, j in rterms]
778 nrad = len(rterms) - (1 if rterms[0][0] == 1 else 0)
789 if len(rterms) > 4:
795 [sqrt(x)*y for x, y in rterms]))
[all …]
/dports/math/py-sympy/sympy-1.9/sympy/simplify/
H A Dradsimp.py829 def _num(rterms): argument
833 if len(rterms) == 2:
837 if len(rterms) == 3:
842 elif len(rterms) == 4:
850 elif len(rterms) == 1:
851 return sqrt(rterms[0][0])
939 rterms = [(Mul(*i), Add(*j)) for i, j in rterms]
940 nrad = len(rterms) - (1 if rterms[0][0] is S.One else 0)
951 if len(rterms) > 4:
957 [sqrt(x)*y for x, y in rterms]))
[all …]
/dports/math/py-sympy/sympy-1.9/sympy/solvers/
H A Dsolvers.py3355 rterms = [Add(*rterms[k]) for k in rterms.keys()]
3359 rterms = list(reversed(list(ordered(rterms))))
3364 if len(rterms) == 1 and not (rterms[0].is_Add and lcm > 2):
3368 if len(rterms) == 1 and rterms[0].is_Add:
3369 rterms = list(rterms[0].args)
3389 eq = rterms[0]**lcm - (-rterms[1])**lcm
3445 rterms.append(rterms.pop(0))
3448 rterms.append(rterms.pop(1))
3452 rterms[0], rterms[1] = rterms[1], rterms[0]
3454 eq = rterms[0]**3 + (rterms[1] + rterms[2] + others)**3
[all …]
/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/
H A Drelevant_domain.cpp56 std::map< Node, Node > rterms; in removeRedundantTerms() local
62 if( rterms.find( r )==rterms.end() ){ in removeRedundantTerms()
63 rterms[r] = d_terms[i]; in removeRedundantTerms()
67 for( std::map< Node, Node >::iterator it = rterms.begin(); it != rterms.end(); ++it ){ in removeRedundantTerms()
/dports/math/abella/abella-2.0.7/src/
H A Dtactics.ml418 let rterms = t1 :: t2 :: (extract_terms_from_cpairs cpairs) in
422 if terms_contain_tyvar rterms then
428 let rterms = t1 :: t2 :: (extract_terms_from_cpairs cpairs) in
432 if terms_contain_tyvar rterms then
/dports/science/fastcap/fastcap-2.0wr/src/
H A Dcalcp.c728 int m, n, r, halfn, flrm, ceilm, numterms, rterms; local
/dports/math/giacxcas/giac-1.6.0/src/
H A Dsignalprocessing.cc1070 vecteur rterms=analyze_terms(_cpartfrac(makesequence(v[3],x),contextptr),x,contextptr); in fourier_terms() local
1071 for (const_iterateur it=rterms.begin();it!=rterms.end();++it) { in fourier_terms()