Quadratic Nonlinear Rootfinding Benchmark
This is a test of a simple small nonlinear rootfinding problem.
using NonlinearSolve, StaticArrays, DiffEqDevTools, Sundials, CairoMakie, LinearSolve,
LinearAlgebra, StableRNGs, BenchmarkTools, Setfield, RecursiveFactorization
import PolyesterForwardDiff, MINPACK, NLsolve, SpeedMapping
const RUS = RadiusUpdateSchemes;
BenchmarkTools.DEFAULT_PARAMETERS.seconds = 0.5;
f_oop(u, p) = u .* u .- p
f_iip(du, u, p) = @. du = u * u - p
function generate_prob(::Val{N}, ::Val{static}) where {N, static}
u0_ = ones(N) .+ randn(StableRNG(0), N) * 0.01
u0 = static ? SVector{N, Float64}(u0_) : u0_
prob = static ?
NonlinearProblem{false}(f_oop, u0, 2.0) :
NonlinearProblem{true}(f_iip, u0, 2.0)
return prob
endgenerate_prob (generic function with 1 method)List of Solvers to Benchmark:
solvers = [
(; pkg = :nonlinearsolve, full_pkgname = "NonlinearSolve.jl",
name = "Default PolyAlgorithm", solver = Dict(:alg => nothing)), (;
pkg = :simplenonlinearsolve, full_pkgname = "SimpleNonlinearSolve.jl",
name = "Simple Newton Raphson", solver = Dict(:alg => SimpleNewtonRaphson())),
(; pkg = :simplenonlinearsolve, full_pkgname = "SimpleNonlinearSolve.jl",
name = "Simple DFSane", solver = Dict(:alg => SimpleDFSane())),
(; pkg = :simplenonlinearsolve, full_pkgname = "SimpleNonlinearSolve.jl",
name = "Simple Trust Region",
solver = Dict(:alg => SimpleTrustRegion(; nlsolve_update_rule = Val(true)))),
(; pkg = :simplenonlinearsolve, full_pkgname = "SimpleNonlinearSolve.jl",
name = "Simple Broyden", solver = Dict(:alg => SimpleBroyden())),
(; pkg = :simplenonlinearsolve, full_pkgname = "SimpleNonlinearSolve.jl",
name = "Simple Klement", solver = Dict(:alg => SimpleKlement())), (;
pkg = :nonlinearsolve, full_pkgname = "NonlinearSolve.jl",
name = "Newton Raphson", solver = Dict(:alg => NewtonRaphson(; linsolve = \))),
(; pkg = :nonlinearsolve, full_pkgname = "NonlinearSolve.jl",
name = "DFSane", solver = Dict(:alg => DFSane())),
(; pkg = :nonlinearsolve,
full_pkgname = "NonlinearSolve.jl",
name = "Trust Region",
solver = Dict(:alg => TrustRegion(; linsolve = \, radius_update_scheme = RUS.NLsolve))),
(; pkg = :nonlinearsolve, full_pkgname = "NonlinearSolve.jl",
name = "Broyden", solver = Dict(:alg => Broyden())),
(; pkg = :nonlinearsolve, full_pkgname = "NonlinearSolve.jl",
name = "Klement", solver = Dict(:alg => Klement(; linsolve = \))), (;
pkg = :wrapper, full_pkgname = "NLsolve.jl", name = "Newton Raphson (NLsolve.jl)",
solver = Dict(:alg => NLsolveJL(; method = :newton, autodiff = :forward))),
(; pkg = :wrapper, full_pkgname = "NLsolve.jl", name = "Trust Region (NLsolve.jl)",
solver = Dict(:alg => NLsolveJL(; autodiff = :forward))),
(; pkg = :wrapper, full_pkgname = "Sundials",
name = "Newton Raphson (Sundials)", solver = Dict(:alg => KINSOL())),
(; pkg = :wrapper, full_pkgname = "SpeedMapping.jl",
name = "Speed Mapping (SpeedMapping.jl)", solver = Dict(:alg => SpeedMappingJL()))
];Configurations:
abstols = 1.0 ./ 10.0 .^ (3:2:12)
reltols = 1.0 ./ 10.0 .^ (3:2:12)5-element Vector{Float64}:
0.001
1.0e-5
1.0e-7
1.0e-9
1.0e-11Helper Functions:
function check_solver(prob, solver)
prob.u0 isa StaticArray && solver.pkg === :wrapper && return false
try
sol = solve(prob, solver.solver[:alg]; abstol = 1e-5, reltol = 1e-5,
maxiters = 10000)
err = norm(sol.resid)
if !SciMLBase.successful_retcode(sol.retcode)
Base.printstyled(
"[Warn] Solver $(solver.name) returned retcode $(sol.retcode) \
with an residual norm = $(norm(sol.resid)).\n"; color = :red)
return false
elseif err > 1e3
Base.printstyled(
"[Warn] Solver $(solver.name) had a very large residual (norm \
= $(norm(sol.resid))).\n"; color = :red)
return false
elseif isinf(err) || isnan(err)
Base.printstyled("[Warn] Solver $(solver.name) had a residual of $(err).\n";
color = :red)
return false
end
Base.printstyled(
"[Info] Solver $(solver.name) successfully solved the problem \
(norm = $(norm(sol.resid))).\n"; color = :green)
catch e
Base.printstyled("[Warn] Solver $(solver.name) threw an error: $e.\n"; color = :red)
return false
end
return true
end
function generate_wpset(prob, solvers)
successful_solvers = filter(solver -> check_solver(prob, solver), solvers)
return WorkPrecisionSet(prob, abstols, reltols, getfield.(successful_solvers, :solver);
numruns = 50, error_estimate = :l∞, names = getfield.(successful_solvers, :name),
maxiters = 10000),
successful_solvers
endgenerate_wpset (generic function with 1 method)Plotting Functions:
# This is hardcoded for 4 input length
function plot_all_wpsets(wpset_list, solver_all, titles, suptitle)
@assert length(wpset_list) == length(titles) == 4
LINESTYLES = Dict(:nonlinearsolve => :solid, :simplenonlinearsolve => :dash,
:wrapper => :dot)
ASPECT_RATIO = 0.7
WIDTH = 1400
HEIGHT = round(Int, WIDTH * ASPECT_RATIO)
STROKEWIDTH = 2.5
colors = cgrad(:tableau_20, length(solver_all); categorical = true)
cycle = Cycle([:marker], covary = true)
plot_theme = Theme(Lines = (; cycle,), Scatter = (; cycle,))
fig = with_theme(plot_theme) do
fig = Figure(; size = (WIDTH, HEIGHT))
# `textbf` doesn't work
axs = Matrix{Any}(undef, 2, 2)
for i in 1:2, j in 1:2
ylabel = j == 1 ? L"$\mathrm{\mathbf{Time}}$ $\mathbf{(s)}$" : ""
xlabel = i == 2 ? L"Error: $\mathbf{||f(u^\ast)||_\infty}$" : ""
ax = Axis(fig[i, j]; ylabel = ylabel, title = titles[2 * (i - 1) + j],
titlegap = 10, titlesize = 22, xlabelsize = 22, ylabelsize = 22,
xticklabelsize = 20, yticklabelsize = 20,
xlabel = xlabel, xticksvisible = i == 2, yticksvisible = j == 1,
xticklabelsvisible = i == 2, yticklabelsvisible = j == 1,
xscale = log10, yscale = log10, xtickwidth = STROKEWIDTH,
ytickwidth = STROKEWIDTH, spinewidth = STROKEWIDTH)
axs[i, j] = ax
end
ls, scs = [], []
label_list = []
for (idx_solver, solver) in enumerate(reverse(solver_all))
first_success = true
for i in 1:2, j in 1:2
wpset, successful_solvers = wpset_list[2 * (i - 1) + j]
idx = findfirst(==(solver.name), [solver.name
for solver in successful_solvers])
idx === nothing && continue
(; name, times, errors) = wpset.wps[idx]
errors = [err.l∞ for err in errors]
l = lines!(axs[i, j], errors, times; linestyle = LINESTYLES[solver.pkg],
label = name, linewidth = 3, color = colors[idx_solver])
sc = scatter!(axs[i, j], errors, times; label = name, markersize = 16,
strokewidth = 1, marker = Cycled(idx_solver),
color = colors[idx_solver])
if first_success
push!(ls, l)
push!(scs, sc)
push!(label_list, solver.name)
first_success = false
end
end
end
linkaxes!(axs...)
Legend(fig[3, :], collect(reverse([[l, sc] for (l, sc) in zip(ls, scs)])),
collect(reverse(label_list)),
"Successful Solvers"; framevisible = true, framewidth = STROKEWIDTH,
orientation = :horizontal,
titlesize = 16, nbanks = 3, labelsize = 16,
tellheight = true, tellwidth = false, patchsize = (40.0f0, 20.0f0))
fig[0, :] = Label(fig, "Quadratic Problem with $(suptitle): Work Precision Diagram",
fontsize = 24, tellwidth = false, font = :bold)
fig
end
return fig
endplot_all_wpsets (generic function with 1 method)Static Array Versions
probs = [generate_prob(Val(N), Val(true)) for N in [2, 4, 8, 12]];
wpsets = [generate_wpset(prob, solvers) for prob in probs];
titles = ["N = 2", "N = 4", "N = 8", "N = 12"];
fig = plot_all_wpsets(wpsets, solvers, titles, "Static Arrays")[Info] Solver Default PolyAlgorithm successfully solved the problem (norm =
8.903708005997684e-6).
[Info] Solver Simple Newton Raphson successfully solved the problem (norm =
8.903708005997684e-6).
[Info] Solver Simple DFSane successfully solved the problem (norm = 2.21391
17217408527e-7).
[Info] Solver Simple Trust Region successfully solved the problem (norm = 8
.903708005997684e-6).
[Info] Solver Simple Broyden successfully solved the problem (norm = 7.7435
50661734637e-6).
[Info] Solver Simple Klement successfully solved the problem (norm = 8.7705
08340460738e-6).
[Info] Solver Newton Raphson successfully solved the problem (norm = 8.9037
08005997684e-6).
[Info] Solver DFSane successfully solved the problem (norm = 8.925226244970
55e-6).
[Info] Solver Trust Region successfully solved the problem (norm = 8.903708
005997684e-6).
[Info] Solver Broyden successfully solved the problem (norm = 7.74355066173
4637e-6).
[Info] Solver Klement successfully solved the problem (norm = 7.74279203948
5169e-6).
[Info] Solver Default PolyAlgorithm successfully solved the problem (norm =
1.3175515250018797e-5).
[Info] Solver Simple Newton Raphson successfully solved the problem (norm =
1.3175515250018797e-5).
[Info] Solver Simple DFSane successfully solved the problem (norm = 3.21318
9867783094e-7).
[Info] Solver Simple Trust Region successfully solved the problem (norm = 1
.3175515250018797e-5).
[Info] Solver Simple Broyden successfully solved the problem (norm = 1.0524
944462494045e-5).
[Info] Solver Simple Klement successfully solved the problem (norm = 1.2719
355158575668e-5).
[Info] Solver Newton Raphson successfully solved the problem (norm = 1.3175
515250018797e-5).
[Info] Solver DFSane successfully solved the problem (norm = 1.367124759680
58e-5).
[Info] Solver Trust Region successfully solved the problem (norm = 1.317551
5250018797e-5).
[Info] Solver Broyden successfully solved the problem (norm = 1.05249444624
94045e-5).
[Info] Solver Klement successfully solved the problem (norm = 1.04709031908
2685e-5).
[Info] Solver Default PolyAlgorithm successfully solved the problem (norm =
1.9046552208413456e-5).
[Info] Solver Simple Newton Raphson successfully solved the problem (norm =
1.9046552208413456e-5).
[Info] Solver Simple DFSane successfully solved the problem (norm = 4.64939
18801382363e-7).
[Info] Solver Simple Trust Region successfully solved the problem (norm = 1
.9046552208413456e-5).
[Info] Solver Simple Broyden successfully solved the problem (norm = 1.4246
490327013533e-5).
[Info] Solver Simple Klement successfully solved the problem (norm = 1.8259
373704793516e-5).
[Info] Solver Newton Raphson successfully solved the problem (norm = 1.9046
552208413456e-5).
[Info] Solver DFSane successfully solved the problem (norm = 1.973829931575
864e-5).
[Info] Solver Trust Region successfully solved the problem (norm = 1.904655
2208413456e-5).
[Info] Solver Broyden successfully solved the problem (norm = 1.42464903270
13533e-5).
[Info] Solver Klement successfully solved the problem (norm = 1.41180265390
8467e-5).
[Info] Solver Default PolyAlgorithm successfully solved the problem (norm =
2.2187014239665903e-5).
[Info] Solver Simple Newton Raphson successfully solved the problem (norm =
2.2187014239665903e-5).
[Info] Solver Simple DFSane successfully solved the problem (norm = 5.40467
1405346579e-7).
[Info] Solver Simple Trust Region successfully solved the problem (norm = 2
.2187014239665903e-5).
[Info] Solver Simple Broyden successfully solved the problem (norm = 1.9287
85498427112e-5).
[Info] Solver Simple Klement successfully solved the problem (norm = 2.1607
111134434963e-5).
[Info] Solver Newton Raphson successfully solved the problem (norm = 2.2187
014239665903e-5).
[Info] Solver DFSane successfully solved the problem (norm = 2.295755366158
96e-5).
[Info] Solver Trust Region successfully solved the problem (norm = 2.218701
4239665903e-5).
[Info] Solver Broyden successfully solved the problem (norm = 1.92878549841
49875e-5).
[Info] Solver Klement successfully solved the problem (norm = 1.92365300994
5377e-5).
save("static_arrays_quadratic.svg", fig)CairoMakie.Screen{SVG}Regular Julia Arrays
probs = [generate_prob(Val(N), Val(false)) for N in [4, 16, 128, 1024]]
wpsets = [(@show length(prob.u0); generate_wpset(prob, solvers))
for prob in probs]
titles = ["N = 4", "N = 16", "N = 128", "N = 1024"]
fig = plot_all_wpsets(wpsets, solvers, titles, "Regular Julia Arrays")length(prob.u0) = 4
[Info] Solver Default PolyAlgorithm successfully solved the problem (norm =
1.3175515250018797e-5).
[Info] Solver Simple Newton Raphson successfully solved the problem (norm =
1.3175515250018797e-5).
[Info] Solver Simple DFSane successfully solved the problem (norm = 3.21318
9867783094e-7).
[Info] Solver Simple Trust Region successfully solved the problem (norm = 1
.3175515250018797e-5).
[Info] Solver Simple Broyden successfully solved the problem (norm = 1.0524
944462889887e-5).
[Info] Solver Simple Klement successfully solved the problem (norm = 1.2719
355158575668e-5).
[Info] Solver Newton Raphson successfully solved the problem (norm = 1.3175
515250018797e-5).
[Info] Solver DFSane successfully solved the problem (norm = 1.367124759680
58e-5).
[Info] Solver Trust Region successfully solved the problem (norm = 1.317551
5250018797e-5).
[Info] Solver Broyden successfully solved the problem (norm = 1.05249444628
89887e-5).
[Info] Solver Klement successfully solved the problem (norm = 1.04709031908
2685e-5).
[Info] Solver Newton Raphson (NLsolve.jl) successfully solved the problem (
norm = 1.3175515250018797e-5).
[Info] Solver Trust Region (NLsolve.jl) successfully solved the problem (no
rm = 1.3175515250018797e-5).
[Info] Solver Newton Raphson (Sundials) successfully solved the problem (no
rm = 3.507854466145342e-9).
[Info] Solver Speed Mapping (SpeedMapping.jl) successfully solved the probl
em (norm = 1.0720403155111692e-5).
length(prob.u0) = 16
[Info] Solver Default PolyAlgorithm successfully solved the problem (norm =
5.416198774029886e-6).
[Info] Solver Simple Newton Raphson successfully solved the problem (norm =
2.5044494662558595e-5).
[Info] Solver Simple DFSane successfully solved the problem (norm = 6.11269
711700824e-7).
[Info] Solver Simple Trust Region successfully solved the problem (norm = 2
.5044494662558595e-5).
[Info] Solver Simple Broyden successfully solved the problem (norm = 2.3141
389150698733e-5).
[Info] Solver Simple Klement successfully solved the problem (norm = 2.4583
675020896853e-5).
[Info] Solver Newton Raphson successfully solved the problem (norm = 5.4161
98774029886e-6).
[Info] Solver DFSane successfully solved the problem (norm = 2.578212922891
9075e-5).
[Info] Solver Trust Region successfully solved the problem (norm = 5.416198
774029886e-6).
[Info] Solver Broyden successfully solved the problem (norm = 2.31413891506
98733e-5).
[Info] Solver Klement successfully solved the problem (norm = 2.31146141902
84395e-5).
[Info] Solver Newton Raphson (NLsolve.jl) successfully solved the problem (
norm = 2.5044494662558595e-5).
[Info] Solver Trust Region (NLsolve.jl) successfully solved the problem (no
rm = 2.5044494662558595e-5).
[Info] Solver Newton Raphson (Sundials) successfully solved the problem (no
rm = 6.033406020887388e-9).
[Info] Solver Speed Mapping (SpeedMapping.jl) successfully solved the probl
em (norm = 2.8506427883757435e-5).
length(prob.u0) = 128
[Info] Solver Default PolyAlgorithm successfully solved the problem (norm =
6.545361092122703e-5).
[Info] Solver Simple Newton Raphson successfully solved the problem (norm =
6.283767496044401e-11).
[Info] Solver Simple DFSane successfully solved the problem (norm = 1.73578
10548996058e-6).
[Info] Solver Simple Trust Region successfully solved the problem (norm = 6
.283767496044401e-11).
[Info] Solver Simple Broyden successfully solved the problem (norm = 6.5453
61092122703e-5).
[Info] Solver Simple Klement successfully solved the problem (norm = 7.0177
89716845796e-5).
[Info] Solver Newton Raphson successfully solved the problem (norm = 1.5772
968247447308e-5).
[Info] Solver DFSane successfully solved the problem (norm = 7.685980582924
527e-5).
[Info] Solver Trust Region successfully solved the problem (norm = 1.577296
8247447308e-5).
[Info] Solver Broyden successfully solved the problem (norm = 6.54536109212
2703e-5).
[Info] Solver Klement successfully solved the problem (norm = 6.53197265210
3389e-5).
[Info] Solver Newton Raphson (NLsolve.jl) successfully solved the problem (
norm = 6.283767496044401e-11).
[Info] Solver Trust Region (NLsolve.jl) successfully solved the problem (no
rm = 6.283767496044401e-11).
[Info] Solver Newton Raphson (Sundials) successfully solved the problem (no
rm = 2.0068313703523284e-8).
[Info] Solver Speed Mapping (SpeedMapping.jl) successfully solved the probl
em (norm = 3.036117846470209e-10).
length(prob.u0) = 1024
[Info] Solver Default PolyAlgorithm successfully solved the problem (norm =
0.00019052993535286191).
[Info] Solver Simple Newton Raphson successfully solved the problem (norm =
1.7311553941286643e-10).
[Info] Solver Simple DFSane successfully solved the problem (norm = 4.84115
0649443264e-6).
[Info] Solver Simple Trust Region successfully solved the problem (norm = 1
.7311553941286643e-10).
[Info] Solver Simple Broyden successfully solved the problem (norm = 0.0001
9052993535286191).
[Info] Solver Simple Klement successfully solved the problem (norm = 0.0001
967925659287559).
[Info] Solver Newton Raphson successfully solved the problem (norm = 4.3939
78338871547e-5).
[Info] Solver DFSane successfully solved the problem (norm = 0.000216303516
23678866).
[Info] Solver Trust Region successfully solved the problem (norm = 4.393978
338871547e-5).
[Info] Solver Broyden successfully solved the problem (norm = 0.00019052993
535286191).
[Info] Solver Klement successfully solved the problem (norm = 0.00019007289
32153426).
[Info] Solver Newton Raphson (NLsolve.jl) successfully solved the problem (
norm = 1.7311553941286643e-10).
[Info] Solver Trust Region (NLsolve.jl) successfully solved the problem (no
rm = 1.7311553941286643e-10).
[Info] Solver Newton Raphson (Sundials) successfully solved the problem (no
rm = 5.408987237602836e-8).
[Info] Solver Speed Mapping (SpeedMapping.jl) successfully solved the probl
em (norm = 1.0990421694883945e-9).
save("regular_arrays_quadratic.svg", fig)CairoMakie.Screen{SVG}Comparison against SimpleNonlinearSolve
function benchmark_combinations(solvers, probs)
return map(Iterators.product(solvers, probs)) do (solver, prob)
try
solver_concrete = solver.solver[:alg]
termination_condition = AbsNormTerminationMode(
Base.Fix1(maximum, abs))
sol = solve(prob, solver_concrete; abstol = 1e-10, reltol = 1e-10,
maxiters = 1000, termination_condition)
@info "Solver $(solver.name) successfully solved the problem with norm = \
$(norm(sol.resid, Inf))."
if norm(sol.resid, Inf) ≤ 1e-10
tt = @belapsed solve($prob, $solver_concrete; abstol = 1e-10,
reltol = 1e-10, maxiters = 1000,
termination_condition = $termination_condition)
@info "Solver $(solver.name) took $(tt) seconds."
return tt
else
return NaN
end
catch e
@error "Solver $(solver.name) threw an error $(e)."
return NaN
end
end
end
probs_sa = [generate_prob(Val(N), Val(true)) for N in [2, 4, 8, 12]];
solve_timings_sa = benchmark_combinations(solvers, probs_sa)
probs_reg = [generate_prob(Val(N), Val(false)) for N in [4, 16, 128, 1024]];
solve_timings_reg = benchmark_combinations(solvers, probs_reg)
function create_structure_data(solve_timings)
df = []
for (i, solver_setup) in enumerate(solvers)
if solver_setup.pkg === :simplenonlinearsolve
alg_name = string(solver_setup.name[8:end])
timings = solve_timings[i, :]
list = []
for (j, other_solver) in enumerate(solvers)
if other_solver.pkg !== :simplenonlinearsolve &&
contains(other_solver.name, alg_name)
this_timings = solve_timings[j, :]
push!(list, other_solver.name => this_timings ./ timings)
end
end
push!(df, alg_name => list)
end
end
return df
end
df_sa = create_structure_data(solve_timings_sa)
df_reg = create_structure_data(solve_timings_reg)
fig = begin
ASPECT_RATIO = 0.7
WIDTH = 1200
HEIGHT = round(Int, WIDTH * ASPECT_RATIO)
STROKEWIDTH = 2.5
fig = Figure(; size = (WIDTH, HEIGHT))
axs = Matrix{Any}(undef, 1, 4)
xs = reduce(vcat, [fill(i, length(dfᵢ.second)) for (i, dfᵢ) in enumerate(df_sa)])
dodge = reduce(vcat, [collect(1:length(dfᵢ.second)) for (i, dfᵢ) in enumerate(df_sa)])
for i in 1:4
ys = reduce(vcat, [[xx.second[i] for xx in dfᵢ.second] for dfᵢ in df_sa])
ax = Axis(fig[1, i];
ylabel = "",
title = L"$N = %$(length(probs_sa[i].u0))$",
titlegap = 10, xticksvisible = false, yticksvisible = true,
xticklabelsvisible = false, yticklabelsvisible = true, titlesize = 22,
spinewidth = STROKEWIDTH, xlabelsize = 22, ylabelsize = 22,
xticklabelrotation = π / 4, xticklabelsize = 20, yticklabelsize = 20)
axs[1, i] = ax
barplot!(ax, xs, ys; color = dodge, colormap = :tableau_20, strokewidth = 2)
hlines!(ax, [1.0], color = :black, linestyle = :dash, linewidth = 2)
end
linkaxes!(axs...)
axs = Matrix{Any}(undef, 1, 4)
xs = reduce(vcat, [fill(i, length(dfᵢ.second)) for (i, dfᵢ) in enumerate(df_reg)])
dodge = reduce(vcat, [collect(1:length(dfᵢ.second)) for (i, dfᵢ) in enumerate(df_reg)])
for i in 1:4
ys = reduce(vcat, [[xx.second[i] for xx in dfᵢ.second] for dfᵢ in df_reg])
ax = Axis(fig[2, i];
ylabel = "",
title = L"$N = %$(length(probs_reg[i].u0))$",
titlegap = 10, xticksvisible = true, yticksvisible = true,
xticklabelsvisible = true, yticklabelsvisible = true, titlesize = 22,
spinewidth = STROKEWIDTH, xlabelsize = 22, ylabelsize = 22,
xticks = (1:length(df_sa), [d.first for d in df_sa]),
xticklabelrotation = π / 4, xticklabelsize = 20, yticklabelsize = 20)
axs[1, i] = ax
barplot!(ax, xs, ys; color = dodge, dodge = dodge, colormap = :tableau_20,
strokewidth = 3)
hlines!(ax, [1.0], color = :black, linestyle = :dash, linewidth = 3)
end
linkaxes!(axs...)
fig[0, :] = Label(fig, "Simple Algorithms on Quadratic Root-Finding Problem",
fontsize = 24, font = :bold)
fig[1, 0] = Label(fig, "Static Arrays",
fontsize = 24, rotation = π / 2, tellheight = false)
fig[2, 0] = Label(fig, "Regular Julia Arrays",
fontsize = 24, rotation = π / 2, tellheight = false)
fig[1:2, end + 1] = Label(
fig, "Relative to SimpleNonlinearSolve.jl (Higher is Better)",
fontsize = 22, tellheight = false, rotation = π / 2)
labels = ["NonlinearSolve.jl", "NLsolve.jl", "Sundials"]
colors = cgrad(:tableau_20, length(labels); categorical = true)
elements = [PolyElement(; polycolor = colors[i], strokewidth = 3) for i in 1:3]
axislegend(axs[1, 4], elements, labels, "Package", patchsize = (20, 20),
labelsize = 16, titlesize = 20, framewidth = STROKEWIDTH, rowgap = 5)
fig
end
save("summary_plot_simplenonlinearsolve.svg", fig)CairoMakie.Screen{SVG}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/NonlinearProblem","quadratic_nonlinear.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_NUM_THREADS = auto
Package Information:
Status `~/github-runners/amdci3-1/_work/SciMLBenchmarks.jl/SciMLBenchmarks.jl/benchmarks/NonlinearProblem/Project.toml`
[2169fc97] AlgebraicMultigrid v2.0.2
[6e4b80f9] BenchmarkTools v1.8.0
[13f3f980] CairoMakie v0.15.14
⌃ [2b5f629d] DiffEqBase v7.20.1
[f3b72e0c] DiffEqDevTools v3.6.3
[a0c0ee7d] DifferentiationInterface v0.7.21
[7da242da] Enzyme v0.13.202
[40713840] IncompleteLU v0.2.1
[b964fa9f] LaTeXStrings v1.4.1
⌃ [d3d80556] LineSearches v7.5.1
⌃ [7ed4a6bd] LinearSolve v5.16.0
[4854310b] MINPACK v1.3.0
⌅ [2774e3e8] NLsolve v4.5.1
[b7050fa9] NonlinearProblemLibrary v0.1.8
⌃ [8913a72c] NonlinearSolve v4.28.0
[ace2c81b] PETSc v0.4.10
[98d1487c] PolyesterForwardDiff v0.1.4
[08abe8d2] PrettyTables v3.4.8
[f2c3362d] RecursiveFactorization v0.2.30
⌃ [31c91b34] SciMLBenchmarks v0.1.3
[a6db7da4] SciMLLogging v2.1.0
[efcf1570] Setfield v1.1.2
[727e6d20] SimpleNonlinearSolve v2.14.2
[9f842d2f] SparseConnectivityTracer v1.2.3
[0a514795] SparseMatrixColorings v0.4.28
[f1835b91] SpeedMapping v0.4.1
[860ef19b] StableRNGs v1.0.4
[90137ffa] StaticArrays v1.9.20
⌃ [c3572dad] Sundials v6.7.0
⌃ [0c5d862f] Symbolics v7.39.0
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`And the full manifest:
Status `~/github-runners/amdci3-1/_work/SciMLBenchmarks.jl/SciMLBenchmarks.jl/benchmarks/NonlinearProblem/Manifest.toml`
[47edcb42] ADTypes v1.24.0
[14f7f29c] AMD v0.5.4
[621f4979] AbstractFFTs v1.5.0
[6e696c72] AbstractPlutoDingetjes v1.4.1
[1520ce14] AbstractTrees v0.4.5
[7d9f7c33] Accessors v0.1.45
[79e6a3ab] Adapt v4.7.0
[35492f91] AdaptivePredicates v1.2.0
[2169fc97] AlgebraicMultigrid v2.0.2
[66dad0bd] AliasTables v1.1.3
[27a7e980] Animations v0.4.2
[ec485272] ArnoldiMethod v0.4.0
[4fba245c] ArrayInterface v7.30.1
[67c07d97] Automa v1.2.0
[13072b0f] AxisAlgorithms v1.1.0
[39de3d68] AxisArrays v0.4.8
[18cc8868] BaseDirs v1.4.0
[6e4b80f9] BenchmarkTools v1.8.0
[e2ed5e7c] Bijections v0.2.2
[62783981] BitTwiddlingConvenienceFunctions v0.1.6
[70df07ce] BracketingNonlinearSolve v1.12.6
[fa961155] CEnum v0.5.0
[2a0fbf3d] CPUSummary v0.2.7
[96374032] CRlibm v1.0.2
[159f3aea] Cairo v1.1.1
[13f3f980] CairoMakie v0.15.14
[d360d2e6] ChainRulesCore v1.26.1
[fb6a15b2] CloseOpenIntervals v0.1.13
[6b39b394] CodecZstd v0.8.7
[a2cac450] ColorBrewer v0.4.2
[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
[95dc2771] ComputePipeline v0.1.8
[2569d6c7] ConcreteStructs v0.2.8
[8f4d0f93] Conda v1.10.3
[187b0558] ConstructionBase v1.6.0
[d38c429a] Contour v0.6.3
[b7a15901] CoreMath v0.1.0
[adafc99b] CpuId v0.3.1
[a8cc5b0e] Crayons v4.2.0
[9a962f9c] DataAPI v1.16.0
[864edb3b] DataStructures v0.19.6
[e2d170a0] DataValueInterfaces v1.0.0
[927a84f5] DelaunayTriangulation v1.6.6
⌃ [2b5f629d] DiffEqBase v7.20.1
[f3b72e0c] DiffEqDevTools v3.6.3
[77a26b50] DiffEqNoiseProcess v5.36.2
[163ba53b] DiffResults v1.1.0
[b552c78f] DiffRules v1.16.0
[a0c0ee7d] DifferentiationInterface v0.7.21
[b4f34e82] Distances v0.10.12
[31c24e10] Distributions v0.25.131
[ffbed154] DocStringExtensions v0.9.5
[5b8099bc] DomainSets v0.8.1
[7c1d4256] DynamicPolynomials v0.6.8
[4e289a0a] EnumX v1.0.7
[7da242da] Enzyme v0.13.202
[f151be2c] EnzymeCore v0.8.21
[429591f6] ExactPredicates v2.2.9
[e2ba6199] ExprTools v0.1.11
[55351af7] ExproniconLite v0.10.14
[b86e33f2] FFTA v0.3.1
[7034ab61] FastBroadcast v1.4.0
[9aa1b823] FastClosures v0.3.2
[a4df4552] FastPower v1.5.0
[5789e2e9] FileIO v1.20.0
[8fc22ac5] FilePaths v0.9.0
[48062228] FilePathsBase v0.9.24
[1a297f60] FillArrays v1.17.0
[64ca27bc] FindFirstFunctions v3.2.1
[6a86dc24] FiniteDiff v2.33.0
⌅ [53c48c17] FixedPointNumbers v0.8.6
[1fa38f19] Format v1.3.7
[f6369f11] ForwardDiff v1.4.5
[b38be410] FreeType v4.1.1
[663a7486] FreeTypeAbstraction v0.10.8
[a85aefff] FunctionMaps v0.1.2
[069b7b12] FunctionWrappers v1.1.3
[77dc65aa] FunctionWrappersWrappers v1.13.0
[46192b85] GPUArraysCore v0.2.0
⌅ [61eb1bfa] GPUCompiler v1.23.0
[a0844989] Gamma v1.2.0
[5c1252a2] GeometryBasics v0.5.12
[d7ba0133] Git v1.5.0
[a2bd30eb] Graphics v1.1.3
[86223c79] Graphs v1.15.0
[3955a311] GridLayoutBase v0.11.3
⌅ [eafb193a] Highlights v0.5.3
[3e5b6fbb] HostCPUFeatures v0.1.18
[34004b35] HypergeometricFunctions v0.3.30
[7073ff75] IJulia v1.34.4
[615f187c] IfElse v0.1.1
[2803e5a7] ImageAxes v0.6.12
[c817782e] ImageBase v0.1.7
[a09fc81d] ImageCore v0.10.5
[82e4d734] ImageIO v0.6.10
[bc367c6b] ImageMetadata v0.9.10
[40713840] IncompleteLU v0.2.1
[9b13fd28] IndirectArrays v1.0.0
[d25df0c9] Inflate v0.1.5
[18e54dd8] IntegerMathUtils v0.1.4
[a98d9a8b] Interpolations v0.16.3
[d1acc4aa] IntervalArithmetic v1.0.11
[8197267c] IntervalSets v0.7.14
[3587e190] InverseFunctions v0.1.17
[92d709cd] IrrationalConstants v0.2.6
[f1662d9f] Isoband v0.1.1
[c8e1da08] IterTools v1.10.0
[82899510] IteratorInterfaceExtensions v1.0.0
[692b3bcd] JLLWrappers v1.8.0
⌅ [682c06a0] JSON v0.21.4
[ae98c720] Jieko v0.2.1
[b835a17e] JpegTurbo v0.1.6
[5ab0869b] KernelDensity v0.6.12
[ba0b0d4f] Krylov v0.10.9
[2faa5264] LHLFactorization v2.2.2
[929cbde3] LLVM v9.13.1
[b964fa9f] LaTeXStrings v1.4.1
[23fbe1c1] Latexify v0.16.12
[10f19ff3] LayoutPointers v0.1.17
[8cdb02fc] LazyModules v0.3.1
[87fe0de2] LineSearch v0.1.16
⌃ [d3d80556] LineSearches v7.5.1
⌃ [7ed4a6bd] LinearSolve v5.16.0
[2ab3a3ac] LogExpFunctions v1.0.1
[e6f89c97] LoggingExtras v1.2.0
[bdcacae8] LoopVectorization v0.12.174
[4854310b] MINPACK v1.3.0
[da04e1cc] MPI v0.20.27
[3da0fdf6] MPIPreferences v0.1.12
[1914dd2f] MacroTools v0.5.16
[ee78f7c6] Makie v0.24.14
[d125e4d3] ManualMemory v0.1.8
[dbb5928d] MappedArrays v0.4.3
[299715c1] MarchingCubes v0.1.11
[0a4f8689] MathTeXEngine v0.6.9
[bb5d69b7] MaybeInplace v0.1.8
[e1d29d7a] Missings v1.2.0
[e94cdb99] MosaicViews v0.3.4
[2e0e35c7] Moshi v0.3.12
[46d2c3a1] MuladdMacro v0.2.7
[102ac46a] MultivariatePolynomials v0.5.19
[ffc61752] Mustache v1.0.21
[d8a4904e] MutableArithmetics v1.8.0
⌅ [d41bc354] NLSolversBase v7.10.0
⌅ [2774e3e8] NLsolve v4.5.1
[77ba4419] NaNMath v1.1.4
[f09324ee] Netpbm v1.1.1
[b7050fa9] NonlinearProblemLibrary v0.1.8
⌃ [8913a72c] NonlinearSolve v4.28.0
[be0214bd] NonlinearSolveBase v2.49.4
[5959db7a] NonlinearSolveFirstOrder v2.5.1
[9a2c21bd] NonlinearSolveQuasiNewton v1.15.3
[26075421] NonlinearSolveSpectralMethods v1.8.2
[d8793406] ObjectFile v0.5.1
[510215fc] Observables v0.5.5
[6fe1bfb0] OffsetArrays v1.17.0
[52e1d378] OpenEXR v0.3.3
[bac558e1] OrderedCollections v2.0.1
[90014a1f] PDMats v0.11.41
[ace2c81b] PETSc v0.4.10
[f57f5aa1] PNGFiles v0.4.5
[19eb6ba3] Packing v0.5.1
[5432bcbf] PaddedViews v0.5.12
⌅ [69de0a69] Parsers v2.8.8
[eebad327] PkgVersion v0.3.3
[995b91a9] PlotUtils v1.4.4
[e409e4f3] PoissonRandom v0.4.13
[f517fe37] Polyester v0.7.19
[98d1487c] PolyesterForwardDiff v0.1.4
[1d0040c9] PolyesterWeave v0.2.2
[647866c9] PolygonOps v0.1.2
[d236fae5] PreallocationTools v1.7.1
⌅ [aea7be01] PrecompileTools v1.2.1
[21216c6a] Preferences v1.5.2
[08abe8d2] PrettyTables v3.4.8
[27ebfcd6] Primes v0.5.7
[92933f4c] ProgressMeter v1.11.0
[43287f4e] PtrArrays v1.4.0
[0c0d3e7f] PureKLU v1.4.1
[4b34888f] QOI v1.0.2
[1fd47b50] QuadGK v2.11.3
[b3c3ace0] RangeArrays v0.3.2
[c84ed2f1] Ratios v0.4.5
[988b38a3] ReadOnlyArrays v0.2.0
[3cdcf5f2] RecipesBase v1.3.4
[731186ca] RecursiveArrayTools v4.5.1
[f2c3362d] RecursiveFactorization v0.2.30
[189a3867] Reexport v1.2.2
[05181044] RelocatableFolders v1.0.1
[ae029012] Requires v1.3.1
[ae5879a3] ResettableStacks v1.4.0
[9fe22ead] RespecializeParams v1.3.0
[79098fc4] Rmath v0.9.0
[47965b36] RootedTrees v2.27.0
[f2b01f46] Roots v3.0.8
[5eaf0fd0] RoundingEmulator v0.2.1
[7e49a35a] RuntimeGeneratedFunctions v0.5.26
[fdea26ae] SIMD v3.7.2
[94e857df] SIMDTypes v0.1.0
[476501e8] SLEEFPirates v0.6.46
[0bca4576] SciMLBase v3.53.1
⌃ [31c91b34] SciMLBenchmarks v0.1.3
[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
[6c6a2e73] Scratch v1.3.0
[efcf1570] Setfield v1.1.2
[65257c39] ShaderAbstractions v0.5.0
[73760f76] SignedDistanceFields v0.4.1
[727e6d20] SimpleNonlinearSolve v2.14.2
[699a6c99] SimpleTraits v0.9.6
[45858cf5] Sixel v0.1.5
[a2af1166] SortingAlgorithms v1.2.3
[bd59d7e1] SparseBandedMatrices v1.4.0
[a57abbd0] SparseColumnPivotedQR v2.1.8
[9f842d2f] SparseConnectivityTracer v1.2.3
[0a514795] SparseMatrixColorings v0.4.28
[276daf66] SpecialFunctions v2.9.0
[f1835b91] SpeedMapping v0.4.1
[860ef19b] StableRNGs v1.0.4
[cae243ae] StackViews v0.1.2
[0c0c59c1] StarAlgebras v0.3.0
[aedffcd0] Static v1.4.6
[0d7ed370] StaticArrayInterface v1.10.0
[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
[4c63d2b9] StatsFuns v2.2.1
[7792a7ef] StrideArraysCore v0.5.9
[69024149] StringEncodings v0.3.7
⌅ [892a3eda] StringManipulation v0.5.0
[09ab397b] StructArrays v0.7.3
[53d494c1] StructIO v0.3.1
⌃ [c3572dad] Sundials v6.7.0
[2efcf032] SymbolicIndexingInterface v0.3.55
[19f23fe9] SymbolicLimits v1.2.1
⌃ [d1185830] SymbolicUtils v4.46.1
⌃ [0c5d862f] Symbolics v7.39.0
[3783bdb8] TableTraits v1.0.1
[bd369af6] Tables v1.14.0
[ed4db957] TaskLocalValues v0.1.3
[62fd8b95] TensorCore v0.1.1
[8ea1fca8] TermInterface v2.0.0
[8290d209] ThreadingUtilities v0.5.6
[731e570b] TiffImages v0.11.9
[a759f4b9] TimerOutputs v1.2.1
[e689c965] Tracy v0.1.6
[3bb67fe8] TranscodingStreams v0.11.3
[d5829a12] TriangularSolve v0.2.6
[981d1d27] TriplotBase v0.1.0
[781d530d] TruncatedStacktraces v1.4.0
[3a884ed6] UnPack v1.0.2
[1cfade01] UnicodeFun v0.4.1
[b8865327] UnicodePlots v3.8.4
[1986cc42] Unitful v1.29.0
[3d5dd08c] VectorizationBase v0.21.74
[33b4df10] VectorizedRNG v0.2.26
[81def892] VersionParsing v1.3.0
[d30d5f5c] WeakCacheSets v0.1.0
[44d3d7a6] Weave v0.10.12
[e3aaa7dc] WebP v0.1.3
[efce3f68] WoodburyMatrices v1.1.0
[ddb6d928] YAML v0.4.16
[c2297ded] ZMQ v1.5.1
[6e34b625] Bzip2_jll v1.0.9+0
[4e9b3aee] CRlibm_jll v1.0.1+0
[83423d85] Cairo_jll v1.18.7+0
[a38c48d9] CoreMath_jll v0.1.0+0
⌅ [5ae413db] EarCut_jll v2.2.4+0
[7cc45869] Enzyme_jll v0.0.292+0
[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
⌅ [b0724c58] GettextRuntime_jll v0.22.4+0
[61579ee1] Ghostscript_jll v9.55.1+0
⌅ [59f7168a] Giflib_jll v5.2.3+0
[020c3dae] Git_LFS_jll v3.7.1+0
[f8c6e375] Git_jll v2.55.0+0
[7746bdde] Glib_jll v2.88.3+0
[3b182d85] Graphite2_jll v1.3.16+0
[2e76f6c2] HarfBuzz_jll v100.14004.0+0
[e33a78d0] Hwloc_jll v2.14.0+0
[905a6f67] Imath_jll v3.2.2+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
[dad2f222] LLVMExtra_jll v0.0.47+0
[1d63c593] LLVMOpenMP_jll v22.1.7+0
[ad6e5548] LibTracyClient_jll v0.13.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
[b5ada748] MPIABI_jll v1.0.0+0
[7cb0a576] MPICH_jll v5.0.1+0
[f1f71cc9] MPItrampoline_jll v5.5.6+0
[9237b28f] MicrosoftMPI_jll v10.1.4+3
[e7412a2a] Ogg_jll v1.3.6+0
[656ef2d0] OpenBLAS32_jll v0.3.34+0
[6cdc7f73] OpenBLASConsistentFPCSR_jll v0.3.34+0
[18a262bb] OpenEXR_jll v3.4.15+0
[fe0851c0] OpenMPI_jll v5.0.11+0
[9bd350c2] OpenSSH_jll v10.5.1+0
[458c3c95] OpenSSL_jll v3.5.8+0
[efe28fd5] OpenSpecFun_jll v0.5.6+0
[91d4177d] Opus_jll v1.6.1+0
[8fa3689e] PETSc_jll v3.22.2+0
[36c8627f] Pango_jll v1.58.2+0
[30392449] Pixman_jll v0.46.4+0
[f50d1b31] Rmath_jll v0.5.2+0
[aabda75e] SCALAPACK32_jll v2.2.302+0
[ca45d3f4] SuiteSparse32_jll v7.12.1+1
[fb77eaff] Sundials_jll v7.5.0+0
⌅ [02c8fc9c] XML2_jll v2.13.9+0
[ffd25f8a] XZ_jll v5.8.3+0
[4f6342f7] Xorg_libX11_jll v1.8.13+0
[0c0b7dd1] Xorg_libXau_jll v1.0.13+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
[ea2f1a96] Xorg_libXrender_jll v0.9.12+0
[a65dc6b1] Xorg_libpciaccess_jll v0.19.0+0
[c7cfdc94] Xorg_libxcb_jll v1.17.1+0
[c5fb5394] Xorg_xtrans_jll v1.6.0+0
[8f1865be] ZeroMQ_jll v4.3.6+0
[3161d3a3] Zstd_jll v1.5.7+1
[b792d7bf] cminpack_jll v1.3.12+0
[9a68df92] isoband_jll v0.2.3+0
[a4ae2306] libaom_jll v3.14.1+0
[0ac62f75] libass_jll v0.17.5+0
[8e53e030] libdrm_jll v2.4.134+0
[f638f0a6] libfdk_aac_jll v2.0.4+0
[b53b4c65] libpng_jll v1.6.58+0
[075b6546] libsixel_jll v1.10.5+0
[a9144af2] libsodium_jll v1.0.21+0
[9a156e7d] libva_jll v2.23.0+0
[f27f6e37] libvorbis_jll v1.3.8+0
[c5f90fcd] libwebp_jll v1.6.0+0
[9aeb927a] mpif_jll v1.0.0+0
[1317d2d5] oneTBB_jll v2022.3.0+0
⌅ [1270edf5] x264_jll v10164.0.1+0
[dfaa095f] x265_jll v4.1.0+0
[0dad84c5] ArgTools v1.1.2
[56f22d72] Artifacts v1.11.0
[2a0f44e3] Base64 v1.11.0
[8bf52ea8] CRC32c 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
[9abbd945] Profile v1.11.0
[3fa0cd96] REPL v1.11.0
[9a3f8284] Random v1.11.0
[ea8e919c] SHA v0.7.0
[9e88b42a] Serialization v1.11.0
[1a1011a3] SharedArrays 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`