Update OrdinaryDiffEq requirement from 6.101 to 6.101, 7.0

[dependabot]

Updates the requirements on OrdinaryDiffEq to permit the latest version.

Release notes

Sourced from OrdinaryDiffEq's releases.

v7.0.0

OrdinaryDiffEq v7.0.0

Diff since v6.211.0

Many breaking changes. The complete migration story is detailed in https://github.com/SciML/OrdinaryDiffEq.jl/blob/master/NEWS.md

Merged pull requests:

• Fix the interpolation function for dense output (#11) (@​dawbarton)
• Merge Internal Redesign (#18) (@​ChrisRackauckas)
• v0.6 compatibility (#37) (@​ChrisRackauckas)
• WIP: SSPRK (#40) (@​ranocha)
• no test prob and callbacks in prob (#41) (@​ChrisRackauckas)
• Compat.Iterators needs 0.18 minimum (#44) (@​tkelman)
• Add testing with v0.6 on Travis and AppVeyor (#47) (@​ScottPJones)
• Remove InplaceOps, no longer used (#51) (@​ScottPJones)
• ode_interpolant uses @evalpoly in interpolants.jl (#52) (@​ranocha)
• rewrote ode_dense_test.jl to make it more readable (#53) (@​ranocha)
• Add first derivatives for interpolation (#54) (@​gabrielgellner)
• Update CI URLs to point to new caching infrastructure (#56) (@​staticfloat)
• update minimum julia version to 0.6.0-pre (#57) (@​tkelman)
• Add dense SSP output for SSPRK22 and SSPRK33 (#65) (@​ranocha)
• added SSPRK432 incl. 2nd order SSP dense output (#66) (@​ranocha)
• Remove type of integrator in signature of apply_discrete_callback! (#67) (@​devmotion)
• Improvements of SSPRK methods (#68) (@​ranocha)
• [WIP] High order symplectic integrator (#69) (@​YingboMa)
• Fix for element-wise tolerances (#71) (@​devmotion)
• Add third-order symplectic integrator (#73) (@​YingboMa)
• Make the output of a solution interpolation be a DiffEqArray (#74) (@​gabrielgellner)
• Sanitize tstops (#76) (@​devmotion)
• Avoid undefined entries if k is array of arrays (#80) (@​devmotion)
• Fix deprecation warning for isnan (#81) (@​devmotion)
• [WIP] Add Runge-Kutta-Nyström method (#88) (@​YingboMa)
• WIP: change to new @​muladd (#89) (@​devmotion)
• Add Nystrom5VelocityIndependent and fix Nystrom4VelocityIndependent (#95) (@​YingboMa)
• Updated @muladd and broadcasts (#104) (@​devmotion)
• LinearImplicitEuler (#109) (@​ChrisRackauckas)
• Remove integrator utils inlining (#121) (@​ChrisRackauckas)
• Fix DEDataArray (#124) (@​devmotion)
• Update tableaus and calculation of error estimates in low order RK methods (#128) (@​devmotion)
• Update tableaus and error estimate calculation of Verner RK methods (#129) (@​devmotion)
• Add forth order improved Runge-Kutta-Nyström method (#131) (@​YingboMa)
• Update Rosenbrock methods and explicit RK (#137) (@​devmotion)
• Update composite integrator and Feagin RK, exponential RK, low order RK, and Verner RK methods (#140) (@​devmotion)
• Update high order RK and threaded DP5 method (#142) (@​devmotion)
• Use Horner's rule in Tsit5 interpolants (#149) (@​devmotion)
• Add IRKN3 and tableaus for DPRKN6 (#150) (@​YingboMa)
• RK Nyström clean up (#154) (@​YingboMa)
• [WIP] Add DPRKN6 a.k.a. RKN6(4)6FD algorithm (#156) (@​YingboMa)
• Generalized Strang splitting (#157) (@​jagot)

... (truncated)

Changelog

Sourced from OrdinaryDiffEq's changelog.

OrdinaryDiffEq.jl v7 Breaking Changes

This release bumps to SciMLBase v3, RecursiveArrayTools v4, and includes breaking changes across DiffEqBase, OrdinaryDiffEqCore, and all solver sublibraries.

Themes of the v7 release

Most of the breaking changes fall into a small set of recurring themes. Keep these in mind while reading the migration table — they explain why an individual change exists and often suggest the right migration direction:

• Time to first solve (TTFS) reduction. Direct deps on Static.jl, StaticArrayInterface.jl, Polyester.jl, and StaticArrays.jl were dropped; using OrdinaryDiffEq now loads only the default solver set; ODEFunction switched to AutoSpecialize. All of this means less code loaded and more precompilation caching on first solve.
• Type stability everywhere. All Bool solver/solve keyword arguments (autodiff, verbose, alias, lazy, …) were replaced by typed objects. Passing a Bool no longer changes dispatch in ways the compiler cannot specialize on, and the reverse is no longer allowed to silently fall back through slow generic paths.
• Generality beyond ForwardDiff. chunk_size, diff_type, standardtag, etc. encoded ForwardDiff-specific or FiniteDiff-specific knobs on every solver. They are replaced by the ADTypes interface (AutoForwardDiff, AutoFiniteDiff, AutoEnzyme, AutoZygote, …) so every solver automatically generalizes to any AD backend.
• Controller is now an object, not a pile of solve kwargs. gamma, beta1, beta2, qmin, qmax, qsteady_min, qsteady_max, qoldinit were moved onto concrete PIController / PIDController / IController / PredictiveController structs, and EEst moved to the controller cache. This is prep work for pluggable controllers and removes a large amount of dead state from the integrator struct.
• Cleanup of old re-exports / deprecations. Functions like has_destats (now has_stats), sol.destats (now sol.stats), DEAlgorithm/DEProblem/DESolution abstract types, tuples()/intervals(), QuadratureProblem, fastpow, concrete_solve, etc. were on a deprecation path for one or more minor releases. v7 removes them.

Recommended upgrade path

The cleanest path is not to jump straight from an old environment onto v7. Most renamed APIs (e.g. DEAlgorithm → AbstractDEAlgorithm, u_modified! → derivative_discontinuity!, has_destats → has_stats, sol.destats → sol.stats, the construct* tableau functions, alias_u0/alias_du0, beta1/beta2, PID kwargs) already exist under their new names in SciMLBase v2 / OrdinaryDiffEq v6 with deprecation warnings. The recommended sequence is:

1. Stay on SciMLBase v2 / OrdinaryDiffEq v6. Update your code to the new names (has_stats, sol.stats, AbstractDEAlgorithm, derivative_discontinuity!, ODEAliasSpecifier, ODEVerbosity, ADTypes-based autodiff, explicit controller = … objects, new tableau names) while the deprecation shims still exist.
2. Verify your tests pass on v6 with no deprecation warnings.
3. Then bump to v7. At this point your code should compile and run against v7 without further changes aside from the genuinely new breakage (RAT v4 array semantics, ensemble prob_func/output_func signature, struct type parameter removals, kwargs that truly no longer exist, default changes like CheckInit and williamson_condition=false).

Doing it in two steps keeps the diff small per step and lets the deprecation warnings on v6 point you at the exact call sites that will break on v7.

Fallback for RAT v4 indexing

If you cannot update sol[i] / length(sol) / eachindex(sol) call sites yet (see the RAT v4 table below), you can opt back into v3 semantics on a per-solution basis by converting the container type to the ragged variant:

using RecursiveArrayToolsRaggedArrays
sol_old = RaggedVectorOfArray(sol)   # indexes like v3: sol_old[i] is the i-th timestep

RecursiveArrayToolsRaggedArrays.jl preserves the previous AbstractVectorOfArray indexing behavior (timestep-first, not element-first). This is the escape hatch for code that assumes sol[i] returns the i-th timestep. It is, however, recommended that you update to the sol.u[i] / sol[:, i] style — the ragged wrapper is a compatibility layer, not the canonical API going forward.

---

RecursiveArrayTools v4

ODESolution is now an AbstractArray

AbstractVectorOfArray (the parent type of ODESolution, RODESolution, DAESolution, etc.) now subtypes AbstractArray. This changes the semantics of several common operations:

Operation	v3 (old)	v4 (new)	Migration
sol[i]	Returns i-th timestep (Vector)	Returns i-th scalar element (column-major)	Use sol.u[i] or sol[:, i]
length(sol)	Number of timesteps	prod(size(sol)) (total elements)	Use length(sol.t) or length(sol.u)
eachindex(sol)	1:nsteps	CartesianIndices(size(sol))	Use eachindex(sol.u)
iterate(sol)	Iterates over timesteps	Iterates over scalar elements	Use for u in sol.u
first(sol) / last(sol)	First/last timestep	First/last scalar element	Use first(sol.u) / last(sol.u)

... (truncated)

Commits

• f3ce496 Merge pull request #3567 from SciML/drop-unused-rosenbrock-tableaus-dep
• 02763e7 Drop unused OrdinaryDiffEqRosenbrockTableaus from top-level deps
• a0a61e0 Update version to 7.0.0 in Project.toml
• 68c304d Merge pull request #3566 from SciML/fix-delaydiffeq-extras-uuids
• 7c87e5a Fix three wrong UUIDs in DelayDiffEq's [extras]
• b3359fb Merge pull request #3565 from SciML/revert-core-ddt-bumps
• cfb94cd Revert OrdinaryDiffEqCore and DiffEqDevTools major bumps from #3562
• 5b867b8 Merge pull request #3563 from ChrisRackauckas-Claude/drop-old-majors-v7-stack
• a8419de Revert out-of-scope deps additions in Rosenbrock/Tsit5 QA test envs
• 260775b Drop old majors from v7-coupled stack compat
• Additional commits viewable in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)