Home
last modified time | relevance | path

Searched refs:maxit (Results 1 – 25 of 1501) sorted by relevance

12345678910>>...61

/dports/math/dune-istl/dune-istl-fffb544a61d2c65a0d2fc7c751f36909f06be8f5/dune/istl/test/
H A Dsolverfactorytest.ini7 maxit = 1000 key
17 maxit = 1000 key
26 maxit = 1000 key
35 maxit = 1000 key
44 maxit = 1000 key
55 maxit = 1000 key
64 maxit = 1000 key
73 maxit = 1000 key
82 maxit = 1000 key
91 maxit = 1000 key
[all …]
/dports/math/py-levmar/levmar-0.2.3/levmar/
H A D__init__.py22 maxit=1000, cdiff=False): argument
72 mu, eps1, eps2, eps3, maxit, cdiff)
77 maxit=1000, cdiff=False): argument
131 mu, eps1, eps2, eps3, maxit, cdiff)
136 maxit=1000, cdiff=False): argument
189 mu, eps1, eps2, eps3, maxit, cdiff)
194 maxit=1000, cdiff=False): argument
256 maxit=1000, cdiff=False): argument
322 maxit=1000, cdiff=False): argument
385 maxit=1000, cdiff=False): argument
[all …]
/dports/math/R-cran-psych/psych/R/
H A Dbifactor.R25 "bifactor" <- function(L, Tmat=diag(ncol(L)), normalize=FALSE, eps=1e-5, maxit=1000){ argument
26 GPForth(L, Tmat=Tmat, normalize=normalize, eps=eps, maxit=maxit,
31 "biquartimin" <- function(L, Tmat=diag(ncol(L)), normalize=FALSE, eps=1e-5, maxit=1000){ argument
32 GPFoblq(L, Tmat=Tmat, normalize=normalize, eps=eps, maxit=maxit,
47 "TargetQ" <- function(L, Tmat=diag(ncol(L)), normalize=FALSE, eps=1e-5, maxit=1000,Target=NULL) { argument
48 GPFoblq(L, Tmat=Tmat,normalize=normalize, eps=eps, maxit=maxit,
51 "TargetT" <- function(L, Tmat=diag(ncol(L)), normalize=FALSE, eps=1e-5, maxit=1000,Target=NULL) { argument
52 GPForth(L, Tmat=Tmat,normalize=normalize, eps=eps, maxit=maxit,
/dports/math/arpack++/arpackpp-2.3.0/examples/areig/
H A Dareig.h389 maxit, resid, AutoShift);
413 maxit, resid, AutoShift);
449 int ncv = 0, ARFLOAT tol = 0.0, int maxit = 0,
552 int ncv = 0, ARFLOAT tol = 0.0, int maxit = 0,
577 int ncv = 0, ARFLOAT tol = 0.0, int maxit = 0,
601 int ncv = 0, ARFLOAT tol = 0.0, int maxit = 0,
903 int ncv = 0, ARFLOAT tol = 0.0, int maxit = 0,
929 int ncv = 0, ARFLOAT tol = 0.0, int maxit = 0,
940 maxit, resid, AutoShift);
963 maxit, resid, AutoShift);
[all …]
/dports/science/siesta/siesta-4.1.5/Src/
H A Dm_broyddj.f9030 integer :: maxit component
93 i2min=0, i2max=maxit, copy=.false., shrink=.false.)
95 i2min=0, i2max=maxit, copy=.false., shrink=.false.)
98 i2min=0, i2max=maxit, copy=.false., shrink=.false.)
276 br%dFdF(0:maxit-1,0:maxit-1) = br%dFdF(1:maxit,1:maxit)
277 br%w(0:maxit-1) = br%w(1:maxit)
278 br%u(1:n,0:maxit-1) = br%u(1:n,1:maxit)
279 br%dF(1:n,0:maxit-1) = br%dF(1:n,1:maxit)
280 br%it = br%maxit ! note fixing of marker, to cycle over and over
H A Dm_broyddj_nocomm.f9037 integer :: maxit component
104 i2min=0, i2max=maxit, copy=.false., shrink=.false.)
106 i2min=0, i2max=maxit, copy=.false., shrink=.false.)
113 i2min=0, i2max=maxit, copy=.false., shrink=.false.)
309 br%dFdF(0:maxit-1,0:maxit-1) = br%dFdF(1:maxit,1:maxit)
310 br%w(0:maxit-1) = br%w(1:maxit)
311 br%u(1:n,0:maxit-1) = br%u(1:n,1:maxit)
312 br%dF(1:n,0:maxit-1) = br%dF(1:n,1:maxit)
313 br%it = br%maxit ! note fixing of marker, to cycle over and over
/dports/graphics/xfractint/xfractint-20.04p16/unix/
H A Dcalmanfp.c20 inside_color = maxit; in calcmandfpasmstart()
53 oldcoloriter = maxit - 255;
56 tmpfsd = maxit - firstsavedand;
86 cx = maxit;
124 if (((maxit - cx) & savedand)==0) {
143 oldcoloriter = maxit;
144 realcoloriter = maxit;
145 kbdcount = kbdcount-(maxit-cx);
162 oldcoloriter = maxit;
163 kbdcount -= maxit;
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A DFuzzy_iso_box.h115 Cartesian_const_iterator_d minit= min_begin, maxit = max_begin;
116 for (unsigned int i = 0; i < dim; ++i, ++pit, ++minit, ++maxit) {
117 if ( ((*pit) < (*minit)) || ((*pit) > (*maxit)) )
126 Cartesian_const_iterator_d minit= min_begin, maxit = max_begin;
127 for (unsigned int i = 0; i < dim; ++i, ++it_coord_begin, ++minit, ++maxit) {
136 Cartesian_const_iterator_d minit= min_begin, maxit = max_begin;
137 for (unsigned int i = 0; i < dim; ++i, ++minit, ++maxit) {
138 if ( ((*maxit)-eps < rectangle.min_coord(i))
147 Cartesian_const_iterator_d minit= min_begin, maxit = max_begin;
148 for (unsigned int i = 0; i < dim; ++i, ++minit, ++maxit) {
[all …]
/dports/devel/R-cran-glmnet/glmnet/R/
H A Djerr.R1 jerr=function(n,maxit,pmax,family){ argument
5 "gaussian"=jerr.elnet(n,maxit,pmax),
6 "binomial"=jerr.lognet(n,maxit,pmax),
7 "multinomial"=jerr.lognet(n,maxit,pmax),
8 "poisson"=jerr.fishnet(n,maxit,pmax),
9 "cox"=jerr.coxnet(n,maxit,pmax)
/dports/math/gap/gap-4.11.0/pkg/Thelma-1.02/lib/
H A Diterative_methods.gi47 if maxit<1 then
63 niter:=maxit;
83 if maxit<1 then
101 niter:=maxit;
131 niter:=maxit;
183 niter:=maxit;
235 niter:=maxit;
269 niter:=maxit;
301 niter:=maxit;
355 niter:=maxit;
[all …]
/dports/math/octave/octave-6.4.0/libinterp/corefcn/
H A D__eigs__.cc193 int maxit = 300; variable
351 maxit = tmp.nint_value ();
454 maxit);
459 maxit);
467 maxit);
472 maxit);
564 cholB, disp, maxit);
569 cholB, disp, maxit);
577 cholB, disp, maxit);
582 disp, maxit);
[all …]
/dports/databases/grass7/grass-7.8.6/lib/gmath/
H A Dsolvers_krylov.c35 double *b, int rows, int maxit, double err);
123 int rows, int maxit, double err, int prec) in G_math_solver_sparse_pcg() argument
189 for (m = 0; m < maxit; m++) { in solver_pcg()
312 return solver_cg(A, NULL, x, b, rows, maxit, err, 0, 0); in G_math_solver_cg()
365 int rows, int maxit, double err) in G_math_solver_sparse_cg() argument
423 for (m = 0; m < maxit; m++) { in solver_cg()
536 int maxit, double err) in G_math_solver_bicgstab() argument
538 return solver_bicgstab(A, NULL, x, b, rows, maxit, err); in G_math_solver_bicgstab()
563 double *b, int rows, int maxit, double err) in G_math_solver_sparse_bicgstab() argument
570 int rows, int maxit, double err) in solver_bicgstab() argument
[all …]
/dports/math/R-cran-VGAM/VGAM/R/
H A Dvgam.control.q14 bf.maxit = 30, argument
20 maxit = 30,
53 if (!is.Numeric(bf.maxit, length.arg = 1,
56 bf.maxit <- 30
62 if (!is.Numeric(maxit, length.arg = 1,
65 maxit <- 30
78 if (iter == 1) iter < maxit else
79 (iter < maxit &&
82 iter < maxit &&
97 bf.maxit = bf.maxit,
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/math/example/
H A Dbrent_minimise_example.cpp145 boost::uintmax_t it = maxit; in show_minima()
158 if (it < maxit) in show_minima()
241 boost::uintmax_t it = maxit; in main()
277 boost::uintmax_t it_4 = maxit; in main()
299 boost::uintmax_t it_5 = maxit; in main()
320 boost::uintmax_t it = maxit; in main()
436 boost::uintmax_t it = maxit; in main()
459 boost::uintmax_t it = maxit; in main()
479 boost::uintmax_t it = maxit; in main()
498 boost::uintmax_t it = maxit; in main()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/libs/math/example/
H A Dbrent_minimise_example.cpp145 boost::uintmax_t it = maxit; in show_minima()
158 if (it < maxit) in show_minima()
241 boost::uintmax_t it = maxit; in main()
277 boost::uintmax_t it_4 = maxit; in main()
299 boost::uintmax_t it_5 = maxit; in main()
320 boost::uintmax_t it = maxit; in main()
436 boost::uintmax_t it = maxit; in main()
459 boost::uintmax_t it = maxit; in main()
479 boost::uintmax_t it = maxit; in main()
498 boost::uintmax_t it = maxit; in main()
[all …]
/dports/devel/boost-libs/boost_1_72_0/libs/math/example/
H A Dbrent_minimise_example.cpp145 boost::uintmax_t it = maxit; in show_minima()
158 if (it < maxit) in show_minima()
241 boost::uintmax_t it = maxit; in main()
277 boost::uintmax_t it_4 = maxit; in main()
299 boost::uintmax_t it_5 = maxit; in main()
320 boost::uintmax_t it = maxit; in main()
436 boost::uintmax_t it = maxit; in main()
459 boost::uintmax_t it = maxit; in main()
479 boost::uintmax_t it = maxit; in main()
498 boost::uintmax_t it = maxit; in main()
[all …]
/dports/devel/hyperscan/boost_1_75_0/libs/math/example/
H A Dbrent_minimise_example.cpp145 boost::uintmax_t it = maxit; in show_minima()
158 if (it < maxit) in show_minima()
241 boost::uintmax_t it = maxit; in main()
277 boost::uintmax_t it_4 = maxit; in main()
299 boost::uintmax_t it_5 = maxit; in main()
320 boost::uintmax_t it = maxit; in main()
436 boost::uintmax_t it = maxit; in main()
459 boost::uintmax_t it = maxit; in main()
479 boost::uintmax_t it = maxit; in main()
498 boost::uintmax_t it = maxit; in main()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/trilinos/packages/rol/src/step/krylov/
H A DROL_GMRES.hpp101 int maxit = Krylov<Real>::getMaximumIteration(); in GMRES() local
103 H_ = ROL::makePtr<SDMatrix>( maxit+1, maxit ); in GMRES()
104 cs_ = ROL::makePtr<SDVector>( maxit ); in GMRES()
105 sn_ = ROL::makePtr<SDVector>( maxit ); in GMRES()
106 s_ = ROL::makePtr<SDVector>( maxit+1 ); in GMRES()
107 y_ = ROL::makePtr<SDVector>( maxit+1 ); in GMRES()
108 cnorm_ = ROL::makePtr<SDVector>( maxit ); in GMRES()
118 int maxit = Krylov<Real>::getMaximumIteration(); in run() local
172 for( iter=0; iter<maxit; ++iter ) { in run()
175 itol = rtol/(maxit*(*res_)[iter]); in run()
[all …]
/dports/math/dune-istl/dune-istl-fffb544a61d2c65a0d2fc7c751f36909f06be8f5/dune/python/istl/
H A Dsolvers.hh96 …earOperator< X, X > &op, Preconditioner< X, X > &prec, double reduction, int maxit, int verbose ) { in registerEndomorphismSolvers() argument
97 …return static_cast< Solver * >( new Dune::LoopSolver< X >( op, prec, reduction, maxit, verbose ) ); in registerEndomorphismSolvers()
116 …earOperator< X, X > &op, Preconditioner< X, X > &prec, double reduction, int maxit, int verbose ) { in registerEndomorphismSolvers() argument
117 …rn static_cast< Solver * >( new Dune::GradientSolver< X >( op, prec, reduction, maxit, verbose ) ); in registerEndomorphismSolvers()
136 …earOperator< X, X > &op, Preconditioner< X, X > &prec, double reduction, int maxit, int verbose ) { in registerEndomorphismSolvers() argument
137 … return static_cast< Solver * >( new Dune::CGSolver< X >( op, prec, reduction, maxit, verbose ) ); in registerEndomorphismSolvers()
156 …earOperator< X, X > &op, Preconditioner< X, X > &prec, double reduction, int maxit, int verbose ) { in registerEndomorphismSolvers() argument
157 … return static_cast< Solver * >( new Dune::CGSolver< X >( op, prec, reduction, maxit, verbose ) ); in registerEndomorphismSolvers()
173 …earOperator< X, X > &op, Preconditioner< X, X > &prec, double reduction, int maxit, int verbose ) { in registerEndomorphismSolvers() argument
174 … return static_cast< Solver * >( new Dune::CGSolver< X >( op, prec, reduction, maxit, verbose ) ); in registerEndomorphismSolvers()
[all …]
/dports/science/ergo/ergo-3.8/source/densfromf/recursive_expansion/eigenvectors/src/
H A Dget_eigenvectors.h84 int maxit = 200,
106 (A, y, number_of_eigenvalues, maxit);
116 num_iter[0] = maxit; // lanczos did not converge in maxIter iterations in catch()
151 (A, y, num_eig, maxit, 100, &v1, sigma);
166 …num_iter[1] = maxit; // lanczos did not converge in maxIter itera… in catch()
186 int maxit = 200)
207 while (it == 1 || (residual.eucl() / template_blas_fabs(lambda) > TOL && it <= maxit))
239 …int maxit = 200, /**< [in] Maximum number of iterations.…
259 power_method(A, eigVal[0], eigVec[0], tol, num_iter[0], maxit);
263 …lanczos_method(A, eigVal, eigVec, number_of_eigenvalues_to_compute, tol, num_iter, maxit, do_defla…
/dports/math/R-cran-robustbase/robustbase/R/
H A Dmc.R21 , maxit = 100, trace.lev = 0 argument
37 maxit=maxit, trace.lev=trace.lev)
57 mcComp <- function(x, doReflect, doScale, eps1, eps2, maxit = 1000, trace.lev = 1) argument
63 length(maxit <- as.integer(maxit)) == 1,
70 c.iter <- c(maxit, trace.lev)
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/math/example/
H A Droot_finding_example.cpp126 const boost::uintmax_t maxit = 10; in cbrt_1() local
127 boost::uintmax_t it = maxit; // Initally our chosen max iterations, but updated with actual. in cbrt_1()
136 cout << "Iterations " << maxit << endl; in cbrt_1()
137 if(it >= maxit) in cbrt_1()
201 boost::uintmax_t maxit = 10; in cbrt_2() local
203 T result = newton_raphson_iterate(cbrt_functor_2<T>(x), guess, min, max, get_digits, maxit); in cbrt_2()
263 boost::uintmax_t maxit = 10; in cbrt_3() local
265 T result = halley_iterate(cbrt_functor_3<T>(x), guess, min, max, digits, maxit); in cbrt_3()
267 cout << "Iterations " << maxit << endl; in cbrt_3()
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/math/example/
H A Droot_finding_example.cpp126 const boost::uintmax_t maxit = 10; in cbrt_1() local
127 boost::uintmax_t it = maxit; // Initally our chosen max iterations, but updated with actual. in cbrt_1()
136 cout << "Iterations " << maxit << endl; in cbrt_1()
137 if(it >= maxit) in cbrt_1()
201 boost::uintmax_t maxit = 10; in cbrt_2() local
203 T result = newton_raphson_iterate(cbrt_functor_2<T>(x), guess, min, max, get_digits, maxit); in cbrt_2()
263 boost::uintmax_t maxit = 10; in cbrt_3() local
265 T result = halley_iterate(cbrt_functor_3<T>(x), guess, min, max, digits, maxit); in cbrt_3()
267 cout << "Iterations " << maxit << endl; in cbrt_3()
/dports/databases/percona57-server/boost_1_59_0/libs/math/example/
H A Droot_finding_example.cpp126 const boost::uintmax_t maxit = 10; in cbrt_1() local
127 boost::uintmax_t it = maxit; // Initally our chosen max iterations, but updated with actual. in cbrt_1()
136 cout << "Iterations " << maxit << endl; in cbrt_1()
137 if(it >= maxit) in cbrt_1()
201 boost::uintmax_t maxit = 10; in cbrt_2() local
203 T result = newton_raphson_iterate(cbrt_functor_2<T>(x), guess, min, max, get_digits, maxit); in cbrt_2()
263 boost::uintmax_t maxit = 10; in cbrt_3() local
265 T result = halley_iterate(cbrt_functor_3<T>(x), guess, min, max, digits, maxit); in cbrt_3()
267 cout << "Iterations " << maxit << endl; in cbrt_3()
/dports/databases/xtrabackup/boost_1_59_0/libs/math/example/
H A Droot_finding_example.cpp126 const boost::uintmax_t maxit = 10; in cbrt_1() local
127 boost::uintmax_t it = maxit; // Initally our chosen max iterations, but updated with actual. in cbrt_1()
136 cout << "Iterations " << maxit << endl; in cbrt_1()
137 if(it >= maxit) in cbrt_1()
201 boost::uintmax_t maxit = 10; in cbrt_2() local
203 T result = newton_raphson_iterate(cbrt_functor_2<T>(x), guess, min, max, get_digits, maxit); in cbrt_2()
263 boost::uintmax_t maxit = 10; in cbrt_3() local
265 T result = halley_iterate(cbrt_functor_3<T>(x), guess, min, max, digits, maxit); in cbrt_3()
267 cout << "Iterations " << maxit << endl; in cbrt_3()

12345678910>>...61