Home
last modified time | relevance | path

Searched refs:singularities (Results 1 – 25 of 480) sorted by relevance

12345678910>>...20

/dports/math/py-Diofant/Diofant-0.13.0/diofant/tests/calculus/
H A Dtest_singularities.py3 from diofant.calculus.singularities import singularities
10 assert singularities(1, x) == set()
11 assert singularities(x**2, x) == set()
12 assert singularities(x/(x**2 + 3*x + 2), x) == {-2, -1}
13 assert singularities(1/(1 + x), x) == {-1}
14 assert singularities(1/(1 + x)**2, x) == {-1}
15 assert singularities(sign(x), x) == {0}
19 assert singularities(exp(1/x), x) == {0}
20 assert singularities(log((x - 2)**2), x) == {2}
21 assert singularities(exp(1/x) + log(x + 1), x) == {-1, 0}
[all …]
/dports/math/py-sympy/sympy-1.9/sympy/calculus/tests/
H A Dtest_singularities.py2 from sympy.calculus.singularities import (
3 singularities,
17 assert singularities(x**2, x) == S.EmptySet
18 assert singularities(x/(x**2 + 3*x + 2), x) == FiniteSet(-2, -1)
19 assert singularities(1/(x**2 + 1), x) == FiniteSet(I, -I)
20 assert singularities(x/(x**3 + 1), x) == \
22 assert singularities(1/(y**2 + 2*I*y + 1), y) == \
26 assert singularities(1/(x**2 + 1), x) == S.EmptySet
27 assert singularities(exp(1/x), x, S.Reals) == FiniteSet(0)
28 assert singularities(exp(1/x), x, Interval(1, 2)) == S.EmptySet
[all …]
/dports/math/octave/octave-6.4.0/liboctave/numeric/
H A DQuad.h124 : Quad (fcn), lower_limit (0.0), upper_limit (1.0), singularities () { } in DefQuad()
127 : Quad (fcn), lower_limit (ll), upper_limit (ul), singularities () { } in DefQuad()
132 singularities (sing) { } in DefQuad()
136 singularities (sing) { } in DefQuad()
151 ColumnVector singularities; variable
189 : Quad (fcn), lower_limit (0.0), upper_limit (1.0), singularities () { } in FloatDefQuad()
192 : Quad (fcn), lower_limit (ll), upper_limit (ul), singularities () { } in FloatDefQuad()
197 singularities (sing) { } in FloatDefQuad()
201 singularities (sing) { } in FloatDefQuad()
216 FloatColumnVector singularities; variable
H A DQuad.cc99 F77_INT npts = octave::to_f77_int (singularities.numel () + 2); in do_integrate()
100 double *points = singularities.fortran_vec (); in do_integrate()
216 F77_INT npts = octave::to_f77_int (singularities.numel () + 2); in do_integrate()
217 float *points = singularities.fortran_vec (); in do_integrate()
/dports/math/py-Diofant/Diofant-0.13.0/diofant/calculus/
H A Dsingularities.py7 def singularities(f, x): function
43 guess = guess.union(*[singularities(a, x) for a in f.args])
48 guess |= singularities(log(f.base)*f.exp, x)
50 guess |= singularities(f.args[0], x)
H A Doptimization.py10 from .singularities import singularities
121 for s in singularities(f, x):
/dports/math/polymake/polymake-4.5/apps/fulton/rules/
H A Dcyclic_quotient_properties.rules33 …rsen: On the components and discriminant of the versal base space of cyclic quotient singularities.
35 # Jan Stevens: On the versal deformation of cyclic quotient singularities.
45 …rsen: On the components and discriminant of the versal base space of cyclic quotient singularities.
54 # Theo de Jong, Duco van Straten: Deformation theory of sandwiched singularities.
61 # Jan Stevens: On the versal deformation of cyclic quotient singularities.
68 # Jan Stevens: On the versal deformation of cyclic quotient singularities.
122 …rsen: On the components and discriminant of the versal base space of cyclic quotient singularities.
/dports/math/gap/gap-4.11.0/pkg/simpcomp/lib/
H A Dblowups.gd15 ## well as the resolution of isolated singularities of certain types of
16 ## combinatorial <M>4</M>-manifolds. As of today singularities where the
20 ## types of mapping cylinders to cover other types of singularities.<P/>
25 ## especially in the case of ordinary double points (singularities of type
/dports/math/py-sympy/sympy-1.9/sympy/calculus/
H A D__init__.py4 from .singularities import (singularities, is_increasing,
/dports/math/openturns/openturns-1.18/lib/src/Uncertainty/Distribution/
H A DMixture.cxx808 Point singularities(0); in getSingularities() local
813 singularities.add(distributionCollection_[i].getRange().getLowerBound()[0]); in getSingularities()
814 singularities.add(distributionCollection_[i].getSingularities()); in getSingularities()
815 singularities.add(distributionCollection_[i].getRange().getUpperBound()[0]); in getSingularities()
825 std::sort(singularities.begin(), singularities.end()); in getSingularities()
827 …singularities.erase(std::unique(singularities.begin(), singularities.end()) - 1, singularities.end… in getSingularities()
829 singularities.erase(singularities.begin(), singularities.begin() + 1); in getSingularities()
830 return singularities; in getSingularities()
H A DCompositeDistribution.cxx441 Point singularities(values_); in getSingularities() local
442 std::sort(singularities.begin(), singularities.end()); in getSingularities()
444 singularities.erase(0); in getSingularities()
445 singularities.erase(singularities.getSize() - 1); in getSingularities()
446 return singularities; in getSingularities()
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/src/
H A Dparametrizer-sing.cpp10 singularities.clear(); in ComputeOrientationSingularities()
26 singularities[f] = index_mod; in ComputeOrientationSingularities()
103 for (auto& f : singularities) { in AnalyzeValence()
132 for (auto& s : singularities) { in AnalyzeValence()
/dports/math/py-Diofant/Diofant-0.13.0/diofant/solvers/
H A Dinequalities.py550 singularities = solve(d, gen, check=False)
553 singularities = []
555 singularities.extend(solve(d, gen))
557 singularities = [s[gen] for s in singularities]
577 reals = _nsort(set(solns + singularities), separated=True)[0]
589 if x in singularities:
590 singularities.remove(x)
/dports/math/pari/pari-2.13.3/src/functions/sums/
H A DHEADER38 noncompact, and the integrand may have reasonable singularities at
40 of subintegrals where the function has no singularities except at the
42 neglecting these logs, singularities are assumed to be algebraic (asymptotic
/dports/math/reduce/Reduce-svn5758-src/packages/numeric/
H A Dnumint.red43 fluid '(!*noequiv accuracy!* singularities!*);
48 begin scalar e,vars,y,p,singularities!*,imode,r,protfg!*,
246 (if atom a then <<singularities!*:=v.singularities!*; 0>>
250 (if atom a then <<singularities!*:=v.singularities!*; 0>>
346 if singularities!* then
348 slo:=member(car lo,singularities!*);
349 smi:=member(car mi,singularities!*);
350 shi:=member(car hi,singularities!*);
352 if slo and smi and shi then rederr "too many singularities";
/dports/math/py-sympy/sympy-1.9/sympy/solvers/
H A Dinequalities.py577 singularities = []
579 singularities.extend(solvify(d, gen, domain))
589 critical_points = FiniteSet(*(solns + singularities + list(
620 if z not in singularities and valid(z) and z.is_extended_real:
629 if pt not in singularities and pt.is_extended_real and valid(pt):
639 for s in singularities:
666 if x in singularities:
667 singularities.remove(x)
/dports/math/scilab/scilab-6.1.1/scilab/modules/cacsd/macros/
H A Dcalfrq.sci121 // Locate singularities to avoid them
125 // selection function for singularities in the frequency range
132 // selection function for singularities in the frequency range
155 // singularities just on the left of the range
162 // singularities just on the right of the range
169 // check for nearly multiple singularities
/dports/cad/gmsh/gmsh-4.9.2-source/Mesh/
H A DgmshCrossFields.cpp667 if(g.singularities.size() == 1) { in createLagrangeMultipliers()
779 if(g.singularities.size() == 1) { in assembleLagrangeMultipliers()
1306 singularities.insert(v); in computeSingularities()
1345 _all.insert(singularities.begin(), singularities.end()); in cutGraph()
1415 singularities.find(it->first) == singularities.end()) { in cutGraph()
1583 singularities.find(v) != singularities.end()) { in groupBoundaries()
1621 singularities.find(v) == singularities.end()); in groupBoundaries()
2239 if(singularities.find(it->second) != singularities.end()) { in computeIsos()
2286 auto it = singularities.begin(); in computeIsos()
2480 else if(singularities.find(vv) != singularities.end()) { in createJumpyPairs()
[all …]
/dports/math/R-cran-lpSolve/lpSolve/src/
H A Dlp_LUSOL.c345 singularities = 0, in bfp_factorize() local
374 return( singularities ); in bfp_factorize()
394 singularities++; in bfp_factorize()
456 if(singularities >= dimsize) { in bfp_factorize()
467 lp->invB->num_singular += singularities; /* The total number of singular updates */ in bfp_factorize()
469 return( singularities ); in bfp_factorize()
/dports/misc/vxl/vxl-3.3.2/contrib/oxl/mvl/
H A DPMatrix.cxx299 if (svd()->singularities() > 1) { in get_focal()
301 << " Nullspace dimension is " << svd()->singularities() in get_focal()
314 if (svd()->singularities() > 1) { in get_focal_point()
316 << " Nullspace dimension is " << svd()->singularities() in get_focal_point()
/dports/cad/opencascade/opencascade-7.6.0/tests/bugs/modalg_5/
H A Dbug255786 # SIGSEGV in BRepSweep_Rotation in case of singularities
/dports/math/py-Diofant/Diofant-0.13.0/docs/modules/calculus/
H A Dindex.rst10 .. automodule:: diofant.calculus.singularities
/dports/cad/opencascade/opencascade-7.6.0/tests/bugs/moddata_3/
H A Dbug23943_36 # OCC fails to work with offset surfaces with singularities
H A Dbug23943_46 # OCC fails to work with offset surfaces with singularities
/dports/cad/opencascade/opencascade-7.6.0/tests/offset/simple/
H A Dbegin10 # default tolerance for detecting singularities

12345678910>>...20