Struct rust_pathtracer::prelude::Hessenberg
source · pub struct Hessenberg<T, D>where
T: ComplexField,
D: DimSub<Const<1>>,
DefaultAllocator: Allocator<T, D, D> + Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>,{ /* 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<T, D, D> + Allocator<T, D, Const<1>> + Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>,
impl<T, D> Hessenberg<T, D>where T: ComplexField, D: DimSub<Const<1>>, DefaultAllocator: Allocator<T, D, D> + Allocator<T, D, Const<1>> + Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>,
sourcepub fn new(
hess: Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>
) -> Hessenberg<T, D>
pub fn new( hess: Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer> ) -> Hessenberg<T, D>
Computes the Hessenberg decomposition using householder reflections.
sourcepub fn new_with_workspace(
hess: Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>,
work: &mut Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<T, D, Const<1>>>::Buffer>
) -> Hessenberg<T, D>
pub fn new_with_workspace( hess: Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>, work: &mut Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<T, D, Const<1>>>::Buffer> ) -> 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<T, D, D>>::Buffer>, Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>)
pub fn unpack( self ) -> (Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>, Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>)
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<T, D, D>>::Buffer>
pub fn unpack_h( self ) -> Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>
Retrieves the upper trapezoidal submatrix H of this decomposition.
Trait Implementations§
source§impl<T, D> Clone for Hessenberg<T, D>where
T: Clone + ComplexField,
D: Clone + DimSub<Const<1>>,
DefaultAllocator: Allocator<T, D, D> + Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>,
impl<T, D> Clone for Hessenberg<T, D>where T: Clone + ComplexField, D: Clone + DimSub<Const<1>>, DefaultAllocator: Allocator<T, D, D> + Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>,
source§fn clone(&self) -> Hessenberg<T, D>
fn clone(&self) -> Hessenberg<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, D> Debug for Hessenberg<T, D>where
T: Debug + ComplexField,
D: Debug + DimSub<Const<1>>,
DefaultAllocator: Allocator<T, D, D> + Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>,
impl<T, D> Debug for Hessenberg<T, D>where T: Debug + ComplexField, D: Debug + DimSub<Const<1>>, DefaultAllocator: Allocator<T, D, D> + Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>,
impl<T, D> Copy for Hessenberg<T, D>where T: ComplexField, D: DimSub<Const<1>>, DefaultAllocator: Allocator<T, D, D> + Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>, Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>: Copy, Matrix<T, <D as DimSub<Const<1>>>::Output, Const<1>, <DefaultAllocator as Allocator<T, <D as DimSub<Const<1>>>::Output, Const<1>>>::Buffer>: Copy,
Auto Trait Implementations§
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§
§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.