pub enum Quadrature<const D: usize> {
Sobol {
num_points: usize,
seed: u64,
},
LatinHypercube {
num_points: usize,
seed: u64,
},
GaussLegendre {
points_per_axis: usize,
},
}Expand description
Quadrature scheme for discretising the prior integral into Q sample points.
Variants§
Sobol
Sobol low-discrepancy QMC on [0,1]^D, transformed to the prior support.
Convergence rate is O(log(N)^D / N) for smooth integrands — much
faster than Monte Carlo’s O(1/sqrt(N)).
Fields
LatinHypercube
Latin-Hypercube sampling — better tails than pure random, simpler than Sobol.
GaussLegendre
Gauss–Legendre tensor product over an axis-aligned box. The total point
count is points_per_axis^D. Exact on polynomials up to degree
2*points_per_axis - 1 along each axis. Only valid when the prior has
finite, axis-aligned support — i.e. Prior::Uniform (and effectively
Prior::Custom if you accept the bounding-box restriction).
Trait Implementations§
Source§impl<const D: usize> Clone for Quadrature<D>
impl<const D: usize> Clone for Quadrature<D>
Source§fn clone(&self) -> Quadrature<D>
fn clone(&self) -> Quadrature<D>
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl<const D: usize> Freeze for Quadrature<D>
impl<const D: usize> RefUnwindSafe for Quadrature<D>
impl<const D: usize> Send for Quadrature<D>
impl<const D: usize> Sync for Quadrature<D>
impl<const D: usize> Unpin for Quadrature<D>
impl<const D: usize> UnsafeUnpin for Quadrature<D>
impl<const D: usize> UnwindSafe for Quadrature<D>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.