IterativeResidual

Struct IterativeResidual 

Source
pub struct IterativeResidual {
    operator: Arc<IterativeSphereCluster>,
    incident: DMatrix<Complex>,
    options: GmresOptions,
    solution: IterativeSolution,
}
Expand description

What IterativeSphereCluster::record saves for its pullback: the shared cluster, the incident fields, the GMRES options and the solution.

Fields§

§operator: Arc<IterativeSphereCluster>§incident: DMatrix<Complex>§options: GmresOptions§solution: IterativeSolution

Implementations§

Source§

impl IterativeResidual

Source

pub fn state_size(lmax: u32, particles: usize, columns: usize) -> Result<usize>

Callback-state bytes for an illumination with these static dimensions. The layout keeps geometry, Mie residuals, solver options, incident and scattered columns, and the primal convergence certificates.

Source§

impl IterativeResidual

Source

pub const fn solution(&self) -> &IterativeSolution

The forward solution and its convergence certificates; the pullback reads the solution.

Source

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

The shape of the solution: local multipoles and incident columns.

Source

pub fn particles(&self) -> usize

Number of particles, for binding-level tangent validation.

Source

fn response(&self) -> Result<DMatrix<Complex>>

The exciting field B + C X, shared by both derivative directions. Reuse the coupling action’s output allocation without copying saved incident data.

Source

pub fn pushforward( &self, k0: f64, radii: &[f64], epsilon: &[Complex], positions: &[[f64; 3]], incident: &DMatrix<Complex>, ) -> Result<IterativeSolution>

Differentiate the converged equation, retaining the matrix-free operator: (I - T C) dX = dT (B + C X) + T (dB + dC X).

Tangent and adjoint solves use relative-only convergence: the primal rtol, or the default 1e-10 if it was zero. The primal atol applies only to the primal solve, so small directions retain their relative accuracy. Restart and iteration limits are unchanged, and each solve returns an independent residual certificate. No Krylov history is retained or differentiated.

Source

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

Gradients of the cluster and the incident fields from cotangent, the gradient of a real loss with respect to the solution.

One adjoint GMRES solve per column gives Y = (I - T C)⁻ᴴ G; each particle pair then contributes to the position and k0 gradients. Those contributions add in chunks of particles fixed by the particle count, and the chunk sums in chunk order; the radius and permittivity gradients add in particle order. The thread count changes none of the gradients. Convergence follows the same relative-only policy as Self::pushforward.

Trait Implementations§

Source§

impl Debug for IterativeResidual

Source§

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

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

impl SavedState for IterativeResidual

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,