pub struct Hessenberg<T, D>where
T: ComplexField,
D: DimSub<Const<1>>,
DefaultAllocator: Allocator<D, D> + Allocator<<D as DimSub<Const<1>>>::Output>,{ /* private fields */ }
Expand description
Hessenberg decomposition of a general matrix.
Implementations§
Source§impl<T, D> Hessenberg<T, D>where
T: ComplexField,
D: DimSub<Const<1>>,
DefaultAllocator: Allocator<D, D> + Allocator<D> + Allocator<<D as DimSub<Const<1>>>::Output>,
impl<T, D> Hessenberg<T, D>where
T: ComplexField,
D: DimSub<Const<1>>,
DefaultAllocator: Allocator<D, D> + Allocator<D> + Allocator<<D as DimSub<Const<1>>>::Output>,
Sourcepub fn new(
hess: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>,
) -> Hessenberg<T, D>
pub fn new( hess: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, ) -> Hessenberg<T, D>
Computes the Hessenberg decomposition using householder reflections.
Sourcepub fn new_with_workspace(
hess: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>,
work: &mut Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>,
) -> Hessenberg<T, D>
pub fn new_with_workspace( hess: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, work: &mut Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>, ) -> Hessenberg<T, D>
Computes the Hessenberg decomposition using householder reflections.
The workspace containing D
elements must be provided but its content does not have to be
initialized.
Sourcepub fn unpack(
self,
) -> (Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>)
pub fn unpack( self, ) -> (Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>)
Retrieves (q, h)
with q
the orthogonal matrix of this decomposition and h
the
hessenberg matrix.
Sourcepub fn unpack_h(
self,
) -> Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>
pub fn unpack_h( self, ) -> Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>
Retrieves the upper trapezoidal submatrix H
of this decomposition.
Trait Implementations§
Source§impl<T, D> Clone for Hessenberg<T, D>
impl<T, D> Clone for Hessenberg<T, D>
Source§fn clone(&self) -> Hessenberg<T, D>
fn clone(&self) -> Hessenberg<T, D>
Returns a duplicate 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, D> Debug for Hessenberg<T, D>
impl<T, D> Debug for Hessenberg<T, D>
impl<T, D> Copy for Hessenberg<T, D>where
T: ComplexField,
D: DimSub<Const<1>>,
DefaultAllocator: Allocator<D, D> + Allocator<<D as DimSub<Const<1>>>::Output>,
Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>: Copy,
Matrix<T, <D as DimSub<Const<1>>>::Output, Const<1>, <DefaultAllocator as Allocator<<D as DimSub<Const<1>>>::Output>>::Buffer<T>>: Copy,
Auto Trait Implementations§
impl<T, D> !Freeze for Hessenberg<T, D>
impl<T, D> !RefUnwindSafe for Hessenberg<T, D>
impl<T, D> !Send for Hessenberg<T, D>
impl<T, D> !Sync for Hessenberg<T, D>
impl<T, D> !Unpin for Hessenberg<T, D>
impl<T, D> !UnwindSafe for Hessenberg<T, D>
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.