| /dports/math/freefem++/FreeFem-sources-4.6/src/Algo/ |
| H A D | CubicLS.hpp | 69 this->iterMax = it; in CubicLineSearch()
74 this->iterMax = it; in CubicLineSearch()
104 while (new_m < old_m + (1. - lambda) * alpha * slope && this->iterNum < this->iterMax) { in search()
110 if (this->iterNum == this->iterMax) cerr << "Alpha overflowed! \n"; in search()
114 while (new_m > old_m + lambda * alpha * slope && this->iterNum < this->iterMax) { in search()
159 if (this->iterNum == this->iterMax) { in search()
161 cerr << this->iterMax; in search()
|
| H A D | Optima.hpp | 36 int iterMax; member in Optima
78 iterMax = MAX_IT_OPT; in Optima()
|
| H A D | NewtonRaphson.hpp | 55 this->iterMax = it; in Newt()
95 while (this->finalResidue( ) > this->tol && this->iterNum < this->iterMax) { in optimizer()
|
| H A D | CG.hpp | 111 iterMax = it; in ConjugateGradient()
213 } while (finalResidue( ) > tol && iterNum < iterMax); // stopping criterion in optimizer()
|
| H A D | BFGS.hpp | 56 this->iterMax = it; in BFGS()
130 while (this->finalResidue( ) > this->tol && this->iterNum < this->iterMax) { in optimizer()
|
| /dports/science/teem/teem-1.11.0-src/src/pull/ |
| H A D | constraints.c | 111 for (iter=1; iter<=iterMax; iter++) { in constraintSatIso()
137 if (iter > iterMax) { in constraintSatIso()
190 for (iter=1; iter<=iterMax; iter++) { in constraintSatLapl()
204 if (iter > iterMax) { in constraintSatLapl()
218 for (iter=1; iter<=iterMax; iter++) { in constraintSatLapl()
250 if (iter > iterMax) { in constraintSatLapl()
416 stepMax, iterMax); in constraintSatHght()
429 for (iter=1; iter<=iterMax; iter++) { in constraintSatHght()
581 if (iter > iterMax) { in constraintSatHght()
612 unsigned int iterMax; in _pullConstraintSatisfy() local
[all …]
|
| /dports/biology/canu/canu-2.2/src/utility/src/tests/ |
| H A D | intervalListTest.C | 56 uint32 iterMax = 935000; in main() local
58 for (uint32 iter=0; iter<iterMax; iter++) { in main()
68 iter, iterMax, in main()
|
| H A D | intervalsTest.C | 105 uint32 iterMax = 935000; in expensiveTest() local
107 for (uint32 iter=0; iter<iterMax; iter++) { in expensiveTest()
117 iter, iterMax, in expensiveTest()
|
| /dports/science/teem/teem-1.11.0-src/src/ten/ |
| H A D | tendBfit.c | 45 int iterMax; in tend_bfitMain() local
57 hestOptAdd(&hopt, "imax", "# iter", airTypeInt, 1, 1, &iterMax, "10", in tend_bfitMain()
97 if (tenBVecNonLinearFit(nout, nin, bb, ww, iterMax, eps)) { in tend_bfitMain()
|
| H A D | bvec.c | 104 double *bb, double *ww, int iterMax, double eps) { in tenBVecNonLinearFit() argument
159 if (iterMax > 0) { in tenBVecNonLinearFit()
168 } while (iter < iterMax && diff > eps); in tenBVecNonLinearFit()
|
| /dports/science/tfel-edf/tfel-3.2.1/mfront/src/ |
| H A D | IsotropicBehaviourDSLBase.cxx | 122 const auto iterMax = this->readUnsignedShort("IsotropicBehaviourDSLBase::treatIterMax"); in treatIterMax() local
123 if(iterMax==0){ in treatIterMax()
130 this->mb.setParameterDefaultValue(h,"iterMax",iterMax); in treatIterMax()
235 unsigned short iterMax = 100u; in completeVariableDeclaration() local
238 this->mb.setParameterDefaultValue(h,"iterMax",iterMax); in completeVariableDeclaration()
|
| /dports/science/tfel/tfel-3.4.0/docs/tutorial/mfront/ |
| H A D | EllipticCreep.hxx | 71 unsigned short iterMax; member
202 ushort iterMax; member in tfel::material::EllipticCreep
418 this->iterMax = EllipticCreepParametersInitializer::get().iterMax; in EllipticCreep()
461 this->iterMax = EllipticCreepParametersInitializer::get().iterMax; in EllipticCreep()
552 (this->iter<EllipticCreep::iterMax)){ in integrate()
579 if(this->iter==this->iterMax){ in integrate()
722 os << "iterMax : " << b.iterMax << endl; in operator <<()
|
| /dports/science/tfel-edf/tfel-3.2.1/docs/tutorial/mfront/ |
| H A D | EllipticCreep.hxx | 71 unsigned short iterMax; member
202 ushort iterMax; member in tfel::material::EllipticCreep
418 this->iterMax = EllipticCreepParametersInitializer::get().iterMax; in EllipticCreep()
461 this->iterMax = EllipticCreepParametersInitializer::get().iterMax; in EllipticCreep()
552 (this->iter<EllipticCreep::iterMax)){ in integrate()
579 if(this->iter==this->iterMax){ in integrate()
722 os << "iterMax : " << b.iterMax << endl; in operator <<()
|
| /dports/science/tfel/tfel-3.4.0/mfront/src/ |
| H A D | IsotropicBehaviourDSLBase.cxx | 154 const auto iterMax = this->readUnsignedShort("IsotropicBehaviourDSLBase::treatIterMax"); in treatIterMax() local
155 if(iterMax==0){ in treatIterMax()
162 this->mb.setParameterDefaultValue(h,"iterMax",iterMax); in treatIterMax()
270 unsigned short iterMax = 100u; in completeVariableDeclaration() local
273 this->mb.setParameterDefaultValue(h,"iterMax",iterMax); in completeVariableDeclaration()
|
| /dports/science/py-skrebate/skrebate-0.62/skrebate/ |
| H A D | turf.py | 105 iterMax = int(1/float(self.pct))
108 while(iter_count < iterMax):
130 …self._lost[self.headers[i]] = iterMax - iter_count #For feature name, store iteration rank it was …
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/QuadMeshingTools/ |
| H A D | qmtMeshGeometryOptimization.h | 161 int iterMax = 1000,
173 int iterMax = 1000,
|
| /dports/math/R-cran-expm/expm/inst/ |
| H A D | test-tools.R | 82 iterMax = 100) argument
112 if((it <- it+1) > iterMax) {
|
| /dports/science/teem/teem-1.11.0-src/src/pull/test/ |
| H A D | circ.c | 223 unsigned int pntNum, pntIdx, iter, iterMax, rngSeed, posNum, coolHalfLife; in main() local
252 hestOptAdd(&hopt, "maxi", "max iter", airTypeUInt, 1, 1, &iterMax, "1000", in main()
266 &posNum, pntNum*sizeof(double), iterMax/10); in main()
283 for (iter=0; iter<iterMax; iter++) { in main()
|
| /dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/term/ |
| H A D | TermMatrixExt.cpp | 1868 iterMax=cg.nbIterations(); in iterativeSolveGen()
1877 iterMax=cgs.nbIterations(); in iterativeSolveGen()
1886 iterMax=qmr.nbIterations(); in iterativeSolveGen()
1895 iterMax=bicg.nbIterations(); in iterativeSolveGen()
1935 _nbIterations=iterMax; in iterativeSolveGen()
1968 iterMax=cg.nbIterations(); in iterativeSolveGen()
1977 iterMax=cgs.nbIterations(); in iterativeSolveGen()
1986 iterMax=qmr.nbIterations(); in iterativeSolveGen()
1995 iterMax=bicg.nbIterations(); in iterativeSolveGen()
2013 iterMax=gmres.nbIterations(); in iterativeSolveGen()
[all …]
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/columnstore/columnstore/oamapps/sessionWalker/ |
| H A D | tdriver.cpp | 123 const int iterMax = 1; in MonitorTestPlan_1() local
131 for (int jdx = 0; jdx < iterMax; jdx++) in MonitorTestPlan_1()
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/columnstore/columnstore/oamapps/sessionWalker/ |
| H A D | tdriver.cpp | 123 const int iterMax = 1; in MonitorTestPlan_1() local
131 for (int jdx = 0; jdx < iterMax; jdx++) in MonitorTestPlan_1()
|
| /dports/science/tfel-edf/tfel-3.2.1/mtest/src/ |
| H A D | SchemeBase.cxx | 81 tfel::raise_if(this->options.iterMax!=-1, in setMaximumNumberOfIterations()
88 this->options.iterMax = static_cast<int>(i); in setMaximumNumberOfIterations()
347 if(this->options.iterMax==-1){ in completeInitialisation()
348 this->options.iterMax=100; in completeInitialisation()
|
| /dports/science/tfel/tfel-3.4.0/mtest/src/ |
| H A D | SchemeBase.cxx | 75 tfel::raise_if(this->options.iterMax != -1, in setMaximumNumberOfIterations()
82 this->options.iterMax = static_cast<int>(i); in setMaximumNumberOfIterations()
360 if (this->options.iterMax == -1) { in completeInitialisation()
361 this->options.iterMax = 100; in completeInitialisation()
|
| /dports/science/tfel/tfel-3.4.0/docs/mtest/ |
| H A D | UnsignedIntegerParameter.md | 7 @UnsignedIntegerParameter 'iterMax' 12;
|
| /dports/science/tfel-edf/tfel-3.2.1/docs/mtest/ |
| H A D | UnsignedIntegerParameter.md | 7 @UnsignedIntegerParameter 'iterMax' 12;
|