Quadruple Boson Energy Conservation

In this notebook we will study the energy conservation properties of several high-order methods for a system with the following Hamiltonian:

\[\mathcal{H}\left(q_0,q_2,p_0,p_2\right) = \frac{A}{2} \left(p_0^2 + p_2^2 + q_0^2 + q_2^2\right) + \frac{B}{\sqrt{2}} q_0 \left(3q_2^2 - q_0^2\right) + \frac{D}{4} \left(q_0^2+q_2^2\right)^2\]

This Hamiltonian resembles the Hénon-Heiles one, but it has an additional fourth order term. The aim of this benchmark is to see what happens with the energy error when highly accurate solutions are needed and how the results compare with the Hénon-Heiles case.

using OrdinaryDiffEq, Plots, DiffEqCallbacks, LinearAlgebra
using OrdinaryDiffEqRKN, OrdinaryDiffEqSymplecticRK
using OrdinaryDiffEqTaylorSeries
using TaylorIntegration
using ParameterizedFunctions
using StaticArrays
gr()
default(fmt = :png)

T(p) = A / 2 * norm(p)^2
function V(q)
    A / 2 * (q[1]^2 + q[2]^2) + B / sqrt(2) * q[1] * (3 * q[2]^2 - q[1]^2) +
    D / 4 * (q[1]^2 + q[2]^2)^2
end
H(p, q, params) = T(p) + V(q)

const A, B, D = 1.0, 0.55, 0.4

function iip_dq(dq, p, q, params, t)
    dq[1] = A * p[1]
    dq[2] = A * p[2]
end

function iip_dp(dp, p, q, params, t)
    dp[1] = -A * q[1] - 3 * B / sqrt(2) * (q[2]^2 - q[1]^2) - D * q[1] * (q[1]^2 + q[2]^2)
    dp[2] = -q[2] * (A + 3 * sqrt(2) * B * q[1] + D * (q[1]^2 + q[2]^2))
end

const iip_q0 = [4.919080920016389, 2.836942666663649]
const iip_p0 = [0.0, 0.0]
const iip_u0 = vcat(iip_p0, iip_q0)

function oop_dq(p, q, params, t)
    p
end

function oop_dp(p, q, params, t)
    dp1 = -A * q[1] - 3 * B / sqrt(2) * (q[2]^2 - q[1]^2) - D * q[1] * (q[1]^2 + q[2]^2)
    dp2 = -q[2] * (A + 3 * sqrt(2) * B * q[1] + D * (q[1]^2 + q[2]^2))
    @SVector [dp1, dp2]
end

const oop_q0 = @SVector [4.919080920016389, 2.836942666663649]
const oop_p0 = @SVector [0.0, 0.0]
const oop_u0 = vcat(oop_p0, oop_q0)

function hamilton(z, params, t)
    SVector(
        -A * z[3] - 3 * B / sqrt(2) * (z[4]^2 - z[3]^2) - D * z[3] * (z[3]^2 + z[4]^2),
        -z[4] * (A + 3 * sqrt(2) * B * z[3] + D * (z[3]^2 + z[4]^2)),
        z[1],
        z[2]
    )
end

function hamilton_iip!(dz, z, params, t)
    dz[1] = -A * z[3] - 3 * B / sqrt(2) * (z[4]^2 - z[3]^2) - D * z[3] * (z[3]^2 + z[4]^2)
    dz[2] = -z[4] * (A + 3 * sqrt(2) * B * z[3] + D * (z[3]^2 + z[4]^2))
    dz[3] = z[1]
    dz[4] = z[2]
    return nothing
end

function g(resid, u, p)
    resid[1] = H([u[1], u[2]], [u[3], u[4]], nothing) - E
    resid[2:4] .= 0
end

function g_jacobian(J, u, p)
    J[1, 1] = u[1]
    J[1, 2] = u[2]
    J[1, 3] = u[3]
    J[1, 4] = u[4]
    J[2:4, :] .= 0
end

const E = H(iip_p0, iip_q0, nothing)
const resid_prototype = zeros(4)
const cb = ManifoldProjection(g, manifold_jacobian = g_jacobian,
    resid_prototype = resid_prototype, nlopts = Dict(:ftol=>1e-13))
SciMLBase.DiscreteCallback{Returns{Bool}, DiffEqCallbacks.ManifoldProjectio
n{DiffEqCallbacks.UntypedNonAutonomousFunction{typeof(Main.var"##WeaveSandB
ox#232".g)}, DiffEqCallbacks.UntypedNonAutonomousFunction{typeof(Main.var"#
#WeaveSandBox#232".g_jacobian)}, Nothing, Missing, Base.Pairs{Symbol, Any, 
Tuple{Symbol, Symbol}, @NamedTuple{resid_prototype::Vector{Float64}, nlopts
::Dict{Symbol, Float64}}}, Nothing}, typeof(DiffEqCallbacks.initialize_mani
fold_projection), typeof(SciMLBase.FINALIZE_DEFAULT), Nothing, Tuple{}}(Ret
urns{Bool}(true), DiffEqCallbacks.ManifoldProjection{DiffEqCallbacks.Untype
dNonAutonomousFunction{typeof(Main.var"##WeaveSandBox#232".g)}, DiffEqCallb
acks.UntypedNonAutonomousFunction{typeof(Main.var"##WeaveSandBox#232".g_jac
obian)}, Nothing, Missing, Base.Pairs{Symbol, Any, Tuple{Symbol, Symbol}, @
NamedTuple{resid_prototype::Vector{Float64}, nlopts::Dict{Symbol, Float64}}
}, Nothing}(DiffEqCallbacks.UntypedNonAutonomousFunction{typeof(Main.var"##
WeaveSandBox#232".g)}(false, Main.var"##WeaveSandBox#232".g, nothing), Diff
EqCallbacks.UntypedNonAutonomousFunction{typeof(Main.var"##WeaveSandBox#232
".g_jacobian)}(false, Main.var"##WeaveSandBox#232".g_jacobian, nothing), no
thing, nothing, missing, Base.Pairs{Symbol, Any, Tuple{Symbol, Symbol}, @Na
medTuple{resid_prototype::Vector{Float64}, nlopts::Dict{Symbol, Float64}}}(
:resid_prototype => [0.0, 0.0, 0.0, 0.0], :nlopts => Dict(:ftol => 1.0e-13)
), nothing), DiffEqCallbacks.initialize_manifold_projection, SciMLBase.FINA
LIZE_DEFAULT, Bool[0, 1], nothing, (), true)

For the comparison we will use the following function

function energy_err(sol)
    map(i->H([sol[1, i], sol[2, i]], [sol[3, i], sol[4, i]], nothing)-E, 1:length(sol.u))
end
function abs_energy_err(sol)
    [abs.(H([sol[1, j], sol[2, j]], [sol[3, j], sol[4, j]], nothing) - E)
     for j in 1:length(sol.u)]
end

function compare(mode = :inplace, all = true, plt = nothing; tmax = 1e2)
    if mode == :inplace
        prob = DynamicalODEProblem(iip_dp, iip_dq, iip_p0, iip_q0, (0.0, tmax))
    else
        prob = DynamicalODEProblem(oop_dp, oop_dq, oop_p0, oop_q0, (0.0, tmax))
    end
    prob_linear = ODEProblem(hamilton, vcat(iip_p0, iip_q0), (0.0, tmax))
    prob_taylor = ODEProblem{true, SciMLBase.FullSpecialize}(
        hamilton_iip!, vcat(iip_p0, iip_q0), (0.0, tmax))

    # Cap saved points so energy-error plots stay CI-friendly. Default
    # save_everystep+dense at long tmax stores millions of states per
    # symplectic solve; TaylorMethod(50) alone allocated ~32 GiB at tmax=2e4
    # in the previous published run. See CI run 30654781033.
    nsave = clamp(Int(round(tmax)) + 1, 101, 1001)
    saveat = range(0.0, tmax; length = nsave)
    common = (; dense = false, saveat)

    GC.gc()
    (mode == :inplace && all) &&
        @time sol1 = solve(prob, Vern9(), callback = cb, abstol = 1e-14, reltol = 1e-14;
            common...)
    GC.gc()
    @time sol2 = solve(prob, KahanLi8(), dt = 1e-2, maxiters = 1e7; common...)
    GC.gc()
    @time sol3 = solve(prob, SofSpa10(), dt = 1e-2, maxiters = 1e7; common...)
    GC.gc()
    @time sol4 = solve(prob, Vern9(), abstol = 1e-14, reltol = 1e-14; common...)
    GC.gc()
    @time sol5 = solve(prob, DPRKN12(), abstol = 1e-14, reltol = 1e-14; common...)
    GC.gc()
    (mode == :inplace && all) &&
        @time sol6 = solve(prob_linear, TaylorMethod(50), abstol = 1e-20; common...)
    GC.gc()
    (mode == :inplace && all) &&
        @time sol7 = solve(prob_taylor, ExplicitTaylor(order = Val(8)),
            abstol = 1e-14, reltol = 1e-14; common...)

    (mode == :inplace && all) && println("Vern9 + ManifoldProjection max energy error:\t" *
            "$(maximum(abs_energy_err(sol1)))\tin\t$(length(sol1.u))\tsteps.")
    println("KahanLi8 max energy error:\t\t\t$(maximum(abs_energy_err(sol2)))\tin\t$(length(sol2.u))\tsteps.")
    println("SofSpa10 max energy error:\t\t\t$(maximum(abs_energy_err(sol3)))\tin\t$(length(sol3.u))\tsteps.")
    println("Vern9 max energy error:\t\t\t\t$(maximum(abs_energy_err(sol4)))\tin\t$(length(sol4.u))\tsteps.")
    println("DPRKN12 max energy error:\t\t\t$(maximum(abs_energy_err(sol5)))\tin\t$(length(sol5.u))\tsteps.")
    (mode == :inplace && all) &&
        println("TaylorMethod max energy error:\t\t\t$(maximum(abs_energy_err(sol6)))" *
                "\tin\t$(length(sol6.u))\tsteps.")
    (mode == :inplace && all) &&
        println("ExplicitTaylor max energy error:\t\t\t$(maximum(abs_energy_err(sol7)))" *
                "\tin\t$(length(sol7.u))\tsteps.")

    if plt == nothing
        plt = plot(xlabel = "t", ylabel = "Energy error")
    end

    (mode == :inplace && all) &&
        plot!(sol1.t, energy_err(sol1), label = "Vern9 + ManifoldProjection")
    plot!(sol2.t, energy_err(sol2), label = "KahanLi8", ls = mode==:inplace ? :solid :
                                                             :dash)
    plot!(sol3.t, energy_err(sol3), label = "SofSpa10", ls = mode==:inplace ? :solid :
                                                             :dash)
    plot!(sol4.t, energy_err(sol4), label = "Vern9", ls = mode==:inplace ? :solid : :dash)
    plot!(sol5.t, energy_err(sol5), label = "DPRKN12", ls = mode==:inplace ? :solid : :dash)
    (mode == :inplace && all) && plot!(sol6.t, energy_err(sol6), label = "TaylorMethod")
    (mode == :inplace && all) && plot!(sol7.t, energy_err(sol7), label = "ExplicitTaylor")

    return plt
end
compare (generic function with 4 methods)

The mode argument chooses between the in place approach and the out of place one. The all parameter is used to compare only the integrators that support both the in place and the out of place versions (we refer here only to the 6 high order methods chosen bellow). The plt argument can be used to overlay the results over a previous plot and the tmax keyword determines the simulation time.

Note:

  1. The Vern9 method is used with ODEProblem because of performance issues with ArrayPartition indexing which manifest for DynamicalODEProblem.
  2. The NLsolve call used by ManifoldProjection was modified to use ftol=1e-13 in order to obtain a very low energy error.

Here are the results of the comparisons between the in place methods:

compare(tmax = 1e2)
100.104955 seconds (182.38 M allocations: 9.133 GiB, 4.45% gc time, 99.72% 
compilation time)
  4.538534 seconds (5.33 M allocations: 289.071 MiB, 99.83% compilation tim
e)
  3.195432 seconds (2.97 M allocations: 167.829 MiB, 99.61% compilation tim
e)
 32.453733 seconds (68.53 M allocations: 3.506 GiB, 4.65% gc time, 99.93% c
ompilation time)
 10.432550 seconds (13.81 M allocations: 737.992 MiB, 1.83% gc time, 99.94%
 compilation time)
  6.282697 seconds (6.37 M allocations: 505.915 MiB, 2.95% gc time, 92.67% 
compilation time)
 77.451042 seconds (40.99 M allocations: 2.022 GiB, 0.94% gc time, 99.89% c
ompilation time: 5% of which was recompilation)
Vern9 + ManifoldProjection max energy error:	8.242295734817162e-13	in	162	s
teps.
KahanLi8 max energy error:			5.215383680479135e-12	in	101	steps.
SofSpa10 max energy error:			3.481659405224491e-12	in	101	steps.
Vern9 max energy error:				8.952838470577262e-13	in	101	steps.
DPRKN12 max energy error:			0.003214324563415971	in	101	steps.
TaylorMethod max energy error:			4.405364961712621e-13	in	101	steps.
ExplicitTaylor max energy error:			1.5701573374826694e-10	in	101	steps.

compare(tmax = 1e3)
0.007263 seconds (41.24 k allocations: 66.073 MiB)
  0.068709 seconds (4.11 k allocations: 217.305 KiB)
  0.118623 seconds (4.11 k allocations: 219.664 KiB)
  0.236778 seconds (242.67 k allocations: 5.602 MiB)
  0.046246 seconds (92.70 k allocations: 1.917 MiB)
  3.270539 seconds (9.23 M allocations: 2.020 GiB, 23.99% gc time)
  0.112237 seconds (7.57 k allocations: 416.109 KiB, 31.81% compilation tim
e)
Vern9 + ManifoldProjection max energy error:	8.242295734817162e-13	in	162	s
teps.
KahanLi8 max energy error:			1.028865881380625e-11	in	1001	steps.
SofSpa10 max energy error:			1.48929757415317e-11	in	1001	steps.
Vern9 max energy error:				7.744915819785092e-12	in	1001	steps.
DPRKN12 max energy error:			0.0038629649572641256	in	1001	steps.
TaylorMethod max energy error:			1.9468870959826745e-12	in	1001	steps.
ExplicitTaylor max energy error:			1.5017604937384021e-9	in	1001	steps.

# Long-horizon comparison without Taylor / ExplicitTaylor / ManifoldProjection.
# TaylorMethod(50) alone allocated ~32 GiB at tmax=2e4 in the previous publish.
compare(:inplace, false; tmax = 1e4)
0.671635 seconds (4.11 k allocations: 217.305 KiB)
  1.187964 seconds (4.11 k allocations: 219.664 KiB)
  2.165590 seconds (1.99 M allocations: 38.986 MiB)
  0.449525 seconds (879.89 k allocations: 16.931 MiB)
KahanLi8 max energy error:			4.3641534830385353e-11	in	1001	steps.
SofSpa10 max energy error:			6.464517809945391e-11	in	1001	steps.
Vern9 max energy error:				6.158984433568548e-11	in	1001	steps.
DPRKN12 max energy error:			0.004295171910001727	in	1001	steps.

As we can see from the above plots, we can achieve a very low energy error for long time simulation by manifold projection and with very high order Taylor methods. In comparison with the Hénon-Heiles system we see that as the Hamiltonian got more complex, the energy error for the other integration methods increased significantly.

We will now compare the in place with the out of place versions. In the plots bellow we will use a dashed line for the out of place versions.

function in_vs_out(; all = false, tmax = 1e2)
    println("In place versions:")
    plt = compare(:inplace, all, tmax = tmax)
    println("\nOut of place versions:")
    plt = compare(:oop, false, plt; tmax = tmax)
end
in_vs_out (generic function with 1 method)

First, here is a summary of all the available methods for tmax = 1e2 (kept short so Taylor / ExplicitTaylor stay in the CI budget):

in_vs_out(all = true, tmax = 1e2)
In place versions:
  0.007440 seconds (41.24 k allocations: 66.035 MiB)
  0.006940 seconds (503 allocations: 28.750 KiB)
  0.012193 seconds (503 allocations: 31.109 KiB)
  0.022793 seconds (24.42 k allocations: 582.766 KiB)
  0.005241 seconds (10.36 k allocations: 236.492 KiB)
  0.345450 seconds (923.28 k allocations: 206.853 MiB)
  0.007497 seconds (302 allocations: 20.453 KiB)
Vern9 + ManifoldProjection max energy error:	8.242295734817162e-13	in	162	s
teps.
KahanLi8 max energy error:			5.215383680479135e-12	in	101	steps.
SofSpa10 max energy error:			3.481659405224491e-12	in	101	steps.
Vern9 max energy error:				8.952838470577262e-13	in	101	steps.
DPRKN12 max energy error:			0.003214324563415971	in	101	steps.
TaylorMethod max energy error:			4.405364961712621e-13	in	101	steps.
ExplicitTaylor max energy error:			1.5701573374826694e-10	in	101	steps.

Out of place versions:
  3.622926 seconds (3.73 M allocations: 202.159 MiB, 99.84% compilation tim
e)
  1.806929 seconds (1.70 M allocations: 98.986 MiB, 99.44% compilation time
)
  3.433952 seconds (4.36 M allocations: 215.741 MiB, 99.91% compilation tim
e)
  2.766915 seconds (2.67 M allocations: 141.118 MiB, 99.90% compilation tim
e)
KahanLi8 max energy error:			5.215383680479135e-12	in	101	steps.
SofSpa10 max energy error:			3.510081114654895e-12	in	101	steps.
Vern9 max energy error:				1.4352963262354024e-12	in	101	steps.
DPRKN12 max energy error:			0.0036987036331623813	in	101	steps.

Now we will compare the in place and the out of place versions, but only for the integrators that are compatible with StaticArrays

in_vs_out(tmax = 1e2)
In place versions:
  0.006800 seconds (503 allocations: 28.750 KiB)
  0.011764 seconds (503 allocations: 31.109 KiB)
  0.024647 seconds (24.42 k allocations: 582.766 KiB)
  0.005065 seconds (10.36 k allocations: 236.305 KiB)
KahanLi8 max energy error:			5.215383680479135e-12	in	101	steps.
SofSpa10 max energy error:			3.481659405224491e-12	in	101	steps.
Vern9 max energy error:				8.952838470577262e-13	in	101	steps.
DPRKN12 max energy error:			0.003214324563415971	in	101	steps.

Out of place versions:
  0.005643 seconds (35 allocations: 10.055 KiB)
  0.010493 seconds (35 allocations: 11.039 KiB)
  0.002809 seconds (34 allocations: 10.742 KiB)
  0.002294 seconds (5.39 k allocations: 763.438 KiB)
KahanLi8 max energy error:			5.215383680479135e-12	in	101	steps.
SofSpa10 max energy error:			3.510081114654895e-12	in	101	steps.
Vern9 max energy error:				1.4352963262354024e-12	in	101	steps.
DPRKN12 max energy error:			0.0036987036331623813	in	101	steps.

in_vs_out(tmax = 1e3)
In place versions:
  0.068616 seconds (4.11 k allocations: 217.305 KiB)
  0.118328 seconds (4.11 k allocations: 219.664 KiB)
  0.236042 seconds (242.67 k allocations: 5.602 MiB)
  0.048811 seconds (92.70 k allocations: 1.917 MiB)
KahanLi8 max energy error:			1.028865881380625e-11	in	1001	steps.
SofSpa10 max energy error:			1.48929757415317e-11	in	1001	steps.
Vern9 max energy error:				7.744915819785092e-12	in	1001	steps.
DPRKN12 max energy error:			0.0038629649572641256	in	1001	steps.

Out of place versions:
  0.055524 seconds (41 allocations: 72.148 KiB)
  0.102672 seconds (41 allocations: 73.133 KiB)
  0.026523 seconds (40 allocations: 72.836 KiB)
  0.026049 seconds (44.75 k allocations: 7.112 MiB)
KahanLi8 max energy error:			1.028865881380625e-11	in	1001	steps.
SofSpa10 max energy error:			1.48929757415317e-11	in	1001	steps.
Vern9 max energy error:				9.890754881780595e-12	in	1001	steps.
DPRKN12 max energy error:			0.004104307027617438	in	1001	steps.

As we see from the above comparisons, the StaticArray versions are significantly faster and use less memory. The speedup provided for the out of place version is more proeminent at larger values for tmax. We can see again that if the simulation time is increased, the energy error of the symplectic methods is less noticeable compared to the rest of the methods. In comparison with the Henon-Heiles case, we see that the symplectic methods are more competitive with DPRKN12.

Appendix

These benchmarks are a part of the SciMLBenchmarks.jl repository, found at: https://github.com/SciML/SciMLBenchmarks.jl. For more information on high-performance scientific machine learning, check out the SciML Open Source Software Organization https://sciml.ai.

To locally run this benchmark, do the following commands:

using SciMLBenchmarks
SciMLBenchmarks.weave_file("benchmarks/DynamicalODE","Quadrupole_boson_Hamiltonian_energy_conservation_benchmark.jmd")

Computer Information:

Julia Version 1.11.9
Commit 53a02c0720c (2026-02-06 00:27 UTC)
Build Info:
  Official https://julialang.org/ release
Platform Info:
  OS: Linux (x86_64-linux-gnu)
  CPU: 128 × AMD EPYC 7502 32-Core Processor
  WORD_SIZE: 64
  LLVM: libLLVM-16.0.6 (ORCJIT, znver2)
Threads: 128 default, 0 interactive, 64 GC (on 128 virtual cores)
Environment:
  JULIA_DEPOT_PATH = /home/crackauc/github-runners/amdci8-1/.julia
  JULIA_NUM_THREADS = auto

Package Information:

Status `~/github-runners/amdci8-1/_work/SciMLBenchmarks.jl/SciMLBenchmarks.jl/benchmarks/DynamicalODE/Project.toml`
  [459566f4] DiffEqCallbacks v4.19.4
  [055956cb] DiffEqPhysics v3.22.0
  [b305315f] Elliptic v1.0.1
  [1dea7af3] OrdinaryDiffEq v7.8.1
  [af6ede74] OrdinaryDiffEqRKN v2.2.0
  [fa646aed] OrdinaryDiffEqSymplecticRK v2.2.2
  [9c7f1690] OrdinaryDiffEqTaylorSeries v2.3.0
  [65888b18] ParameterizedFunctions v5.27.0
  [91a5bcdd] Plots v1.41.7
  [31c91b34] SciMLBenchmarks v0.2.1
  [90137ffa] StaticArrays v1.9.20
  [10745b16] Statistics v1.11.5
  [92b13dbe] TaylorIntegration v0.18.16
  [37e2e46d] LinearAlgebra v1.11.0
  [de0858da] Printf v1.11.0

And the full manifest:

Status `~/github-runners/amdci8-1/_work/SciMLBenchmarks.jl/SciMLBenchmarks.jl/benchmarks/DynamicalODE/Manifest.toml`
  [47edcb42] ADTypes v1.24.0
  [14f7f29c] AMD v0.5.4
  [6e696c72] AbstractPlutoDingetjes v1.4.1
  [1520ce14] AbstractTrees v0.4.5
  [7d9f7c33] Accessors v0.1.45
  [79e6a3ab] Adapt v4.7.0
  [66dad0bd] AliasTables v1.1.3
  [ec485272] ArnoldiMethod v0.4.0
⌃ [4fba245c] ArrayInterface v7.30.1
  [4c555306] ArrayLayouts v1.12.2
  [15f4f7f2] AutoHashEquals v2.2.0
  [aae01518] BandedMatrices v1.12.0
  [e2ed5e7c] Bijections v0.2.2
  [b2a6c25c] BinaryHeaps v1.1.0
  [caf10ac8] BipartiteGraphs v0.1.14
  [8e7c35d0] BlockArrays v1.10.0
  [70df07ce] BracketingNonlinearSolve v1.12.7
  [082447d4] ChainRules v1.73.0
  [d360d2e6] ChainRulesCore v1.26.1
  [0b6fb165] ChunkCodecCore v1.0.2
  [4c0bbee4] ChunkCodecLibZlib v1.1.0
  [55437552] ChunkCodecLibZstd v1.0.0
  [08986516] Collects v1.1.0
  [35d6a980] ColorSchemes v3.31.0
  [3da002f7] ColorTypes v0.12.1
  [c3611d14] ColorVectorSpace v0.11.0
  [5ae59095] Colors v0.13.1
⌅ [861a8166] Combinatorics v1.0.2
  [38540f10] CommonSolve v0.2.14
  [bbf7d656] CommonSubexpressions v0.3.1
  [f70d9fcc] CommonWorldInvalidations v1.2.2
  [34da2185] Compat v4.18.1
  [b152e2b5] CompositeTypes v0.1.4
  [a33af91c] CompositionsBase v0.1.2
  [2569d6c7] ConcreteStructs v0.2.8
  [187b0558] ConstructionBase v1.6.0
  [d38c429a] Contour v0.6.3
  [a8cc5b0e] Crayons v4.2.0
  [9a962f9c] DataAPI v1.16.0
  [864edb3b] DataStructures v0.19.6
  [e2d170a0] DataValueInterfaces v1.0.0
  [8bb1440f] DelimitedFiles v1.9.1
  [2b5f629d] DiffEqBase v7.21.1
  [459566f4] DiffEqCallbacks v4.19.4
  [055956cb] DiffEqPhysics v3.22.0
  [163ba53b] DiffResults v1.1.0
  [b552c78f] DiffRules v1.16.0
  [a0c0ee7d] DifferentiationInterface v0.7.21
  [ffbed154] DocStringExtensions v0.9.5
  [5b8099bc] DomainSets v0.8.1
  [7c1d4256] DynamicPolynomials v0.6.8
  [b305315f] Elliptic v1.0.1
  [4e289a0a] EnumX v1.0.7
  [f151be2c] EnzymeCore v0.8.21
  [6912e4f1] Espresso v0.6.4
  [e2ba6199] ExprTools v0.1.11
  [55351af7] ExproniconLite v0.10.14
  [c87230d0] FFMPEG v0.4.5
  [7034ab61] FastBroadcast v1.4.0
  [9aa1b823] FastClosures v0.3.2
  [a4df4552] FastPower v1.5.0
  [5789e2e9] FileIO v1.20.0
  [1a297f60] FillArrays v1.17.0
  [64ca27bc] FindFirstFunctions v3.2.1
  [6a86dc24] FiniteDiff v2.33.0
⌅ [53c48c17] FixedPointNumbers v0.8.6
  [3821ddf9] FixedSizeArrays v1.3.0
  [1fa38f19] Format v1.3.7
  [f6369f11] ForwardDiff v1.4.6
  [a85aefff] FunctionMaps v0.1.2
  [069b7b12] FunctionWrappers v1.1.3
  [77dc65aa] FunctionWrappersWrappers v1.13.0
  [46192b85] GPUArraysCore v0.2.0
  [28b8d3ca] GR v0.73.27
  [86223c79] Graphs v1.15.0
  [076d061b] HashArrayMappedTries v0.2.0
⌅ [eafb193a] Highlights v0.5.3
  [3263718b] ImplicitDiscreteSolve v2.3.0
  [d25df0c9] Inflate v0.1.5
  [18e54dd8] IntegerMathUtils v0.1.4
  [8197267c] IntervalSets v0.7.14
  [3587e190] InverseFunctions v0.1.17
  [92d709cd] IrrationalConstants v0.2.6
  [82899510] IteratorInterfaceExtensions v1.0.0
  [033835bb] JLD2 v0.6.6
  [1019f520] JLFzf v0.1.11
  [692b3bcd] JLLWrappers v1.8.0
⌅ [682c06a0] JSON v0.21.4
  [ae98c720] Jieko v0.2.1
⌃ [ccbc3e58] JumpProcesses v9.32.3
  [ba0b0d4f] Krylov v0.10.10
  [2faa5264] LHLFactorization v2.2.2
  [b964fa9f] LaTeXStrings v1.4.1
  [23fbe1c1] Latexify v0.16.12
  [87fe0de2] LineSearch v0.1.18
⌃ [7ed4a6bd] LinearSolve v5.17.3
  [2ab3a3ac] LogExpFunctions v1.0.1
  [e6f89c97] LoggingExtras v1.2.0
  [1914dd2f] MacroTools v0.5.16
  [bb5d69b7] MaybeInplace v0.1.8
  [442fdcdd] Measures v0.3.3
  [e1d29d7a] Missings v1.2.0
  [961ee093] ModelingToolkit v11.43.1
⌃ [7771a370] ModelingToolkitBase v1.71.2
  [6bb917b9] ModelingToolkitTearing v1.20.6
⌅ [2e0e35c7] Moshi v0.3.9
  [46d2c3a1] MuladdMacro v0.2.7
  [102ac46a] MultivariatePolynomials v0.5.19
  [ffc61752] Mustache v1.0.21
  [d8a4904e] MutableArithmetics v1.8.0
  [77ba4419] NaNMath v1.1.4
⌃ [8913a72c] NonlinearSolve v4.30.0
⌃ [be0214bd] NonlinearSolveBase v2.49.5
⌃ [5959db7a] NonlinearSolveFirstOrder v2.6.1
  [9a2c21bd] NonlinearSolveQuasiNewton v1.15.3
  [26075421] NonlinearSolveSpectralMethods v1.8.3
  [6fe1bfb0] OffsetArrays v1.17.0
  [bac558e1] OrderedCollections v2.0.1
  [1dea7af3] OrdinaryDiffEq v7.8.1
⌃ [6ad6398a] OrdinaryDiffEqBDF v2.4.9
⌃ [bbf590c4] OrdinaryDiffEqCore v4.17.2
  [50262376] OrdinaryDiffEqDefault v2.6.2
  [4302a76b] OrdinaryDiffEqDifferentiation v3.12.0
  [127b3ac7] OrdinaryDiffEqNonlinearSolve v2.9.8
  [af6ede74] OrdinaryDiffEqRKN v2.2.0
  [43230ef6] OrdinaryDiffEqRosenbrock v2.7.3
  [b4bd8bb3] OrdinaryDiffEqRosenbrockTableaus v2.4.2
⌃ [2d112036] OrdinaryDiffEqSDIRK v2.9.4
  [fa646aed] OrdinaryDiffEqSymplecticRK v2.2.2
  [9c7f1690] OrdinaryDiffEqTaylorSeries v2.3.0
  [b1df2697] OrdinaryDiffEqTsit5 v2.1.4
  [79d7bb75] OrdinaryDiffEqVerner v2.4.1
  [65888b18] ParameterizedFunctions v5.27.0
  [d96e819e] Parameters v0.13.1
⌅ [69de0a69] Parsers v2.8.8
  [ccf2f8ad] PlotThemes v3.3.0
  [995b91a9] PlotUtils v1.4.4
  [91a5bcdd] Plots v1.41.7
  [e409e4f3] PoissonRandom v0.4.13
  [d236fae5] PreallocationTools v1.7.1
⌅ [aea7be01] PrecompileTools v1.2.1
  [21216c6a] Preferences v1.6.0
  [08abe8d2] PrettyTables v3.4.8
  [27ebfcd6] Primes v0.5.7
  [43287f4e] PtrArrays v1.4.0
  [0c0d3e7f] PureKLU v1.5.0
  [988b38a3] ReadOnlyArrays v0.2.0
  [795d4caa] ReadOnlyDicts v1.0.1
  [c1ae055f] RealDot v0.1.0
  [3cdcf5f2] RecipesBase v1.3.4
  [01d81517] RecipesPipeline v0.6.12
  [731186ca] RecursiveArrayTools v4.5.1
  [189a3867] Reexport v1.2.2
  [05181044] RelocatableFolders v1.0.1
  [ae029012] Requires v1.3.1
  [9fe22ead] RespecializeParams v1.3.0
  [7e49a35a] RuntimeGeneratedFunctions v0.5.26
  [9dfe8606] SCCNonlinearSolve v1.15.3
  [0bca4576] SciMLBase v3.54.0
  [31c91b34] SciMLBenchmarks v0.2.1
  [19f34311] SciMLJacobianOperators v0.1.19
  [a6db7da4] SciMLLogging v2.1.0
⌃ [c0aeaf25] SciMLOperators v1.30.0
  [431bcebd] SciMLPublic v1.3.0
  [53ae85a6] SciMLStructures v1.10.5
  [7e506255] ScopedValues v1.6.2
  [6c6a2e73] Scratch v1.3.0
  [efcf1570] Setfield v1.1.2
  [992d4aef] Showoff v1.1.1
  [727e6d20] SimpleNonlinearSolve v2.14.5
  [699a6c99] SimpleTraits v0.9.6
  [a2af1166] SortingAlgorithms v1.2.3
  [a57abbd0] SparseColumnPivotedQR v2.1.8
  [dc90abb0] SparseInverseSubset v0.1.3
  [0a514795] SparseMatrixColorings v0.4.28
  [276daf66] SpecialFunctions v2.9.0
  [860ef19b] StableRNGs v1.0.4
  [0c0c59c1] StarAlgebras v0.3.0
  [64909d44] StateSelection v1.11.1
  [90137ffa] StaticArrays v1.9.20
  [1e83bf80] StaticArraysCore v1.4.4
  [10745b16] Statistics v1.11.5
  [82ae8749] StatsAPI v1.8.0
  [2913bbd2] StatsBase v0.34.13
  [69024149] StringEncodings v0.3.7
⌅ [892a3eda] StringManipulation v0.5.0
  [09ab397b] StructArrays v0.7.3
  [2efcf032] SymbolicIndexingInterface v0.3.55
  [19f23fe9] SymbolicLimits v1.2.1
  [d1185830] SymbolicUtils v4.46.6
  [0c5d862f] Symbolics v7.39.2
  [3783bdb8] TableTraits v1.0.1
  [bd369af6] Tables v1.14.0
  [ed4db957] TaskLocalValues v0.1.3
  [b36ab563] TaylorDiff v0.3.5
  [92b13dbe] TaylorIntegration v0.18.16
  [6aa5eb33] TaylorSeries v0.22.4
  [62fd8b95] TensorCore v0.1.1
  [8ea1fca8] TermInterface v2.0.0
  [a759f4b9] TimerOutputs v1.2.1
  [781d530d] TruncatedStacktraces v1.4.0
  [3a884ed6] UnPack v1.0.2
  [1cfade01] UnicodeFun v0.4.1
  [41fe7b60] Unzip v0.2.0
  [d30d5f5c] WeakCacheSets v0.1.0
  [44d3d7a6] Weave v0.10.12
  [ddb6d928] YAML v0.4.16
  [6e34b625] Bzip2_jll v1.0.9+0
  [83423d85] Cairo_jll v1.18.7+0
  [ee1fde0b] Dbus_jll v1.16.2+0
  [2702e6a9] EpollShim_jll v0.0.20230411+1
  [2e619515] Expat_jll v2.8.4+0
⌅ [b22a6f82] FFMPEG_jll v8.1.2+0
  [a3f928ae] Fontconfig_jll v2.17.1+0
  [d7e528f0] FreeType2_jll v2.14.3+1
  [559328eb] FriBidi_jll v1.0.17+0
  [0656b61e] GLFW_jll v3.5.1+0
  [d2c73de3] GR_jll v0.73.27+0
⌅ [b0724c58] GettextRuntime_jll v0.22.4+0
  [61579ee1] Ghostscript_jll v9.55.1+0
  [7746bdde] Glib_jll v2.88.3+0
  [3b182d85] Graphite2_jll v1.3.16+0
  [2e76f6c2] HarfBuzz_jll v100.14004.0+0
  [1d5cc7b8] IntelOpenMP_jll v2025.2.0+0
  [aacddb02] JpegTurbo_jll v3.2.0+1
  [c1c5ebd0] LAME_jll v3.100.3+0
  [88015f11] LERC_jll v4.2.0+0
  [1d63c593] LLVMOpenMP_jll v23.1.1+0
⌅ [e9f186c6] Libffi_jll v3.4.7+0
  [7e76a0d4] Libglvnd_jll v1.7.1+1
  [94ce4f54] Libiconv_jll v1.18.0+0
  [4b2f31a3] Libmount_jll v2.42.0+0
  [89763e89] Libtiff_jll v4.7.3+0
  [38a345b3] Libuuid_jll v2.42.0+0
  [856f044c] MKL_jll v2025.2.0+0
  [e7412a2a] Ogg_jll v1.3.6+0
  [458c3c95] OpenSSL_jll v3.5.8+0
  [efe28fd5] OpenSpecFun_jll v0.5.6+0
  [91d4177d] Opus_jll v1.6.1+0
  [36c8627f] Pango_jll v1.58.2+0
  [30392449] Pixman_jll v0.46.4+0
  [c0090381] Qt6Base_jll v6.10.2+2
  [629bc702] Qt6Declarative_jll v6.10.2+2
  [ce943373] Qt6ShaderTools_jll v6.10.2+1
  [6de9746b] Qt6Svg_jll v6.10.2+0
  [e99dba38] Qt6Wayland_jll v6.10.2+1
  [a44049a8] Vulkan_Loader_jll v1.3.243+0
  [a2964d1f] Wayland_jll v1.24.0+0
  [ffd25f8a] XZ_jll v5.8.4+0
  [f67eecfb] Xorg_libICE_jll v1.1.2+0
  [c834827a] Xorg_libSM_jll v1.2.6+0
  [4f6342f7] Xorg_libX11_jll v1.8.13+0
  [0c0b7dd1] Xorg_libXau_jll v1.0.13+0
  [935fb764] Xorg_libXcursor_jll v1.2.4+0
  [a3789734] Xorg_libXdmcp_jll v1.1.6+0
  [1082639a] Xorg_libXext_jll v1.3.8+0
  [d091e8ba] Xorg_libXfixes_jll v6.0.2+0
  [a51aa0fd] Xorg_libXi_jll v1.8.4+0
  [d1454406] Xorg_libXinerama_jll v1.1.7+0
  [ec84b674] Xorg_libXrandr_jll v1.5.6+0
  [ea2f1a96] Xorg_libXrender_jll v0.9.12+0
  [a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0
  [c7cfdc94] Xorg_libxcb_jll v1.17.1+0
  [cc61e674] Xorg_libxkbfile_jll v1.2.0+0
  [e920d4aa] Xorg_xcb_util_cursor_jll v0.1.6+0
  [12413925] Xorg_xcb_util_image_jll v0.4.1+0
  [2def613f] Xorg_xcb_util_jll v0.4.1+0
  [975044d2] Xorg_xcb_util_keysyms_jll v0.4.1+0
  [0d47668e] Xorg_xcb_util_renderutil_jll v0.3.10+0
  [c22f9ab0] Xorg_xcb_util_wm_jll v0.4.2+0
  [35661453] Xorg_xkbcomp_jll v1.4.7+0
  [33bec58e] Xorg_xkeyboard_config_jll v2.47.0+2
  [c5fb5394] Xorg_xtrans_jll v1.6.0+0
  [3161d3a3] Zstd_jll v1.5.7+1
  [35ca27e7] eudev_jll v3.2.14+0
⌅ [214eeab7] fzf_jll v0.61.1+0
  [a4ae2306] libaom_jll v3.14.1+0
  [0ac62f75] libass_jll v0.17.5+0
  [1183f4f0] libdecor_jll v0.2.2+0
  [8e53e030] libdrm_jll v2.4.134+0
  [2db6ffa8] libevdev_jll v1.13.4+0
  [f638f0a6] libfdk_aac_jll v2.0.4+0
  [36db933b] libinput_jll v1.28.1+0
  [b53b4c65] libpng_jll v1.6.58+0
  [9a156e7d] libva_jll v2.23.0+0
  [f27f6e37] libvorbis_jll v1.3.8+0
  [009596ad] mtdev_jll v1.1.7+0
  [1317d2d5] oneTBB_jll v2022.3.0+0
⌅ [1270edf5] x264_jll v10164.0.1+0
  [dfaa095f] x265_jll v4.1.0+0
  [d8fb68d0] xkbcommon_jll v1.13.0+0
  [0dad84c5] ArgTools v1.1.2
  [56f22d72] Artifacts v1.11.0
  [2a0f44e3] Base64 v1.11.0
  [ade2ca70] Dates v1.11.0
  [8ba89e20] Distributed v1.11.0
  [f43a241f] Downloads v1.6.0
  [7b1f6079] FileWatching v1.11.0
  [9fa8497b] Future v1.11.0
  [b77e0a4c] InteractiveUtils v1.11.0
  [4af54fe1] LazyArtifacts v1.11.0
  [b27032c2] LibCURL v0.6.4
  [76f85450] LibGit2 v1.11.0
  [8f399da3] Libdl v1.11.0
  [37e2e46d] LinearAlgebra v1.11.0
  [56ddb016] Logging v1.11.0
  [d6f4376e] Markdown v1.11.0
  [a63ad114] Mmap v1.11.0
  [ca575930] NetworkOptions v1.2.0
  [44cfe95a] Pkg v1.11.0
  [de0858da] Printf v1.11.0
  [3fa0cd96] REPL v1.11.0
  [9a3f8284] Random v1.11.0
  [ea8e919c] SHA v0.7.0
  [9e88b42a] Serialization v1.11.0
  [6462fe0b] Sockets v1.11.0
  [2f01184e] SparseArrays v1.11.0
  [f489334b] StyledStrings v1.11.0
  [4607b0f0] SuiteSparse
  [fa267f1f] TOML v1.0.3
  [a4e569a6] Tar v1.10.0
  [8dfed614] Test v1.11.0
  [cf7118a7] UUIDs v1.11.0
  [4ec0a83e] Unicode v1.11.0
  [e66e0078] CompilerSupportLibraries_jll v1.1.1+0
  [deac9b47] LibCURL_jll v8.6.0+0
  [e37daf67] LibGit2_jll v1.7.2+0
  [29816b5a] LibSSH2_jll v1.11.0+1
  [c8ffd9c3] MbedTLS_jll v2.28.6+0
  [14a3606d] MozillaCACerts_jll v2023.12.12
  [4536629a] OpenBLAS_jll v0.3.27+1
  [05823500] OpenLibm_jll v0.8.5+0
  [efcefdf7] PCRE2_jll v10.42.0+1
  [bea87d4a] SuiteSparse_jll v7.7.0+0
  [83775a58] Zlib_jll v1.2.13+1
  [8e850b90] libblastrampoline_jll v5.11.0+0
  [8e850ede] nghttp2_jll v1.59.0+0
  [3f19e933] p7zip_jll v17.4.0+2
Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m`