FieldResidual

Struct FieldResidual 

Source
pub struct FieldResidual {
    pub(super) vectors: Vec<[Complex; 3]>,
    pub(super) polarizations: Vec<u8>,
    pub(super) points: Vec<[f64; 3]>,
    pub(super) coefficients: Option<Vec<Complex>>,
    pub(super) helicity: bool,
    pub(super) fixed_vectors: bool,
}
Expand description

What field saves for its pullback: its inputs, for weighted fields or for the matrix that samples every mode.

The pullback splits the longer of the point and mode axes into at most 32 blocks, fixed by the shape, as PhasesResidual::pullback does. Each block writes the gradients of its own points or modes and a partial sum of the gradients of the other axis, and the partial sums add in block order; a mode’s polarization pulls back once, from its total over all points. The blocks run in parallel from 4096 points times modes (PARALLEL_ENTRIES), and in the same order on the calling thread below, so the thread count does not change the result.

Fields§

§vectors: Vec<[Complex; 3]>§polarizations: Vec<u8>§points: Vec<[f64; 3]>§coefficients: Option<Vec<Complex>>§helicity: bool§fixed_vectors: bool

Implementations§

Source§

impl FieldResidual

Source

pub fn coefficient_count(&self) -> usize

Number of weighted amplitudes, or zero for a field operator.

Source

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

Flattened output dimensions (3 * samples, modes or one weighted column).

Source

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

Validate amplitude, sample-point and wavevector tangents. An operator takes an empty amplitude tangent because it has no amplitude input.

Source

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

Push one direction through the amplitudes, phases and polarizations. Each mode’s polarization derivative is contracted once and reused at every point.

Source

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

Gradients for a cotangent of the field’s shape. The pullback recomputes the polarization and phase derivatives instead of storing a dense field Jacobian.

Source

fn mode(&self, j: usize, variable: bool) -> Result<ModeTerms>

The wavevector, polarization jet and amplitude of plane mode j.

Source

fn rows<'c>( &self, cotangent: &'c DMatrix<Complex>, j: usize, ) -> &'c [[Complex; 3]]

The three Cartesian cotangents of each sample, contiguous in the cotangent column of mode j, or in the one column of a weighted field.

Source

fn contract( &self, mode: &ModeTerms, points: &[[f64; 3]], rows: &[[Complex; 3]], point_gradients: &mut [[f64; 3]], sums: &mut ModeSums, )

Add the terms of mode at points, whose cotangents are rows, to the point gradients point_gradients and to the mode’s sums, in point order.

Source

fn finish( &self, mode: &ModeTerms, sums: &ModeSums, coefficient: Option<&mut Complex>, vector: &mut [Complex; 3], )

Write the amplitude gradient coefficient (none for an operator) and the wavevector gradient vector of mode from its sums over all points.

Source§

impl FieldResidual

Source

pub fn state_size(points: usize, modes: usize, weighted: bool) -> Result<usize>

Byte count for plane fields; weighted fields retain one amplitude per mode.

Trait Implementations§

Source§

impl Debug for FieldResidual

Source§

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

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

impl SavedState for FieldResidual

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,