Nick
Nick
Code to reproduce: ```cpp #include #include #include using boost::math::tools::polynomial; template void problem(size_t N) { std::vector coeffs(N); for (size_t i = 0; i < coeffs.size(); ++i) { coeffs[i] = i; }...
On [stackoverflow](https://stackoverflow.com/questions/61013158/integration-of-a-matrix-function-over-time-with-boost-calculate-the-controllab) some people are trying to get the quadrature to work with matrix values, which is a really cool use case, but has hit some template problems: ```cpp #include...
In the AGM PR, I have found that ~90% of the runtime is spent computing float distances. However, at least for `float` and `double`, the following trivial modification drops the...
Not *super* easy to see, but if you squint you can see the gray background extends into the space between `tcsh` and "shell": Observed with all inline :code:`Foo` blocks. sphinx-material...
If we were allowed to pass a zero tolerance to `mgard_compress`, then a very powerful unit test would be available. However, this is removed by `mgard_api.cpp`, line 19, which `assert`s...
To reproduce: ```python from sympy import * i = symbols('i', integer=True) α = symbols('α', real=True) x = symbols('x', real=True, positive=True) c = symbols('c', real=True) f = c*pow(x, i + α)...
For instance, in forming a symbolic polynomial, it's convenient to let the coefficients be zero indexed. However, though we can _declare_ zero indexed arrays, we cannot access them at index...
Imagined use: Suppose we have an ODE and we wish to solve it with the Frobenius method. The we would like to convert the ansatz $$y(t) = \sum_{i=0}^{\infty} c_{i} t^{i+\alpha}$$...
To reproduce: ```python #!/usr/bin/env python3 import numpy from deepod.models.time_series.dif import DeepIsolationForestTS arr = numpy.empty(shape=(33, 741)) arr.fill(1.0) # Also reproduces the issue: # arr = numpy.random.rand(33, 741) dif = DeepIsolationForestTS(device=None, seq_len=min(arr.shape[0],...