Trait net_ensembles::sampling::HistogramPartition [−][src]
pub trait HistogramPartition {
fn overlapping_partition(
&self,
n: usize,
overlap: usize
) -> Result<Vec<Self, Global>, HistErrors>;
}
Expand description
Your Interval is to large to sample in a resonable amound of time? No problem
In WangLandau or EntropicSampling, you can split your interval in smaller, overlapping intervals and “glue” them together later on
Required methods
fn overlapping_partition(
&self,
n: usize,
overlap: usize
) -> Result<Vec<Self, Global>, HistErrors>
fn overlapping_partition(
&self,
n: usize,
overlap: usize
) -> Result<Vec<Self, Global>, HistErrors>
partition the interval
- returns Vector of
n
histograms, that together
parameter
n
number of resulting intervalsoverlap
How much overlap should there be?
To understand overlap
, we have to look at the formula for the i_th interval in the result vector:
let left
be the left border of self
and right
be the right border of self
- left border of interval i = left + i * (right - left) / (n + overlap)
- right border of interval i = left + (i + overlap) * (right - left) / (n + overlap)