Struct MGH

pub struct MGH { /* private fields */ }

Implementations

impl MGH

pub fn aux(m: usize) -> Self

pub fn biggs_exp6(&self, x: &[f64]) -> f64

pub fn gaussian(x: &[f64]) -> f64

pub fn powell_badly_scaled(x: &[f64]) -> f64

pub fn box_3d(&self, x: &[f64]) -> f64

pub fn variably_dimensional(x: &[f64]) -> f64

pub fn watson(x: &[f64]) -> f64

pub fn penalty1(x: &[f64]) -> f64

pub fn penalty2(x: &[f64]) -> f64

pub fn brown_badly_scaled(x: &[f64]) -> f64

pub fn brown_and_dennis(&self, x: &[f64]) -> f64

pub fn gulf_research_and_development(&self, x: &[f64]) -> f64

pub fn trigonometric(x: &[f64]) -> f64

pub fn extended_rosenbrock(x: &[f64]) -> f64

pub fn powell_singular(x: &[f64]) -> f64

pub fn beale(x: &[f64]) -> f64

pub fn wood(x: &[f64]) -> f64

pub fn chebyquad(&self, x: &[f64]) -> f64

Implements the Chebyquad function.

This function calculates a vector f(x) of size m, where each component f_i is defined by the formula: f_i(x) = (1/n) * Σ_{j=1 to n} T_i(x_j) - ∫_0^1 T_i(x) dx

Arguments

• x: A slice representing the input vector x = (x_1, …, x_n).
• m: The number of functions f_i to compute.

Returns

A Vec<f64> containing the result vector f(x).

pub fn broyden_banded(x: &[f64]) -> f64

pub fn discrete_boundary_value(x: &[f64]) -> f64

pub fn discrete_integral_equation(x: &[f64]) -> f64

pub fn extended_powell_singular(x: &[f64]) -> f64

pub fn linear_full_rank(&self, x: &[f64]) -> f64