numdiff 0.7.3

Numerical differentiation via forward-mode automatic differentiation and finite difference approximations.
Documentation
use crate::constants::CBRT_EPS;
use linalg_traits::Vector;

/// Partial derivative of a multivariate, vector-valued function using the central difference
/// approximation.
///
/// # Arguments
///
/// * `f` - Multivariate, vector-valued function, $\mathbf{f}:\mathbb{R}^{n}\to\mathbb{R}^{m}$.
/// * `x0` - Evaluation point, $\mathbf{x}_{0}\in\mathbb{R}^{n}$.
/// * `k` - Element of $\mathbf{x}$ to differentiate with respect to. Note that this uses 0-based
///   indexing (e.g. $\mathbf{x}=\left(x_{0},...,x_{k},...,x_{n-1}\right)^{T}$).
/// * `h` - Relative step size, $h\in\mathbb{R}$. Defaults to [`CBRT_EPS`].
///
/// # Returns
///
/// Partial derivative of $\mathbf{f}$ with respect to $x_{k}$, evaluated at
/// $\mathbf{x}=\mathbf{x}_{0}$.
///
/// $$\frac{d\mathbf{f}}{dx_{k}}\bigg\rvert_{\mathbf{x}=\mathbf{x}_{0}}\in\mathbb{R}^{m}$$
///
/// # Note
///
/// This function performs 2 evaluations of $\mathbf{f}(\mathbf{x})$.
///
/// # Examples
///
/// ## Basic Example
///
/// Approximate the partial derivative of
///
/// $$\mathbf{f}(\mathbf{x})=\begin{bmatrix}\sin{x_{0}}\sin{x_{1}}\\\\\cos{x_{0}}\cos{x_{1}}\end{bmatrix}$$
///
/// with respect to $x_{0}$ at $\mathbf{x}=(1,2)^{T}$, and compare the result to the
/// true result of
///
/// $$
/// \frac{\partial\mathbf{f}}{\partial x_{0}}\bigg\rvert_{\mathbf{x}=(1,2)^{T}}=
/// \begin{bmatrix}
/// \cos{(1)}\sin{(2)} \\\\
/// -\sin{(1)}\cos{(2)}
/// \end{bmatrix}
/// $$
///
/// #### Using standard vectors
///
/// ```
/// use numtest::*;
///
/// use numdiff::central_difference::vpartial_derivative;
///
/// // Define the function, f(x).
/// let f = |x: &Vec<f64>| vec![x[0].sin() * x[1].sin(), x[0].cos() * x[1].cos()];
///
/// // Define the evaluation point.
/// let x0 = vec![1.0, 2.0];
///
/// // Define the element of the vector (using 0-based indexing) we are differentiating with respect
/// // to.
/// let k = 0;
///
/// // Approximate the partial derivative of f(x) with respect to x₀ at the evaluation point.
/// let pf: Vec<f64> = vpartial_derivative(&f, &x0, k, None);
///
/// // True partial derivative of f(x) with respect to x₀ at the evaluation point.
/// let pf_true: Vec<f64> = vec![1.0_f64.cos() * 2.0_f64.sin(), -1.0_f64.sin() * 2.0_f64.cos()];
///
/// // Check the accuracy of the partial derivative approximation.
/// assert_arrays_equal_to_decimal!(pf, pf_true, 11);
/// ```
///
/// #### Using other vector types
///
/// We can also use other types of vectors, such as `nalgebra::SVector`, `nalgebra::DVector`,
/// `ndarray::Array1`, `faer::Mat`, or any other type of vector that implements the
/// `linalg_traits::Vector` trait.
///
/// ```
/// use faer::Mat;
/// use linalg_traits::Vector;  // to provide from_slice method for faer::Mat
/// use nalgebra::{dvector, DVector, SVector};
/// use ndarray::{array, Array1};
/// use numtest::*;
///
/// use numdiff::central_difference::vpartial_derivative;
///
/// let k = 0;
///
/// let pf_true: Vec<f64> = vec![1.0_f64.cos() * 2.0_f64.sin(), -1.0_f64.sin() * 2.0_f64.cos()];
///
/// // nalgebra::DVector
/// let f_dvector = |x: &DVector<f64>| dvector![x[0].sin() * x[1].sin(), x[0].cos() * x[1].cos()];
/// let x0_dvector: DVector<f64> = dvector![1.0, 2.0];
/// let pf_dvector: DVector<f64> = vpartial_derivative(&f_dvector, &x0_dvector, k, None);
/// assert_arrays_equal_to_decimal!(pf_dvector, pf_true, 11);
///
/// // nalgebra::SVector
/// let f_svector = |x: &SVector<f64, 2>| {
///     SVector::from_row_slice(&[x[0].sin() * x[1].sin(), x[0].cos() * x[1].cos()])
/// };
/// let x0_svector: SVector<f64, 2> = SVector::from_row_slice(&[1.0, 2.0]);
/// let pf_svector: SVector<f64, 2> = vpartial_derivative(&f_svector, &x0_svector, k, None);
/// assert_arrays_equal_to_decimal!(pf_svector, pf_true, 11);
///
/// // ndarray::Array1
/// let f_array1 = |x: &Array1<f64>| array![x[0].sin() * x[1].sin(), x[0].cos() * x[1].cos()];
/// let x0_array1: Array1<f64> = array![1.0, 2.0];
/// let pf_array1: Array1<f64> = vpartial_derivative(&f_array1, &x0_array1, k, None);
/// assert_arrays_equal_to_decimal!(pf_array1, pf_true, 11);
///
/// // faer::Mat
/// let f_mat = |x: &Mat<f64>| {
///     Mat::from_slice(&[
///         x[(0, 0)].sin() * x[(1, 0)].sin(),
///         x[(0, 0)].cos() * x[(1, 0)].cos(),
///     ])
/// };
/// let x0_mat: Mat<f64> = Mat::from_slice(&[1.0, 2.0]);
/// let pf_mat: Mat<f64> = vpartial_derivative(&f_mat, &x0_mat, k, None);
/// assert_arrays_equal_to_decimal!(pf_mat.as_slice(), pf_true, 11);
/// ```
///
/// #### Modifying the relative step size
///
/// We can also modify the relative step size. Choosing a coarser relative step size, we get a worse
/// approximation.
///
/// ```
/// use numtest::*;
///
/// use numdiff::central_difference::vpartial_derivative;
///
/// let f = |x: &Vec<f64>| vec![x[0].sin() * x[1].sin(), x[0].cos() * x[1].cos()];
/// let x0 = vec![1.0, 2.0];
/// let k = 0;
///
/// let pf: Vec<f64> = vpartial_derivative(&f, &x0, k, Some(0.001));
/// let pf_true: Vec<f64> = vec![1.0_f64.cos() * 2.0_f64.sin(), -1.0_f64.sin() * 2.0_f64.cos()];
///
/// assert_arrays_equal_to_decimal!(pf, pf_true, 6);
/// ```
///
/// ## Example Passing Runtime Parameters
///
/// Approximate the partial derivative of a parameterized vector function
///
/// $$\mathbf{f}(\mathbf{x})=\begin{bmatrix}ax_{0}^{2}+bx_{1}\\\\c\sin(dx_{0})+ex_{1}^{2}\end{bmatrix}$$
///
/// where $a$, $b$, $c$, $d$, and $e$ are runtime parameters. The partial derivatives are:
///
/// * $\dfrac{\partial \mathbf{f}}{\partial x_{0}}=\begin{bmatrix}2ax_{0}\\\\cd\cos(dx_{0})\end{bmatrix}$
/// * $\dfrac{\partial \mathbf{f}}{\partial x_{1}}=\begin{bmatrix}b\\\\2ex_{1}\end{bmatrix}$
///
/// ```
/// use numtest::*;
///
/// use numdiff::central_difference::vpartial_derivative;
///
/// // Runtime parameters.
/// let a = 1.5;
/// let b = -2.0;
/// let c = 3.0;
/// let d = 0.5;
/// let e = 2.5;
///
/// // Define the parameterized function.
/// fn f_param(x: &Vec<f64>, a: f64, b: f64, c: f64, d: f64, e: f64) -> Vec<f64> {
///     vec![
///         a * x[0].powi(2) + b * x[1],
///         c * (d * x[0]).sin() + e * x[1].powi(2)
///     ]
/// }
///
/// // Wrap the parameterized function with a closure that captures the parameters.
/// let f = |x: &Vec<f64>| f_param(x, a, b, c, d, e);
///
/// // Evaluation point.
/// let x0 = vec![1.0, 0.8];
///
/// // True partial derivative functions.
/// let df_dx0_true = |x: &[f64]| vec![
///     2.0 * a * x[0],
///     c * d * (d * x[0]).cos()
/// ];
/// let df_dx1_true = |x: &[f64]| vec![
///     b,
///     2.0 * e * x[1]
/// ];
///
/// // Approximate ∂f/∂x₀ at x₀ and compare with true function.
/// let df_dx0 = vpartial_derivative(&f, &x0, 0, None);
/// let expected_df_dx0 = df_dx0_true(&x0);
/// assert_arrays_equal_to_decimal!(df_dx0, expected_df_dx0, 8);
///
/// // Approximate ∂f/∂x₁ at x₀ and compare with true function.
/// let df_dx1 = vpartial_derivative(&f, &x0, 1, None);
/// let expected_df_dx1 = df_dx1_true(&x0);
/// assert_arrays_equal_to_decimal!(df_dx1, expected_df_dx1, 9);
/// ```
pub fn vpartial_derivative<V, U>(f: &impl Fn(&V) -> U, x0: &V, k: usize, h: Option<f64>) -> U
where
    V: Vector<f64>,
    U: Vector<f64>,
{
    // Copy the evaluation point so that we may modify it.
    let mut x0 = x0.clone();

    // Default the relative step size to h = ε¹ᐟ³ if not specified.
    let h = h.unwrap_or(*CBRT_EPS);

    // Original value of the evaluation point in the kth direction.
    let x0k = x0.vget(k);

    // Absolute step size in the kth direction.
    let dxk = h * (1.0 + x0k.abs());

    // Step forward in the kth direction.
    x0.vset(k, x0k + dxk);
    let f1 = f(&x0);

    // Step backward in the kth direction.
    x0.vset(k, x0k - dxk);
    let f2 = f(&x0);

    // Evaluate the partial derivative of f with respect to xₖ.
    f1.sub(&f2).div(2.0 * dxk)
}

#[cfg(test)]
mod tests {
    use super::*;
    use nalgebra::{DVector, SVector, dvector};
    use ndarray::{Array1, array};
    use numtest::*;

    #[test]
    fn test_vpartial_derivative_1() {
        let f = |x: &Vec<f64>| vec![x[0].powi(2)];
        let x0 = vec![2.0];
        let k = 0;
        let dfk = |x: &Vec<f64>| vec![2.0 * x[0]];
        assert_arrays_equal_to_decimal!(vpartial_derivative(&f, &x0, k, None), dfk(&x0), 11);
    }

    #[test]
    fn test_vpartial_derivative_2() {
        let f = |x: &DVector<f64>| dvector![x[0].powi(4), x[1].powi(3)];
        let x0 = dvector![1.0, 2.0];
        let k = 1;
        let dfk = |x: &DVector<f64>| dvector![0.0, 3.0 * x[1].powi(2)];
        assert_arrays_equal_to_decimal!(vpartial_derivative(&f, &x0, k, None), dfk(&x0), 9);
    }

    #[test]
    fn test_vpartial_derivative_3() {
        let f = |x: &Vec<f64>| vec![x[0].powi(3) * x[1].powi(3)];
        let x0 = vec![3.0, 2.0];
        let k = 1;
        let dfk = |x: &Vec<f64>| vec![3.0 * x[0].powi(3) * x[1].powi(2)];
        assert_arrays_equal_to_decimal!(vpartial_derivative(&f, &x0, k, None), dfk(&x0), 8);
    }

    #[test]
    fn test_vpartial_derivative_4() {
        let f = |x: &Array1<f64>| array![x[0].powi(4), x[1].powi(3)];
        let x0 = array![1.0, 2.0];
        let k = 1;
        let dfk = |x: &Array1<f64>| array![0.0, 3.0 * x[1].powi(2)];
        assert_arrays_equal_to_decimal!(vpartial_derivative(&f, &x0, k, None), dfk(&x0), 9);
    }

    #[test]
    fn test_vpartial_derivative_5() {
        let f = |x: &SVector<f64, 3>| {
            SVector::<f64, 4>::from_row_slice(&[
                x[0],
                5.0 * x[2],
                4.0 * x[1].powi(2) - 2.0 * x[2],
                x[2] * x[0].sin(),
            ])
        };
        let x0: SVector<f64, 3> = SVector::from_row_slice(&[5.0, 6.0, 7.0]);
        let k = 2;
        let dfk =
            |x: &SVector<f64, 3>| SVector::<f64, 4>::from_row_slice(&[0.0, 5.0, -2.0, x[0].sin()]);
        assert_arrays_equal_to_decimal!(vpartial_derivative(&f, &x0, k, None), dfk(&x0), 10);
    }
}