Struct autd3_holo_gain::Lm[−][src]

pub struct Lm<B: Backend> { /* fields omitted */ }

Expand description

References

K.Levenberg, “A method for the solution of certain non-linear problems in least squares,” Quarterly of applied mathematics, vol.2, no.2, pp.164–168, 1944.
D.W.Marquardt, “An algorithm for least-squares estimation of non-linear parameters,” Journal of the society for Industrial and AppliedMathematics, vol.11, no.2, pp.431–441, 1963.
K.Madsen, H.Nielsen, and O.Tingleff, “Methods for non-linear least squares problems (2nd ed.),” 2004.

Implementations

impl<B: Backend> Lm<B>

pub fn new(foci: Vec<Vector3>, amps: Vec<f64>) -> Self

pub fn with_param(
    foci: Vec<Vector3>,
    amps: Vec<f64>,
    eps_1: f64,
    eps_2: f64,
    tau: f64,
    k_max: usize,
    initial: Vec<f64>
) -> Self

Trait Implementations

impl<B: Backend> Gain for Lm<B>

fn build(&mut self, geometry: &Geometry) -> Result<()>

fn rebuild(&mut self, geometry: &Geometry) -> Result<()>

fn data(&self) -> &[Drive ]

fn take(self) -> Vec<Drive>

fn built(&self) -> bool

impl<B: Backend> IDatagramBody for Lm<B>

fn init(&mut self)

fn pack(&mut self, geometry: &Geometry, tx: &mut TxDatagram) -> Result<()>

fn is_finished(&self) -> bool

Auto Trait Implementations

impl<B> RefUnwindSafe for Lm<B> where
B: RefUnwindSafe,

impl<B> Send for Lm<B> where
B: Send,

impl<B> Sync for Lm<B> where
B: Sync,

impl<B> Unpin for Lm<B> where
B: Unpin,

impl<B> UnwindSafe for Lm<B> where
B: UnwindSafe,

Blanket Implementations

impl<T> Any for T where
T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where
T: ?Sized,

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where
T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

pub fn from(t: T) -> T

Performs the conversion.

impl<T, U> Into<U> for T where
U: From<T>,

pub fn into(self) -> U

Performs the conversion.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,

pub fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

pub fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

impl<T, U> TryFrom<U> for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

pub fn vzip(self) -> V