build based on bf19e6e

dev/.documenter-siteinfo.json

@@ -1 +1 @@
-{"documenter":{"julia_version":"1.11.1","generation_timestamp":"2024-11-11T07:05:04","documenter_version":"1.7.0"}}
+{"documenter":{"julia_version":"1.11.1","generation_timestamp":"2024-11-11T13:08:39","documenter_version":"1.7.0"}}

dev/explicit/Feagin/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 class="docstring"><header><a class="docstring-article-toggle-button fa-solid fa-chevron-down" href="javascript:;" title="Collapse docstring"></a><a class="docstring-binding" id="OrdinaryDiffEqFeagin.Feagin10" href="#OrdinaryDiffEqFeagin.Feagin10"><code>OrdinaryDiffEqFeagin.Feagin10</code></a> — <span class="docstring-category">Type</span><span class="is-flex-grow-1 docstring-article-toggle-button" title="Collapse docstring"></span></header><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/28199e0455cc70cae21a3da08d66fb067da7fe37/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L1-L18">source</a></section></article><article class="docstring"><header><a class="docstring-article-toggle-button fa-solid fa-chevron-down" href="javascript:;" title="Collapse docstring"></a><a class="docstring-binding" id="OrdinaryDiffEqFeagin.Feagin12" href="#OrdinaryDiffEqFeagin.Feagin12"><code>OrdinaryDiffEqFeagin.Feagin12</code></a> — <span class="docstring-category">Type</span><span class="is-flex-grow-1 docstring-article-toggle-button" title="Collapse docstring"></span></header><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/28199e0455cc70cae21a3da08d66fb067da7fe37/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L20-L37">source</a></section></article><article class="docstring"><header><a class="docstring-article-toggle-button fa-solid fa-chevron-down" href="javascript:;" title="Collapse docstring"></a><a class="docstring-binding" id="OrdinaryDiffEqFeagin.Feagin14" href="#OrdinaryDiffEqFeagin.Feagin14"><code>OrdinaryDiffEqFeagin.Feagin14</code></a> — <span class="docstring-category">Type</span><span class="is-flex-grow-1 docstring-article-toggle-button" title="Collapse docstring"></span></header><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/28199e0455cc70cae21a3da08d66fb067da7fe37/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L39-L56">source</a></section></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.7.0 on <span class="colophon-date" title="Monday 11 November 2024 07:05">Monday 11 November 2024</span>. Using Julia version 1.11.1.</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 class="docstring"><header><a class="docstring-article-toggle-button fa-solid fa-chevron-down" href="javascript:;" title="Collapse docstring"></a><a class="docstring-binding" id="OrdinaryDiffEqFeagin.Feagin10" href="#OrdinaryDiffEqFeagin.Feagin10"><code>OrdinaryDiffEqFeagin.Feagin10</code></a> — <span class="docstring-category">Type</span><span class="is-flex-grow-1 docstring-article-toggle-button" title="Collapse docstring"></span></header><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/bf19e6e024d6a3f0a65fdf3e62fb017cd863ff07/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L1-L18">source</a></section></article><article class="docstring"><header><a class="docstring-article-toggle-button fa-solid fa-chevron-down" href="javascript:;" title="Collapse docstring"></a><a class="docstring-binding" id="OrdinaryDiffEqFeagin.Feagin12" href="#OrdinaryDiffEqFeagin.Feagin12"><code>OrdinaryDiffEqFeagin.Feagin12</code></a> — <span class="docstring-category">Type</span><span class="is-flex-grow-1 docstring-article-toggle-button" title="Collapse docstring"></span></header><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/bf19e6e024d6a3f0a65fdf3e62fb017cd863ff07/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L20-L37">source</a></section></article><article class="docstring"><header><a class="docstring-article-toggle-button fa-solid fa-chevron-down" href="javascript:;" title="Collapse docstring"></a><a class="docstring-binding" id="OrdinaryDiffEqFeagin.Feagin14" href="#OrdinaryDiffEqFeagin.Feagin14"><code>OrdinaryDiffEqFeagin.Feagin14</code></a> — <span class="docstring-category">Type</span><span class="is-flex-grow-1 docstring-article-toggle-button" title="Collapse docstring"></span></header><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/bf19e6e024d6a3f0a65fdf3e62fb017cd863ff07/lib/OrdinaryDiffEqFeagin/src/algorithms.jl#L39-L56">source</a></section></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.7.0 on <span class="colophon-date" title="Monday 11 November 2024 13:08">Monday 11 November 2024</span>. Using Julia version 1.11.1.</p></section><footer class="modal-card-foot"></footer></div></div></div></body><div data-docstringscollapsed="true"></div></html>