Code-Eli
0.3.6
|
Functions | |
template<typename data__ > | |
int | closed_form_0 (std::vector< data__ > &root, const data__ a[]) |
template<typename data__ > | |
int | closed_form_1 (std::vector< data__ > &root, const data__ a[]) |
template<typename data__ > | |
int | closed_form_2 (std::vector< data__ > &root, const data__ a[]) |
template<typename data__ > | |
int | closed_form_3 (std::vector< data__ > &root, const data__ a[]) |
template<typename data__ > | |
int | closed_form_4 (std::vector< data__ > &root, const data__ aa[]) |
template<typename data__ > | |
int | closed_form (std::vector< data__ > &root, const data__ a[], size_t degree) |
template<typename data__ > | |
int | descartes_rule (const polynomial< data__ > &f, bool positive) |
template<typename data__ > | |
int | descartes_rule (const polynomial< data__ > &f) |
template<typename data__ > | |
data__ | max_radius (const polynomial< data__ > &f) |
template<typename data__ > | |
data__ | at_least_radius (const polynomial< data__ > &f) |
template<typename it__ > | |
int | sign_changes (const it__ itb, const it__ ite) |
template<typename data__ > | |
void | sturm_functions (std::vector< polynomial< data__ > > &sturm_fun, const polynomial< data__ > &f) |
template<typename data__ , typename data2__ > | |
int | sturm_count (const std::vector< polynomial< data__ > > &sturm_fun, const data2__ &xmin, const data2__ &xmax) |
template<typename data__ , typename data2__ > | |
int | sturm_count (const polynomial< data__ > &f, const data2__ &xmin, const data2__ &xmax) |
template<typename data__ > | |
int | sturm_count (const polynomial< data__ > &f, bool positive) |
template<typename data__ > | |
int | sturm_count (const std::vector< polynomial< data__ > > &sturm_fun, bool positive) |
template<typename data__ > | |
int | sturm_count (const polynomial< data__ > &f) |
template<typename data__ > | |
int | sturm_count (const std::vector< polynomial< data__ > > &sturm_fun) |
data__ eli::mutil::poly::root::at_least_radius | ( | const polynomial< data__ > & | f | ) |
int eli::mutil::poly::root::closed_form | ( | std::vector< data__ > & | root, |
const data__ | a[], | ||
size_t | degree | ||
) |
int eli::mutil::poly::root::closed_form_0 | ( | std::vector< data__ > & | root, |
const data__ | a[] | ||
) |
int eli::mutil::poly::root::closed_form_1 | ( | std::vector< data__ > & | root, |
const data__ | a[] | ||
) |
int eli::mutil::poly::root::closed_form_2 | ( | std::vector< data__ > & | root, |
const data__ | a[] | ||
) |
int eli::mutil::poly::root::closed_form_3 | ( | std::vector< data__ > & | root, |
const data__ | a[] | ||
) |
inspired by numerical recipes section 5.6
int eli::mutil::poly::root::closed_form_4 | ( | std::vector< data__ > & | root, |
const data__ | aa[] | ||
) |
based on Shmakov IJPAM 71(2)
int eli::mutil::poly::root::descartes_rule | ( | const polynomial< data__ > & | f, |
bool | positive | ||
) |
int eli::mutil::poly::root::descartes_rule | ( | const polynomial< data__ > & | f | ) |
data__ eli::mutil::poly::root::max_radius | ( | const polynomial< data__ > & | f | ) |
int eli::mutil::poly::root::sign_changes | ( | const it__ | itb, |
const it__ | ite | ||
) |
int eli::mutil::poly::root::sturm_count | ( | const std::vector< polynomial< data__ > > & | sturm_fun, |
const data2__ & | xmin, | ||
const data2__ & | xmax | ||
) |
int eli::mutil::poly::root::sturm_count | ( | const polynomial< data__ > & | f, |
const data2__ & | xmin, | ||
const data2__ & | xmax | ||
) |
int eli::mutil::poly::root::sturm_count | ( | const polynomial< data__ > & | f, |
bool | positive | ||
) |
int eli::mutil::poly::root::sturm_count | ( | const std::vector< polynomial< data__ > > & | sturm_fun, |
bool | positive | ||
) |
int eli::mutil::poly::root::sturm_count | ( | const polynomial< data__ > & | f | ) |
int eli::mutil::poly::root::sturm_count | ( | const std::vector< polynomial< data__ > > & | sturm_fun | ) |
void eli::mutil::poly::root::sturm_functions | ( | std::vector< polynomial< data__ > > & | sturm_fun, |
const polynomial< data__ > & | f | ||
) |