FieldResidual

Struct FieldResidual 

Source
pub struct FieldResidual {
    waves: WaveSet,
    points: Vec<[f64; 3]>,
    coefficients: Vec<Complex>,
}
Expand description

What field saves for its pullback: the wave set, the points and the coefficients. Its size grows with the samples plus the modes, not their product.

Fields§

§waves: WaveSet§points: Vec<[f64; 3]>§coefficients: Vec<Complex>

Implementations§

Source§

impl FieldResidual

Source

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

Saved-state byte count determined solely by the input dimensions and wave family, independent of material values or derivative directions.

Source

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

Samples and Cartesian components: the shape of the field array.

Source

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

Number of mode coefficients and expansion centres in the input.

Source

pub fn pushforward( &self, coefficients: &[Complex], points: &[[f64; 3]], positions: &[[f64; 3]], ks: [Complex; 2], ) -> Result<Vec<[Complex; 3]>>

Field tangent in one direction of coefficients, sample points, expansion centres and medium wavenumbers. Each sample reuses the primal wave caches.

Source

pub fn pushforward_axial( &self, coefficients: &[Complex], points: &[[f64; 3]], positions: &[[f64; 3]], ks: [Complex; 2], kz: &[f64], ) -> Result<Vec<[Complex; 3]>>

Self::pushforward with an axial-wavenumber tangent per cylindrical mode.

Source

fn pushforward_impl<const N: usize>( &self, coefficients: &[Complex], tangent: GeometryTangent<'_>, ) -> Result<Vec<[Complex; 3]>>

Source

pub fn pullback(&self, cotangent: &[[Complex; 3]]) -> Result<FieldGradient>

Input gradients from cotangent, the gradient of a real loss with respect to the field, one Cartesian vector per sample. The waves are evaluated again per sample; no dense Jacobian is stored.

Each point gradient comes from its own sample only. The coefficient, position and wavenumber gradients add in chunks of consecutive samples fixed by the sample count, and the chunk sums in chunk order (numerics::parallel::try_fold_ordered), so the thread count does not change them.

Source

pub fn pullback_axial( &self, cotangent: &[[Complex; 3]], ) -> Result<(FieldGradient, Vec<f64>)>

Self::pullback plus a real axial-wavenumber gradient for each mode of a cylindrical basis; the axial gradients add their chunk sums the same way.

Source

fn pullback_impl<const N: usize>( &self, cotangent: &[[Complex; 3]], ) -> Result<(FieldGradient, Vec<f64>)>

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,