pub struct LatticeExpansionResidual {
destination: Basis,
source: Basis,
ks: [Complex; 2],
lattice: BlochLattice,
eta: Complex,
helicity: bool,
blocks: Vec<Block>,
}Expand description
What lattice_expansion saves for its pullback: the bases, the wavenumbers, the
lattice, the split and the blocks, whose angular plans every position pair shares.
The pullback evaluates bounded batches of blocks in parallel and adds their gradients in block and harmonic order, so the thread count does not change it.
Fields§
§destination: Basis§source: Basis§ks: [Complex; 2]§lattice: BlochLattice§eta: Complex§helicity: bool§blocks: Vec<Block>Implementations§
Source§impl LatticeExpansionResidual
impl LatticeExpansionResidual
Sourcepub fn pushforward(
&self,
destination: &[[f64; 3]],
source: &[[f64; 3]],
ks: [Complex; 2],
kpar: &[f64],
vectors: &DMatrix<f64>,
) -> Result<DMatrix<Complex>>
pub fn pushforward( &self, destination: &[[f64; 3]], source: &[[f64; 3]], ks: [Complex; 2], kpar: &[f64], vectors: &DMatrix<f64>, ) -> Result<DMatrix<Complex>>
Directional derivative in destination/source positions, medium wavenumbers, Bloch wavevector and lattice vectors. The Ewald split remains fixed.
Trait Implementations§
Source§impl Debug for LatticeExpansionResidual
impl Debug for LatticeExpansionResidual
Auto Trait Implementations§
impl Freeze for LatticeExpansionResidual
impl RefUnwindSafe for LatticeExpansionResidual
impl Send for LatticeExpansionResidual
impl Sync for LatticeExpansionResidual
impl Unpin for LatticeExpansionResidual
impl UnwindSafe for LatticeExpansionResidual
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> 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 more§impl<T> Pointable for T
impl<T> Pointable 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.