[−][src]Struct nalgebra::linalg::RealSchur
Real Schur decomposition of a square matrix.
Methods
impl<N: Real, D: Dim> RealSchur<N, D> where
D: DimSub<U1>,
ShapeConstraint: DimEq<Dynamic, DimDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, DimDiff<D, U1>> + Allocator<N, DimDiff<D, U1>> + Allocator<N, D, D> + Allocator<N, D>,
[src]
impl<N: Real, D: Dim> RealSchur<N, D> where
D: DimSub<U1>,
ShapeConstraint: DimEq<Dynamic, DimDiff<D, U1>>,
DefaultAllocator: Allocator<N, D, DimDiff<D, U1>> + Allocator<N, DimDiff<D, U1>> + Allocator<N, D, D> + Allocator<N, D>,
pub fn new(m: MatrixN<N, D>) -> RealSchur<N, D>
[src]
pub fn new(m: MatrixN<N, D>) -> RealSchur<N, D>
Computes the Schur decomposition of a square matrix.
pub fn try_new(
m: MatrixN<N, D>,
eps: N,
max_niter: usize
) -> Option<RealSchur<N, D>>
[src]
pub fn try_new(
m: MatrixN<N, D>,
eps: N,
max_niter: usize
) -> Option<RealSchur<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) -> (MatrixN<N, D>, MatrixN<N, D>)
[src]
pub fn unpack(self) -> (MatrixN<N, D>, MatrixN<N, D>)
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<VectorN<N, D>>
[src]
pub fn eigenvalues(&self) -> Option<VectorN<N, D>>
Computes the real eigenvalues of the decomposed matrix.
Return None
if some eigenvalues are complex.
pub fn complex_eigenvalues(&self) -> VectorN<Complex<N>, D> where
DefaultAllocator: Allocator<Complex<N>, D>,
[src]
pub fn complex_eigenvalues(&self) -> VectorN<Complex<N>, D> where
DefaultAllocator: Allocator<Complex<N>, D>,
Computes the complex eigenvalues of the decomposed matrix.
Trait Implementations
impl<N: Clone + Real, D: Clone + Dim> Clone for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
[src]
impl<N: Clone + Real, D: Clone + Dim> Clone for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
fn clone(&self) -> RealSchur<N, D>
[src]
fn clone(&self) -> RealSchur<N, D>
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0
[src]Performs copy-assignment from source
. Read more
impl<N: Real, D: Dim> Copy for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
MatrixN<N, D>: Copy,
[src]
impl<N: Real, D: Dim> Copy for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
MatrixN<N, D>: Copy,
impl<N: Debug + Real, D: Debug + Dim> Debug for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
[src]
impl<N: Debug + Real, D: Debug + Dim> Debug for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
impl<N: Real, D: Dim> Serialize for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, D>,
MatrixN<N, D>: Serialize,
[src]
impl<N: Real, D: Dim> Serialize for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, D>,
MatrixN<N, D>: Serialize,
fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
__S: Serializer,
[src]
fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
__S: Serializer,
impl<'de, N: Real, D: Dim> Deserialize<'de> for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, D>,
MatrixN<N, D>: Deserialize<'de>,
[src]
impl<'de, N: Real, D: Dim> Deserialize<'de> for RealSchur<N, D> where
DefaultAllocator: Allocator<N, D, D>,
DefaultAllocator: Allocator<N, D, D>,
MatrixN<N, D>: Deserialize<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
Auto Trait Implementations
Blanket Implementations
impl<T, U> Into for T where
U: From<T>,
[src]
impl<T, U> Into for T where
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
impl<T> From for T
[src]
impl<T> From for T
impl<T, U> TryFrom for T where
T: From<U>,
[src]
impl<T, U> TryFrom for T where
T: From<U>,
type Error = !
🔬 This is a nightly-only experimental API. (
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T> Borrow for T where
T: ?Sized,
[src]
impl<T> Borrow for T where
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
impl<T> Any for T where
T: 'static + ?Sized,
fn get_type_id(&self) -> TypeId
[src]
fn get_type_id(&self) -> TypeId
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
🔬 This is a nightly-only experimental API. (
try_from
)The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
impl<T> BorrowMut for T where
T: ?Sized,
[src]
impl<T> BorrowMut for T where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
fn borrow_mut(&mut self) -> &mut T
impl<T> Same for T
[src]
impl<T> Same for T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf for SP where
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
[src]
fn to_subset(&self) -> Option<SS>
fn is_in_subset(&self) -> bool
[src]
fn is_in_subset(&self) -> bool
unsafe fn to_subset_unchecked(&self) -> SS
[src]
unsafe fn to_subset_unchecked(&self) -> SS
fn from_subset(element: &SS) -> SP
[src]
fn from_subset(element: &SS) -> SP