[−][src]Struct na::linalg::Schur
Schur decomposition of a square matrix.
If this is a real matrix, this will be a RealField Schur decomposition.
Methods
impl<N, D> Schur<N, D> where
D: Dim + DimSub<U1>,
N: ComplexField,
DefaultAllocator: Allocator<N, D, <D as DimSub<U1>>::Output>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
[src]
D: Dim + DimSub<U1>,
N: ComplexField,
DefaultAllocator: Allocator<N, D, <D as DimSub<U1>>::Output>,
DefaultAllocator: Allocator<N, <D as DimSub<U1>>::Output, U1>,
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, U1>,
pub fn new(
m: Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
) -> Schur<N, D>
[src]
m: Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>
) -> Schur<N, D>
Computes the Schur decomposition of a square matrix.
pub fn try_new(
m: Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>,
eps: <N as ComplexField>::RealField,
max_niter: usize
) -> Option<Schur<N, D>>
[src]
m: Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>,
eps: <N as ComplexField>::RealField,
max_niter: usize
) -> Option<Schur<N, D>>
Attempts to compute the Schur decomposition of a square matrix.
If only eigenvalues are needed, it is more efficient to call the matrix method
.eigenvalues()
instead.
Arguments
eps
− tolerance used to determine when a value converged to 0.max_niter
− maximum total number of iterations performed by the algorithm. If this number of iteration is exceeded,None
is returned. Ifniter == 0
, then the algorithm continues indefinitely until convergence.
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 the unitary matrix Q
and the upper-quasitriangular matrix T
such that the
decomposed matrix equals Q * T * Q.transpose()
.
pub fn eigenvalues(
&self
) -> Option<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
[src]
&self
) -> Option<Matrix<N, D, U1, <DefaultAllocator as Allocator<N, D, U1>>::Buffer>>
Computes the real eigenvalues of the decomposed matrix.
Return None
if some eigenvalues are complex.
pub fn complex_eigenvalues(
&self
) -> Matrix<Complex<N>, D, U1, <DefaultAllocator as Allocator<Complex<N>, D, U1>>::Buffer> where
N: RealField,
DefaultAllocator: Allocator<Complex<N>, D, U1>,
[src]
&self
) -> Matrix<Complex<N>, D, U1, <DefaultAllocator as Allocator<Complex<N>, D, U1>>::Buffer> where
N: RealField,
DefaultAllocator: Allocator<Complex<N>, D, U1>,
Computes the complex eigenvalues of the decomposed matrix.
Trait Implementations
impl<N, D> Clone for Schur<N, D> where
D: Dim + Clone,
N: Clone + ComplexField,
DefaultAllocator: Allocator<N, D, D>,
[src]
D: Dim + Clone,
N: Clone + ComplexField,
DefaultAllocator: Allocator<N, D, D>,
fn clone(&self) -> Schur<N, D>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<N, D> Copy for Schur<N, D> where
D: Dim,
N: ComplexField,
DefaultAllocator: Allocator<N, D, D>,
Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>: Copy,
[src]
D: Dim,
N: ComplexField,
DefaultAllocator: Allocator<N, D, D>,
Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>: Copy,
impl<N, D> Debug for Schur<N, D> where
D: Dim + Debug,
N: Debug + ComplexField,
DefaultAllocator: Allocator<N, D, D>,
[src]
D: Dim + Debug,
N: Debug + ComplexField,
DefaultAllocator: Allocator<N, D, D>,
Auto Trait Implementations
Blanket Implementations
impl<V> IntoVec<V> for V
[src]
impl<V> IntoPnt<V> for V
[src]
impl<T> From<T> for T
[src]
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> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
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<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Same<T> for T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
SS: SubsetOf<SP>,