pub struct RootLocus {
pub num: Vec<f64>,
pub den: Vec<f64>,
}Expand description
Root locus computation: closed-loop poles as a function of gain K.
For open-loop transfer function G(s) = num(s)/den(s), the closed-loop poles satisfy: den(s) + K*num(s) = 0.
Fields§
§num: Vec<f64>Numerator polynomial coefficients (descending order).
den: Vec<f64>Denominator polynomial coefficients (descending order).
Implementations§
Source§impl RootLocus
impl RootLocus
Sourcepub fn compute(&self, gains: &[f64]) -> Vec<RootLocusPoint>
pub fn compute(&self, gains: &[f64]) -> Vec<RootLocusPoint>
Compute closed-loop poles for each gain in gains.
Uses companion matrix eigenvalue approach for small polynomials (degree ≤ 4). For the characteristic equation den(s) + K*num(s) = 0, forms the combined polynomial.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for RootLocus
impl RefUnwindSafe for RootLocus
impl Send for RootLocus
impl Sync for RootLocus
impl Unpin for RootLocus
impl UnsafeUnpin for RootLocus
impl UnwindSafe for RootLocus
Blanket Implementations§
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<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.