Home
last modified time | relevance | path

Searched refs:degree (Results 1 – 25 of 7714) sorted by relevance

12345678910>>...309

/dports/math/openturns/openturns-1.18/python/test/
H A Dt_LinearModelStepwiseAlgorithm_std.expout4 …degree=0,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFunction de…
9 …Function degree=0,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFu…
10 …Function degree=0,class=MonomialFunction degree=1,class=MonomialFunction degree=0,class=MonomialFu…
11 …Function degree=0,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFu…
33 …degree=0,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFunction de…
38 …Function degree=0,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFu…
39 …Function degree=1,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFu…
64 …degree=0,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFunction de…
93 …degree=0,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFunction de…
122 …degree=0,class=MonomialFunction degree=0,class=MonomialFunction degree=0,class=MonomialFunction de…
[all …]
/dports/science/PETSc/petsc-3.14.1/src/dm/dt/tests/output/
H A Dex1_1.out2 degree 1 at 0: B= 0 D= 1 D2= 0
3 degree 2 at 0: B= -0.5 D= 0 D2= 3
4 degree 3 at 0: B= 0 D= -1.5 D2= 0
5 degree 4 at 0: B= 0.375 D= 0 D2= -7.5
6 degree 5 at 0: B= 0 D= 1.875 D2= 0
7 degree 1 at 0.2: B= 0.2 D= 1 D2= 0
8 degree 2 at 0.2: B= -0.44 D= 0.6 D2= 3
9 degree 3 at 0.2: B= -0.28 D= -1.2 D2= 3
10 degree 4 at 0.2: B= 0.232 D= -1.36 D2= -5.4
11 degree 5 at 0.2: B= 0.3075 D= 0.888 D2= -9.24
[all …]
/dports/math/giacxcas/CoCoALib-0.99700/include/CoCoA/
H A Ddegree.H42 class degree
62 degree operator+(const degree& d1, const degree& d2); ///< Computes d1+d2
63 degree operator-(const degree& d1, const degree& d2); ///< Computes d1-d2
64 …degree top(const degree& d1, const degree& d2); ///< i-th compt is max(d1[i], d…
73 inline degree::degree(long dim): in degree() function
85 inline int FastCmp(const degree& d1, const degree& d2) in FastCmp()
93 inline bool operator<(const degree& d1, const degree& d2)
99 inline bool operator<=(const degree& d1, const degree& d2)
105 inline bool operator>(const degree& d1, const degree& d2)
111 inline bool operator>=(const degree& d1, const degree& d2)
[all …]
/dports/math/cocoalib/CoCoALib-0.99712/include/CoCoA/
H A Ddegree.H42 class degree
62 degree operator+(const degree& d1, const degree& d2); ///< Computes d1+d2
63 degree operator-(const degree& d1, const degree& d2); ///< Computes d1-d2
64 …degree top(const degree& d1, const degree& d2); ///< i-th compt is max(d1[i], d…
73 inline degree::degree(long dim): in degree() function
85 inline int FastCmp(const degree& d1, const degree& d2) in FastCmp()
93 inline bool operator<(const degree& d1, const degree& d2)
99 inline bool operator<=(const degree& d1, const degree& d2)
105 inline bool operator>(const degree& d1, const degree& d2)
111 inline bool operator>=(const degree& d1, const degree& d2)
[all …]
/dports/graphics/proj/proj-7.2.1/datum/
H A DDK_bornholm.pol39 # Poly NORTH :: e-degree = 0 : n-degree = 6
43 # Poly NORTH :: e-degree = 1 : n-degree = 5
46 # Poly NORTH :: e-degree = 2 : n-degree = 4
49 # Poly NORTH :: e-degree = 3 : n-degree = 3
52 # Poly NORTH :: e-degree = 4 : n-degree = 2
54 # Poly NORTH :: e-degree = 5 : n-degree = 1
56 # Poly NORTH :: e-degree = 6 : n-degree = 0
61 # Poly EAST :: n-degree = 0 : e-degree = 6
65 # Poly EAST :: n-degree = 1 : e-degree = 5
68 # Poly EAST :: n-degree = 2 : e-degree = 4
[all …]
H A DFO_fk89.pol33 # Poly NORTH :: e-degree = 0 : n-degree = 10
39 # Poly NORTH :: e-degree = 1 : n-degree = 9
45 # Poly NORTH :: e-degree = 2 : n-degree = 8
50 # Poly NORTH :: e-degree = 3 : n-degree = 7
55 # Poly NORTH :: e-degree = 4 : n-degree = 6
60 # Poly NORTH :: e-degree = 5 : n-degree = 5
64 # Poly NORTH :: e-degree = 6 : n-degree = 4
68 # Poly NORTH :: e-degree = 7 : n-degree = 3
72 # Poly NORTH :: e-degree = 8 : n-degree = 2
75 # Poly NORTH :: e-degree = 9 : n-degree = 1
[all …]
H A DDK_general.pol32 #Poly NORTH :: e-degree = 0 : n-degree = 15
39 #Poly NORTH :: e-degree = 1 : n-degree = 14
45 #Poly NORTH :: e-degree = 2 : n-degree = 13
51 #Poly NORTH :: e-degree = 3 : n-degree = 12
57 #Poly NORTH :: e-degree = 4 : n-degree = 11
62 #Poly NORTH :: e-degree = 5 : n-degree = 10
67 #Poly NORTH :: e-degree = 6 : n-degree = 9
72 #Poly NORTH :: e-degree = 7 : n-degree = 8
76 #Poly NORTH :: e-degree = 8 : n-degree = 7
80 #Poly NORTH :: e-degree = 9 : n-degree = 6
[all …]
H A DDK_jutland.pol41 # Poly NORTH :: e-degree = 0 : n-degree = 13
48 # Poly NORTH :: e-degree = 1 : n-degree = 12
55 # Poly NORTH :: e-degree = 2 : n-degree = 11
61 # Poly NORTH :: e-degree = 3 : n-degree = 10
67 # Poly NORTH :: e-degree = 4 : n-degree = 9
73 # Poly NORTH :: e-degree = 5 : n-degree = 8
78 # Poly NORTH :: e-degree = 6 : n-degree = 7
83 # Poly NORTH :: e-degree = 7 : n-degree = 6
88 # Poly NORTH :: e-degree = 8 : n-degree = 5
92 # Poly NORTH :: e-degree = 9 : n-degree = 4
[all …]
H A DDK_zealand.pol35 # Poly NORTH :: e-degree = 0 : n-degree = 9
41 # Poly NORTH :: e-degree = 1 : n-degree = 8
46 # Poly NORTH :: e-degree = 2 : n-degree = 7
51 # Poly NORTH :: e-degree = 3 : n-degree = 6
56 # Poly NORTH :: e-degree = 4 : n-degree = 5
60 # Poly NORTH :: e-degree = 5 : n-degree = 4
64 # Poly NORTH :: e-degree = 6 : n-degree = 3
68 # Poly NORTH :: e-degree = 7 : n-degree = 2
71 # Poly NORTH :: e-degree = 8 : n-degree = 1
74 # Poly NORTH :: e-degree = 9 : n-degree = 0
[all …]
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/fe/
H A Dfe_q_hierarchical.cc67 FiniteElementData<dim>(get_dpo_vector(degree), 1, degree) in FE_Q_Hierarchical()
71 FiniteElementData<dim>(get_dpo_vector(degree), 1, degree) in FE_Q_Hierarchical()
365 if (this->degree < fe_hierarchical_other->degree) in compare_for_domination()
367 else if (this->degree == fe_hierarchical_other->degree) in compare_for_domination()
824 unsigned int n = this->degree + 1; in initialize_generalized_support_points()
826 n *= this->degree + 1; in initialize_generalized_support_points()
1925 n *= this->degree + 1; in initialize_generalized_face_support_points()
2165 const unsigned int degree) in face_fe_q_hierarchical_to_hierarchic_numbering() argument
2168 FE_Q_Hierarchical<dim - 1>::get_dpo_vector(degree), 1, degree); in face_fe_q_hierarchical_to_hierarchic_numbering()
2380 face * (this->degree - 1) * (this->degree - 1) + in get_embedding_dofs()
[all …]
H A Dfe_nedelec.cc160 for (unsigned int j = this->degree; j < 2 * this->degree; in FE_Nedelec()
996 i + (this->degree - 1 + j) * this->degree + in initialize_restriction()
2059 dpo[2] = 2 * degree * (degree + 1); in get_dpo_vector()
2062 dpo[3] = 3 * degree * degree * (degree + 1); in get_dpo_vector()
2333 if (this->degree < fe_nedelec_other->degree) in compare_for_domination()
2335 else if (this->degree == fe_nedelec_other->degree) in compare_for_domination()
2391 i < std::min(fe_nedelec_other->degree, this->degree); in hp_line_dof_identities()
3283 system_matrix.reinit((this->degree - 1) * this->degree, in convert_generalized_support_point_values_to_dof_values()
3284 (this->degree - 1) * this->degree); in convert_generalized_support_point_values_to_dof_values()
3561 system_matrix.reinit((this->degree - 1) * this->degree, in convert_generalized_support_point_values_to_dof_values()
[all …]
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/
H A Ddegree.C36 inline void degree::CheckCompatible(const degree& d1, const degree& d2, const char* fn) in CheckCompatible()
65 degree& degree::operator+=(const degree& d)
75 degree& degree::operator-=(const degree& d)
85 bool IsZero(const degree& d) in IsZero()
95 degree operator+(const degree& d1, const degree& d2)
99 degree ans(dim);
106 degree operator-(const degree& d1, const degree& d2)
110 degree ans(dim);
117 degree top(const degree& d1, const degree& d2) in top()
121 degree ans(dim); in top()
[all …]
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/
H A Ddegree.C36 inline void degree::CheckCompatible(const degree& d1, const degree& d2, const char* fn) in CheckCompatible()
65 degree& degree::operator+=(const degree& d)
75 degree& degree::operator-=(const degree& d)
85 bool IsZero(const degree& d) in IsZero()
95 degree operator+(const degree& d1, const degree& d2)
99 degree ans(dim);
106 degree operator-(const degree& d1, const degree& d2)
110 degree ans(dim);
117 degree top(const degree& d1, const degree& d2) in top()
121 degree ans(dim); in top()
[all …]
/dports/security/nflib/NFLlib-1.0.0-23-g5cf40ed/include/nfl/
H A Dpermut.hpp18 struct r_loop<degree, degree, R, I> {
30 struct r_set<I, degree, degree> {
55 template <size_t degree>
59 idx_type data_[degree];
78 assert(i < degree); in operator ()()
86 template <size_t degree>
96 template <size_t degree>
110 template <size_t degree>
111 permut_compute<degree> permut<degree,false>::P;
115 template <size_t degree>
[all …]
/dports/games/dhewm3/dhewm3-1.5.1/neo/idlib/math/
H A DPolynomial.h203 if ( degree > p.degree ) {
211 n.degree = degree;
212 } else if ( p.degree > degree ) {
220 n.degree = p.degree;
238 if ( degree > p.degree ) {
246 n.degree = degree;
255 n.degree = p.degree;
299 if ( degree > p.degree ) {
325 if ( degree > p.degree ) {
371 if ( degree != p.degree ) { in Compare()
[all …]
/dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/finiteElements/integration/
H A DQuadrature.cpp65 q->degree = degree; in clone()
77 degree = 1; in centroidRule()
156 if(q->degree % 2 == 0) { q->noEvenDegreeRule(); q->degree += 1; } in segmentQuadrature()
161 if(q->degree % 2 == 0) { q->noEvenDegreeRule(); q->degree += 1; } in segmentQuadrature()
194 if(q->degree % 2 == 0) { q->noEvenDegreeRule(); q->degree += 1; } in segmentQuadrature()
243 if(q->degree % 2 == 0) { q->noEvenDegreeRule(); q->degree += 1; } in triangleQuadrature()
255 if(q->degree % 2 == 0) { q->noEvenDegreeRule(); q->degree += 1; } in triangleQuadrature()
323 if(q->degree % 2 == 0) { q->noEvenDegreeRule(); q->degree += 1; } in quadrangleQuadrature()
379 if(q->degree % 2 == 0) { q->noEvenDegreeRule(); q->degree += 1; } in quadrangleQuadrature()
428 if(q->degree % 2 == 0) { q->noEvenDegreeRule(); q->degree += 1; } in tetrahedronQuadrature()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/teuchos/numerics/test/Polynomial/
H A DPolynomial_UnitTest.cpp60 for (unsigned int degree=0 ; degree<10 ; ++degree) { in TEUCHOS_UNIT_TEST() local
62 TEST_EQUALITY_CONST( P.degree(), degree ); in TEUCHOS_UNIT_TEST()
67 unsigned int degree = 10; in TEUCHOS_UNIT_TEST() local
78 unsigned int degree = 10; in TEUCHOS_UNIT_TEST() local
90 int degree = 10; in TEUCHOS_UNIT_TEST() local
106 int degree = 2; in TEUCHOS_UNIT_TEST() local
134 unsigned int degree = 2; in TEUCHOS_UNIT_TEST() local
140 unsigned int degree = 2; in TEUCHOS_UNIT_TEST() local
146 unsigned int degree = 2; in TEUCHOS_UNIT_TEST() local
153 unsigned int degree = 2; in TEUCHOS_UNIT_TEST() local
[all …]
/dports/devel/tcllib/tcllib-1.20/modules/struct/graph/tests/node/
H A Ddegree.test2 # Graph tests - node degree
7 # Syntax: graph node degree ?-in|-out? NODE
12 test graph-${impl}-${setimpl}-node-degree-1.0 {node degree, wrong#args, missing} {
14 catch {mygraph node degree} msg
19 test graph-${impl}-${setimpl}-node-degree-1.1 {node degree, wrong#args, too many} {
21 catch {mygraph node degree foo bar baz} msg
29 test graph-${impl}-${setimpl}-node-degree-2.0 {node degree, missing node} {
31 catch {mygraph node degree node0} msg
36 test graph-${impl}-${setimpl}-node-degree-2.1 {node degree, bad switch} {
38 catch {mygraph node degree -foo node0} msg
[all …]
/dports/devel/tcllibc/tcllib-1.20/modules/struct/graph/tests/node/
H A Ddegree.test2 # Graph tests - node degree
7 # Syntax: graph node degree ?-in|-out? NODE
12 test graph-${impl}-${setimpl}-node-degree-1.0 {node degree, wrong#args, missing} {
14 catch {mygraph node degree} msg
19 test graph-${impl}-${setimpl}-node-degree-1.1 {node degree, wrong#args, too many} {
21 catch {mygraph node degree foo bar baz} msg
29 test graph-${impl}-${setimpl}-node-degree-2.0 {node degree, missing node} {
31 catch {mygraph node degree node0} msg
36 test graph-${impl}-${setimpl}-node-degree-2.1 {node degree, bad switch} {
38 catch {mygraph node degree -foo node0} msg
[all …]
/dports/graphics/rawtherapee/rawtherapee-5.8/rtgui/
H A Drotate.cc43 pack_start (*degree); in Rotate()
52 degree->setLogScale(2, 0); in Rotate()
63 degree->setEditedState (pedited->rotate.degree ? Edited : UnEdited); in read()
66 degree->setValue (pp->rotate.degree); in read()
74 pp->rotate.degree = degree->getValue (); in write()
77 pedited->rotate.degree = degree->getEditedState (); in write()
84 degree->setDefault (defParams->rotate.degree); in setDefaults()
87 degree->setDefaultEditedState (pedited->rotate.degree ? Edited : UnEdited); in setDefaults()
103 degree->setValue (degree->getValue() + deg); in straighten()
123 degree->showEditedCB (); in setBatchMode()
[all …]
/dports/graphics/py-geomdl/geomdl-5.2.10/geomdl/
H A Dhelpers.py49 low = degree
277 N = [[None for _ in range(degree + 1)] for _ in range(degree + 1)]
365 r = float(degree)
402 N = [[0.0 for _ in range(0, degree + 1)] for _ in range(0, degree + 1)]
646 first = r - degree
854 knot_list = kwargs.get('knot_list', knotvector[degree:-degree])
930 new_ctrlpts[k - degree - 1] = ctrlpts[i - degree - 1]
934 new_ctrlpts[k - degree - 1] = deepcopy(new_ctrlpts[k - degree])
1039 if degree == 2:
1139 degree=degree[0],
[all …]
/dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/pqc/math/linearalgebra/
H A DGF2mField.java27 private int degree = 0; field in GF2mField
38 if (degree >= 32) in GF2mField()
43 if (degree < 1) in GF2mField()
48 this.degree = degree; in GF2mField()
60 if (degree != PolynomialRingGF2.degree(poly)) in GF2mField()
70 this.degree = degree; in GF2mField()
89 degree = PolynomialRingGF2.degree(polynomial); in GF2mField()
94 degree = field.degree; in GF2mField()
105 return degree; in getDegree()
270 if (degree == 31) in isElementOfThisField()
[all …]
/dports/print/scribus-devel/scribus-1.5.7/scribus/third_party/lib2geom/
H A Dsolve-bezier-parametric.cpp19 unsigned degree,
94 for (unsigned i = 1; i <= degree; i++) { in crossing_count()
113 unsigned degree) /* Degree of polynomial */ in control_poly_flat_enough() argument
122 const double c = V[0][Geom::X] * V[degree][Geom::Y] - V[degree][Geom::X] * V[0][Geom::Y]; in control_poly_flat_enough()
127 for (unsigned i = 1; i < degree; i++) { in control_poly_flat_enough()
140 for (unsigned i = 0; i < degree-1; i++) { in control_poly_flat_enough()
173 unsigned degree) /* Degree of curve */ in compute_x_intercept() argument
175 const Geom::Point A = V[degree] - V[0]; in compute_x_intercept()
194 const unsigned size=degree+1; in Bezier()
204 Right[degree]= vtemp[degree]; in Bezier()
[all …]
/dports/math/p5-Graph/Graph-0.9725/t/
H A D57_degree.t29 is( $g0->degree(1), -2 );
30 is( $g0->degree(2), 0 );
31 is( $g0->degree(3), 1 );
32 is( $g0->degree(4), 2 );
33 is( $g0->degree(5), -1 );
34 is( $g0->degree(6), 0 );
57 is( $g1->degree(1), 4 );
58 is( $g1->degree(2), 2 );
59 is( $g1->degree(3), 1 );
71 is( $g0->degree, 0 );
[all …]
/dports/cad/ngspice_rework/ngspice-35/src/maths/poly/
H A Dinterpolate.c46 if ((degree < 1) || (degree > olen)) { in ft_interpolate()
48 degree); in ft_interpolate()
57 scratch = TMALLOC(double, (degree + 1) * (degree + 2)); in ft_interpolate()
58 result = TMALLOC(double, degree + 1); in ft_interpolate()
59 xdata = TMALLOC(double, degree + 1); in ft_interpolate()
60 ydata = TMALLOC(double, degree + 1); in ft_interpolate()
71 if (--degree == 0) { in ft_interpolate()
85 for (i = 0; i < degree; i++) { in ft_interpolate()
93 for (l = degree + 1; l < olen; l++) { in ft_interpolate()
96 for (i = 0; i < degree; i++) { in ft_interpolate()
[all …]

12345678910>>...309