build based on 07f7057

Author: Documenter.jl

dev/.documenter-siteinfo.json

@@ -1 +1 @@
-{"documenter":{"julia_version":"1.12.5","generation_timestamp":"2026-03-24T17:47:29","documenter_version":"1.17.0"}}
+{"documenter":{"julia_version":"1.12.5","generation_timestamp":"2026-03-25T10:21:18","documenter_version":"1.17.0"}}

dev/assets/Manifest.toml

@@ -684,9 +684,9 @@ version = "1.12.0"
 
 [[deps.LinearSolve]]
 deps = ["ArrayInterface", "ChainRulesCore", "ConcreteStructs", "DocStringExtensions", "EnumX", "GPUArraysCore", "InteractiveUtils", "Krylov", "Libdl", "LinearAlgebra", "MKL_jll", "Markdown", "OpenBLAS_jll", "PrecompileTools", "Preferences", "RecursiveArrayTools", "Reexport", "SciMLBase", "SciMLLogging", "SciMLOperators", "Setfield", "StaticArraysCore"]
-git-tree-sha1 = "a118acd3945833455f9de6bae521c0414feaac2d"
+git-tree-sha1 = "adbd4c44ef9361c67dd5dc192b66ac12b9e1be85"
 uuid = "7ed4a6bd-45f5-4d41-b270-4a48e9bafcae"
-version = "3.67.0"
+version = "3.68.0"
 
     [deps.LinearSolve.extensions]
     LinearSolveAMDGPUExt = "AMDGPU"
@@ -873,10 +873,10 @@ version = "4.16.0"
     Sundials = "c3572dad-4567-51f8-b174-8c6c989267f4"
 
 [[deps.NonlinearSolveBase]]
-deps = ["ADTypes", "Adapt", "ArrayInterface", "CommonSolve", "Compat", "ConcreteStructs", "DifferentiationInterface", "EnzymeCore", "FastClosures", "LinearAlgebra", "LogExpFunctions", "Markdown", "MaybeInplace", "PreallocationTools", "Preferences", "Printf", "RecursiveArrayTools", "SciMLBase", "SciMLJacobianOperators", "SciMLLogging", "SciMLOperators", "SciMLStructures", "Setfield", "StaticArraysCore", "SymbolicIndexingInterface", "TimerOutputs"]
-git-tree-sha1 = "4f595a0977d6e048fa1e3c382b088b950f8c7934"
+deps = ["ADTypes", "Adapt", "ArrayInterface", "CommonSolve", "Compat", "ConcreteStructs", "DifferentiationInterface", "EnzymeCore", "FastClosures", "LinearAlgebra", "LogExpFunctions", "Markdown", "MaybeInplace", "PreallocationTools", "PrecompileTools", "Preferences", "Printf", "RecursiveArrayTools", "SciMLBase", "SciMLJacobianOperators", "SciMLLogging", "SciMLOperators", "SciMLStructures", "Setfield", "StaticArraysCore", "SymbolicIndexingInterface", "TimerOutputs"]
+git-tree-sha1 = "28ddfd7d136564c5b2a09d28759feccc2005dbea"
 uuid = "be0214bd-f91f-a760-ac4e-3421ce2b2da0"
-version = "2.15.0"
+version = "2.16.0"
 
     [deps.NonlinearSolveBase.extensions]
     NonlinearSolveBaseBandedMatricesExt = "BandedMatrices"

dev/dynamicalodeexplicit/RKN/index.html

@@ -14,4 +14,4 @@
 u0 = [1.0; 0.0; 0.0]
 tspan = (0.0, 100.0)
 prob = ODEProblem(lorenz!, u0, tspan)
-sol = solve(prob, Feagin14())</code></pre><h2 id="Full-list-of-solvers"><a class="docs-heading-anchor" href="#Full-list-of-solvers">Full list of solvers</a><a id="Full-list-of-solvers-1"></a><a class="docs-heading-anchor-permalink" href="#Full-list-of-solvers" title="Permalink"></a></h2><article><details class="docstring"><summary id="OrdinaryDiffEqFeagin.Feagin10"><a class="docstring-binding" href="#OrdinaryDiffEqFeagin.Feagin10"><code>OrdinaryDiffEqFeagin.Feagin10</code></a> — <span class="docstring-category">Type</span></summary><section><div><pre><code class="language-julia hljs">Feagin10(; step_limiter! = OrdinaryDiffEq.trivial_limiter!)</code></pre><p>Explicit Runge-Kutta Method.  Feagin&#39;s 10th-order method.</p><p><strong>Keyword Arguments</strong></p><ul><li><code>stage_limiter!</code>: function of the form <code>limiter!(u, integrator, p, t)</code></li></ul><p><strong>References</strong></p><p>@article{feagin2012high, title={High-order explicit Runge-Kutta methods using m-symmetry}, author={Feagin, Terry}, year={2012}, publisher={Neural, Parallel \&amp; Scientific Computations} }</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/SciML/OrdinaryDiffEq.jl/blob/249cda3241550024de421401bbe0720802e9b3b2/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L1-L18">source</a></section></details></article><article><details class="docstring"><summary id="OrdinaryDiffEqFeagin.Feagin12"><a class="docstring-binding" href="#OrdinaryDiffEqFeagin.Feagin12"><code>OrdinaryDiffEqFeagin.Feagin12</code></a> — <span class="docstring-category">Type</span></summary><section><div><pre><code class="language-julia hljs">Feagin12(; step_limiter! = OrdinaryDiffEq.trivial_limiter!)</code></pre><p>Explicit Runge-Kutta Method.  Feagin&#39;s 12th-order method.</p><p><strong>Keyword Arguments</strong></p><ul><li><code>stage_limiter!</code>: function of the form <code>limiter!(u, integrator, p, t)</code></li></ul><p><strong>References</strong></p><p>@article{feagin2012high, title={High-order explicit Runge-Kutta methods using m-symmetry}, author={Feagin, Terry}, year={2012}, publisher={Neural, Parallel \&amp; Scientific Computations} }</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/SciML/OrdinaryDiffEq.jl/blob/249cda3241550024de421401bbe0720802e9b3b2/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L20-L37">source</a></section></details></article><article><details class="docstring"><summary id="OrdinaryDiffEqFeagin.Feagin14"><a class="docstring-binding" href="#OrdinaryDiffEqFeagin.Feagin14"><code>OrdinaryDiffEqFeagin.Feagin14</code></a> — <span class="docstring-category">Type</span></summary><section><div><pre><code class="language-julia hljs">Feagin14(; step_limiter! = OrdinaryDiffEq.trivial_limiter!)</code></pre><p>Explicit Runge-Kutta Method.  Feagin&#39;s 14th-order method.</p><p><strong>Keyword Arguments</strong></p><ul><li><code>stage_limiter!</code>: function of the form <code>limiter!(u, integrator, p, t)</code></li></ul><p><strong>References</strong></p><p>@article{feagin2009explicit, title={An Explicit Runge-Kutta Method of Order Fourteen}, author={Feagin, Terry}, year={2009}, publisher={Numerical Algorithms} }</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/SciML/OrdinaryDiffEq.jl/blob/249cda3241550024de421401bbe0720802e9b3b2/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L39-L56">source</a></section></details></article></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../HighOrderRK/">« OrdinaryDiffEqHighOrderRK</a><a class="docs-footer-nextpage" href="../PRK/">OrdinaryDiffEqPRK »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.17.0 on <span class="colophon-date" title="Tuesday 24 March 2026 17:47">Tuesday 24 March 2026</span>. Using Julia version 1.12.5.</p></section><footer class="modal-card-foot"></footer></div></div></div></body><div data-docstringscollapsed="true"></div></html>
+sol = solve(prob, Feagin14())</code></pre><h2 id="Full-list-of-solvers"><a class="docs-heading-anchor" href="#Full-list-of-solvers">Full list of solvers</a><a id="Full-list-of-solvers-1"></a><a class="docs-heading-anchor-permalink" href="#Full-list-of-solvers" title="Permalink"></a></h2><article><details class="docstring"><summary id="OrdinaryDiffEqFeagin.Feagin10"><a class="docstring-binding" href="#OrdinaryDiffEqFeagin.Feagin10"><code>OrdinaryDiffEqFeagin.Feagin10</code></a> — <span class="docstring-category">Type</span></summary><section><div><pre><code class="language-julia hljs">Feagin10(; step_limiter! = OrdinaryDiffEq.trivial_limiter!)</code></pre><p>Explicit Runge-Kutta Method.  Feagin&#39;s 10th-order method.</p><p><strong>Keyword Arguments</strong></p><ul><li><code>stage_limiter!</code>: function of the form <code>limiter!(u, integrator, p, t)</code></li></ul><p><strong>References</strong></p><p>@article{feagin2012high, title={High-order explicit Runge-Kutta methods using m-symmetry}, author={Feagin, Terry}, year={2012}, publisher={Neural, Parallel \&amp; Scientific Computations} }</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/SciML/OrdinaryDiffEq.jl/blob/07f7057ff6028bd75c86f43b8cb3b61608f6df41/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L1-L18">source</a></section></details></article><article><details class="docstring"><summary id="OrdinaryDiffEqFeagin.Feagin12"><a class="docstring-binding" href="#OrdinaryDiffEqFeagin.Feagin12"><code>OrdinaryDiffEqFeagin.Feagin12</code></a> — <span class="docstring-category">Type</span></summary><section><div><pre><code class="language-julia hljs">Feagin12(; step_limiter! = OrdinaryDiffEq.trivial_limiter!)</code></pre><p>Explicit Runge-Kutta Method.  Feagin&#39;s 12th-order method.</p><p><strong>Keyword Arguments</strong></p><ul><li><code>stage_limiter!</code>: function of the form <code>limiter!(u, integrator, p, t)</code></li></ul><p><strong>References</strong></p><p>@article{feagin2012high, title={High-order explicit Runge-Kutta methods using m-symmetry}, author={Feagin, Terry}, year={2012}, publisher={Neural, Parallel \&amp; Scientific Computations} }</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/SciML/OrdinaryDiffEq.jl/blob/07f7057ff6028bd75c86f43b8cb3b61608f6df41/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L20-L37">source</a></section></details></article><article><details class="docstring"><summary id="OrdinaryDiffEqFeagin.Feagin14"><a class="docstring-binding" href="#OrdinaryDiffEqFeagin.Feagin14"><code>OrdinaryDiffEqFeagin.Feagin14</code></a> — <span class="docstring-category">Type</span></summary><section><div><pre><code class="language-julia hljs">Feagin14(; step_limiter! = OrdinaryDiffEq.trivial_limiter!)</code></pre><p>Explicit Runge-Kutta Method.  Feagin&#39;s 14th-order method.</p><p><strong>Keyword Arguments</strong></p><ul><li><code>stage_limiter!</code>: function of the form <code>limiter!(u, integrator, p, t)</code></li></ul><p><strong>References</strong></p><p>@article{feagin2009explicit, title={An Explicit Runge-Kutta Method of Order Fourteen}, author={Feagin, Terry}, year={2009}, publisher={Numerical Algorithms} }</p></div><a class="docs-sourcelink" target="_blank" href="https://github.com/SciML/OrdinaryDiffEq.jl/blob/07f7057ff6028bd75c86f43b8cb3b61608f6df41/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L39-L56">source</a></section></details></article></article><nav class="docs-footer"><a class="docs-footer-prevpage" href="../HighOrderRK/">« OrdinaryDiffEqHighOrderRK</a><a class="docs-footer-nextpage" href="../PRK/">OrdinaryDiffEqPRK »</a><div class="flexbox-break"></div><p class="footer-message">Powered by <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> and the <a href="https://julialang.org/">Julia Programming Language</a>.</p></nav></div><div class="modal" id="documenter-settings"><div class="modal-background"></div><div class="modal-card"><header class="modal-card-head"><p class="modal-card-title">Settings</p><button class="delete"></button></header><section class="modal-card-body"><p><label class="label">Theme</label><div class="select"><select id="documenter-themepicker"><option value="auto">Automatic (OS)</option><option value="documenter-light">documenter-light</option><option value="documenter-dark">documenter-dark</option><option value="catppuccin-latte">catppuccin-latte</option><option value="catppuccin-frappe">catppuccin-frappe</option><option value="catppuccin-macchiato">catppuccin-macchiato</option><option value="catppuccin-mocha">catppuccin-mocha</option></select></div></p><hr/><p>This document was generated with <a href="https://github.com/JuliaDocs/Documenter.jl">Documenter.jl</a> version 1.17.0 on <span class="colophon-date" title="Wednesday 25 March 2026 10:21">Wednesday 25 March 2026</span>. Using Julia version 1.12.5.</p></section><footer class="modal-card-foot"></footer></div></div></div></body><div data-docstringscollapsed="true"></div></html>