You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
<tdclass="markdownTableBodyRight"><code>igr</code></td><tdclass="markdownTableBodyCenter">Logical </td><tdclass="markdownTableBodyLeft">Enable solution via information geometric regularization (IGR) <aclass="el" href="md_references.html">Cao (2024)</a></td></tr>
545
+
<trclass="markdownTableRowOdd">
546
+
<tdclass="markdownTableBodyRight"><code>igr_order</code></td><tdclass="markdownTableBodyCenter">Integer </td><tdclass="markdownTableBodyLeft">Order of reconstruction for IGR [3,5] </td></tr>
547
+
<trclass="markdownTableRowEven">
548
+
<tdclass="markdownTableBodyRight"><code>alf_factor</code></td><tdclass="markdownTableBodyCenter">Real </td><tdclass="markdownTableBodyLeft">Alpha factor for IGR entropic pressure (default 10) </td></tr>
<tdclass="markdownTableBodyRight"><code>num_igr_iters</code></td><tdclass="markdownTableBodyCenter">Integer </td><tdclass="markdownTableBodyLeft">Number of iterations for for the IGR elliptic solve (default 2) </td></tr>
555
+
<trclass="markdownTableRowEven">
556
+
<tdclass="markdownTableBodyRight"><code>num_igr_warm_start_iters</code></td><tdclass="markdownTableBodyCenter">Integer </td><tdclass="markdownTableBodyLeft">Number of iterations for the IGR elliptic solve at the first time step (default 50) </td></tr>
543
557
</table>
544
558
<ul>
545
559
<li>* Options that work only with <code>model_eqns = 2</code>.</li>
<tdclass="markdownTableBodyRight"><code>length_x[y,z]</code>* </td><tdclass="markdownTableBodyCenter">Real </td><tdclass="markdownTableBodyLeft">Length of the boundary patch in the x[y,z]-direction </td></tr>
597
611
<trclass="markdownTableRowOdd">
598
-
<tdclass="markdownTableBodyRight"><code>radius</code>* </td><tdclass="markdownTableBodyCenter">Real </td><tdclass="markdownTableBodyLeft">Radius of the boundary patch </td></tr>
612
+
<tdclass="markdownTableBodyRight"><code>radiue</code>* </td><tdclass="markdownTableBodyCenter">Real </td><tdclass="markdownTableBodyLeft">Radius of the boundary patch </td></tr>
599
613
</table>
600
614
<p>*: These parameters should be prepended with <code>patch_bc(j)%</code> where $j$ is the patch index.</p>
601
615
<p>Boundary condition patches can be used with the following boundary condition types:</p><ul>
<p>P. D. Lax, Weak solutions of nonlinear hyperbolic equations and their numerical computation, Communications on pure and applied mathematics 7 (1) (1954) 159–193. </p>
<p>Bezgin, D. A., & Buhendwa A. B., & Adams N. A. (2022). JAX-FLUIDS: A fully-differentiable high-order computational fluid dynamics solver for compressible two-phase flows. arXiv:2203.13760 </p>
175
170
</blockquote>
176
171
<blockquoteclass="doxtable">
177
172
<p>Ghia, U., & Ghia, K. N., & Shin, C. T. (1982). High-re solutions for incompressible flow using the Navier-Stokes equations and a multigrid method. Journal of Computational Physics, 48, 387-411 </p>
<p>Chamarthi, A., & Hoffmann, N., & Nishikawa, H., & Frankel S. (2023). Implicit gradients based conservative numerical scheme for compressible flows. arXiv:2110.05461 </p>
<p>V. A. Titarev, E. F. Toro, Finite-volume WENO schemes for three-dimensional conservation laws, Journal of Computational Physics 201 (1) (2004) 238–260. </p>
<p>P. J. Martínez Ferrer, R. Buttay, G. Lehnasch, and A. Mura, “A detailed verification procedure for compressible reactive multicomponent Navier–Stokes solvers”, Computers & Fluids, vol. 89, pp. 88–110, Jan. 2014. Accessed: Oct. 13, 2024. [Online]. Available: <ahref="https://doi.org/10.1016/j.compfluid.2013.10.014">https://doi.org/10.1016/j.compfluid.2013.10.014</a></p>
231
225
</blockquote>
232
226
<blockquoteclass="doxtable">
233
227
<p>H. Chen, C. Si, Y. Wu, H. Hu, and Y. Zhu, “Numerical investigation of the effect of equivalence ratio on the propagation characteristics and performance of rotating detonation engine”, Int. J. Hydrogen Energy, Mar. 2023. Accessed: Oct. 13, 2024. [Online]. Available: <ahref="https://doi.org/10.1016/j.ijhydene.2023.03.190">https://doi.org/10.1016/j.ijhydene.2023.03.190</a></p>
<p>G. B. Skinner and G. H. Ringrose, “Ignition Delays of a Hydrogen—Oxygen—Argon Mixture at Relatively Low Temperatures”, J. Chem. Phys., vol. 42, no. 6, pp. 2190–2192, Mar. 1965. Accessed: Oct. 13, 2024. [Online]. Available: <ahref="https://doi.org/10.1063/1.1696266">https://doi.org/10.1063/1.1696266</a>. </p>
243
+
<p>G. B. Skinner and G. H. Ringrose, “Ignition Delays of a Hydrogen—Oxygen—Argon Mixture at Relatively Low Temperatures”, J. Chem. Phys., vol. 42, no. 6, pp. 2190–2192, Mar. 1965. Accessed: Oct. 13, 2024. </p>
<divclass="line">Induction Times ([OH] >= 1e-6):</div>
253
247
<divclass="line"> + Skinner et al.: 5.200e-05 s</div>
254
248
<divclass="line"> + Cantera: 5.130e-05 s</div>
255
249
<divclass="line"> + (Che)MFC: 5.130e-05 s</div>
256
250
</div><!-- fragment --><p><imgsrc="result-nD_perfect_reactor-example.png" alt="" height="400" class="inline"/></p>
257
-
<h1><aclass="anchor" id="autotoc_md68"></a>
251
+
<h1><aclass="anchor" id="autotoc_md66"></a>
258
252
Strong- & Weak-scaling</h1>
259
-
<p>The <ahref="case.py"><b>Scaling</b></a> case can exercise both weak- and strong-scaling. It adjusts itself depending on the number of requested ranks.</p>
253
+
<p>The scaling case can exercise both weak- and strong-scaling. It adjusts itself depending on the number of requested ranks.</p>
260
254
<p>This directory also contains a collection of scripts used to test strong-scaling on OLCF Frontier. They required modifying MFC to collect some metrics but are meant to serve as a reference to users wishing to run similar experiments.</p>
261
-
<h2><aclass="anchor" id="autotoc_md69"></a>
255
+
<h2><aclass="anchor" id="autotoc_md67"></a>
262
256
Weak Scaling</h2>
263
257
<p>Pass <code>--scaling weak</code>. The <code>--memory</code> option controls (approximately) how much memory each rank should use, in Gigabytes. The number of cells in each dimension is then adjusted according to the number of requested ranks and an approximation for the relation between cell count and memory usage. The problem size increases linearly with the number of ranks.</p>
264
-
<h2><aclass="anchor" id="autotoc_md70"></a>
258
+
<h2><aclass="anchor" id="autotoc_md68"></a>
265
259
Strong Scaling</h2>
266
260
<p>Pass <code>--scaling strong</code>. The <code>--memory</code> option controls (approximately) how much memory should be used in total during simulation, across all ranks, in Gigabytes. The problem size remains constant as the number of ranks increases.</p>
267
-
<h2><aclass="anchor" id="autotoc_md71"></a>
261
+
<h2><aclass="anchor" id="autotoc_md69"></a>
268
262
Example</h2>
269
263
<p>For example, to run a weak-scaling test that uses ~4GB of GPU memory per rank on 8 2-rank nodes with case optimization, one could:</p>
270
264
<divclass="fragment"><divclass="line">./mfc.sh run examples/scaling/case.py -t pre_process simulation \</div>
0 commit comments