Home
last modified time | relevance | path

Searched refs:nbve (Results 1 – 25 of 48) sorted by relevance

12

/dports/math/scilab/scilab-6.1.1/scilab/modules/optimization/macros/optimsimplex/
H A Doptimsimplex_setall.sci18 // * size nbve X n+1
20 // * simplex(k,1) is the function value of the vertex #k, with k = 1 , nbve
21 // * simplex(k,2:n+1) is the coordinates of the vertex #k, with k = 1 , nbve
32 nbve = size(simplex,1)
34 if np1 > nbve then
35 … %d which is smaller than the number of columns %d (i.e. n+1).") , "optimsimplex_setall",nbve,np1);
39 this.nbve = nbve;
40 this.fv ( 1:nbve , 1 ) = simplex ( 1:nbve , 1 )
41 this.x ( 1:nbve , 1:this.n ) = simplex ( 1:nbve , 2:this.n+1 )
H A Doptimsimplex_setnbve.sci18 // nbve : the number of vertices
20 function this = optimsimplex_setnbve ( this , nbve )
24 if type(nbve) <> 1 then
27 if or(size(nbve) <> [1 1]) then
30 if nbve-floor(nbve) <> 0 then
33 this.nbve = nbve;
H A Doptimsimplex_getall.sci17 // in the same matrix, with size nbve X n+1, which is organized as follows :
19 // * simplex(k,1) is the function value of the vertex #k, with kve = 1 , nbve
20 // * simplex(k,2:n+1) is the coordinates of the vertex #k, with kve = 1 , nbve
28 simplex = zeros ( this.nbve , this.n+1 );
29 simplex ( 1:this.nbve , 1 ) = this.fv ( 1:this.nbve , 1 )
30 simplex ( 1:this.nbve , 2:this.n+1 ) = this.x ( 1:this.nbve , 1:this.n )
H A Doptimsimplex_new.sci72 newobj.nbve = 0;
83 if nbve < n + 1 then
88 newobj.nbve = nbve;
89 newobj.x(1:nbve,1:n) = coords(1:nbve,1:n);
108 newobj.nbve = n + 1;
120 nv = newobj.nbve;
137 newobj.nbve = n + 1;
148 nv = newobj.nbve;
171 newobj.nbve = n + 1;
204 newobj.nbve = nbve;
[all …]
H A Doptimsimplex_check.sci28 if this.nbve<> 0 & nx1 <> this.nbve then
29 …s %d, which is different from number of vertices = %d."),"optimsimplex_check" , nx1 , this.nbve ));
36 if this.n<> 0 & nf1 <> this.nbve then
37 …s %d, which is different from number of vertices = %d."),"optimsimplex_check" , nf1 , this.nbve ));
39 if this.nbve<> 0 & nf2 <> 1 then
H A Doptimsimplex_setallfv.sci18 // with k = 1 , nbve
30 if fv1 <> this.nbve then
31 …the function value array is %d, while expected %d." ), "optimsimplex_setallfv" , fv1 , this.nbve ))
37 this.fv ( 1:this.nbve , 1 ) = fv ( 1:this.nbve );
H A Doptimsimplex_setallx.sci18 // with k = 1 , nbve
30 if nx1 <> this.nbve then
31 …: The number of rows in x is %d, while expected %d." ), "optimsimplex_setallx" , nx1 , this.nbve ))
37 this.x ( 1:this.nbve , 1:this.n ) = x ( 1:this.nbve , 1:this.n );
H A Doptimsimplex_xbar.sci27 iexcl = this.nbve;
35 cen = sum(this.x(1:this.nbve,1:this.n),"r")
38 cen = cen / ( this.nbve - nexcl )
H A Doptimsimplex_computefv.sci50 this = optimsimplex_compsomefv ( this , fun , 1:this.nbve )
52 [ this , data ] = optimsimplex_compsomefv ( this , fun , 1:this.nbve , data )
55 [ this , data ] = optimsimplex_compsomefv ( this , fun , 1:this.nbve , data )
H A Doptimsimplex_deltafv.sci22 df = this.fv(2:this.nbve) - this.fv(1)*ones(this.nbve-1,1)
H A Doptimsimplex_getallfv.sci19 // with k = 1 , nbve
27 fv = this.fv ( 1:this.nbve , 1 )
H A Doptimsimplex_getallx.sci18 // with k = 1 , nbve
26 x = this.x ( 1:this.nbve , 1:this.n )
H A Doptimsimplex_deltafvmax.sci19 // the smallest function value and that the vertex #nbve
28 dfm = this.fv(this.nbve) - this.fv(1)
H A D%TSIMPLEX_string.sci33 str(k) = sprintf("nbve: %d\n",this.nbve);
H A Doptimsimplex_reflect.sci24 nv = this.nbve;
28 r.nbve = nv
/dports/math/scilab/scilab-6.1.1/scilab/modules/optimization/tests/unit_tests/neldermead/
H A Dneldermead_searchfixed.dia.ref73 nbve: 3
92 nbve: 3
111 nbve: 3
130 nbve: 3
149 nbve: 3
220 nbve: 3
242 nbve: 3
266 nbve: 3
288 nbve: 3
312 nbve: 3
H A Dneldermead_searchvariable.dia.ref102 nbve: 3
125 nbve: 3
155 nbve: 3
185 nbve: 3
215 nbve: 3
H A Dneldermead_rosensuzuki.tst213 nbve = optimsimplex_getnbve ( simplexopt );
214 assert_checkequal ( nbve , 8 );
256 nbve = optimsimplex_getnbve ( simplexopt );
257 assert_checkequal ( nbve , 6 );
291 nbve = optimsimplex_getnbve ( simplexopt );
292 assert_checkequal ( nbve , 6 );
336 nbve = optimsimplex_getnbve ( simplexopt );
337 assert_checkequal ( nbve , 7 );
H A Dneldermead_rosensuzuki.dia.ref204 nbve = optimsimplex_getnbve ( simplexopt );
205 assert_checkequal ( nbve , 8 );
245 nbve = optimsimplex_getnbve ( simplexopt );
246 assert_checkequal ( nbve , 6 );
280 assert_checkequal ( nbve , 6 );
325 assert_checkequal ( nbve , 7 );
460 nbve: 8
487 nbve: 8
523 nbve: 8
557 nbve: 8
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/IFSelect/
H A DIFSelect_SignatureList.cxx209 …Standard_Integer nbtot = 0, nbsign = 0, maxent = 0, nbval = 0, nbve = 0, minval = 0, maxval = 0, t… in PrintSum() local
231 nbve += nbent; in PrintSum()
239 S<<" For Nb Entities : "<<nbve<<std::endl; in PrintSum()
243 avg1 = totval/nbve; in PrintSum()
244 avg2 = ((totval - (avg1*nbve)) * 10) / nbve; in PrintSum()
/dports/math/scilab/scilab-6.1.1/scilab/modules/optimization/tests/unit_tests/optimsimplex/
H A Doptimsimplex_new.dia.ref126 "nbve: 5"
134 nbve: 5
152 nbve: 5
169 nbve: 5
H A Doptimsimplex_tostring.tst29 "nbve: 3"
50 "nbve: 4"
H A Doptimsimplex_tostring.dia.ref26 "nbve: 3"
46 "nbve: 4"
/dports/math/freefem++/FreeFem-sources-4.6/plugin/seq/
H A Ddistance.cpp507 const int nbve = 3; in DistanceIso0() local
509 int iK[nbve] = {Th(k, 0), Th(k, 1), Th(k, 2)}; in DistanceIso0()
510 R fk[nbve] = {f[iK[0]], f[iK[1]], f[iK[2]]}; in DistanceIso0()
512 double FK[nbve] = {fv[iK[0]], fv[iK[1]], fv[iK[2]]}; in DistanceIso0()
531 const int nbve = 4; in DistanceIso0() local
551 const int nbve = Mesh::Rd::d + 1; in Distance() local
585 for (int iv = 0; iv < nbve; ++iv) { in Distance()
606 for (int e = 0; e < nbve; ++e) { in Distance()
631 int e = t.second % nbve; in Distance()
632 int k = t.second / nbve; in Distance()
[all …]
/dports/math/scilab/scilab-6.1.1/scilab/modules/optimization/macros/neldermead/
H A Dneldermead_updatesimp.sci93 nbve = optimsimplex_getnbve ( simplex0 );
96 for i = 1:nbve
102 nbve = optimsimplex_getnbve ( simplex0 )
103 for ive = 1 : nbve
107 ive , nbve , _strvec(x)));
112 ive , nbve , strcat(string(x)," "));
129 for i = 1:nbve

12