Skip to main content

SvdLinearSolver

varpro::solvers::levmar

Struct SvdLinearSolver 

Source 
pub struct SvdLinearSolver<ScalarType>
where
    ScalarType: Scalar + ComplexField,
{ /* private fields */ }
Expand description

A solver for the linear subproblem in variable projection that uses singular value decomposition to calculate the linear solution. It is well equipped to deal with numerically difficult problems that might become rank deficient during the optimization. The high numerical stability means that it will suffer in performance compared to other solvers in this crate, but it is a good default choice and varpro with SVD will outperform pure nonlinear optimizers any day of the week.

§Details

The solver uses the singular value decomposition with a Kaufmann approximation for the derivatives as described here.

Trait Implementations§

Source§

impl<ScalarType> Clone for SvdLinearSolver<ScalarType>
where ScalarType: Scalar + ComplexField + Clone,

Source§

fn clone(&self) -> SvdLinearSolver<ScalarType>

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl<ScalarType> Debug for SvdLinearSolver<ScalarType>
where ScalarType: Scalar + ComplexField + Debug,

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<ScalarType> LinearSolver for SvdLinearSolver<ScalarType>
where ScalarType: Scalar + ComplexField,

Source§

type ScalarType = ScalarType

numeric type used in this solver
Source§

fn linear_coefficients_matrix(self) -> DMatrix<Self::ScalarType>

get the linear coefficients in matrix form. For single RHS this is a matrix with just one column.

Auto Trait Implementations§

§

impl<ScalarType> Freeze for SvdLinearSolver<ScalarType>
where Matrix<ScalarType, Dyn, Dyn, VecStorage<ScalarType, Dyn, Dyn>>: Freeze, SVD<ScalarType, Dyn, Dyn>: Freeze,

§

impl<ScalarType> RefUnwindSafe for SvdLinearSolver<ScalarType>
where Matrix<ScalarType, Dyn, Dyn, VecStorage<ScalarType, Dyn, Dyn>>: RefUnwindSafe, SVD<ScalarType, Dyn, Dyn>: RefUnwindSafe,

§

impl<ScalarType> Send for SvdLinearSolver<ScalarType>
where Matrix<ScalarType, Dyn, Dyn, VecStorage<ScalarType, Dyn, Dyn>>: Send, SVD<ScalarType, Dyn, Dyn>: Send,

§

impl<ScalarType> Sync for SvdLinearSolver<ScalarType>
where Matrix<ScalarType, Dyn, Dyn, VecStorage<ScalarType, Dyn, Dyn>>: Sync, SVD<ScalarType, Dyn, Dyn>: Sync,

§

impl<ScalarType> Unpin for SvdLinearSolver<ScalarType>
where Matrix<ScalarType, Dyn, Dyn, VecStorage<ScalarType, Dyn, Dyn>>: Unpin, SVD<ScalarType, Dyn, Dyn>: Unpin,

§

impl<ScalarType> UnsafeUnpin for SvdLinearSolver<ScalarType>
where Matrix<ScalarType, Dyn, Dyn, VecStorage<ScalarType, Dyn, Dyn>>: UnsafeUnpin, SVD<ScalarType, Dyn, Dyn>: UnsafeUnpin,

§

impl<ScalarType> UnwindSafe for SvdLinearSolver<ScalarType>
where Matrix<ScalarType, Dyn, Dyn, VecStorage<ScalarType, Dyn, Dyn>>: UnwindSafe, SVD<ScalarType, Dyn, Dyn>: UnwindSafe,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

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

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

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

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

fn from_subset(element: &SS) -> SP

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

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.