PhasesResidual

Struct PhasesResidual 

Source
pub struct PhasesResidual {
    pub(super) points: Vec<[f64; 3]>,
    pub(super) vectors: Vec<[Complex; 3]>,
}
Expand description

What phases saves for its pullback: the points and the wavevectors, without the phases of every point and mode.

Fields§

§points: Vec<[f64; 3]>§vectors: Vec<[Complex; 3]>

Implementations§

Source§

impl PhasesResidual

Source

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

Number of displacements and wavevectors.

Source

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

Validate point and wavevector tangents for the recorded operation.

Source

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

Differentiate each phase in one input direction without constructing a Jacobian.

Source

pub fn pullback<S: Storage<Complex, Dyn, Dyn> + Sync>( &self, cotangent: &Matrix<Complex, Dyn, Dyn, S>, ) -> Result<PhasesGradient>

Recompute each phase once and add its terms to the point and wavevector gradients.

The longer axis is split into at most 32 blocks, fixed by the shape, that run in parallel; each block sums its own rows (or columns) in index order and a partial gradient of the shorter axis, and the partials are added in block order. The result is deterministic and the scratch is at most 32 gradients of the shorter axis.

Source§

impl PhasesResidual

Source

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

Byte count for phases at points sample points and modes plane waves.

Trait Implementations§

Source§

impl Debug for PhasesResidual

Source§

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

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

impl SavedState for PhasesResidual

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,