pub struct IterativeGradient {
pub cluster: SphereClusterGradient,
pub incident: DMatrix<Complex>,
pub convergence: Vec<Convergence>,
}Expand description
Gradients of an IterativeResidual, without a dense coupling matrix or its
gradient.
The fields follow the inputs: cluster holds the gradients of the arguments of
IterativeSphereCluster::new in their order (k0, radii, epsilon,
positions), then come those of the incident fields of
record and the convergence of the adjoint
solves.
Fields§
§cluster: SphereClusterGradientGradients of the vacuum wavenumber, radii, permittivities and positions.
incident: DMatrix<Complex>Gradient of the incident fields.
convergence: Vec<Convergence>Independent convergence certificates of the adjoint solves.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for IterativeGradient
impl RefUnwindSafe for IterativeGradient
impl Send for IterativeGradient
impl Sync for IterativeGradient
impl Unpin for IterativeGradient
impl UnwindSafe for IterativeGradient
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
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
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.