compute the heat capacity and average energies from the energy levels of a nested sampling run
Parameters : | energies: nparray of floats
nreplicas : int npar : int
ndof : int
Tmin, Tmax : float
nT : int
live_replicas : bool
|
---|---|
Returns : | T : array of temperatures Cv : array of heat capacities (including the momentum degrees of freedom) U : the mean energy U : the mean of the (energy squared) |
Bases: object
Methods
Cv_singles | |
__call__ | |
jack_Cv_averages | |
jack_Cv_moments | |
jack_Cv_stdev | |
jack_E_averages | |
split_energies | |
split_energies_block | |
split_energies_randomly |
returns the M(=self.nsubsets) Cv Jackknife averages (from the combined subsets)
returns the stdev associated with the heat capacity, it calculates the variance of the Jackknife estimate and then from this finds the standard deviation of the heat capacity estimate obtained from the sample average
returns the stdev calculated by jackknifing
Bases: object
Methods
Cv_moments | |
Cv_singles | |
Cv_stdev | |
__call__ | |
jack_Cv_averages | |
jack_alpha_averages | |
make_random_alpha_list | |
sample_alphas |
Bases: dict
Represents the optimization result.
Notes
There may be additional attributes not listed above depending of the specific solver. Since this class is essentially a subclass of dict with attribute accessors, one can see which attributes are available using the keys() method.
Attributes
x | (ndarray) The solution of the optimization. |
success | (bool) Whether or not the optimizer exited successfully. |
status | (int) Termination status of the optimizer. Its value depends on the underlying solver. Refer to message for details. |
message | (str) Description of the cause of the termination. |
fun, jac, hess | (ndarray) Values of objective function, Jacobian and Hessian (if available). |
nfev, njev, nhev | (int) Number of evaluations of the objective functions and of its Jacobian and Hessian. |
nit | (int) Number of iterations performed by the optimizer. |
maxcv | (float) The maximum constraint violation. |
Methods
clear(() -> None. Remove all items from D.) | |
copy(() -> a shallow copy of D) | |
fromkeys(...) | v defaults to None. |
get((k[,d]) -> D[k] if k in D, ...) | |
has_key((k) -> True if D has a key k, else False) | |
items(() -> list of D’s (key, value) pairs, ...) | |
iteritems(() -> an iterator over the (key, ...) | |
iterkeys(() -> an iterator over the keys of D) | |
itervalues(...) | |
keys(() -> list of D’s keys) | |
pop((k[,d]) -> v, ...) | If key is not found, d is returned if given, otherwise KeyError is raised |
popitem(() -> (k, v), ...) | 2-tuple; but raise KeyError if D is empty. |
setdefault((k[,d]) -> D.get(k,d), ...) | |
update(([E, ...) | If E present and has a .keys() method, does: for k in E: D[k] = E[k] |
values(() -> list of D’s values) | |
viewitems(...) | |
viewkeys(...) | |
viewvalues(...) |