Results for “Approximate block factorization”

DOE OSTI2025

A scalable multidimensional fully implicit solver for Hall magnetohydrodynamics

We propose an optimally performant fully implicit algorithm for the Hall magnetohydrodynamics (HMHD) equations based on multigrid-preconditioned Jacobian-free Newton-Krylov methods. HMHD is a challenging system to solve numerically because it supports stiff fast dispersive waves. The preconditioner is formulated using an operator-split approximate block factorization (Schur complement), informed by physics insight. We use a vector-potential formulation (instead of a magnetic field one) to allow a clean segregation of the problematic $\nabla$ x $\nabla$ x operator in the electron Ohm's law subsystem. This segregation allows the formulation of an effective damped block-Jacobi smoother for multigrid. We demonstrate by analysis that our proposed block-Jacobi iteration is convergent and has the smoothing property. The resulting HMHD solver is verified linearly with wave propagation examples, and nonlinearly with the GEM challenge reconnection problem by comparison against another HMHD code. We demonstrate the excellent algorithmic and parallel performance of the algorithm up to 16384 MPI tasks in two dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Assessing the difficulty of capturing the distribution function of neutrinos in neutron star merger simulations

The collision of two neutron stars is a rich source of information about nuclear physics. In particular, the kilonova signal following a merger can help us elucidate the role of neutron stars in nucleosynthesis, and informs us about the properties of matter above nuclear saturation. Approximate modeling of neutrinos remains an important limitation to our ability to make predictions for these observables. Part of the problem is the fermionic nature of neutrinos. By the exclusion principle, the expected value 𝑓 𝜈 for the number of neutrinos in a quantum state is at most 1. Any process producing neutrinos is suppressed by a blocking factor (1 −𝑓 𝜈 ). Recent simulations focused on neutrino physics mostly use a gray two-moment scheme to evolve neutrinos. This evolves integrals of 𝑓 𝜈 over momentum space, preventing direct calculations of blocking factors. Monte Carlo methods may be an attractive alternative, providing access to the full distribution of neutrinos. Their current implementation is, however, inadequate to estimate 𝑓 𝜈 : in our most recent simulations, a single Monte Carlo packet causes, in the worst cases, estimates of 𝑓 𝜈 to jump from 𝑓 𝜈 =0 to 𝑓 𝜈 ∼10 5 . While this is concerning, this brazen violation of the fermionic nature of neutrinos has been largely inconsequential, as the interactions used in simulations avoid direct calculations of 𝑓 𝜈 . We are, however, reaching a level of modeling at which this problem can no longer be ignored. Here, we discuss the relatively simple origin of this issue. We then show that very rough estimates of 𝑓 𝜈 can in theory be obtained in merger simulations, but that they will require a combination of unintuitive weighting schemes for Monte Carlo packets and smoothing of the neutrino distribution at coarser resolution than what the merger simulation uses.

79 ASTRONOMY AND ASTROPHYSICS↗