ExpansionResidual

Struct ExpansionResidual 

Source
pub struct ExpansionResidual {
    destination: Basis,
    source: Basis,
    ks: [Complex; 2],
    radial: Radial,
    couplings: Couplings,
}
Expand description

What expansion saves for its pullback: the bases, the wavenumbers, the radial kind and the distinct couplings.

Equal axial wavenumbers select the coupled entries, and the pullback holds that selection fixed.

The pullback evaluates the coefficients in parallel and adds their gradients in request order, so its result does not depend on the thread count.

Fields§

§destination: Basis§source: Basis§ks: [Complex; 2]§radial: Radial§couplings: Couplings

Implementations§

Source§

impl ExpansionResidual

Source

fn prepare( destination: Basis, source: Basis, ks: [Complex; 2], radial: Radial, ) -> Result<Self>

Source

pub fn state_size( destination_modes: usize, destination_positions: usize, source_modes: usize, source_positions: usize, ) -> Result<usize>

Fixed saved-state bytes for the two basis shapes.

Source

pub(crate) fn write_state(&self, writer: &mut Writer)

Append state for a containing residual without an intermediate buffer.

Source

pub fn shape(&self) -> (usize, usize)

Destination and source mode counts: the shape of the expansion matrix.

Source

pub fn pushforward( &self, destination: &[[f64; 3]], source: &[[f64; 3]], ks: [Complex; 2], ) -> Result<DMatrix<Complex>>

Directional derivative with fixed axial mode labels.

Source

pub fn pushforward_axial( &self, destination: &[[f64; 3]], source: &[[f64; 3]], ks: [Complex; 2], kz: &[f64], ) -> Result<DMatrix<Complex>>

Also perturb the sorted distinct shared axial wavenumbers, holding their equality partitions fixed.

Source

fn pushforward_impl( &self, destination: &[[f64; 3]], source: &[[f64; 3]], ks: [Complex; 2], kz: Option<&[f64]>, ) -> Result<DMatrix<Complex>>

Source

pub fn pullback( &self, cotangent: &DMatrix<Complex>, ) -> Result<ExpansionGradient>

Position and complex wavenumber gradients. Axial mode labels stay fixed.

Source

pub fn pullback_axial( &self, cotangent: &DMatrix<Complex>, ) -> Result<(ExpansionGradient, Vec<f64>)>

Also differentiate each shared axial wavenumber. The final array follows the sorted distinct kz values from both bases; equality partitions stay fixed.

Source

fn translation(&self, (i, j): (usize, usize)) -> Result<CartesianTranslation>

The translation coefficient and derivatives of request (i, j).

Source

fn pullback_impl<const AXIAL: bool>( &self, cotangent: &DMatrix<Complex>, ) -> Result<(ExpansionGradient, Vec<f64>)>

Trait Implementations§

Source§

impl Debug for ExpansionResidual

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl SavedState for ExpansionResidual

Source§

fn save_state(&self) -> Result<Vec<u8>>

Copy the saved numerical state into its fixed byte layout.
Source§

fn from_state(bytes: &[u8]) -> Result<Self>

Restore numerical state from bytes produced by this extension.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,