Ivan Pribec

If your reply is aimed at the `compiler_options()` comment, personally I wouldn't do it. Extra complexity for little benefit.

Unfortunately in Fortran you can not force functions and subroutines under the same interface. So the last split has to be named differently.

> Comment from Youtube user ES on https://youtube.com/watch?v=HI-Yhn7Q8Ko: > > > Here's how I might choose to implement split in C++ (but you should be able to do it similarly...

The [Boost C++ library](https://www.boost.org/doc/libs/1_64_0/libs/math/doc/html/math_toolkit/roots.html) simply provides the routines under different names: - Root Finding Without Derivatives ```C++ // Bisection template std::pair bisect( F f, T min, T max, Tol tol,...

The [NLopt](https://nlopt.readthedocs.io/en/latest/) library contains several constrained and unconstrained nonlinear optimization routines and comes with a Fortran interface (geared toward the old F77 style of Fortran). Ironically, many of the routines...

I would definitely say bracketing is part of this issue. From the looks of it, the Julia `find_zeros` will attempt to find multiple roots on a *defined* interval, by dividing...

I noticed compiler explorer supports `nvc++` (C++) and `nvcc` (CUDA C++). Would it be possible to add `nvfortran`? (It should be part of the NVIDIA HPC SDK.)

The NNEF page has added some text explaining the differences > ONNX and NNEF are Complementary > ONNX moves quickly to track authoring framework updates > NNEF provides a stable...

Btw, you may find [abaci](https://bristolcompositesinstitute.github.io/abaci/index.html) helpful for developing Abaqus user subroutines. (@lkedward, maybe you find this use case interesting)

Just for the record, on the same system, all the tests pass successfully when OpenMM is compiled with GCC (`gcc (Spack GCC) 13.2.0`). Is `icpx` one of the supported compilers?