ExpansionResidual

Struct ExpansionResidual 

Source
pub struct ExpansionResidual {
    pub(super) basis: MultipoleBasis,
    pub(super) vectors: Vec<[Complex; 3]>,
    pub(super) polarizations: Vec<u8>,
    pub(super) helicity: bool,
    pub(super) fixed_vectors: bool,
}
Expand description

What expansion saves for its pullback: its inputs. The pullback recomputes the coefficients instead of keeping a Jacobian.

The pullback adds the per-mode position gradients in chunks of consecutive plane modes fixed by the mode count, and the chunk sums in chunk order (numerics::parallel::try_fold_ordered), so the thread count does not change them. Each wavevector gradient belongs to one plane mode, which writes it in place.

Fields§

§basis: MultipoleBasis§vectors: Vec<[Complex; 3]>§polarizations: Vec<u8>§helicity: bool§fixed_vectors: bool

Implementations§

Source§

impl ExpansionResidual

Source

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

Multipole output and plane input mode counts.

Source

pub fn validate_tangents( &self, positions: &[[f64; 3]], vectors: &[[Complex; 3]], ) -> Result<()>

Validate position and wavevector tangents for the recorded operation.

Source

pub fn pushforward( &self, positions: &[[f64; 3]], vectors: &[[Complex; 3]], ) -> Result<DMatrix<Complex>>

Push a direction through the position phases and angular coefficients. Cylindrical axial components remain fixed mode labels, as in the pullback.

Source

fn push_column<const N: usize>( &self, labels: &AngularLabels, j: usize, direction: &Direction<N>, positions: &[[f64; 3]], vectors: &[[Complex; 3]], column: &mut [Complex], )

Evaluate and contract the same angular jets used by the reverse contraction.

Source

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

Differentiate position phases and the full direction-dependent angular coefficient.

Source

fn contract<const N: usize>( &self, labels: &AngularLabels, j: usize, direction: &Direction<N>, cotangent: &DMatrix<Complex>, positions: &mut [[f64; 3]], vector_gradient: &mut [Complex; 3], )

Add the gradients of column j to the position gradients positions and, with direction derivatives (N > 0), to its wavevector gradient vector_gradient.

Source§

impl ExpansionResidual

Source

pub fn state_size( multipoles: usize, positions: usize, modes: usize, cylindrical: bool, ) -> Result<usize>

Byte count for expansion into a spherical or cylindrical multipole basis.

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,