1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
use crateSQRT_EPS;
use Vector;
/// Directional derivative of a multivariate, scalar-valued function using the forward difference
/// approximation.
///
/// # Arguments
///
/// * `f` - Multivariate, scalar-valued function, $f:\mathbb{R}^{n}\to\mathbb{R}$.
/// * `x0` - Evaluation point, $\mathbf{x}_{0}\in\mathbb{R}^{n}$.
/// * `v` - Vector defining the direction of differentiation, $\mathbf{v}\in\mathbb{R}^{n}$.
/// * `h` - Relative step size, $h\in\mathbb{R}$. Defaults to [`SQRT_EPS`].
///
/// # Returns
///
/// Directional derivative of $f$ with respect to $\mathbf{x}$ in the direction of $\mathbf{v}$,
/// evaluated at $\mathbf{x}=\mathbf{x}_{0}$.
///
/// $$\nabla_{\mathbf{v}}f(\mathbf{x}_{0})=\nabla f(\mathbf{x}\_{0})^{T}\mathbf{v}\in\mathbb{R}$$
///
/// # Note
///
/// * This function performs 2 evaluations of $f(\mathbf{x})$.
/// * This implementation does _not_ assume that $\mathbf{v}$ is a unit vector.
///
/// # Examples
///
/// ## Basic Example
///
/// Approximate the directional derivative of
///
/// $$f(\mathbf{x})=x_{0}^{5}+\sin^{3}{x_{1}}$$
///
/// at $\mathbf{x}=(5,8)^{T}$ in the direction of $\mathbf{v}=(10,20)^{T}$, and compare the result
/// to the true result of
///
/// $$\nabla f_{(10,20)^{T}}\left((5,8)^{T}\right)=31250+60\sin^{2}{(8)}\cos{(8)}$$
///
/// #### Using standard vectors
///
/// ```
/// use numtest::*;
///
/// use numdiff::forward_difference::directional_derivative;
///
/// // Define the function, f(x).
/// let f = |x: &Vec<f64>| x[0].powi(5) + x[1].sin().powi(3);
///
/// // Define the evaluation point.
/// let x0 = vec![5.0, 8.0];
///
/// // Define the direction of differentiation.
/// let v = vec![10.0, 20.0];
///
/// // Approximate the directional derivative of f(x) at the evaluation point along the specified
/// // direction of differentiation.
/// let df_v: f64 = directional_derivative(&f, &x0, &v, None);
///
/// // True directional derivative of f(x) at the evaluation point along the specified direction of
/// // differentiation.
/// let df_v_true: f64 = 31250.0 + 60.0 * 8.0_f64.sin().powi(2) * 8.0_f64.cos();
///
/// // Check the accuracy of the directional derivative approximation.
/// assert_equal_to_decimal!(df_v, df_v_true, 2);
/// ```
///
/// #### 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::forward_difference::directional_derivative;
///
/// let df_v_true: f64 = 31250.0 + 60.0 * 8.0_f64.sin().powi(2) * 8.0_f64.cos();
///
/// // nalgebra::DVector
/// let f_dvector = |x: &DVector<f64>| x[0].powi(5) + x[1].sin().powi(3);
/// let x0_dvector: DVector<f64> = dvector![5.0, 8.0];
/// let v_dvector = dvector![10.0, 20.0];
/// let df_v_dvector: f64 = directional_derivative(&f_dvector, &x0_dvector, &v_dvector, None);
/// assert_equal_to_decimal!(df_v_dvector, df_v_true, 2);
///
/// // nalgebra::SVector
/// let f_svector = |x: &SVector<f64,2>| x[0].powi(5) + x[1].sin().powi(3);
/// let x0_svector: SVector<f64, 2> = SVector::from_row_slice(&[5.0, 8.0]);
/// let v_svector: SVector<f64, 2> = SVector::from_row_slice(&[10.0, 20.0]);
/// let df_v_svector: f64 = directional_derivative(&f_svector, &x0_svector, &v_svector, None);
/// assert_equal_to_decimal!(df_v_svector, df_v_true, 2);
///
/// // ndarray::Array1
/// let f_array1 = |x: &Array1<f64>| x[0].powi(5) + x[1].sin().powi(3);
/// let x0_array1: Array1<f64> = array![5.0, 8.0];
/// let v_array1: Array1<f64> = array![10.0, 20.0];
/// let df_v_array1: f64 = directional_derivative(&f_array1, &x0_array1, &v_array1, None);
/// assert_equal_to_decimal!(df_v_array1, df_v_true, 2);
///
/// // faer::Mat
/// let f_mat = |x: &Mat<f64>| x[(0, 0)].powi(5) + x[(1, 0)].sin().powi(3);
/// let x0_mat: Mat<f64> = Mat::from_slice(&[5.0, 8.0]);
/// let v_mat: Mat<f64> = Mat::from_slice(&[10.0, 20.0]);
/// let df_v_mat: f64 = directional_derivative(&f_mat, &x0_mat, &v_mat, None);
/// assert_equal_to_decimal!(df_v_mat, df_v_true, 2);
/// ```
///
/// #### 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::forward_difference::directional_derivative;
///
/// let f = |x: &Vec<f64>| x[0].powi(5) + x[1].sin().powi(3);
/// let x0 = vec![5.0, 8.0];
/// let v = vec![10.0, 20.0];
///
/// let df_v: f64 = directional_derivative(&f, &x0, &v, Some(0.001));
/// let df_v_true: f64 = 31250.0 + 60.0 * 8.0_f64.sin().powi(2) * 8.0_f64.cos();
///
/// assert_equal_to_decimal!(df_v, df_v_true, -2);
/// ```
///
/// ## Example Passing Runtime Parameters
///
/// Approximate the directional derivative of a parameterized function
///
/// $$f(\mathbf{x})=ax_{0}^{2}+bx_{1}^{2}+cx_{0}x_{1}+d\exp(ex_{0})$$
///
/// where $a$, $b$, $c$, $d$, and $e$ are runtime parameters. Compare the result against the true
/// directional derivative, which is $\nabla f \cdot \mathbf{v}$, where the gradient is
///
/// $$\nabla f=\begin{bmatrix}2ax_{0}+cx_{1}+de\exp(ex_{0})\\\\2bx_{1}+cx_{0}\end{bmatrix}$$
///
/// ```
/// use numtest::*;
///
/// use numdiff::forward_difference::directional_derivative;
///
/// // Runtime parameters.
/// let a = 1.5;
/// let b = 2.0;
/// let c = 0.8;
/// let d = 0.3;
/// let e = 0.5;
///
/// // Define the parameterized function.
/// fn f_param(x: &Vec<f64>, a: f64, b: f64, c: f64, d: f64, e: f64) -> f64 {
/// a * x[0].powi(2) + b * x[1].powi(2) + c * x[0] * x[1] + d * (e * x[0]).exp()
/// }
///
/// // 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 and direction.
/// let x0 = vec![1.0, -0.5];
/// let v = vec![0.6, 0.8];
///
/// // True directional derivative function.
/// let df_v_true = |x: &Vec<f64>, v: &Vec<f64>| {
/// let grad_x0 = 2.0 * a * x[0] + c * x[1] + d * e * (e * x[0]).exp();
/// let grad_x1 = 2.0 * b * x[1] + c * x[0];
/// grad_x0 * v[0] + grad_x1 * v[1]
/// };
///
/// // Approximate the directional derivative and compare with true result.
/// let df_v_eval: f64 = directional_derivative(&f, &x0, &v, None);
/// let df_v_eval_true: f64 = df_v_true(&x0, &v);
/// assert_equal_to_decimal!(df_v_eval, df_v_eval_true, 4);
/// ```