Struct na::Bidiagonal[−][src]

pub struct Bidiagonal<N, R, C> where
    C: Dim,
    N: ComplexField,
    R: DimMin<C>,
    <R as DimMin<C>>::Output: DimSub<U1>,
    DefaultAllocator: Allocator<N, R, C>,
    DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>,
    DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>,  { /* fields omitted */ }

The bidiagonalization of a general matrix.

Implementations

`impl<N, R, C> Bidiagonal<N, R, C> where C: Dim, N: ComplexField, R: DimMin<C>, <R as DimMin<C>>::Output: DimSub<U1>, DefaultAllocator: Allocator<N, R, C>, DefaultAllocator: Allocator<N, C, U1>, DefaultAllocator: Allocator<N, R, U1>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>,` [src]

`pub fn new( matrix: Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer> ) -> Bidiagonal<N, R, C>`[src]

Computes the Bidiagonal decomposition using householder reflections.

`pub fn is_upper_diagonal(&self) -> bool`[src]

Indicates whether this decomposition contains an upper-diagonal matrix.

pub fn unpack( self ) -> (Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer>, Matrix<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>>::Buffer>, Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer>) where DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>, DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, C>, [src]

Unpacks this decomposition into its three matrix factors (U, D, V^t).

The decomposed matrix M is equal to U * D * V^t.

`pub fn d( &self ) -> Matrix<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>>::Buffer> where DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>,` [src]

Retrieves the upper trapezoidal submatrix R of this decomposition.

`pub fn u( &self ) -> Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer> where DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>,` [src]

Computes the orthogonal matrix U of this U * D * V decomposition.

`pub fn v_t( &self ) -> Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer> where DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, C>,` [src]

Computes the orthogonal matrix V_t of this U * D * V_t decomposition.

`pub fn diagonal( &self ) -> Matrix<<N as ComplexField>::RealField, <R as DimMin<C>>::Output, U1, <DefaultAllocator as Allocator<<N as ComplexField>::RealField, <R as DimMin<C>>::Output, U1>>::Buffer> where DefaultAllocator: Allocator<<N as ComplexField>::RealField, <R as DimMin<C>>::Output, U1>,` [src]

The diagonal part of this decomposed matrix.

`pub fn off_diagonal( &self ) -> Matrix<<N as ComplexField>::RealField, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1, <DefaultAllocator as Allocator<<N as ComplexField>::RealField, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>>::Buffer> where DefaultAllocator: Allocator<<N as ComplexField>::RealField, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>,` [src]

The off-diagonal part of this decomposed matrix.

Trait Implementations

`impl<N, R, C> Clone for Bidiagonal<N, R, C> where C: Clone + Dim, N: Clone + ComplexField, R: Clone + DimMin<C>, <R as DimMin<C>>::Output: DimSub<U1>, DefaultAllocator: Allocator<N, R, C>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>,` [src]

`pub fn clone(&self) -> Bidiagonal<N, R, C>`[src]

`pub fn clone_from(&mut self, source: &Self)`1.0.0 [src]

`impl<N, R, C> Debug for Bidiagonal<N, R, C> where C: Debug + Dim, N: Debug + ComplexField, R: Debug + DimMin<C>, <R as DimMin<C>>::Output: DimSub<U1>, DefaultAllocator: Allocator<N, R, C>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>,` [src]

`pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>`[src]

impl<'de, N, R, C> Deserialize<'de> for Bidiagonal<N, R, C> where C: Dim, N: ComplexField, R: DimMin<C>, <R as DimMin<C>>::Output: DimSub<U1>, DefaultAllocator: Allocator<N, R, C>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>, <R as DimMin<C>>::Output: DimSub<U1>, DefaultAllocator: Allocator<N, R, C>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>, Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>: Deserialize<'de>, Matrix<N, <R as DimMin<C>>::Output, U1, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, U1>>::Buffer>: Deserialize<'de>, Matrix<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1, <DefaultAllocator as Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>>::Buffer>: Deserialize<'de>, [src]

`pub fn deserialize<D>( deserializer: D ) -> Result<Bidiagonal<N, R, C>, <D as Deserializer<'de>>::Error> where __D: Deserializer<'de>,` [src]

impl<N, R, C> Serialize for Bidiagonal<N, R, C> where C: Dim, N: ComplexField, R: DimMin<C>, <R as DimMin<C>>::Output: DimSub<U1>, DefaultAllocator: Allocator<N, R, C>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>, <R as DimMin<C>>::Output: DimSub<U1>, DefaultAllocator: Allocator<N, R, C>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>, Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>: Serialize, Matrix<N, <R as DimMin<C>>::Output, U1, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, U1>>::Buffer>: Serialize, Matrix<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1, <DefaultAllocator as Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>>::Buffer>: Serialize, [src]

`pub fn serialize<S>( &self, serializer: S ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error> where S: Serializer,` [src]

impl<N, R, C> Copy for Bidiagonal<N, R, C> where C: Dim, N: ComplexField, R: DimMin<C>, <R as DimMin<C>>::Output: DimSub<U1>, DefaultAllocator: Allocator<N, R, C>, DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, U1>, DefaultAllocator: Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>, Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>: Copy, Matrix<N, <R as DimMin<C>>::Output, U1, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, U1>>::Buffer>: Copy, Matrix<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1, <DefaultAllocator as Allocator<N, <<R as DimMin<C>>::Output as DimSub<U1>>::Output, U1>>::Buffer>: Copy, [src]

Auto Trait Implementations

`impl<N, R, C> !RefUnwindSafe for Bidiagonal<N, R, C>`

`impl<N, R, C> !Send for Bidiagonal<N, R, C>`

`impl<N, R, C> !Sync for Bidiagonal<N, R, C>`

`impl<N, R, C> !Unpin for Bidiagonal<N, R, C>`

`impl<N, R, C> !UnwindSafe for Bidiagonal<N, R, C>`

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`pub fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`pub fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`pub fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`pub fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`pub fn into(self) -> U`[src]

`impl<V> IntoPnt<V> for V`[src]

`pub fn into_pnt(Self) -> V`[src]

`impl<V> IntoVec<V> for V`[src]

`pub fn into_vec(Self) -> V`[src]

`impl<T> Same<T> for T`[src]

`type Output = T`

Should always be Self

`impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,` [src]

`pub fn to_subset(&self) -> Option<SS>`[src]

`pub fn is_in_subset(&self) -> bool`[src]

`pub fn to_subset_unchecked(&self) -> SS`[src]

`pub fn from_subset(element: &SS) -> SP`[src]

`impl<T> ToOwned for T where T: Clone,` [src]

`type Owned = T`

The resulting type after obtaining ownership.

`pub fn to_owned(&self) -> T`[src]

`pub fn clone_into(&self, target: &mut T)`[src]

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`pub fn try_into(self) -> Result<U, >::Error>`[src]

`impl<V, T> VZip<V> for T where V: MultiLane<T>,` [src]

`pub fn vzip(self) -> V`[src]

Struct na::Bidiagonal⎘[−][src]

Implementations

pub fn new( matrix: Matrix<N, R, C, <DefaultAllocator as Allocator<N, R, C>>::Buffer>) -> Bidiagonal<N, R, C>[src]

pub fn is_upper_diagonal(&self) -> bool[src]

pub fn d( &self) -> Matrix<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>>::Buffer> where DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>, [src]

pub fn u( &self) -> Matrix<N, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<N, R, <R as DimMin<C>>::Output>>::Buffer> where DefaultAllocator: Allocator<N, R, <R as DimMin<C>>::Output>, [src]

pub fn v_t( &self) -> Matrix<N, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<N, <R as DimMin<C>>::Output, C>>::Buffer> where DefaultAllocator: Allocator<N, <R as DimMin<C>>::Output, C>, [src]

Trait Implementations

pub fn clone(&self) -> Bidiagonal<N, R, C>[src]

pub fn clone_from(&mut self, source: &Self)1.0.0[src]

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>[src]

pub fn deserialize<__D>( __deserializer: __D) -> Result<Bidiagonal<N, R, C>, <__D as Deserializer<'de>>::Error> where __D: Deserializer<'de>, [src]

pub fn serialize<__S>( &self, __serializer: __S) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where __S: Serializer, [src]

Auto Trait Implementations

impl<N, R, C> !RefUnwindSafe for Bidiagonal<N, R, C>

impl<N, R, C> !Send for Bidiagonal<N, R, C>

impl<N, R, C> !Sync for Bidiagonal<N, R, C>

impl<N, R, C> !Unpin for Bidiagonal<N, R, C>

impl<N, R, C> !UnwindSafe for Bidiagonal<N, R, C>

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

pub fn into(self) -> U[src]

impl<V> IntoPnt<V> for V[src]

pub fn into_pnt(Self) -> V[src]

impl<V> IntoVec<V> for V[src]

pub fn into_vec(Self) -> V[src]

impl<T> Same<T> for T[src]

type Output = T

impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>, [src]

pub fn to_subset(&self) -> Option<SS>[src]

pub fn is_in_subset(&self) -> bool[src]

pub fn to_subset_unchecked(&self) -> SS[src]

pub fn from_subset(element: &SS) -> SP[src]

impl<T> ToOwned for T where T: Clone, [src]

type Owned = T

pub fn to_owned(&self) -> T[src]

pub fn clone_into(&self, target: &mut T)[src]

impl<T, U> TryFrom<U> for T where U: Into<T>, [src]

type Error = Infallible

pub 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]

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

impl<V, T> VZip<V> for T where V: MultiLane<T>, [src]

pub fn vzip(self) -> V[src]