EigResidual

Struct EigResidual 

Source
pub struct EigResidual {
    values: Vec<Complex>,
    vectors: DMatrix<Complex>,
    pivots: Vec<usize>,
    scale: f64,
    vectors_lu: OnceLock<Result<Lu>>,
}
Expand description

What eig saves for its derivatives: the right eigensystem, with unit vectors whose largest component is real and positive.

Fields§

§values: Vec<Complex>§vectors: DMatrix<Complex>§pivots: Vec<usize>§scale: f64§vectors_lu: OnceLock<Result<Lu>>

Factor the eigenvectors only when a derivative needs their inverse; every later direction and cotangent shares the same factors.

Implementations§

Source§

impl EigResidual

Source

pub fn state_size(n: usize) -> Result<usize>

Byte count for the native saved state of an n × n eigensystem.

Source§

impl EigResidual

Source

fn vectors_lu(&self) -> Result<&Lu>

Source

pub fn values(&self) -> &[Complex] ⓘ

The eigenvalues in the solver’s order, which the pullback reads.

Source

pub const fn vectors(&self) -> &DMatrix<Complex>

The right eigenvectors, one column per eigenvalue, which the pullback reads.

Source

fn tied_pivot(&self, column: usize) -> bool

Whether the phase pivot is tied with another largest component.

Source

fn eigenbasis_tangent( &self, operator: &DMatrix<Complex>, ) -> Result<DMatrix<Complex>>

Express the perturbation in the eigenbasis; its diagonal is the eigenvalue derivative and its off-diagonal entries determine eigenvectors.

Source

fn check_value_order(&self, weights: Option<&[Complex]>) -> Result<()>

An ordered spectrum switches modes when real parts cross. Only equal loss weights across a tied group make that change irrelevant.

Source

pub fn pushforward_values( &self, operator: &DMatrix<Complex>, ) -> Result<Vec<Complex>>

Eigenvalue tangents with no eigenvector phase constraint. Distinct real parts keep eigvals’ ordering fixed; tied phase pivots are supported.

Source

pub fn pullback_values(&self, values: &[Complex]) -> Result<DMatrix<Complex>>

Pullback of eigvals, allowing equal weights at ordering ties.

Source

pub fn pushforward( &self, operator: &DMatrix<Complex>, ) -> Result<(Vec<Complex>, DMatrix<Complex>)>

Eigenpair tangents with the same unit norm and real-positive pivot phase as the primal. Repeated eigenvalues and tied phase pivots have no pushforward of the complete eigenpair output. Use Self::pushforward_values when only eigenvalues are needed.

Source

pub fn pullback( &self, values: &[Complex], vectors: DMatrix<Complex>, ) -> Result<DMatrix<Complex>>

The operator gradient from the eigenvalue and eigenvector cotangents, with the phase of each vector fixed at its pivot.

Repeated eigenvalues support equal eigenvalue weights and zero vector cotangents within each repeated group. Individual modes there have no pullback.

Trait Implementations§

Source§

impl Debug for EigResidual

Source§

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

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

impl SavedState for EigResidual

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,