Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Spatial modeling algorithms for reactions and transport in biological cells

Biological cells rely on precise spatiotemporal coordination of biochemical reactions to control their functions. Such cell signaling networks have been a common focus for mathematical models, but they remain challenging to simulate, particularly in realistic cell geometries. Here we present Spatial Modeling Algorithms for Reactions and Transport (SMART), a software package that takes in high-level user specifications about cell signaling networks and then assembles and solves the associated mathematical systems. SMART uses state-of-the-art finite element analysis, via the FEniCS Project software, to efficiently and accurately resolve cell signaling events over discretized cellular and subcellular geometries. We demonstrate its application to several different biological systems, including yes-associated protein (YAP)/PDZ-binding motif (TAZ) mechanotransduction, calcium signaling in neurons and cardiomyocytes, and ATP generation in mitochondria. Throughout, we utilize experimentally derived realistic cellular geometries represented by well-conditioned tetrahedral meshes. These scenarios demonstrate the applicability, flexibility, accuracy and efficiency of SMART across a range of temporal and spatial scales.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Bayesian Monte Carlo Evaluation of Imperfect (n, 233 U) Data and Model

Conventional nuclear data evaluation methods using generalized linear least squares make the following assumptions: prior and posterior probability distribution functions (PDFs) of all model parameters and data are normal (Gaussian); the linear approximation is sufficiently accurate to minimize the cost function (even for nonlinear models); the model (e.g., of neutron cross section) and experimental data (including covariance data) are without defect and prior PDFs of parameters and measured data are known perfectly. Neglect of covariance between model parameters and measured data in conventional evaluations contributes to imperfections. These assumptions are inherent to the generalized linear least squares minimization method commonly used for resolved resonance region neutron cross section evaluations but are often not justified due to the presence of non-normal PDFs, nonlinear models (e.g., R-matrix formalism), and inherent imperfections in data and models (e.g., imperfect covariance data). Here, these assumptions are removed in a mathematical framework of Bayes’ theorem, which is implemented using the Metropolis-Hastings Monte Carlo method. Most importantly, new parameters are introduced to parameterize discrepancies between the theoretical model and measured data to quantify judgement about discrepancies or imperfections in a reproducible manner. An evaluation of 233U in the eV region using the ENDF-B/VIII.0 library and transmission data (Guber et al.) is presented, and posterior parameters are compared to those obtained by conventional evaluation methods. This example illustrates the effects of removing the most harmful assumption: that of model-data perfection.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Chaotic Dynamics Driven by Particle-Core Interactions

High-intensity beams in modern linacs are frequently encircled by diffuse halos, which drive sustained particle losses and result in gradual degradation of accelerating structures. In large part, the growth of halos is facilitated by internal space-charge forces within the beams, and detailed characterization of this process constitutes an active area of ongoing research. A partial understanding of dynamics that ensue within space-charge dominated beams is presented by the particle-core interaction paradigm – a mathematical model wherein single particle dynamics, subject to the collective potential of the core, are treated as a proxy for the broader behavior of the beam. In this work, we investigate the conditions for the onset of large-scale chaos within the framework of this model, and demonstrate that the propensity towards stochastic evolution is strongly dependent upon the charge distribution of the beam. In particular, we show that while particle motion within a uniformly charged beam is dominantly regular, rapid deterministic chaos readily arises within space-charge dominated Gaussian beams. Importantly, we find that for sufficiently high values of the beam’s space charge and beam pulsation amplitude, enhanced chaotic mixing between the core and the halo can lead to an enhanced radial diffusion of charged particles. We explain our results from analytic grounds by demonstrating that chaotic motion is driven by the intersection of two principal resonances of the system, and derive the relevant overlap conditions. Additionally, our analysis illuminates a close connection between the mathematical formulation of the particle-core interaction model and the Andoyer family of integrable Hamiltonians

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

A multi-dimensional Child–Langmuir law for any diode geometry

While prior theoretical studies of multi-dimensional space-charge limited current (SCLC) assumed emission from a small patch on infinite electrodes, none have considered emission from an entire finite electrode. In this paper, we apply variational calculus (VC) and conformal mapping, which have previously been used to derive analytic solutions for SCLC density (SCLCD) for nonplanar one-dimensional geometries, to obtain mathematical relationships for any multi-dimensional macroscopic diode with finite cathode and anode. We first derive a universal mathematical relationship between space-charge limited potential and vacuum potential for any diode and apply this technique to determine SCLCD for an eccentric spherical diode. We then apply VC and the Schwartz–Christoffel transformation to derive an exact equation for SCLCD in a general two-dimensional planar geometry with emission from a finite emitter. Particle-in-cell simulations using VSim agreed within 4%–13% for a range of ratios of emitter width to gap distance using the thinnest electrodes practical for the memory constraints of our hardware, with the difference partially attributed to the theory's assumption of infinitesimally thin electrodes. After generalizing this approach to determine SCLCD for any orthogonal diode as a function of only the vacuum capacitance and vacuum potential, we derive an analytical formulation of the three-dimensional Child–Langmuir law for finite parallel rectangular and disk geometries. These results demonstrate the utility for calculating SCLCD for any diode geometry using vacuum capacitance and vacuum potential, which are readily obtainable for many diode geometries, to guide experiment and simulation development.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Physics successfully implements Lagrange multiplier optimization

Optimization is a major part of human effort. While being mathematical, optimization is also built into physics. For example, physics has the Principle of Least Action; the Principle of Minimum Power Dissipation, also called Minimum Entropy Generation; and the Variational Principle. Physics also has Physical Annealing, which, of course, preceded computational Simulated Annealing. Physics has the Adiabatic Principle, which, in its quantum form, is called Quantum Annealing. Thus, physical machines can solve the mathematical problem of optimization, including constraints. Binary constraints can be built into the physical optimization. In that case, the machines are digital in the same sense that a flip–flop is digital. A wide variety of machines have had recent success at optimizing the Ising magnetic energy. We demonstrate in this paper that almost all those machines perform optimization according to the Principle of Minimum Power Dissipation as put forth by Onsager. Further, we show that this optimization is in fact equivalent to Lagrange multiplier optimization for constrained problems. We find that the physical gain coefficients that drive those systems actually play the role of the corresponding Lagrange multipliers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Resurgent extrapolation: rebuilding a function from asymptotic data. Painlevé I

Extrapolation is a generic problem in physics and mathematics: how to use asymptotic data in one parametric regime to learn about the behavior of a function in another parametric regime. For example: extending weak coupling expansions to strong coupling, or high temperature expansions to low temperature, or vice versa. Such extrapolations are particularly interesting in systems possessing dualities. Here we study numerical procedures for performing such an extrapolation, combining ideas from resurgent asymptotics with well-known techniques of Borel summation, Padé approximants and conformal mapping. We illustrate the method with the concrete example of the Painlevé I equation, which has applications in many branches of physics and mathematics. Starting solely with a finite number of coefficients from asymptotic data at infinity on the positive real line, we obtain a high precision extrapolation of the function throughout the complex plane, even across the phase transition into the pole region. The precision far exceeds that of state-of-the-art numerical integration methods along the real axis. Furthermore, the methods used are both elementary and general, not relying on Painlevé integrability properties, and so are applicable to a wide class of extrapolation problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Models and Methods for Sparse (Hyper)Network Science in Business, Industry, and Government

The authors are hosting an AMS sponsored Mathematics Research Community (MRC) focusing on two themes that have garnered intense attention in network models of complex relational data: (1) how to faithfully model multi-way relations in hypergraphs, rather than only pairwise interactions in graphs; and (2) challenges posed by modelling networks with extreme sparsity. Here we introduce and explore these two themes and their challenges. In this work, we hope to generate interest from researchers in pure and applied mathematics and computer science.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The Euler characteristic as a basis for teaching topology concepts to crystallographers

The simple Euler polyhedral formula, expressed as an alternating count of the bounding faces, edges and vertices of any polyhedron, V – E + F = 2, is a fundamental concept in several branches of mathematics. Obviously, it is important in geometry, but it is also well known in topology, where a similar telescoping sum is known as the Euler characteristic χ of any finite space. The value of χ can also be computed for the unit polyhedra (such as the unit cell, the asymmetric unit or Dirichlet domain) which build, in a symmetric fashion, the infinite crystal lattices in all space groups. In this application χ has a modified form (χ m ) and value because the addends have to be weighted according to their symmetry. Although derived in geometry (in fact in crystallography), χ m has an elegant topological interpretation through the concept of orbifolds. Alternatively, χ m can be illustrated using the theorems of Harriot and Descartes, which predate the discovery made by Euler. Those historical theorems, which focus on angular defects of polyhedra, are beautifully expressed in the formula of de Gua de Malves. In a still more general interpretation, the theorem of Gauss–Bonnet links the Euler characteristic with the general curvature of any closed space. This article presents an overview of these interesting aspects of mathematics with Euler's formula as the leitmotif. Finally, a game is designed, allowing readers to absorb the concept of the Euler characteristic in an entertaining way.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Perspectives on Research in Computational Plasma Physics With Applications to Experiments

Computational plasma physics was born some 50 years ago with the development of high-speed computers. Computer simulation is well suited to the challenging nature of fundamental and applied plasma science, which exhibits enormous ranges of time and space scales, and whose underlying mathematical framework is comprised of nonlinear partial differential equations and nonlinear kinetic equations. Computational plasma physics has advanced from relatively simple calculations with limited dimensionality and scope to sophisticated and comprehensive simulation models. Moreover, computational plasma physics has matured as a significant scientific discipline with a rigorous mathematical foundation and voluminous literature. While computational plasma physics has greatly benefitted from the growth in computing capability by many orders of magnitude, the contributions from innovation in methods and algorithms have been no less important. This talk presents a personal perspective on the development and application of computational plasma physics to plasmas in nature and in the laboratory. The examples described will be based on experience over the course of a career in computational plasma physics and illustrate both the fundamental plasma phenomena and the behavior of laboratory plasmas. Some of the specific examples include simulations of microinstabilities in the magnetic mirror, tokamak and spheromak plasmas, laser-plasma interactions, and the Knudsen-layer phenomena, as it affects fusion performance. The examples also illustrate the development of appropriate models and algorithms that are well suited to simulating the phenomena of interest efficiently. Finally, a particular interest of the author has been the development of multiple time-scale algorithms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Numerical Analysis of Liquid Metal MHD Flow and Heat Transfer for Open-Surface Li Divertor in FNSF

Within the ongoing U.S.-based program on the development of liquid metal plasma-facing components, numerical simulations and analyses are performed to address the feasibility of the open-surface Li divertor. In the previous scoping studies (Smolentsev, 2021), heat-removal capabilities of the divertor were assessed using a simplified flow model for a slug-type velocity profile and constant flow thickness. Here, new analyses take into account forces acting on the flowing Li layer. Three reduced-order mathematical models are applied under the conditions of the U.S. Fusion Nuclear Science Facility (FNSF) to access magnetohydrodynamic (MHD) flow development effects, velocity distribution, and surface waves: 1) fully developed MHD flow; 2) quasi-2-D developing MHD flow; and 3) multiphase MHD flow. The obtained results for MHD flows and the surface heat flux computed with the plasma code scrape-off layer plasma simulation for ITER (SOLPS-ITER) are then used as input data to compute the temperature distribution in the divertor by solving the convection–diffusion energy equation.

Smolentsev, Sergey↗
DOE OSTI2020

HIV influences clustering and intracellular replication of hepatitis C virus

We report HCV and HIV coinfection is common and HIV leads to increased HCV viraemia and accelerated disease progression. However, the biological basis of this interaction remains poorly understood and little is known about the impact of HIV on HCV replication at the cellular level. We analysed HCV RNA, based on single-cell laser-capture microdissection, in liver biopsies from monoinfected (n = 4) and HCV/HIV-coinfected (n = 5) participants. HCV RNA was assayed in 3200 hepatocytes with information of spatial position. We compared HCV RNA levels and clustering properties of infection between mono- and coinfected participants, and developed a mathematical model of infection. Although the median plasma HCV RNA level and the fraction of infected cells were comparable in monoinfected (7.0 log 10 IU/mL and ~ 30%) and coinfected (7.3 log 10 IU/mL and ~ 40%) participants, the median HCV RNA per infected hepatocyte in monoinfected (2.8IU) was significantly lower than in coinfected (8.2IU) participants (p = .03). Clustering of infected cells was more prominent in monoinfected participants (91% of samples) than in coinfected participants (~48%), p = .0045, suggesting that spatial spread may be influenced by HIV coinfection. Interestingly, when clustering does occur, the size of clusters is similar in both types of infection. A mathematical model of infection suggested that HIV allows higher intracellular accumulation of HCV RNA by impeding the export of HCV RNA. Our observations show that HIV coinfection impacts intracellular accumulation of HCV RNA and the clustering of HCV-infected cells, but to a less extent the fraction of HCV-infected cells.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Ergodic Lagrangian dynamics in a superhero universe

We present a fictional scenario that, while undeniably whimsical, provides the foundation for a unique exercise in extended problem solving, physics analysis, and quantitative model development. Starting with the foundational premise of the Wild Cards shared-world superhero universe, we demonstrate how a variety of concepts appropriate to the advanced undergraduate level—ergodicity, functional analysis, Lagrangian mechanics, and the ever-important simplifying approximation—can be combined into a rich, coherent mathematical model. The goal of this case study is to develop a useful pedagogical exercise in exploring an open-ended research question that presents, at first glance, no clear path forward. Being both eclectic and lengthy, this exercise offers a unique way for students to apply their core physics and mathematics education. It is perhaps best used within a senior honors seminar or within a brief (e.g., January term) elective class.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Understanding Hepatitis B Virus Dynamics and the Antiviral Effect of Interferon Alpha Treatment in Humanized Chimeric Mice

Whereas the mode of action of lamivudine (LAM) against hepatitis B virus (HBV) is well established, the inhibition mechanism(s) of interferon alpha (IFN-α) is less completely defined. To advance our understanding, we, for this study, mathematically modeled HBV kinetics during 14-day pegylated IFN-α-2a (pegIFN), LAM, or pegIFN-plus-LAM (pegIFN+LAM) treatment of 39 chronically HBV-infected humanized uPA/SCID chimeric mice. Serum HBV DNA and intracellular HBV DNA were measured frequently. We developed a multicompartmental mathematical model and simultaneously fit it to the serum and intracellular HBV DNA data. Unexpectedly, even in the absence of an adaptive immune response, a biphasic decline in serum HBV DNA and intracellular HBV DNA was observed in response to all treatments. Kinetic analysis and modeling indicate that the first phase represents inhibition of intracellular HBV DNA synthesis and secretion, which was similar under all treatments with an overall mean efficacy of 98%. In contrast, there were distinct differences in HBV decline during the second phase, which was accounted for in the model by a time-dependent inhibition of intracellular HBV DNA synthesis, with the steepest decline observed during pegIFN+LAM treatment (1.28/day) and the slowest (0.1/day) during pegIFN monotherapy. Reminiscent of observations in patients treated with pegIFN and/or LAM, a biphasic HBV decline was observed in treated humanized mice in the absence of an adaptive immune response. Interestingly, combination treatment did not increase the initial inhibition of HBV production but rather enhanced second-phase decline, providing insight into the dynamics of HBV treatment response and the mode of action of IFN-α against HBV.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Local and nonlocal phase-field models of tumor growth and invasion due to ECM degradation

We present and analyze new multi-species phase-field mathematical models of tumor growth and ECM invasion. The local and nonlocal mathematical models describe the evolution of volume fractions of tumor cells, viable cells (proliferative and hypoxic cells), necrotic cells, and the evolution of matrix-degenerative enzyme (MDE) and extracellular matrix (ECM), together with chemotaxis, haptotaxis, apoptosis, nutrient distribution, and cell-to-matrix adhesion. We provide a rigorous proof of the existence of solutions of the coupled system with gradient-based and adhesion-based haptotaxis effects. In addition, we discuss finite element discretizations of the model, and we present the results of numerical experiments designed to show the relative importance and roles of various effects, including cell mobility, proliferation, necrosis, hypoxia, and nutrient concentration on the generation of MDEs and the degradation of the ECM.

Mathematics↗
DOE OSTI2024

Implementation and Synthesis of Math Library Functions

Achieving speed and accuracy for math library functions like exp, sin, and log is difficult. This is because low-level implementation languages like C do not help math library developers catch mathematical errors, build implementations incrementally, or separate high-level and low-level decision making. This ultimately puts development of such functions out of reach for all but the most experienced experts. To address this, we introduce MegaLibm, a domain-specific language for implementing, testing, and tuning math library implementations. MegaLibm is safe, modular, and tunable. Implementations in MegaLibm can automatically detect mathematical mistakes like sign flips via semantic wellformedness checks, and components like range reductions can be implemented in a modular, composable way, simplifying implementations. Once the high-level algorithm is done, tuning parameters like working precisions and evaluation schemes can be adjusted through orthogonal tuning parameters to achieve the desired speed and accuracy. MegaLibm also enables math library developers to work interactively, compiling, testing, and tuning their implementations and invoking tools like Sollya and type-directed synthesis to complete components and synthesize entire implementations. MegaLibm can express 8 state-of-the-art math library implementations with comparable speed and accuracy to the original C code, and can synthesize 5 variations and 3 from-scratch implementations with minimal guidance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Role of pore dilation in molecular transport through the nuclear pore complex: Insights from polymer scaling theory

The nuclear pore complex (NPC), a channel within the nuclear envelope filled with intrinsically disordered proteins, regulates the transport of macromolecules between the nucleus and the cytoplasm. Recent studies have highlighted the NPC’s ability to adjust its diameter in response to the membrane tension, underscoring the importance of exploring how variations in pore size influence molecular transport through the NPC. In this study, we investigated the relationship between pore size and transport rate and proposed a mathematical model describing this connection. We began by theoretically analyzing how the pore size scales with the characteristic dimensions of the mesh-like structure within the pore. By introducing key assumptions about how the meshwork structure influences molecular diffusion, we derived a mathematical expression for the transport rate based on the size of the pore and the transported molecules. To validate our model, we conducted Brownian dynamics simulations using a coarse-grained representation of the NPC. These simulations, performed across a range of pore sizes, demonstrated strong agreement with our model’s predictions, confirming its accuracy and applicability. Our model is specifically tailored for small-to-medium-sized molecules, approximately 5 nanometers in size, making it relevant to a wide range of transcription factors and signaling molecules. It also extends to molecules with weak and transient interactions with FG-Nups, such as importin-β. By presenting this model formula, our study offers a quantitative framework for analyzing the effects of pore dilation on nucleocytoplasmic transport.

Biochemistry & Molecular Biology↗
DOE OSTI2022

graphenv: a Python library for reinforcement learning on graph search spaces

Many important and challenging problems in combinatorial optimization (CO) can be expressed as graph search problems, in which graph vertices represent full or partial solutions and edges represent decisions that connect them. Graph structure not only introduces strong relational inductive biases for learning (Battaglia et al., 2018) - in this context, by providing a way to explicitly model the value of transitioning (along edges) between one search state (vertex) and the next - but lends itself to problems both with and without clearly defined algebraic structure. For example, classic CO problems on graphs such as the Traveling Salesman Problem (TSP) can be expressed as either pure graph search or integer programs. Other problems, however, such as molecular optimization, do no have concise algebraic formulations and yet are readily implemented as a graph search (V. et al., 2022; Zhou et al., 2019). Such "model-free" problems constitute a large fraction of modern reinforcement learning (RL) research owing to the fact that it is often much easier to write a forward simulation that expresses all of the state transitions and rewards, than to write down the precise mathematical expression of the full optimization problem. In the case of molecular optimization, for example, one can use domain knowledge alongside existing software libraries to model the effect of adding a single bond or atom to an existing but incomplete molecule, and let the RL algorithm build a model of how good a given decision is by "experiencing" the simulated environment many times through. In contrast, a model-based mathematical formulation that fully expresses all the chemical and physical constraints is intractable. In recent years, RL has emerged as an effective paradigm for optimizing searches over graphs and led to state-of-the-art heuristics for games like Go and chess, as well as for classical CO problems such as the TSP. This combination of graph search and RL, while powerful, requires non-trivial software to execute, especially when combining advanced state representations such as Graph Neural Networks (GNN) with scalable RL algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Sparse Recovery for Scientific Data

We have built build and analyzed fundamental mathematical tools that enable sparse recovery of scientific data for high performance computing, experimental facilities and sensor measurement. The proposed work will impact many areas of research across the DOE. We have designed, developed and analyzed fast scalable algorithms for the sparse recovery of scientific data sets that may be extremely large, generated very quickly and distributed across multiple storage devices. The algorithms we developed will be used to process the copious amounts of scientific data generated by the DOE supercomputer simulations and by DOE experimental and observational facilities. They leverage the fact that while the amount of data produced can be extremely large, the actual quantities of interest (QoI's) are often sparse, either in space time, or in some feature space. Mathematically, notions of compressive sensing, including l1 regularized and total variation regularized optimization have played an important part in this effort.

97 MATHEMATICS AND COMPUTING↗