#[non_exhaustive]pub enum MatsubaraPointMethod {
SignChanges,
PairSelection,
}Expand description
How the Matsubara sampling points of a basis are chosen
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
SignChanges
The sign changes of the first function beyond the basis, as in SparseIR.jl and libsparseir: the default for functions with a definite parity (centrosymmetric kernels), which only they have.
PairSelection
A set symmetric in ±n, selected in pairs by an interpolative
decomposition (pivoted QR of the rows Re û(n), Im û(n), as Kaye,
Chen and Parcollet do for the DLR, Phys. Rev. B 105, 235115 (2022)):
the only method, and so the default, for functions without a parity
(e.g. LogisticKernelWindowed); available for the others on
request.
Trait Implementations§
Source§impl Clone for MatsubaraPointMethod
impl Clone for MatsubaraPointMethod
Source§fn clone(&self) -> MatsubaraPointMethod
fn clone(&self) -> MatsubaraPointMethod
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 moreimpl Copy for MatsubaraPointMethod
Source§impl Debug for MatsubaraPointMethod
impl Debug for MatsubaraPointMethod
impl Eq for MatsubaraPointMethod
Source§impl PartialEq for MatsubaraPointMethod
impl PartialEq for MatsubaraPointMethod
impl StructuralPartialEq for MatsubaraPointMethod
Auto Trait Implementations§
impl Freeze for MatsubaraPointMethod
impl RefUnwindSafe for MatsubaraPointMethod
impl Send for MatsubaraPointMethod
impl Sync for MatsubaraPointMethod
impl Unpin for MatsubaraPointMethod
impl UnsafeUnpin for MatsubaraPointMethod
impl UnwindSafe for MatsubaraPointMethod
Blanket Implementations§
impl<T> Boilerplate for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.impl<T, U> Imply<T> for U
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 moreimpl<T> MaybeSend for Twhere
T: Send,
impl<T> MaybeSendSync for T
impl<T> MaybeSync for Twhere
T: Sync,
§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.