Struct lnkit::prelude::linalg::Bidiagonal[−][src]

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

The bidiagonalization of a general matrix.

Implementations

impl<T, R, C> Bidiagonal<T, R, C> where C: Dim, T: ComplexField, R: DimMin<C>, <R as DimMin<C>>::Output: DimSub<Const<1_usize>>, DefaultAllocator: Allocator<T, R, C>, DefaultAllocator: Allocator<T, C, Const<1_usize>>, DefaultAllocator: Allocator<T, R, Const<1_usize>>, DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>, DefaultAllocator: Allocator<T, <<R as DimMin<C>>::Output as DimSub<Const<1_usize>>>::Output, Const<1_usize>>, [src]

`pub fn new( matrix: Matrix<T, R, C, <DefaultAllocator as Allocator<T, R, C>>::Buffer> ) -> Bidiagonal<T, 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<T, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, R, <R as DimMin<C>>::Output>>::Buffer>, Matrix<T, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>>::Buffer>, Matrix<T, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, C>>::Buffer>) where DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>, DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>, DefaultAllocator: Allocator<T, <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<T, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, <R as DimMin<C>>::Output>>::Buffer> where DefaultAllocator: Allocator<T, <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<T, R, <R as DimMin<C>>::Output, <DefaultAllocator as Allocator<T, R, <R as DimMin<C>>::Output>>::Buffer> where DefaultAllocator: Allocator<T, R, <R as DimMin<C>>::Output>,` [src]

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

`pub fn v_t( &self ) -> Matrix<T, <R as DimMin<C>>::Output, C, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, C>>::Buffer> where DefaultAllocator: Allocator<T, <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<<T as ComplexField>::RealField, <R as DimMin<C>>::Output, Const<1_usize>, <DefaultAllocator as Allocator<<T as ComplexField>::RealField, <R as DimMin<C>>::Output, Const<1_usize>>>::Buffer> where DefaultAllocator: Allocator<<T as ComplexField>::RealField, <R as DimMin<C>>::Output, Const<1_usize>>,` [src]

The diagonal part of this decomposed matrix.

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

The off-diagonal part of this decomposed matrix.

Trait Implementations

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

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

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

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

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

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

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

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

impl<T, R, C> Serialize for Bidiagonal<T, R, C> where C: Dim, T: ComplexField, R: DimMin<C>, <R as DimMin<C>>::Output: DimSub<Const<1_usize>>, DefaultAllocator: Allocator<T, R, C>, DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>, DefaultAllocator: Allocator<T, <<R as DimMin<C>>::Output as DimSub<Const<1_usize>>>::Output, Const<1_usize>>, <R as DimMin<C>>::Output: DimSub<Const<1_usize>>, DefaultAllocator: Allocator<T, R, C>, DefaultAllocator: Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>, DefaultAllocator: Allocator<T, <<R as DimMin<C>>::Output as DimSub<Const<1_usize>>>::Output, Const<1_usize>>, Matrix<T, R, C, <DefaultAllocator as Allocator<T, R, C>>::Buffer>: Serialize, Matrix<T, <R as DimMin<C>>::Output, Const<1_usize>, <DefaultAllocator as Allocator<T, <R as DimMin<C>>::Output, Const<1_usize>>>::Buffer>: Serialize, Matrix<T, <<R as DimMin<C>>::Output as DimSub<Const<1_usize>>>::Output, Const<1_usize>, <DefaultAllocator as Allocator<T, <<R as DimMin<C>>::Output as DimSub<Const<1_usize>>>::Output, Const<1_usize>>>::Buffer>: Serialize, [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<T, R, C> !RefUnwindSafe for Bidiagonal<T, R, C>`

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

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

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

`impl<T, R, C> !UnwindSafe for Bidiagonal<T, 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, U> Cast for T where U: FromCast<T>,`

`pub fn cast(self) -> U`

`impl<T> Downcast for T where T: Any,`

`pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>`

`pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>`

`pub fn as_any(&self) -> &(dyn Any + 'static)`

`pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)`

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

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

`impl<T> FromBits<T> for T`

`pub fn from_bits(t: T) -> T`

`impl<T> FromCast<T> for T`

`pub fn from_cast(t: T) -> T`

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

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

`impl<T, U> IntoBits for T where U: FromBits<T>,`

`pub fn into_bits(self) -> U`

`impl<T> Pointable for T`

`pub const ALIGN: usize`

`type Init = T`

The type for initializers.

`pub unsafe fn init(init: <T as Pointable>::Init) -> usize`

`pub unsafe fn deref<'a>(ptr: usize) -> &'a T`

`pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T`

`pub unsafe fn drop(ptr: usize)`

`impl<T> Same<T> for T`

`type Output = T`

Should always be Self

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

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

`pub fn is_in_subset(&self) -> bool`

`pub fn to_subset_unchecked(&self) -> SS`

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

`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>,`

`pub fn vzip(self) -> V`

Struct lnkit::prelude::linalg::Bidiagonal⎘[−][src]

Implementations

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

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

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

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

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

Trait Implementations

pub fn clone(&self) -> Bidiagonal<T, 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<T, 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<T, R, C> !RefUnwindSafe for Bidiagonal<T, R, C>

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

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

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

impl<T, R, C> !UnwindSafe for Bidiagonal<T, 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, U> Cast<U> for T where U: FromCast<T>,

pub fn cast(self) -> U

impl<T> Downcast for T where T: Any,

pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

pub fn as_any(&self) -> &(dyn Any + 'static)

pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

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

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

impl<T> FromBits<T> for T

pub fn from_bits(t: T) -> T

impl<T> FromCast<T> for T

pub fn from_cast(t: T) -> T

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

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

impl<T, U> IntoBits<U> for T where U: FromBits<T>,

pub fn into_bits(self) -> U

impl<T> Pointable for T

pub const ALIGN: usize

type Init = T

pub unsafe fn init(init: <T as Pointable>::Init) -> usize

pub unsafe fn deref<'a>(ptr: usize) -> &'a T

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

pub unsafe fn drop(ptr: usize)

impl<T> Same<T> for T

type Output = T

impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,

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

pub fn is_in_subset(&self) -> bool

pub fn to_subset_unchecked(&self) -> SS

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

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>,

pub fn vzip(self) -> V