pub struct GeneralizedSchurDecomposition<R: Runtime> {
pub q: Tensor<R>,
pub z: Tensor<R>,
pub s: Tensor<R>,
pub t: Tensor<R>,
pub eigenvalues_real: Tensor<R>,
pub eigenvalues_imag: Tensor<R>,
}Expand description
Generalized Schur (QZ) decomposition result: A = Q @ S @ Z^H, B = Q @ T @ Z^H
For a pair of matrices (A, B), the QZ decomposition factors them as:
- A = Q @ S @ Z^H
- B = Q @ T @ Z^H
where Q and Z are unitary, S is upper quasi-triangular, and T is upper triangular.
§Generalized Eigenvalues
The generalized eigenvalues λ satisfy det(A - λB) = 0 and are computed as
the ratios of diagonal elements: λ_i = S[i,i] / T[i,i] (when T[i,i] ≠ 0).
When T[i,i] = 0, the eigenvalue is infinite.
§Use Cases
- Generalized eigenvalue problems: Av = λBv
- Control theory: descriptor systems
- Stability analysis of matrix pencils
Fields§
§q: Tensor<R>Left unitary matrix Q [n, n]
z: Tensor<R>Right unitary matrix Z [n, n]
s: Tensor<R>Upper quasi-triangular matrix S (from A) [n, n]
t: Tensor<R>Upper triangular matrix T (from B) [n, n]
eigenvalues_real: Tensor<R>Real parts of generalized eigenvalues [n]
eigenvalues_imag: Tensor<R>Imaginary parts of generalized eigenvalues [n]
Auto Trait Implementations§
impl<R> Freeze for GeneralizedSchurDecomposition<R>
impl<R> RefUnwindSafe for GeneralizedSchurDecomposition<R>
impl<R> Send for GeneralizedSchurDecomposition<R>
impl<R> Sync for GeneralizedSchurDecomposition<R>
impl<R> Unpin for GeneralizedSchurDecomposition<R>
impl<R> UnsafeUnpin for GeneralizedSchurDecomposition<R>
impl<R> UnwindSafe for GeneralizedSchurDecomposition<R>
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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 moreSource§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.