Skip to content

Commit 391e3f6

Browse files
committed
Fix sentence on interoperability (#340)
1 parent 39cc55c commit 391e3f6

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

paper/paper.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -74,7 +74,7 @@ The solvers rely heavily on iterative linear algebra methods from `Krylov.jl` [@
7474
Julia's JIT compiler is attractive for the design of efficient scientific computing software, and, in particular, mathematical optimization [@lubin2015computing], and has become a natural choice for developing new solvers.
7575

7676
While several options exist to solve \eqref{eq:nlp} in Julia, many rely on wrappers to solvers implemented in low-level compiled languages.
77-
For example, if \eqref{eq:nlp} is modeled using JuMP [@jump], it can be passed to solvers like IPOPT [@wachter2006implementation] or Artelys Knitro [@byrd2006k] via Julia’s native C++ and Fortran interoperability.
77+
For example, if \eqref{eq:nlp} is modeled using JuMP [@jump], it can be passed to solvers like IPOPT [@wachter2006implementation] or Artelys Knitro [@byrd2006k] via Julia’s native C and Fortran interoperability.
7878
However, these interfaces often lack flexibility with respect to data types and numerical precision.
7979
In contrast, solvers written in pure Julia can operate seamlessly with a variety of arithmetic types or even GPU array types.
8080
This capability is increasingly important as extended-precision arithmetic becomes more accessible through packages such as GNU MPFR, shipped with Julia.

0 commit comments

Comments
 (0)