pub struct IrDlrTransform { /* private fields */ }Expand description
Linear map between the coefficients of an IR basis and of a DLR on the same domain.
The DLR basis function of pole ω_i is expanded in the IR basis as
u_i = Σ_l T[l, i] U_l with T[l, i] = -s_l V_l(ω_i) (w_i / w^{IR}_i),
where w_i and w^{IR}_i are the pole weights of the DLR and of the IR
kernel. DLR -> IR applies T; IR -> DLR is its least-squares inverse.
Implementations§
Source§impl IrDlrTransform
impl IrDlrTransform
Sourcepub fn matrix(&self) -> &TypedTensor<f64, Rank<2>>
pub fn matrix(&self) -> &TypedTensor<f64, Rank<2>>
The ir_size x dlr_size matrix T mapping DLR to IR coefficients.
Sourcepub fn ir_to_dlr_nd<T>(
&self,
backend: Option<&GemmBackendHandle>,
gl: &TypedTensor<T>,
dim: usize,
) -> Result<TypedTensor<T>, Error>where
T: FitScalar,
pub fn ir_to_dlr_nd<T>(
&self,
backend: Option<&GemmBackendHandle>,
gl: &TypedTensor<T>,
dim: usize,
) -> Result<TypedTensor<T>, Error>where
T: FitScalar,
IR -> DLR along axis dim (least squares).
§Errors
The errors of DiscreteLehmannRepresentation::from_ir_nd.
Sourcepub fn dlr_to_ir_nd<T>(
&self,
backend: Option<&GemmBackendHandle>,
g_dlr: &TypedTensor<T>,
dim: usize,
) -> Result<TypedTensor<T>, Error>where
T: FitScalar,
pub fn dlr_to_ir_nd<T>(
&self,
backend: Option<&GemmBackendHandle>,
g_dlr: &TypedTensor<T>,
dim: usize,
) -> Result<TypedTensor<T>, Error>where
T: FitScalar,
Auto Trait Implementations§
impl !Freeze for IrDlrTransform
impl !RefUnwindSafe for IrDlrTransform
impl !UnwindSafe for IrDlrTransform
impl Send for IrDlrTransform
impl Sync for IrDlrTransform
impl Unpin for IrDlrTransform
impl UnsafeUnpin for IrDlrTransform
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§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<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<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.