| /third_party/boost/libs/math/example/ |
| D | brent_minimise_example.cpp | 144 const boost::uintmax_t maxit = 20; in show_minima() local
145 boost::uintmax_t it = maxit; in show_minima()
158 if (it < maxit) in show_minima()
240 const boost::uintmax_t maxit = 20; in main() local
241 boost::uintmax_t it = maxit; in main()
276 const boost::uintmax_t maxit = 20; in main() local
277 boost::uintmax_t it_4 = maxit; in main()
297 const boost::uintmax_t maxit = 20; in main() local
299 boost::uintmax_t it_5 = maxit; in main()
319 const boost::uintmax_t maxit = 20; in main() local
[all …]
|
| D | root_finding_fifth.cpp | 180 const boost::uintmax_t maxit = 50; // Chosen max iterations, in fifth_noderiv() local
186 boost::uintmax_t it = maxit; // Initially our chosen max iterations, in fifth_noderiv()
198 if (it >= maxit) in fifth_noderiv()
292 const boost::uintmax_t maxit = 20; // Optionally limit the number of iterations. in fifth_1deriv() local
293 boost::uintmax_t it = maxit; // limit the number of iterations. in fifth_1deriv()
297 cout << it << " iterations (from max of " << maxit << ")" << endl; in fifth_1deriv()
360 const boost::uintmax_t maxit = 50; in fifth_2deriv() local
361 boost::uintmax_t it = maxit; in fifth_2deriv()
364 cout << it << " iterations (from max of " << maxit << ")" << endl; in fifth_2deriv()
|
| D | root_finding_start_locations.cpp | 45 const boost::uintmax_t maxit = 20; // Limit to maximum iterations. in cbrt_noderiv() local
46 …boost::uintmax_t it = maxit; // Initially our chosen max iterations, but updated … in cbrt_noderiv()
87 const boost::uintmax_t maxit = 20; in cbrt_deriv() local
88 boost::uintmax_t it = maxit; in cbrt_deriv()
125 boost::uintmax_t maxit = 20; in cbrt_2deriv() local
126 halley_iterate(cbrt_functor_2deriv<T>(x), guess, min, max, get_digits, maxit); in cbrt_2deriv()
127 return maxit; in cbrt_2deriv()
142 boost::uintmax_t maxit = 20; in cbrt_2deriv_s() local
143 schroder_iterate(cbrt_functor_2deriv<T>(x), guess, min, max, get_digits, maxit); in cbrt_2deriv_s()
144 return maxit; in cbrt_2deriv_s()
[all …]
|
| D | root_finding_example.cpp | 129 const boost::uintmax_t maxit = 20; // Limit to maximum iterations. in cbrt_noderiv() local
130 …boost::uintmax_t it = maxit; // Initially our chosen max iterations, but updated … in cbrt_noderiv()
237 const boost::uintmax_t maxit = 20; in cbrt_deriv() local
238 boost::uintmax_t it = maxit; in cbrt_deriv()
297 boost::uintmax_t maxit = 20; in cbrt_2deriv() local
298 T result = halley_iterate(cbrt_functor_2deriv<T>(x), guess, min, max, get_digits, maxit); in cbrt_2deriv()
321 boost::uintmax_t maxit = 20; in cbrt_2deriv_lambda() local
325 guess, min, max, get_digits, maxit); in cbrt_2deriv_lambda()
423 const boost::uintmax_t maxit = 50; in fifth_2deriv() local
424 boost::uintmax_t it = maxit; in fifth_2deriv()
|
| D | root_finding_multiprecision_example.cpp | 72 const boost::uintmax_t maxit = 20; in cbrt_2deriv() local
73 boost::uintmax_t it = maxit; in cbrt_2deriv()
138 const boost::uintmax_t maxit = 50; in nth_2deriv() local
139 boost::uintmax_t it = maxit; in nth_2deriv()
142 std::cout << it << " iterations (from max of " << maxit << ")" << std::endl; in nth_2deriv()
|
| D | root_n_finding_algorithms.cpp | 209 const boost::uintmax_t maxit = 50; // Limit to maximum iterations. in nth_root_noderiv() local
210 boost::uintmax_t it = maxit; // Initially our chosen max iterations, but updated with actual. in nth_root_noderiv()
264 const boost::uintmax_t maxit = 20; in nth_root_1deriv() local
265 boost::uintmax_t it = maxit; in nth_root_1deriv()
316 const boost::uintmax_t maxit = 20; in nth_root_2deriv() local
317 boost::uintmax_t it = maxit; in nth_root_2deriv()
344 const boost::uintmax_t maxit = 20; in nth_root_2deriv_s() local
345 boost::uintmax_t it = maxit; in nth_root_2deriv_s()
|
| D | root_finding_algorithms.cpp | 220 const boost::uintmax_t maxit = 50; // Limit to maximum iterations. in cbrt_noderiv() local
221 boost::uintmax_t it = maxit; // Initially our chosen max iterations, but updated with actual. in cbrt_noderiv()
270 const boost::uintmax_t maxit = 20; in cbrt_deriv() local
271 boost::uintmax_t it = maxit; in cbrt_deriv()
315 boost::uintmax_t maxit = 20; in cbrt_2deriv() local
316 boost::uintmax_t it = maxit; in cbrt_2deriv()
342 const boost::uintmax_t maxit = 20; in cbrt_2deriv_s() local
343 boost::uintmax_t it = maxit; in cbrt_2deriv_s()
|
| D | root_elliptic_finding.cpp | 207 const boost::uintmax_t maxit = 50; // Limit to maximum iterations. in elliptic_root_noderiv() local
208 …boost::uintmax_t it = maxit; // Initially our chosen max iterations, but updated with actua… in elliptic_root_noderiv()
272 const boost::uintmax_t maxit = 20; in elliptic_root_1deriv() local
273 boost::uintmax_t it = maxit; in elliptic_root_1deriv()
330 const boost::uintmax_t maxit = 20; in elliptic_root_2deriv() local
331 boost::uintmax_t it = maxit; in elliptic_root_2deriv()
356 const boost::uintmax_t maxit = 20; in elliptic_root_2deriv_s() local
357 boost::uintmax_t it = maxit; in elliptic_root_2deriv_s()
|
| D | root_finding_n_example.cpp | 108 const boost::uintmax_t maxit = 20; in nth_2deriv() local
109 boost::uintmax_t it = maxit; in nth_2deriv()
|
| /third_party/boost/libs/math/doc/roots/ |
| D | minima.qbk | 136 (so it may be useful to also keep a record of the limit set in `const maxit`).
|