pub struct LatticeExpansionResidual {
destination: Basis,
source: Basis,
ks: [Complex; 2],
lattice: BlochLattice,
eta: Complex,
couplings: Couplings,
}Expand description
What lattice_expansion saves for its pullback: the bases, the wavenumbers, the
lattice, the split and the distinct couplings.
Equal axial wavenumbers select the coupled entries, and the pullback holds that selection fixed.
The pullback evaluates the lattice-sum gradients in parallel and adds them in request order, so its result does not depend on the thread count.
Fields§
§destination: Basis§source: Basis§ks: [Complex; 2]§lattice: BlochLattice§eta: Complex§couplings: CouplingsImplementations§
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 positions, medium wavenumbers and lattice geometry.
Sourcepub fn pushforward_axial(
&self,
destination: &[[f64; 3]],
source: &[[f64; 3]],
ks: [Complex; 2],
kpar: &[f64],
vectors: &DMatrix<f64>,
axial: &[f64],
) -> Result<DMatrix<Complex>>
pub fn pushforward_axial( &self, destination: &[[f64; 3]], source: &[[f64; 3]], ks: [Complex; 2], kpar: &[f64], vectors: &DMatrix<f64>, axial: &[f64], ) -> Result<DMatrix<Complex>>
Also vary the sorted distinct shared axial wavenumbers, holding matching mode groups fixed.
fn pushforward_impl( &self, destination: &[[f64; 3]], source: &[[f64; 3]], ks: [Complex; 2], kpar: &[f64], vectors: &DMatrix<f64>, axial: Option<&[f64]>, ) -> Result<DMatrix<Complex>>
Sourcepub fn shape(&self) -> (usize, usize)
pub fn shape(&self) -> (usize, usize)
Destination and source mode counts: the shape of the coupling matrix.
Sourcefn geometry(&self, key: CouplingKey) -> (Complex, Complex, [f64; 3], Complex)
fn geometry(&self, key: CouplingKey) -> (Complex, Complex, [f64; 3], Complex)
The wavenumber, the transverse wavenumber, the source-to-destination
displacement r and the axial phase exp(-i kz r_z) of a request.
Sourcepub fn pullback(
&self,
cotangent: &DMatrix<Complex>,
) -> Result<LatticeExpansionGradient>
pub fn pullback( &self, cotangent: &DMatrix<Complex>, ) -> Result<LatticeExpansionGradient>
Differentiate positions, medium wavenumbers and lattice geometry.
Sourcepub fn pullback_axial(
&self,
cotangent: &DMatrix<Complex>,
) -> Result<(LatticeExpansionGradient, Vec<f64>)>
pub fn pullback_axial( &self, cotangent: &DMatrix<Complex>, ) -> Result<(LatticeExpansionGradient, Vec<f64>)>
Also differentiate sorted distinct axial wavenumbers with matching groups fixed.
fn pullback_impl<const AXIAL: bool>( &self, cotangent: &DMatrix<Complex>, ) -> Result<(LatticeExpansionGradient, Vec<f64>)>
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
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>
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>
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>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.