Struct bevy_rapier2d::prelude::nalgebra::linalg::Schur [−][src]
pub struct Schur<T, D> where
T: ComplexField,
D: Dim,
DefaultAllocator: Allocator<T, D, D>, { /* fields omitted */ }
Expand description
Schur decomposition of a square matrix.
If this is a real matrix, this will be a RealField Schur decomposition.
Implementations
impl<T, D> Schur<T, D> where
T: ComplexField,
D: Dim + DimSub<Const<1_usize>>,
DefaultAllocator: Allocator<T, D, <D as DimSub<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T, <D as DimSub<Const<1_usize>>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<T, D, Const<1_usize>>,
[src]
impl<T, D> Schur<T, D> where
T: ComplexField,
D: Dim + DimSub<Const<1_usize>>,
DefaultAllocator: Allocator<T, D, <D as DimSub<Const<1_usize>>>::Output>,
DefaultAllocator: Allocator<T, <D as DimSub<Const<1_usize>>>::Output, Const<1_usize>>,
DefaultAllocator: Allocator<T, D, D>,
DefaultAllocator: Allocator<T, D, Const<1_usize>>,
[src]Computes the Schur decomposition of a square matrix.
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.
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<T, D, Const<1_usize>, <DefaultAllocator as Allocator<T, D, Const<1_usize>>>::Buffer>>
[src]
pub fn eigenvalues(
&self
) -> Option<Matrix<T, D, Const<1_usize>, <DefaultAllocator as Allocator<T, D, Const<1_usize>>>::Buffer>>
[src]Computes the real eigenvalues of the decomposed matrix.
Return None
if some eigenvalues are complex.
pub fn complex_eigenvalues(
&self
) -> Matrix<Complex<T>, D, Const<1_usize>, <DefaultAllocator as Allocator<Complex<T>, D, Const<1_usize>>>::Buffer> where
T: RealField,
DefaultAllocator: Allocator<Complex<T>, D, Const<1_usize>>,
[src]
pub fn complex_eigenvalues(
&self
) -> Matrix<Complex<T>, D, Const<1_usize>, <DefaultAllocator as Allocator<Complex<T>, D, Const<1_usize>>>::Buffer> where
T: RealField,
DefaultAllocator: Allocator<Complex<T>, D, Const<1_usize>>,
[src]Computes the complex eigenvalues of the decomposed matrix.
Trait Implementations
impl<T, D> Clone for Schur<T, D> where
T: Clone + ComplexField,
D: Clone + Dim,
DefaultAllocator: Allocator<T, D, D>,
[src]
impl<T, D> Clone for Schur<T, D> where
T: Clone + ComplexField,
D: Clone + Dim,
DefaultAllocator: Allocator<T, D, D>,
[src]impl<T, D> Debug for Schur<T, D> where
T: Debug + ComplexField,
D: Debug + Dim,
DefaultAllocator: Allocator<T, D, D>,
[src]
impl<T, D> Debug for Schur<T, D> where
T: Debug + ComplexField,
D: Debug + Dim,
DefaultAllocator: Allocator<T, D, D>,
[src]impl<T, D> Copy for Schur<T, D> where
T: ComplexField,
D: Dim,
DefaultAllocator: Allocator<T, D, D>,
Matrix<T, D, D, <DefaultAllocator as Allocator<T, D, D>>::Buffer>: Copy,
[src]Auto Trait Implementations
impl<T, D> !RefUnwindSafe for Schur<T, D>
impl<T, D> !UnwindSafe for Schur<T, D>
Blanket Implementations
Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
type Output = T
type Output = T
Should always be Self
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
pub fn vzip(self) -> V