pub struct Schur<T, D>{ /* private fields */ }
Expand description
Schur decomposition of a square matrix.
If this is a real matrix, this will be a RealField
Schur decomposition.
Implementations§
Source§impl<T, D> Schur<T, D>
impl<T, D> Schur<T, D>
Sourcepub fn new(
m: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>,
) -> Schur<T, D>
pub fn new( m: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, ) -> Schur<T, D>
Computes the Schur decomposition of a square matrix.
Sourcepub fn try_new(
m: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>,
eps: <T as ComplexField>::RealField,
max_niter: usize,
) -> Option<Schur<T, D>>
pub fn try_new( m: Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, eps: <T as ComplexField>::RealField, max_niter: usize, ) -> Option<Schur<T, 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.
Sourcepub fn unpack(
self,
) -> (Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>)
pub fn unpack( self, ) -> (Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>, Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>)
Retrieves the unitary matrix Q
and the upper-quasitriangular matrix T
such that the
decomposed matrix equals Q * T * Q.transpose()
.
Sourcepub fn eigenvalues(
&self,
) -> Option<Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>>
pub fn eigenvalues( &self, ) -> Option<Matrix<T, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<T>>>
Computes the real eigenvalues of the decomposed matrix.
Return None
if some eigenvalues are complex.
Sourcepub fn complex_eigenvalues(
&self,
) -> Matrix<Complex<T>, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<Complex<T>>>
pub fn complex_eigenvalues( &self, ) -> Matrix<Complex<T>, D, Const<1>, <DefaultAllocator as Allocator<D>>::Buffer<Complex<T>>>
Computes the complex eigenvalues of the decomposed matrix.
Trait Implementations§
Source§impl<'de, T, D> Deserialize<'de> for Schur<T, D>where
T: ComplexField,
D: Dim,
DefaultAllocator: Allocator<D, D>,
Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>: Deserialize<'de>,
impl<'de, T, D> Deserialize<'de> for Schur<T, D>where
T: ComplexField,
D: Dim,
DefaultAllocator: Allocator<D, D>,
Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>: Deserialize<'de>,
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<Schur<T, D>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<Schur<T, D>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<T, D> Serialize for Schur<T, D>where
T: ComplexField,
D: Dim,
DefaultAllocator: Allocator<D, D>,
Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>: Serialize,
impl<T, D> Serialize for Schur<T, D>where
T: ComplexField,
D: Dim,
DefaultAllocator: Allocator<D, D>,
Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>: Serialize,
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
impl<T, D> Copy for Schur<T, D>where
T: ComplexField,
D: Dim,
DefaultAllocator: Allocator<D, D>,
Matrix<T, D, D, <DefaultAllocator as Allocator<D, D>>::Buffer<T>>: Copy,
Auto Trait Implementations§
impl<T, D> !Freeze for Schur<T, D>
impl<T, D> !RefUnwindSafe for Schur<T, D>
impl<T, D> !Send for Schur<T, D>
impl<T, D> !Sync for Schur<T, D>
impl<T, D> !Unpin for Schur<T, D>
impl<T, D> !UnwindSafe for Schur<T, D>
Blanket Implementations§
Source§impl<T> AsyncTaskResult for T
impl<T> AsyncTaskResult for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn 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
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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.Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts self reference as a reference to
Any
. Could be used to downcast a trait object
to a particular type.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts self reference as a reference to
Any
. Could be used to downcast a trait object
to a particular type.fn into_any(self: Box<T>) -> Box<dyn Any>
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere
T: 'static,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> ScriptMessagePayload for T
impl<T> ScriptMessagePayload for T
Source§fn as_any_ref(&self) -> &(dyn Any + 'static)
fn as_any_ref(&self) -> &(dyn Any + 'static)
Returns
self
as &dyn Any
Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Returns
self
as &dyn Any
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.