Readying.

numerics/approximation_body.hpp

@@ -81,10 +81,11 @@ template<int N, typename Argument, typename Function>
   }
 
   // Unlike [Boy13], section 4, we return the polynomial of the lower degree
-  // that is within the |max_error| bound (that is, N / 2).  Even though we
-  // computed the polymial of degree N, returning it would impose an unnecessary
-  // cost on the client (e.g., more costly evaluation).  If a client wants a
-  // more precise approximation, they just need to give a smaller |max_error|.
+  // that is within the |max_error| bound (that is, the one of degree N / 2).
+  // Even though we computed the polynomial of degree N, returning it would
+  // impose an unnecessary cost on the client (e.g., more costly evaluation). If
+  // a client wants a more precise approximation, they just need to give a
+  // smaller |max_error|.
   std::vector<Value<Argument, Function>> coefficients;
   std::copy(previous_aⱼ.begin(), previous_aⱼ.end(),
             std::back_inserter(coefficients));

numerics/чебышёв_series_test.cpp

@@ -7,6 +7,7 @@
 #include "gtest/gtest.h"
 #include "numerics/matrix_computations.hpp"
 #include "numerics/unbounded_arrays.hpp"
+#include "quantities/elementary_functions.hpp"
 #include "quantities/named_quantities.hpp"
 #include "quantities/quantities.hpp"
 #include "quantities/si.hpp"