QmatResidual

Struct QmatResidual 

Source
pub struct QmatResidual {
    destination: Vec<Mode>,
    source: Vec<Mode>,
    surface: Surface,
    ks: [[Complex; 2]; 2],
    zs: [Complex; 2],
    radial: Radial,
    radial_area_factor: bool,
}
Expand description

What qmat saves for its pullback: the modes, the surface and the media, without any wave values; the pullback evaluates the waves again.

Fields§

§destination: Vec<Mode>§source: Vec<Mode>§surface: Surface§ks: [[Complex; 2]; 2]§zs: [Complex; 2]§radial: Radial§radial_area_factor: bool

Implementations§

Source§

impl QmatResidual

Source

fn validate(&self) -> Result<()>

Source

pub fn state_size( samples: usize, destinations: usize, sources: usize, ) -> Result<usize>

Bytes in the private callback state for the quadrature and mode counts.

Source

fn wave_sets(&self) -> Result<[WaveSet; 2]>

The inner test waves, whose orders are reversed, and the outer waves.

Source

fn weight(&self, node: usize) -> f64

Integration weight of a node: the quadrature weight, sin(theta) and, with radial_area_factor, the radius.

Source

fn measure(&self, node: usize) -> f64

The quadrature weight times sin(theta), which does not depend on the radius.

Source

fn rows_by_order(&self) -> HashMap<i32, Vec<usize>>

The rows of each azimuthal order; only equal orders couple.

Source

fn factors(&self) -> [[Complex; 2]; 2]

The impedance factor HELICITY[a] z_outer + HELICITY[b] z_inner of each (row helicity a, column helicity b) pair.

Source

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

Matrix shape, for binding-level cotangent validation.

Source

pub fn samples(&self) -> usize

Number of fixed quadrature nodes, for binding-level tangent validation.

Source

pub fn pushforward( &self, radii: &[f64], slopes: &[f64], ks: [[Complex; 2]; 2], zs: [Complex; 2], ) -> Result<DMatrix<Complex>>

Directional derivative with respect to the surface radii and slopes, wavenumbers and impedances. Quadrature nodes and weights stay fixed. Each wave’s local derivatives are contracted once per node, before the matrix entries are assembled, sharing the same cached waves as the pullback.

Source

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

Gradients of the surface radii and slopes, the wavenumbers and the impedances from cotangent, the gradient of a real loss with respect to the matrix. The quadrature nodes and weights stay fixed. The sums run over the nodes in order, so the gradients do not depend on the thread count.

Trait Implementations§

Source§

impl Debug for QmatResidual

Source§

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

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

impl SavedState for QmatResidual

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,