SolverBuilder

Struct SolverBuilder 

Source
pub struct SolverBuilder<'a, R: Problem, A>(/* private fields */);
Expand description

Builder for the SolverDriver.

Implementations§

Source§

impl<'a, R: Problem, A> SolverBuilder<'a, R, A>

Source

pub fn with_initial(self, x0: Vec<R::Field>) -> Self

Sets the initial point from which the iterative process starts.

Examples found in repository?
examples/equations.rs (line 36)
33fn main() -> Result<(), String> {
34    let r = Rosenbrock { a: 1.0, b: 1.0 };
35    let mut solver = SolverDriver::builder(&r)
36        .with_initial(vec![10.0, -5.0])
37        .build();
38
39    let tolerance = 1e-6;
40
41    let (_, norm) = solver
42        .find(|state| {
43            println!(
44                "iter = {}\t|| r(x) || = {}\tx = {:?}",
45                state.iter(),
46                state.norm(),
47                state.x()
48            );
49            state.norm() <= tolerance || state.iter() >= 100
50        })
51        .map_err(|error| format!("{error}"))?;
52
53    if norm <= tolerance {
54        Ok(())
55    } else {
56        Err("did not converge".to_string())
57    }
58}
Source

pub fn with_algo<S2, FA>(self, factory: FA) -> SolverBuilder<'a, R, S2>
where FA: FnOnce(&R, &Domain<R::Field>) -> S2,

Sets specific algorithm to be used.

This builder method accepts a closure that takes the reference to the problem and its domain. For many algorithms in gomez, you can simply pass the new constructor directly (e.g., TrustRegion::new).

Source

pub fn build(self) -> SolverDriver<'a, R, A>

Builds the SolverDriver.

Examples found in repository?
examples/equations.rs (line 37)
33fn main() -> Result<(), String> {
34    let r = Rosenbrock { a: 1.0, b: 1.0 };
35    let mut solver = SolverDriver::builder(&r)
36        .with_initial(vec![10.0, -5.0])
37        .build();
38
39    let tolerance = 1e-6;
40
41    let (_, norm) = solver
42        .find(|state| {
43            println!(
44                "iter = {}\t|| r(x) || = {}\tx = {:?}",
45                state.iter(),
46                state.norm(),
47                state.x()
48            );
49            state.norm() <= tolerance || state.iter() >= 100
50        })
51        .map_err(|error| format!("{error}"))?;
52
53    if norm <= tolerance {
54        Ok(())
55    } else {
56        Err("did not converge".to_string())
57    }
58}

Auto Trait Implementations§

§

impl<'a, R, A> Freeze for SolverBuilder<'a, R, A>
where A: Freeze,

§

impl<'a, R, A> RefUnwindSafe for SolverBuilder<'a, R, A>

§

impl<'a, R, A> Send for SolverBuilder<'a, R, A>
where A: Send, R: Sync,

§

impl<'a, R, A> Sync for SolverBuilder<'a, R, A>
where A: Sync, R: Sync,

§

impl<'a, R, A> Unpin for SolverBuilder<'a, R, A>
where A: Unpin, <R as Problem>::Field: Unpin,

§

impl<'a, R, A> UnwindSafe for SolverBuilder<'a, R, A>

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> 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, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

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.