Struct nalgebra::linalg::givens::GivensRotation [−][src]
pub struct GivensRotation<N: ComplexField> { /* fields omitted */ }
Expand description
A Givens rotation.
Implementations
Initializes a Givens rotation from its components.
The components are copies as-is. It is not checked whether they describe an actually valid Givens rotation.
Initializes a Givens rotation from its non-normalized cosine an sine components.
Initializes a Givens rotation form its non-normalized cosine an sine components.
Computes the rotation R required such that the y component of R * v is zero.
Returns None if no rotation is needed (i.e. if v.y == 0). Otherwise, this returns the norm
of v and the rotation r such that R * v = [ |v|, 0.0 ]^t where |v| is the norm of v.
Computes the rotation R required such that the x component of R * v is zero.
Returns None if no rotation is needed (i.e. if v.x == 0). Otherwise, this returns the norm
of v and the rotation r such that R * v = [ 0.0, |v| ]^t where |v| is the norm of v.
pub fn rotate<R2: Dim, C2: Dim, S2: StorageMut<N, R2, C2>>(
&self,
rhs: &mut Matrix<N, R2, C2, S2>
) where
ShapeConstraint: DimEq<R2, U2>,
pub fn rotate<R2: Dim, C2: Dim, S2: StorageMut<N, R2, C2>>(
&self,
rhs: &mut Matrix<N, R2, C2, S2>
) where
ShapeConstraint: DimEq<R2, U2>,
Performs the multiplication rhs = self * rhs in-place.
pub fn rotate_rows<R2: Dim, C2: Dim, S2: StorageMut<N, R2, C2>>(
&self,
lhs: &mut Matrix<N, R2, C2, S2>
) where
ShapeConstraint: DimEq<C2, U2>,
pub fn rotate_rows<R2: Dim, C2: Dim, S2: StorageMut<N, R2, C2>>(
&self,
lhs: &mut Matrix<N, R2, C2, S2>
) where
ShapeConstraint: DimEq<C2, U2>,
Performs the multiplication lhs = lhs * self in-place.
Trait Implementations
Auto Trait Implementations
impl<N> RefUnwindSafe for GivensRotation<N> where
N: RefUnwindSafe,
<N as ComplexField>::RealField: RefUnwindSafe,
impl<N> Send for GivensRotation<N>
impl<N> Sync for GivensRotation<N>
impl<N> Unpin for GivensRotation<N> where
N: Unpin,
<N as ComplexField>::RealField: Unpin,
impl<N> UnwindSafe for GivensRotation<N> where
N: UnwindSafe,
<N as ComplexField>::RealField: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
The inverse inclusion map: attempts to construct self from the equivalent element of its
superset. Read more
Checks if self is actually part of its subset T (and can be converted to it).
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
The inclusion map: converts self to the equivalent element of its superset.