Initial conditions problem in cosmological inflation revisited
Not Available
79 ASTRONOMY AND ASTROPHYSICS↗
SEARCH · Search NASA
Results for “Initial conditions problem”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Redshifting the Cosmological Constant in Unimodular Gravity via Nonlinear Quantum Mechanics
The cosmological constant problem represents a profound conflict between quantum field theory and general relativity. Unimodular gravity offers a compelling starting point by de-gravitating the vacuum energy of the Standard Model, but this framework traditionally trades the problem of vacuum energy for a fine-tuning of initial conditions, which manifest as a ``shadow" cosmological constant. In this paper, we resolve this initial conditions problem by proposing a novel modification to gravity based on nonlinear quantum mechanics. We introduce specific state-dependent terms to the Hamiltonian, constructed from expectation values of the metric such as the average Ricci scalar. These terms alter the dynamical equations of gravity such that the shadow energy density associated with unconstrained initial conditions redshifts away with cosmic expansion, rendering it negligible at late times. The resulting cosmology is naturally dominated by matter and radiation without fine-tuning. We demonstrate that this significant infrared modification of gravity is consistent with local and cosmological tests of gravity. We comment on the possibility of testing this solution in cosmological measurements of Newton's constant.
Kaplan, David E. [Johns Hopkins U.; Tokyo U., IPMU↗
Source term method for binary neutron stars initial data
The initial condition problem for a binary neutron star system requires a Poisson equation solver for the velocity potential with a Neumann-like boundary condition on the surface of the star. Difficulties that arise in this boundary value problem are: (a) the boundary is not known a priori, but constitutes part of the solution of the problem; (b) various terms become singular at the boundary. In this work, we present a new method to solve the fluid Poisson equation for irrotational/spinning binary neutron stars. The advantage of the new method is that it does not require complex fluid surface fitted coordinates and it can be implemented in a Cartesian grid, which is a standard choice in numerical relativity calculations. This is accomplished by employing the source term method proposed by Towers, where the boundary condition is treated as a jump condition and is incorporated as additional source terms in the Poisson equation, which is then solved iteratively. The issue of singular terms caused by vanishing density on the surface is resolved with an additional separation that shifts the computation boundary to the interior of the star. We present two-dimensional tests to show the convergence of the source term method, and we further apply this solver to a realistic three-dimensional binary neutron star problem. By comparing our solution with the one coming from the initial data solver cocal, we demonstrate agreement to approximately 1%. We report our method can be used in other problems with non-smooth solutions like in magnetized neutron stars.
79 ASTRONOMY AND ASTROPHYSICS↗
Influence of initial conditions on data-driven model identification and information entropy for ideal mhd problems
Data-driven methods of model identification are able to discern governing dynamics of a system from data. Such methods are well suited to help us learn about systems with unpredictable evolution or systems with ambiguous governing dynamics given our current understanding. Many plasma problems of interest fall into these categories as there are a wide range of models that exist, however each model is only useful in a certain regime and often limited by computational complexity. To ensure data-driven methods align with theory, they must be consistent and predictable when acting on data whose governing dynamics are known. Weak Sparse Identification of Nonlinear Dynamics (WSINDy) is a recently developed data-driven method that has shown promise in learning governing dynamics from data with high noise levels [1]. This work examines how WSINDy acts on ideal MHD test problems as the initial conditions are varied and specifies limiting requirements for successful equation identification. Furthermore, it is hard to recover the governing dynamics from data that emphasize a single dominant behavior. In these low information cases, Shannon information entropy is able to pick up on the redundancies in the data that affect recoverability.
97 MATHEMATICS AND COMPUTING↗
Gravity in the era of equality: Towards solutions to the Hubble problem without fine-tuned initial conditions
Not Available
79 ASTRONOMY AND ASTROPHYSICS↗
A greedy Galerkin method to efficiently select sensors for linear dynamical systems
A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dynamical system and develop an efficient control-theoretical approach for greedily selecting sensors. Our method employs a Galerkin projection to reduce the size of the inverse problem, resulting in a computationally efficient algorithm for sensor selection. As a byproduct of our algorithm, we obtain a preconditioner for the inverse problem that enables the rapid recovery of the initial condition. Here, we analyze the theoretical performance of our greedy sensor selection algorithm as well as the performance of the associated preconditioner. Finally, we verify our theoretical results on various inverse problems involving partial differential equations.
97 MATHEMATICS AND COMPUTING↗
Investigating the use of field solvers for simulating classical systems
We explore the use of field solvers as approximations of classical Vlasov-Poisson systems. This correspondence is investigated in both electrostatic and gravitational contexts. We demonstrate the ability of field solvers to be excellent approximations of problems with cold initial condition into the nonlinear regime. We also investigate extensions of the Schrödinger-Poisson system that employ multiple stacked cold streams, and the von Neumann–Poisson equation as methods that can successfully reproduce the classical evolution of warm initial conditions. We then discuss how appropriate simulation parameters need to be chosen to avoid interference terms, aliasing, and wave behavior in the field solver solutions. Finally, we present a series of criteria clarifying how parameters need to be chosen in order to effectively approximate classical solutions.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
MatCal Users Guide: Release 1.3.0
Any continuum mechanics model will require three components: (1) a discretized geometry of the boundary value problem being studied, (2) the partial differential equations to be solved, and (3) the initial conditions and boundary conditions for the problem. To describe material behavior in these computational models, material models contribute to (2) the underlying equations and, occasionally, to (3) the initial conditions for the simulation. These material models can exhibit a mathematical form that is empirically based, based on first principles, or developed from both empirical observations and known physics. In general, these models are meant to represent a class of materials with well understood behavior. As a result, material models have parameters that must be tuned or calibrated so that the model response matches characterization data available for the specific material it is intended to represent when used to simulate a specific system. For simple models, such as isotropic, linear elastic materials in solid mechanics, this calibration process can be a simple analytical calculation directly extracting the parameters from experimental measurements. For complex models that have many inputs and require many characterization datasets to adequately identify the material behavior, the model calibration process can require an inverse problem approach where an optimization is performed to tune the model parameters to the available data.
36 MATERIALS SCIENCE↗
TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems
Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.
97 MATHEMATICS AND COMPUTING↗
Robust wind farm layout optimization
Wake interactions in wind farms cause losses in annual energy production (AEP) on the order of 10%. Wind farm designers optimize the layout of the farm to mitigate wake losses, especially in the dominant site-specific wind directions. As wind turbines and wind farms grow in scale, optimization becomes more complex. Offshore wind farms regularly comprise more than 100 wind turbines and are characterized by complex boundaries due to shipping lanes, neighboring wind farms, and other constraints. Layout optimization methods are broadly split between gradient-based and gradient-free approaches. Gradient-based approaches can converge quickly and perform well for smaller, academic problems but are often sensitive to initial conditions and tuning parameters and require expert knowledge to use. On the other hand, gradient-free approaches can be more robust to problem complexities. We present a robust layout optimization approach based on a random search algorithm. The algorithm is intended for those who are not optimization experts and has few tuning parameters that need specification to achieve satisfactory results. Unlike off-the-shelf methods, which use generally available, non-domain-specific optimization routines that accept as inputs an optimization function and constraint definitions, this approach takes advantage of the relative computational costs of the different evaluations by evaluating cheaper computations first (boundary and minimum distance constraints) and running expensive AEP evaluations only if all other checks pass. Moreover, an outer genetic algorithm allows multiple solutions to evolve in parallel, enabling rapid solution development on high-performance computers. We discuss the relative ease of selecting necessary tuning parameters and demonstrate the efficacy of the genetic random search on a complex layout problem consisting of placing 70 turbines in a nonconvex and unconnected boundary region.
17 WIND ENERGY↗
Phase field benchmark problems for nucleation
In this work, we present nucleation phase field model benchmark problems, expanding on our previous benchmark problems on diffusion, precipitation, dendritic growth, linear elasticity, fluid flow and electrochemistry. Nucleation is the process in which either a new thermodynamic phase or a new structure is created, such as solidification from the melt, or self-assembly of particulates. Based on where the nucleation occurs, it can be divided into two main categories: homogeneous nucleation and heterogeneous nucleation. In the first nucleation benchmark problem, we focus on homogeneous nucleation for both single seed under different initial conditions and multiple seeds. The second nucleation benchmark problem focuses on athermal heterogeneous nucleation and nucleation behavior near the free growth limit with different undercooling driving forces.
36 MATERIALS SCIENCE↗
Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations
In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.
97 MATHEMATICS AND COMPUTING↗
Where did the tumor start? An inverse solver with sparse localization for tumor growth models
In this work, we present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.
97 MATHEMATICS AND COMPUTING↗
Fluoride-Cooled High-Temperature Pebble-Bed Reactor Reference Plant Model
In this report we present work performed in Fiscal Year 2022 that demonstrates the modeling and simulation of a fully coupled neutronics thermal hydraulics reference plant model for a fluoride-cooled high-temperature pebble-bed reactor. The multiphysics model is developed on the Nuclear Regulatory Commission’s Comprehensive Reactor Analysis Bundle (BlueCRAB) available on the Idaho National Laboratory’s high-performance computer, which natively and seamlessly couples Griffin, Pronghorn, and the BISON Multiphysics Object-Oriented Simulation Environment based applications. Griffin provides reactor physics capabilities, including depletion to the equilibrium core, k-eigenvalue, adjoint, and transient. The unique direct equilibrium core capability in Griffin is based on a streamline methodology to spatially deplete the pebbles into burnup groups. Pronghorn solves the porous medium equations for the fluid regions and conduction in the solid regions and incorporates a fluidic diode model to simulate the transition from forced to natural convection during accident scenarios. MOOSE modules solves thermal conduction problems for the pebbles and tristructural isotropic in the pebble-bed core, thus providing the fuel and moderator spatial fields for each pebble burnup group. The neutronics feedback relies primarily on fuel, moderator, and reflector temperatures as as well as the FLiBe salt density. Here, we present results for the uncoupled equilibrium core and perform comparisons to equivalent Monte Carlo models. The power distributions and kinetic parameters obtained with Griffin are consistent with those computed with Griffin. We demonstrate a noticeable improvement with the use of discrete ordinates method (SN) transport. The coupled steady-state equilibrium core provides the initial condition for two time-dependent problems: a control rod withdrawal event and an unprotected loss of flow event. In both cases, the reactor design is self-stabilizing and the solutions are consistent with the expected physics. Although this model is prototypical regarding BlueCRAB’s capabilities, its results are consistent with published work by Kairos Power and other research entities. Significant improvements to the model are planned in future work.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Estimation of distributions via multilevel Monte Carlo with stratified sampling
We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Stability analysis of the Eulerian–Lagrangian finite volume methods for nonlinear hyperbolic equations in one space dimension
In this paper, we construct a novel Eulerian–Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the initial conditions are smooth, and direct numerical methods may suffer from restricted time step sizes. To relieve the restriction, we propose an ELFV method, where the space-time domain was separated by the partition lines originated from the cell interfaces whose slopes are obtained following the Rakine–Hugoniot junmp condition. Unfortunately, to avoid the intersection of the partition lines, the time step sizes are still limited. To fix this gap, we detect effective troubled cells (ETCs) and carefully design the influence region of each ETC, within which the partitioned space-time regions are merged together to form a new one. Then with the new partition of the space-time domain, we theoretically prove that the proposed first-order scheme with Euler forward time discretization is total-variation-diminishing and maximum-principle-preserving with at least twice larger time step constraints than the classical first order Eulerian method for Burgers’ equation. Numerical experiments verify the optimality of the designed time step sizes.
97 MATHEMATICS AND COMPUTING↗
Accelerating kinetic plasma simulations with machine-learning-generated initial conditions
Computational models of plasma technologies often solve for the system operating conditions by time-stepping an initial value problem to a quasi-steady solution. However, the strongly nonlinear and multi-timescale nature of plasma dynamics often necessitate millions, or even hundreds of millions, of steps to reach convergence, reducing the effectiveness of these simulations for computer-aided engineering. We consider acceleration of kinetic plasma simulations via data-driven machine-learning-generated initial conditions, which initialize the simulations close to their final quasi-steady-state, thereby reducing the number of steps to reach convergence. Three machine-learning models are developed to predict the density and ion kinetic profiles of capacitively coupled plasma discharges relevant to the microelectronics industry. The models are trained on kinetic simulations over a range of device operating frequencies and pressures. Best performance was observed when simulations were initialized with ion kinetic profiles generated by a convolutional neural network, reducing the mean number of steps to reach convergence by 17.1× when compared to initialization with a zero-dimensional global model. We also outline a workflow for continuous data-driven model improvement and simulation speedup, with the aim of generating sufficient data for full device digital twins.
Artificial neural networks↗
Hidden fluid mechanics: Learning velocity and pressure fields from flow visualizations
For centuries, flow visualization has been the art of making fluid motion visible in physical and biological systems. Although such flow patterns can be, in principle, described by the Navier-Stokes equations, extracting the velocity and pressure fields directly from the images is challenging. We addressed this problem by developing hidden fluid mechanics (HFM), a physics-informed deep-learning framework capable of encoding the Navier-Stokes equations into the neural networks while being agnostic to the geometry or the initial and boundary conditions. We demonstrate HFM for several physical and biomedical problems by extracting quantitative information for which direct measurements may not be possible.
Raissi, Maziar↗