  Neutrino flavor oscillations and conversion in the presence of an interacting
background may offer the missing evidence for charge-parity violation in the
leptonic sector of the Standard Model, as well as yet undiscovered new
interactions. The usual approach for simulating these effects is by numerically
integrating the Schrodinger equation over the neutrino trajectory, arriving at
the conversion and survival probabilities for each flavor. From these, the
neutrino mixing matrix and its parameters are recovered. This work makes the
case for a different numerical approach, which starts by recognizing how
Jacobi's diagonalization algorithm is the most suitable for neutrino
oscillations in general. By switching from physical space to a parameter space
of choice, Jacobi's algorithm results in both eigenvalues and eigenvectors
simultaneously, with only local round-off errors. This approach is trivially
parallelizable, making it a suitable choice for concurrent computation.
Moreover, the freedom to build a parameter space allows for
quasi-model-independent solutions, which in turn eliminates the necessity of
repeating the simulation for every change in the model's parameters. Benchmarks
and efficiency analyses are discussed, as well as a concrete neutrino
oscillation example.
