Home
last modified time | relevance | path

Searched refs:p_prime (Results 1 – 2 of 2) sorted by relevance

/third_party/boost/libs/math/test/
Dtest_roots.cpp456 polynomial<Complex> p_prime = p.prime(); in test_complex_newton() local
457 auto f = [&](Complex z) { return std::make_pair<Complex, Complex>(p(z), p_prime(z)); }; in test_complex_newton()
472 p_prime = p.prime(); in test_complex_newton()
474 auto g = [&](Complex z) { return std::make_pair<Complex, Complex>(p(z), p_prime(z)); }; in test_complex_newton()
483 p_prime = p.prime(); in test_complex_newton()
485 auto g2 = [&](Complex z) { return std::make_pair<Complex, Complex>(p(z), p_prime(z)); }; in test_complex_newton()
497 p_prime = p.prime(); in test_complex_newton()
499 auto g3 = [&](Complex z) { return std::make_pair<Complex, Complex>(p(z), p_prime(z)); }; in test_complex_newton()
506 p_prime = p.prime(); in test_complex_newton()
508 auto g4 = [&](Complex z) { return std::make_pair<Complex, Complex>(p(z), p_prime(z)); }; in test_complex_newton()
[all …]
/third_party/boost/boost/math/special_functions/
Dlegendre.hpp102 T p_prime; in legendre_p_prime_imp() local
107 p_prime = p0; in legendre_p_prime_imp()
111 p_prime = 3*p1; in legendre_p_prime_imp()
122 p_prime += (2*n+1)*p1; in legendre_p_prime_imp()
136 return p_prime; in legendre_p_prime_imp()