pub struct SymmetricTridiagonal<T: ComplexField, D: DimSub<U1>>{ /* private fields */ }
Expand description
Tridiagonalization of a symmetric matrix.
Implementations§
Source§impl<T: ComplexField, D: DimSub<U1>> SymmetricTridiagonal<T, D>
impl<T: ComplexField, D: DimSub<U1>> SymmetricTridiagonal<T, D>
Sourcepub fn new(m: OMatrix<T, D, D>) -> Self
pub fn new(m: OMatrix<T, D, D>) -> Self
Computes the tridiagonalization of the symmetric matrix m
.
Only the lower-triangular part (including the diagonal) of m
is read.
Sourcepub fn unpack(
self,
) -> (OMatrix<T, D, D>, OVector<T::RealField, D>, OVector<T::RealField, DimDiff<D, U1>>)
pub fn unpack( self, ) -> (OMatrix<T, D, D>, OVector<T::RealField, D>, OVector<T::RealField, DimDiff<D, U1>>)
Retrieve the orthogonal transformation, diagonal, and off diagonal elements of this decomposition.
Sourcepub fn unpack_tridiagonal(
self,
) -> (OVector<T::RealField, D>, OVector<T::RealField, DimDiff<D, U1>>)
pub fn unpack_tridiagonal( self, ) -> (OVector<T::RealField, D>, OVector<T::RealField, DimDiff<D, U1>>)
Retrieve the diagonal, and off diagonal elements of this decomposition.
Sourcepub fn diagonal(&self) -> OVector<T::RealField, D>where
DefaultAllocator: Allocator<D>,
pub fn diagonal(&self) -> OVector<T::RealField, D>where
DefaultAllocator: Allocator<D>,
The diagonal components of this decomposition.
Trait Implementations§
Source§impl<T: Clone + ComplexField, D: Clone + DimSub<U1>> Clone for SymmetricTridiagonal<T, D>
impl<T: Clone + ComplexField, D: Clone + DimSub<U1>> Clone for SymmetricTridiagonal<T, D>
Source§fn clone(&self) -> SymmetricTridiagonal<T, D>
fn clone(&self) -> SymmetricTridiagonal<T, D>
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl<T: Debug + ComplexField, D: Debug + DimSub<U1>> Debug for SymmetricTridiagonal<T, D>
impl<T: Debug + ComplexField, D: Debug + DimSub<U1>> Debug for SymmetricTridiagonal<T, D>
Source§impl<'de, T: ComplexField, D: DimSub<U1>> Deserialize<'de> for SymmetricTridiagonal<T, D>where
DefaultAllocator: Allocator<D, D> + Allocator<DimDiff<D, U1>>,
OMatrix<T, D, D>: Deserialize<'de>,
OVector<T, DimDiff<D, U1>>: Deserialize<'de>,
impl<'de, T: ComplexField, D: DimSub<U1>> Deserialize<'de> for SymmetricTridiagonal<T, D>where
DefaultAllocator: Allocator<D, D> + Allocator<DimDiff<D, U1>>,
OMatrix<T, D, D>: Deserialize<'de>,
OVector<T, DimDiff<D, U1>>: Deserialize<'de>,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<T: ComplexField, D: DimSub<U1>> Serialize for SymmetricTridiagonal<T, D>
impl<T: ComplexField, D: DimSub<U1>> Serialize for SymmetricTridiagonal<T, D>
impl<T: ComplexField, D: DimSub<U1>> Copy for SymmetricTridiagonal<T, D>
Auto Trait Implementations§
impl<T, D> !Freeze for SymmetricTridiagonal<T, D>
impl<T, D> !RefUnwindSafe for SymmetricTridiagonal<T, D>
impl<T, D> !Send for SymmetricTridiagonal<T, D>
impl<T, D> !Sync for SymmetricTridiagonal<T, D>
impl<T, D> !Unpin for SymmetricTridiagonal<T, D>
impl<T, D> !UnwindSafe for SymmetricTridiagonal<T, D>
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)Source§impl<F, W, T, D> Deserialize<With<T, W>, D> for F
impl<F, W, T, D> Deserialize<With<T, W>, D> for F
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>
Gets the layout of the type.
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.