Search NASA⌕ Search

SEARCH · Search NASA

Results for “boundedness”

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.

15 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A physics-constrained neural network for multiphase flows

The present study develops a physics-constrained neural network (PCNN) to predict sequential patterns and motions of multiphase flows (MPFs), which includes strong interactions among various fluid phases. To predict the order parameters, which locate individual phases in the future time, a neural network (NN) is applied to quickly infer the dynamics of the phases by encoding observations. The multiphase consistent and conservative boundedness mapping algorithm (MCBOM) is next implemented to correct the predicted order parameters. This enforces the predicted order parameters to strictly satisfy the mass conservation, the summation of the volume fractions of the phases to be unity, the consistency of reduction, and the boundedness of the order parameters. Then, the density of the fluid mixture is updated from the corrected order parameters. Finally, the velocity in the future time is predicted by another NN with the same network structure, but the conservation of momentum is included in the loss function to shrink the parameter space. The proposed PCNN for MPFs sequentially performs (NN)-(MCBOM)-(NN), which avoids nonphysical behaviors of the order parameters, accelerates the convergence, and requires fewer data to make predictions. Numerical experiments demonstrate that the proposed PCNN is capable of predicting MPFs effectively.

Mechanics↗
DOE OSTI2024

Scalar bounded-from-below conditions from Bayesian active learning

We present a procedure leveraging Bayesian deep active learning to rapidly produce highly accurate approximate bounded-from-below conditions for arbitrary renormalizable scalar potentials, in the form of a neural network which may be saved and exported for use in arbitrary parameter space scans. We explore the performance of our procedure on three different scalar potentials with either highly nontrivial or unknown symbolic bounded-from-below conditions (the most general two-Higgs doublet model, the three-Higgs doublet model, and a version of the Georgi-Machacek model without custodial symmetry). We find that we can produce fast and highly accurate binary classifiers for all three potentials. Furthermore, for the potentials for which no known symbolic necessary and sufficient conditions on boundedness-from-below exist, our classifiers substantially outperform some common approximate analytical methods, such as producing tractable sufficient but not necessary conditions or evaluating boundedness-from-below conditions for scenarios in which only a subset of the theory’s fields achieve vacuum expectation values. Our methodology can be readily adapted to any renormalizable scalar field theory. For the community’s use, we have developed a package, BFBrain, which allows for the rapid implementation of our analysis procedure on user-specified scalar potentials with a high degree of customizability. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2021

A consistent and conservative volume distribution algorithm and its applications to multiphase flows using Phase-Field models

In the present study, the multiphase volume distribution problem, where there can be an arbitrary number of phases, is addressed using a consistent and conservative volume distribution algorithm. The proposed algorithm satisfies the summation constraint, the conservation constraint, and the consistency of reduction. The first application of the volume distribution algorithm is to determine the Lagrange multipliers in multiphase Phase-Field models that enforce the mass conservation, and a multiphase conservative Allen-Cahn model that satisfies the consistency of reduction is developed. A corresponding consistent and conservative numerical scheme is developed for the model. The multiphase conservative Allen-Cahn model has a better ability than the multiphase Cahn-Hilliard model to preserve under-resolved structures. The second application is to develop a numerical procedure, called the boundedness mapping, to map the order parameters, obtained numerically from a multiphase model, into their physical interval, and at the same time to preserve the physical properties of the order parameters. Along with the consistent and conservative schemes for the multiphase Phase-Field models, the numerical solutions of the order parameters are reduction consistent, conservative, and bounded, which are theoretically analyzed and numerically validated. Then, the multiphase Phase-Field models are coupled with the momentum equation by satisfying the consistency of mass conservation and the consistency of mass and momentum transport, thanks to the consistent formulation. Finally, it is demonstrated that the proposed model and scheme converge to the sharp-interface solution and are capable of capturing the complicated multiphase dynamics even when there is a large density and/or viscosity ratio.

42 ENGINEERING↗
DOE OSTI2022

Analysis of sparse recovery for Legendre expansions using envelope bound

We provide novel sufficient conditions for the uniform recovery of sparse Legendre expansions using ℓ 1 minimization, where the sampling points are drawn according to orthogonalization (uniform) measure. So far, conditions of the form m ≳ Θ 2 s x log factors have been relied on to determine the minimum number of samples m that guarantees successful reconstruction of s-sparse vectors when the measurement matrix is associated to an orthonormal system. However, in case of sparse Legendre expansions, the uniform bound Θ of Legendre systems is so high that these conditions are unable to provide meaningful guarantees. Here, in this paper, we present an analysis which employs the envelop bound of all Legendre polynomials instead, and prove a new recovery guarantee for s-sparse Legendre expansions, m ≳ Θs 2 x log factors, which is independent of Θ. Arguably, this is the first recovery condition established for orthonormal systems without assuming the uniform boundedness of the sampling matrix. The key ingredient of our analysis is an extension of chaining arguments, recently developed in Bourgain and Chkifa et al., to handle the envelope bound. Furthermore, our recovery condition is proved via restricted eigenvalue property, a less demanding replacement of restricted isometry property which is perfectly suited to the considered scenario. Along the way, we derive simple criteria to detect good sample sets. Our numerical tests show that sets of uniformly sampled points that meet these criteria will perform better recovery on average.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Machine Learning Moment Closure Models for the Radiative Transfer Equation III: Enforcing Hyperbolicity and Physical Characteristic Speeds

This is the third paper in a series in which we develop machine learning (ML) moment closure models for the radiative transfer equation. In our previous work (Huang et al. in J Comput Phys 453:110941, 2022), we proposed an approach to learn the gradient of the unclosed high order moment, which performs much better than learning the moment itself and the conventional $P_N$ closure. However, while the ML moment closure has better accuracy, it is not able to guarantee hyperbolicity and has issues with long time stability. In our second paper (Huang et al., in: Machine learning moment closure models for the radiative transfer equation II: enforcing global hyperbolicity in gradient based closures, 2021. arXiv:2105.14410), we identified a symmetrizer which leads to conditions that enforce that the gradient based ML closure is symmetrizable hyperbolic and stable over long time. The limitation of this approach is that in practice the highest moment can only be related to four, or fewer, lower moments. In this paper, we propose a new method to enforce the hyperbolicity of the ML closure model. Motivated by the observation that the coefficient matrix of the closure system is a lower Hessenberg matrix, we relate its eigenvalues to the roots of an associated polynomial. Here, we design two new neural network architectures based on this relation. The ML closure model resulting from the first neural network is weakly hyperbolic and guarantees the physical characteristic speeds, i.e., the eigenvalues are bounded by the speed of light. The second model is strictly hyperbolic and does not guarantee the boundedness of the eigenvalues. Several benchmark tests including the Gaussian source problem and the two-material problem show the good accuracy, stability and generalizability of our hyperbolic ML closure model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Limiter-aware adaptive excitation control for hydropower generators with legacy voltage regulation systems

Hydropower units often rely on legacy excitation systems with fixed automatic voltage regulator (AVR) settings, but parameter drift, changing operating conditions, and evolving grid-service demands can degrade terminal-voltage regulation over time. This problem should be addressed because poor voltage regulation affects reactive-power support, system stability, and reliable plant operation, and replacing installed AVR and limiter logic is costly and disruptive in practice. To address this issue, this paper proposes a retrofit-friendly enhancement for hydropower generator excitation systems that combines adaptive tuning of the AVR middle lead–lag branch with a small proportional-integral correction for removing steady bias and slow drift. The adaptive laws are normalized, projection-bounded, and equipped with leakage, while adaptation is enabled only in the middle branch. Thus, the intent of the underexcitation and overexcitation limiters, as well as legacy current and rate limits, remains unchanged. Stability is analyzed under incremental performance assumptions, yielding boundedness and asymptotic tracking in the absence of saturation. The method is evaluated using real operational data from a utility-scale hydropower unit at Rocky Reach Dam, Unit C-8. Compared with the fixed AVR baseline, the proposed method reduces terminal-voltage mean squared error by about 70%, removes long periods of steady-state bias, and improves transient tracking while coexisting with limiter actions. These results show that substantial voltage-control improvement can be achieved on existing hydropower units with minimal integration effort and without replacing the installed AVR structure.

ESST5B model↗
DOE OSTI2026

Bridge Connectivity Dictates Spin Interactions and Triplet Pair Dynamics in Intramolecular Singlet Fission

Electron spin plays a critical role in determining the structure, dynamics, and reactivities of molecular excited states, including multiexciton processes such as singlet fission. These systems exhibit triplet pair states whose excited state dynamics can be widely tuned through molecular engineering. For example, the electronic coupling between covalently linked chromophores can be readily modulated using chemical bridges to control proximity, quantum interference, or resonance effects. However, less is known about how spin coupling interactions are impacted by chromophore architecture, and how this influences triplet pair recombination dynamics. Here, in this study, we investigate the role of bridge connectivity and chromophore identity in modulating interchromophore exchange and dipolar coupling interactions for a series of pentacene and tetracene dimers bridged by alternant hydrocarbons (phenylene, naphthalene, anthracene). Using both time-resolved electron paramagnetic resonance and transient absorption spectroscopy, we find that the boundedness and recombination pathways of the triplet pair spins are highly sensitive to molecular architecture and chromophore-specific magnetic dipolar interactions. Notably, nominally ferromagnetic and antiferromagnetic eigenstates result in distinct spin state orderings, consistent with predictions from quantum interference-based graphical models. These findings establish new design principles for tuning spin dynamics in iSF materials, with implications for photonic and quantum information applications.

He, Guiying [City Univ. of New York (CUNY), NY (Un↗
DOE OSTI2022

Finite boundary effects on the spherical Rayleigh–Taylor instability between viscous fluids

For the Rayleigh–Taylor unstable arrangement of a viscous fluid sphere embedded in a finite viscous fluid spherical shell with a rigid boundary and a radially directed acceleration, a dispersion relation is developed from a linear stability analysis using the method of normal modes. [Formula: see text] is the radially directed acceleration at the interface. ρ i denotes the density, μ i is the viscosity, and R i is the radius, where i = 1 is the inner sphere and i = 2 is the outer sphere. The dispersion relation is a function of the following dimensionless variables: viscosity ratio [Formula: see text], density ratio [Formula: see text], spherical harmonic mode n, [Formula: see text], [Formula: see text], and the dimensionless growth rate [Formula: see text], where σ is the exponential growth rate. We show that the boundedness provided by the outer spherical shell has a strong influence on the instability behavior, which is reflected not only in the modulation of the growth rate but also in the selection of the most unstable modes that are physically possible. This outer boundary effect is quantified by the relative magnitude of the radius ratio H. We find that when H is close to unity, lower order harmonics are excluded from becoming the most unstable within a vast region of the parameter space. In other words, the effect of H has precedence over the other controlling parameters d, B, and a wide range of s in establishing what the lowest most unstable mode can be. When H ~ 1, low order harmonics can become the most unstable only for s >> 1. However, in the limit when s → ∞, we show that the most unstable mode is n = 1 and derive the dispersion relation in this limit. The exclusion of most unstable low order harmonics caused by a finite outer boundary is not realized when the outer boundary extends beyond a certain threshold length-scale in which case all modes are equally possible depending on the value of B.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2020

Annihilation-to-nothing: a quantum gravitational boundary condition for the Schwarzschild black hole

The interior of a static Schwarzschild metric can be written in terms of two functions, similar to some models of anisotropic cosmology. With a suitable choice of canonical variables, we solve the Wheeler-DeWitt equation (WDW) inside the horizon of a Schwarzschild black hole. By imposing classicality near the horizon, and requiring boundedness of the wave function, we get a rather generic solution of the WDW equation, whose steepest-descent solution, i.e., the ridge of the wave function, coincides nicely with the classical trajectory. However, there is an ambiguity in defining the arrow of time which leads to two possible interpretations—(i) if there is only one arrow of time, one can infer that the steepest-descent of the wave function follows the classical trajectory throughout: coming from the event horizon and going all the way down to the singularity, while (ii) if there are two different arrows of time in two separate regimes, it can be inferred that the steepest-descent of the wave function comes inwards from the event horizon in one region while it moves outwards from the singularity in the other region, and there exists an annihilation process of these two parts of the wave function inside the horizon. Additionally, adopting the second interpretation could shed light on the information loss paradox: as time goes on, probabilities for histories that include black holes and singularities decay to zero and eventually only trivial geometries dominate.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗
DOE OSTI2022

Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function

Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.

42 ENGINEERING↗
DOE OSTI2025

FIRE: A Failure-Adaptive RL Framework for Edge Computing Migrations

In edge computing, users' service profiles are migrated between edge servers due to user mobility. Reinforcement Learning (RL) frameworks have been proposed to do so, often trained on simulated data. However, existing RL frameworks overlook occasional server failures, which although rare, impact latency-sensitive applications like AR/VR and real- time obstacle detection. These rare failures, being not adequately represented in historical training data, pose a challenge for data-driven RL algorithms. We introduce FIRE, a framework that adapts to rare events by training a RL policy in an edge computing digital twin environment. We propose FIRE-ImRE, an importance sampling-based Q-learning algorithm, which samples rare events proportionally to their impact on the value function. FIRE considers delay, migration, failure, and backup placement costs across individual and shared service profiles. We prove FIRE-ImRE's boundedness and convergence to optimality. Next, we introduce novel deep Q-learning (FIRE-ImDQL) and actor critic (FIRE-ImACRE) versions of our algorithm to enhance scalability. Here, we extend our framework to accommodate users with varying risk tolerances of rare failure events. Through trace-driven experiments, we show that FIRE reduces edge computing costs compared to vanilla RL and the greedy baseline in the event of failures.

Edge computing↗
DOE OSTI2024

Convergence of Weak-SINDy Surrogate Models

In this paper, we give an in-depth error analysis for surrogate models generated by a variant of the Sparse Identification of Nonlinear Dynamics (SINDy) method. We start with an overview of a variety of nonlinear system identification techniques, namely SINDy, weak-SINDy, and the occupation kernel method. Under the assumption that the dynamics are a finite linear combination of a set of basis functions, these methods establish a linear system to recover coefficients. We illuminate the structural similarities between these techniques and establish a projection property for the weak-SINDy technique. Following the overview, we analyze the error of surrogate models generated by a simplified version of weak-SINDy. In particular, under the assumption of boundedness of a composition operator given by the solution, we show that (i) the surrogate dynamics converges towards the true dynamics and (ii) the solution of the surrogate model is reasonably close to the true solution. Finally, as an application, we discuss the use of a combination of weak-SINDy surrogate modeling and proper orthogonal decomposition (POD) to build a surrogate model for partial differential equations (PDEs).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Software Verification Toolkit (SVT): Survey on Available Software Verification Tools and Future Direction

Writing software is difficult. However, writing complex, well tested and designed, and functionally correct software is incredibly difficult. An entire field of study is devoted to the validation and verification of software to address this problem, and in this paper we analyze the landscape of currently available third party software. We have divided our analyses into three separate subsections with regards to software validation: formal methods, static analysis, and test generation. Formal verification is the most complex method in which to validate software correctness, but also the most thorough as it truly validates the mathematical validity of the source code. Static analysis generally is relegated to abstract syntax tree traversal techniques to find errors related to faulty software such as memory leaks or stack overflow issues. Automatic test generation is similar in implementation to static analysis, but pushes a bit further in verifying the boundedness of function inputs and outputs with regards to annotated or parsed criteria. The crux of this report is to analyze and describe the software tools that implement these techniques to validate and verify software. Pros and cons related to installation, utilization, and capabilities of the frameworks are described, and reproducible examples are provided with a focus on usability. The initial survey concluded that the most interesting tools of note are Z3, Isabelle/HOL, and TLA+ with regards to formal verification; and Infer, Frama-C, and SonarQube with regards to static analysis. With these tools in mind, a final conjecture is provided that describes future avenues of utilizing these tools for developing a verification framework to assist in validating existing software at Sandia National Laboratories.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The Stochastic Gause Predator-Prey model: Noise-induced extinctions and invariance

We consider the Gause predator-prey with general bounded or sub‑linear functional responses, – which includes those of Holling types Ⅰ–Ⅳ. – and multiplicative Gaussian noise. In contrast to previous studies, the prey in our model follows logistic dynamics while the predator's population is solely regulated by consumption of the prey. To ensure well-posedeness, we derive explicit Lyapunov‐type criteria ensuring global positivity and moment boundedness of solutions. We find conditions for noise‑induced extinctions, proving that stochasticity can drive either population to collapse even when the deterministic analogue predicts stable coexistence. In the case when the predator becomes extinct, we establish a limiting distribution for the predator's population. Last, for functional responses of Holling type Ⅰ, we provide sufficient conditions on the intensity of the noise for the existence and uniqueness of a stationary distribution.

Gause model↗