CYCLUS
|
Classes | |
class | Cascade |
class | EnrichmentInfiniteLoopError |
class | EnrichmentIterationLimit |
class | EnrichmentIterationNaN |
Functions | |||||||||
Cascade | _fill_default_uranium_cascade () | ||||||||
double | alphastar_i (double alpha, double Mstar, double M_i) | ||||||||
double | feed_per_prod (double x_feed, double x_prod, double x_tail) | ||||||||
double | feed_per_tail (double x_feed, double x_prod, double x_tail) | ||||||||
double | prod_per_feed (double x_feed, double x_prod, double x_tail) | ||||||||
double | prod_per_tail (double x_feed, double x_prod, double x_tail) | ||||||||
Cascade | solve_symbolic (Cascade &orig_casc) | ||||||||
double | swu_per_feed (double x_feed, double x_prod, double x_tail) | ||||||||
double | swu_per_prod (double x_feed, double x_prod, double x_tail) | ||||||||
double | swu_per_tail (double x_feed, double x_prod, double x_tail) | ||||||||
double | tail_per_feed (double x_feed, double x_prod, double x_tail) | ||||||||
double | tail_per_prod (double x_feed, double x_prod, double x_tail) | ||||||||
double | value_func (double x) | ||||||||
Cascade | solve_numeric (Cascade &orig_casc, double tolerance=1.0E-7, int max_iter=100) | ||||||||
void | _recompute_nm (Cascade &casc, double tolerance=1.0E-7) | ||||||||
void | _recompute_prod_tail_mats (Cascade &casc) | ||||||||
Cascade | _norm_comp_secant (Cascade &casc, double tolerance=1.0E-7, int max_iter=100) | ||||||||
double | _deltaU_i_OverG (Cascade &casc, int i) | ||||||||
Multicomponent Functions | |||||||||
Finds a value of Mstar by minimzing the seperative power. Note that Mstar on orig_casc represents an intial guess at what Mstar might be. This is the final function that actually solves for an optimized M* that makes the cascade!
| |||||||||
Cascade | multicomponent (Cascade &orig_casc, char *solver, double tolerance=1.0E-7, int max_iter=100) | ||||||||
Cascade | multicomponent (Cascade &orig_casc, std::string solver="symbolic", double tolerance=1.0E-7, int max_iter=100) | ||||||||
Variables | |
Cascade | default_uranium_cascade |
Enrichment Component Class and Functions.
double pyne::enrichment::_deltaU_i_OverG | ( | pyne_enr::Cascade & | casc, |
int | i ) |
Solves for a stage separative power relevant to the ith component per unit of flow G.
This is taken from Equation 31 divided by G from the paper "Wood, Houston G., Borisevich, V. D. and Sulaberidze, G. A., 'On a Criterion Efficiency for Multi-Isotope Mixtures Separation', Separation Science and Technology, 34:3, 343 - 357" To link to this article: DOI: 10.1081/SS-100100654 URL: http://dx.doi.org/10.1081/SS-100100654
casc | Input cascade. |
i | nuclide in id form. |
pyne_enr::Cascade pyne::enrichment::_fill_default_uranium_cascade | ( | ) |
pyne_enr::Cascade pyne::enrichment::_norm_comp_secant | ( | pyne_enr::Cascade & | casc, |
double | tolerance = 1.0E-7, | ||
int | max_iter = 100 ) |
This function solves the whole system of equations.
It uses _recompute_prod_tail_mats() to find the roots for the enriching and stripping stage numbers. It then checks to see if the product and waste streams meet their target enrichments for the jth component like they should. If they don't then it trys other values of N and M varied by the Secant method.
casc | Input cascade. |
tolerance | Maximum numerical error allowed in L/F, N, and M. |
max_iter | Maximum number of iterations for to perform. |
void pyne::enrichment::_recompute_nm | ( | pyne_enr::Cascade & | casc, |
double | tolerance = 1.0E-7 ) |
void pyne::enrichment::_recompute_prod_tail_mats | ( | pyne_enr::Cascade & | casc | ) |
This function takes a given initial guess number of enriching and stripping stages for a given composition of fuel with a given jth key component, knowing the values that are desired in both Product and Tails streams.
Having this it solves for what the actual N and M stage numbers are and also what the product and waste streams compositions are.
casc | Cascade instance, modified in-place. |
double pyne::enrichment::alphastar_i | ( | double | alpha, |
double | Mstar, | ||
double | M_i ) |
double pyne::enrichment::feed_per_prod | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
double pyne::enrichment::feed_per_tail | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
pyne_enr::Cascade pyne::enrichment::multicomponent | ( | pyne_enr::Cascade & | orig_casc, |
char * | solver, | ||
double | tolerance = 1.0E-7, | ||
int | max_iter = 100 ) |
pyne_enr::Cascade pyne::enrichment::multicomponent | ( | pyne_enr::Cascade & | orig_casc, |
std::string | solver = "symbolic", | ||
double | tolerance = 1.0E-7, | ||
int | max_iter = 100 ) |
double pyne::enrichment::prod_per_feed | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
double pyne::enrichment::prod_per_tail | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
pyne_enr::Cascade pyne::enrichment::solve_numeric | ( | pyne_enr::Cascade & | orig_casc, |
double | tolerance = 1.0E-7, | ||
int | max_iter = 100 ) |
Finds the total flow rate (L) over the feed flow rate (F), the number of enriching stages (N), and the number of stripping stages (M).
Numeric Solver Functions
These functions enable the numeric cascade solver.
orig_casc | Original input cascade. |
tolerance | Maximum numerical error allowed in L/F, N, and M. |
max_iter | Maximum number of iterations for to perform. |
pyne::enrichment::Cascade pyne::enrichment::solve_symbolic | ( | Cascade & | orig_casc | ) |
double pyne::enrichment::swu_per_feed | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
double pyne::enrichment::swu_per_prod | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
double pyne::enrichment::swu_per_tail | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
double pyne::enrichment::tail_per_feed | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
double pyne::enrichment::tail_per_prod | ( | double | x_feed, |
double | x_prod, | ||
double | x_tail ) |
double pyne::enrichment::value_func | ( | double | x | ) |
|
extern |
a cascade instance with default values for a uranium enrichment.