[−][src]Struct cv::nalgebra::linalg::Hessenberg
Hessenberg decomposition of a general matrix.
Implementations
impl<N, D> Hessenberg<N, D> where
D: DimSub<U1>,
N: ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
[src]
D: DimSub<U1>,
N: ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
pub fn new(
hess: Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
) -> Hessenberg<N, D>
[src]
hess: Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
) -> Hessenberg<N, D>
Computes the Hessenberg decomposition using householder reflections.
pub fn new_with_workspace(
hess: Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>,
work: &mut Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> Hessenberg<N, D>
[src]
hess: Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>,
work: &mut Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>
) -> Hessenberg<N, 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.
pub fn unpack(
self
) -> (Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>, Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>)
[src]
self
) -> (Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>, Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>)
Retrieves (q, h)
with q
the orthogonal matrix of this decomposition and h
the
hessenberg matrix.
pub fn unpack_h(
self
) -> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
[src]
self
) -> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
Retrieves the upper trapezoidal submatrix H
of this decomposition.
pub fn h(
&self
) -> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
[src]
&self
) -> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
Retrieves the upper trapezoidal submatrix H
of this decomposition.
This is less efficient than .unpack_h()
as it allocates a new matrix.
pub fn q(
&self
) -> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
[src]
&self
) -> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
Computes the orthogonal matrix Q
of this decomposition.
Trait Implementations
impl<N, D> Clone for Hessenberg<N, D> where
D: DimSub<U1> + Clone,
N: Clone + ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
[src]
D: DimSub<U1> + Clone,
N: Clone + ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
fn clone(&self) -> Hessenberg<N, D>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<N, D> Copy for Hessenberg<N, D> where
D: DimSub<U1>,
N: ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>: Copy,
Matrix<N, <D as DimSub<U1>>::Output, U1, <DefaultAllocator as Allocator<N, <D as DimSub<U1>>::Output, U1>>::Buffer>: Copy,
[src]
D: DimSub<U1>,
N: ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>: Copy,
Matrix<N, <D as DimSub<U1>>::Output, U1, <DefaultAllocator as Allocator<N, <D as DimSub<U1>>::Output, U1>>::Buffer>: Copy,
impl<N, D> Debug for Hessenberg<N, D> where
D: DimSub<U1> + Debug,
N: Debug + ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
[src]
D: DimSub<U1> + Debug,
N: Debug + ComplexField,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
Auto Trait Implementations
impl<N, D> !RefUnwindSafe for Hessenberg<N, D>
impl<N, D> !Send for Hessenberg<N, D>
impl<N, D> !Sync for Hessenberg<N, D>
impl<N, D> !Unpin for Hessenberg<N, D>
impl<N, D> !UnwindSafe for Hessenberg<N, D>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,