Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational mathematics”

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.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

SRBench++: Principled Benchmarking of Symbolic Regression With Domain-Expert Interpretation

Symbolic regression searches for analytic expressions that accurately describe studied phenomena. The main promise of this approach is that it may return an interpretable model that can be insightful to users, while maintaining high accuracy. The current standard for benchmarking these algorithms is SRBench, which evaluates methods on hundreds of datasets that are a mix of real-world and simulated processes spanning multiple domains. At present, the ability of SRBench to evaluate interpretability is limited to measuring the size of expressions on real-world data, and the exactness of model forms on synthetic data. In practice, model size is only one of many factors used by subject experts to determine how interpretable a model truly is. Furthermore, SRBench does not characterize algorithm performance on specific, challenging sub-tasks of regression such as feature selection and evasion of local minima. In this work, we propose and evaluate an approach to benchmarking SR algorithms that addresses these limitations of SRBench by 1) incorporating expert evaluations of interpretability on a domain-specific task, and 2) evaluating algorithms over distinct properties of data science tasks. We evaluate 12 modern symbolic regression algorithms on these benchmarks and present an in-depth analysis of the results, discuss current challenges of symbolic regression algorithms and highlight possible improvements for the benchmark itself.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Integrated Framework of Multisource Data Fusion for Outage Location in Looped Distribution Systems

Accurate outage location is essential for expediting post-outage power restoration, minimizing outage duration, and enhancing the resilience of distribution networks. With the advent of advanced metering infrastructure, data-driven outage location methods have significantly advanced beyond traditional approaches that rely on manual inspections. However, existing methods still face critical challenges, like reliance on single-source data, limited ability to handle partially observable systems or difficulties with loop networks. To the best of our knowledge, no single approach has comprehensively addressed all of these challenges at once. To this end, this paper proposes a comprehensive multisource data fusion framework for outage locations via probabilistic graph networks. The framework consists of three key phases. First, a novel method for reconstituting distribution networks with loops is developed, transforming looped networks into multiple radial subnetworks that retain all outage causalities of the original network. Second, Bayesian network (BN) models are established for each subnetwork, integrating multiple data sources and network structures. Finally, a joint Gibbs sampling mechanism, featuring forward and backward information flow, is designed to merge data from separate BN models and maximize the utilization of limited evidence, ensuring accurate outage location identification. In conclusion, the framework was validated on two modified public test systems, and comparative studies confirmed its effectiveness.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

The Eight Levers of Coercive Conflict: No More, No Less

Few concepts are more important to our nation than the principle of deterrence. It is at the very core of our national security strategy. Despite its lasting import to our nation, and the rest of the world, we still lack a complete and explicit formulation of the calculus of deterrence. This has, at times, resulted in failed policies costing the Nation lives and wealth. With the ultimate objective of making the Nation more secure, we establish a complete and explicit formulation of deterrence calculus, which consists of eight levers. As it turns out this formulation also applies to the calculus of compellence, and is thus a unifying model of coercive conflict.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2026

A mathematical framework for thermodynamic computing with applications to chemical reaction networks

The widespread adoption of energy-intensive computing applications has led to a growing need for energy-efficient computing approaches. Thermodynamic computing offers a promising approach for low-energy computation by leveraging the intrinsic computational capabilities of physical, chemical, or biological systems. However, the mathematical foundations of thermodynamic computing require further development to fully realize the potential energy efficiencies, as well as to assess factors like noise and operational speed. In this paper, we establish a mathematical framework for utilizing thermodynamic processes to perform fundamental operations, including addition, subtraction, multiplication, and division. We highlight the use of chemical reactions as potential computational units and explore synthetic chemical and biochemical systems as practical implementations. Additionally, we demonstrate how these principles can be applied to solving complex mathematical problems, such as ordinary differential equations (ODEs) and suggest the necessary components to implement the thermodynamic computing framework using chemical reactions based in a microfluidic device. This work enhances our understanding of thermodynamic processes for natural computing as a basis for scalable, energy-efficient computation in paradigm disruptive next-generation systems.

Cannon, William R. [Pacific Northwest National Lab↗
DOE OSTI2022

Likelihood Maximization and Moment Matching in Low SNR Gaussian Mixture Models

We derive an asymptotic expansion for the log-likelihood of Gaussian mixture models (GMMs) with equal covariance matrices in the low signal-to-noise regime. The expansion reveals an intimate connection between two types of algorithms for parameter estimation: the method of moments and likelihood optimizing algorithms such as Expectation-Maximization (EM). We show that likelihood optimization in the low SNR regime reduces to a sequence of least squares optimization problems that match the moments of the estimate to the ground truth moments one by one. This connection is a stepping stone towards the analysis of EM and maximum likelihood estimation in a wide range of models. A motivating application for the study of low SNR mixture models is cryo-electron microscopy data, which can be modeled as a GMM with algebraic constraints imposed on the mixture centers. We discuss the application of our expansion to algebraically constrained GMMs, among other example models of interest. © 2022 The Authors. Communications on Pure and Applied Mathematics published by Wiley Periodicals LLC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Convergence analysis of single rate and multirate fixed stress split iterative coupling schemes in heterogeneous poroelastic media

Recently, the accurate modeling of flow–structure interactions has gained more attention and importance for both petroleum and environmental engineering applications. Of particular interest is the coupling between subsurface flow and reservoir geomechanics. Different single rate and multirate iterative and explicit coupling schemes have been proposed and analyzed in the past. In addition, Banach fixed point contraction results were obtained for iterative coupling schemes, and conditionally stable results were obtained for explicit coupling schemes. In this work, we will consider the mathematical analysis of the single rate and multirate fixed stress split iterative coupling schemes for spatially heterogeneous poroelastic media. We will re–establish the contractivity for both schemes in the localized case, and we will show that heterogeneities come at the expense of imposing more restricted conditions on the number of fine flow time steps that can be taken within one coarse mechanics time step in the multirate case. Our mathematical analysis is supplemented by numerical simulations validating our derived upper bounds. Finally, to the best of our knowledge, this is the first rigorous mathematical analysis of the multirate fixed–stress split iterative coupling scheme in heterogeneous poroelastic media.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Nearly Periodic Maps and Geometric Integration of Noncanonical Hamiltonian Systems

Abstract M. Kruskal showed that each continuous-time nearly periodic dynamical system admits a formal U (1)-symmetry, generated by the so-called roto-rate. When the nearly periodic system is also Hamiltonian, Noether’s theorem implies the existence of a corresponding adiabatic invariant. We develop a discrete-time analog of Kruskal’s theory. Nearly periodic maps are defined as parameter-dependent diffeomorphisms that limit to rotations along a U (1)-action. When the limiting rotation is non-resonant, these maps admit formal U (1)-symmetries to all orders in perturbation theory. For Hamiltonian nearly periodic maps on exact presymplectic manifolds, we prove that the formal U (1)-symmetry gives rise to a discrete-time adiabatic invariant using a discrete-time extension of Noether’s theorem. When the unperturbed U (1)-orbits are contractible, we also find a discrete-time adiabatic invariant for mappings that are merely presymplectic, rather than Hamiltonian. As an application of the theory, we use it to develop a novel technique for geometric integration of non-canonical Hamiltonian systems on exact symplectic manifolds.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

On Properties of Adjoint Systems for Evolutionary PDEs

We investigate the geometric structure of adjoint systems associated with evolutionary partial differential equations at the fully continuous, semi-discrete, and fully discrete levels and the relations between these levels. We show that the adjoint system associated with an evolutionary partial differential equation has an infinite-dimensional Hamiltonian structure, which is useful for connecting the fully continuous, semi-discrete, and fully discrete levels. We subsequently address the question of discretize-then-optimize versus optimize-then-discrete for both semi-discretization and time integration, by characterizing the commutativity of discretize-then-optimize methods versus optimize-then-discretize methods uniquely in terms of an adjoint-variational quadratic conservation law. For Galerkin semi-discretizations and one-step time integration methods in particular, we explicitly construct these commuting methods by using structure-preserving discretization techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Type II Hamiltonian Variational Principle and Adjoint Systems for Lie Groups

We present a novel Type II variational principle on the cotangent bundle of a Lie group which enforces Type II boundary conditions, i.e., fixed initial position and final momentum. In general, such Type II variational principles are only globally defined on vector spaces or locally defined on general manifolds; however, by left translation, we are able to define this variational principle globally on cotangent bundles of Lie groups. Type II boundary conditions are particularly important for adjoint sensitivity analysis, which is our motivating application. As such, we additionally discuss adjoint systems on Lie groups, their properties, and how they can be used to solve optimization problems subject to dynamics on Lie groups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Physics-based stabilized finite element approximations of the Poisson–Nernst–Planck equations

We present and analyze two stabilized finite element methods for solving numerically the Poisson–Nernst–Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionally stable. We validate our methodology through transient numerical experiments that show convergence toward steady-state solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Improving the accuracy of discretisations of the vector transport equation on the lowest-order quadrilateral Raviart-Thomas finite elements

Within finite element models of fluids, vector-valued fields such as velocity or momentum variables are commonly discretised using the Raviart-Thomas elements. However, when using the lowest-order quadrilateral Raviart-Thomas elements, standard finite element discretisations of the vector transport equation typically have a low order of spatial accuracy. This paper describes two schemes that improve the accuracy of transporting such vector-valued fields on two-dimensional curved manifolds. The first scheme that is presented reconstructs the transported field in a higher-order function space, where the transport equation is then solved. The second scheme applies a mixed finite element formulation to the vector transport equation, simultaneously solving for the transported field and its vorticity. In this work, an approach to stabilising this mixed vector-vorticity formulation is presented that uses a Streamline Upwind Petrov-Galerkin (SUPG) method. These schemes are then demonstrated, along with their accuracy properties, through some numerical tests. Two new test cases are used to assess the transport of vector-valued fields on curved manifolds, solving the vector transport equation in isolation. The improvement of the schemes is also shown through two standard test cases for rotating shallow-water models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Projective embedding of dynamical systems: Uniform mean field equations

Herein we study embeddings of continuous dynamical systems in larger dimensions via projector operators. We call this technique PEDS, projective embedding of dynamical systems, as the stable fixed point of the original system dynamics are recovered via projection from the higher dimensional space. In this paper we provide a general definition and prove that for a particular type of rank-1 projector operator, the uniform mean field projector, the equations of motion become a mean field approximation of the dynamical system. While in general the embedding depends on a specified variable ordering, the same is not true for the uniform mean field projector. We prove a variety of results on the relationship between the spectrum of the Jacobian for fixed points in the original and in the embedded system. Direct applications of PEDS can be non-convex optimization and machine learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Predicting stress response and improved protein overproduction in Bacillus subtilis

Abstract Bacillus subtilis is a well-characterized microorganism and a model for the study of Gram-positive bacteria. The bacterium can produce proteins at high densities and yields, which has made it valuable for industrial bioproduction. Like other cell factories, metabolic modeling of B. subtilis has discovered ways to optimize its metabolism toward various applications. The first genome-scale metabolic model (M-model) of B. subtilis was published more than a decade ago and has been applied extensively to understand metabolism, to predict growth phenotypes, and served as a template to reconstruct models for other Gram-positive bacteria. However, M-models are ill-suited to simulate the production and secretion of proteins as well as their proteomic response to stress. Thus, a new generation of metabolic models, known as metabolism and gene expression models (ME-models), has been initiated. Here, we describe the reconstruction and validation of a ME model of B. subtilis , i JT964-ME. This model achieved higher performance scores on the prediction of gene essentiality as compared to the M-model. We successfully validated the model by integrating physiological and omics data associated with gene expression responses to ethanol and salt stress. The model further identified the mechanism by which tryptophan synthesis is upregulated under ethanol stress. Further, we employed i JT964-ME to predict amylase production rates under two different growth conditions. We analyzed these flux distributions and identified key metabolic pathways that permitted the increase in amylase production. Models like i JT964-ME enable the study of proteomic response to stress and the illustrate the potential for optimizing protein production in bacteria.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Optimization of nutrient utilization efficiency and productivity for algal cultures under light and dark cycles using genome-scale model process control

Abstract Algal cultivations are strongly influenced by light and dark cycles. In this study, genome-scale metabolic models were applied to optimize nutrient supply during alternating light and dark cycles of Chlorella vulgaris . This approach lowered the glucose requirement by 75% and nitrate requirement by 23%, respectively, while maintaining high final biomass densities that were more than 80% of glucose-fed heterotrophic culture. Furthermore, by strictly controlling glucose feeding during the alternating cycles based on model-input, yields of biomass, lutein, and fatty acids per gram of glucose were more than threefold higher with cycling compared to heterotrophic cultivation. Next, the model was incorporated into open-loop and closed-loop control systems and compared with traditional fed-batch systems. Closed-loop systems which incorporated a feed-optimizing algorithm increased biomass yield on glucose more than twofold compared to standard fed-batch cultures for cycling cultures. Finally, the performance was compared to conventional proportional-integral-derivative (PID) controllers. Both simulation and experimental results exhibited superior performance for genome-scale model process control (GMPC) compared to traditional PID systems, reducing the overall measured value and setpoint error by 80% over 8 h. Overall, this approach provides researchers with the capability to enhance nutrient utilization and productivity of cell factories systematically by combining genome-scale models and controllers into an integrated platform with superior performance to conventional fed-batch and PID methodologies.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Leveraging public AI tools to explore systems biology resources in mathematical modeling

Predictive mathematical modeling is an essential part of systems biology and is interconnected with information management. Systems biology information is often stored in specialized formats to facilitate data storage and analysis. These formats are not designed for easy human readability and thus require specialized software to visualize and interpret results. Therefore, comprehending modeling and underlying networks and pathways is contingent on mastering systems biology tools, which is particularly challenging for users with no or little background in data science or system biology. To address this challenge, we investigated the usage of public Artificial Intelligence (AI) tools in exploring systems biology resources in mathematical modeling. We tested public AI’s understanding of mathematics in models, related systems biology data, and the complexity of model structures. Our approach can enhance the accessibility of systems biology for non-system biologists and help them understand systems biology without a deep learning curve.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Kibble-Zurek mechanism for nonequilibrium phase transitions in driven systems with quenched disorder

Abstract We show that the Kibble-Zurek mechanism applies to nonequilibrium phase transitions found in driven assemblies of superconducting vortices and colloids moving over quenched disorder where a transition occurs from a plastic disordered flowing state to a moving anisotropic crystal. We measure the density of topological defects as a function of quench rate through the nonequilibrium phase transition, and find that on the ordered side of the transition, the topological defect density ρ d scales as a power law, $${\rho }_{{{{{{{{\rm{d}}}}}}}}}\propto 1/{t}_{{{{{{{{\rm{q}}}}}}}}}^{\beta }$$ ρ d ∝ 1 / t q β , where t q is the quench time duration, consistent with the Kibble-Zurek mechanism. We show that scaling with the same exponent holds for varied strengths of quenched disorder and that the exponents fall in the directed percolation universality class. Our results suggest that the Kibble-Zurek mechanism can be applied to the broader class of systems that exhibit absorbing phase transitions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A framework for data-driven solution and parameter estimation of PDEs using conditional generative adversarial networks

We employ and adapt the image-to-image translation concept based on conditional generative adversarial networks (cGAN) for learning a forward and an inverse solution operator of partial differential equations (PDEs). We focus on steady-state solutions of coupled hydromechanical processes in heterogeneous porous media and present the parameterization of the spatially heterogeneous coefficients, which is exceedingly difficult using standard reduced-order modeling techniques. We show that our framework provides a speed-up of at least 2,000 times compared to a finite-element solver and achieves a relative root-mean-square error (r.m.s.e.) of less than 2% for forward modeling. For inverse modeling, the framework estimates the heterogeneous coefficients, given an input of pressure and/or displacement fields, with a relative r.m.s.e. of less than 7%, even for cases where the input data are incomplete and contaminated by noise. The framework also provides a speed-up of 120,000 times compared to a Gaussian prior-based inverse modeling approach while also delivering more accurate results.

97 MATHEMATICS AND COMPUTING↗