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 1,117 records · Page 62

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

The Differential Equations That Model Diseases

In this brief tutorial, I will describe the simplest way of modeling a deadly infectious disease, such as COVID-19. I will show that at early times, the disease grows exponentially, but at late times, falls off like a Bell curve. I will solve the equations numerically with Python. A common mathematical model is the so-called compartmental model, where diseases can move people between "categories" such as healthy, infectious, or truly sick. This is a large, well established field and there are many good resources on this topic. I started with the SIAM review article The mathematics of infectious diseases. However, there are many excellent textbooks and more modern reviews as well.

60 APPLIED LIFE SCIENCES↗

A Plasma Modeling Hierarchy and Verification Approach

This report reviews a hierarchy of formal mathematical models for describing plasma phenomena. Starting with the Boltzmann equation, a sequence of approximations and modeling assumptions can be made that progressively reduce to the equations for magnetohydrodynamics. Understanding the assumptions behind each of these models and their mathematical form is essential to appropriate use of each level of the hierarchy. A sequence of moment models of the Boltzmann equation are presented, then focused into a generalized three-fluid model for neutral species, electrons, and ions. This model is then further reduced to a two-fluid model, for which Braginskii described a useful closure. Further reduction of the two-fluid model yields a Generalized Ohm's Law model, which provides a connection to magnetohydrodynamic approaches. A verification approach based on linear plasma waves is presented alongside the model hierarchy, which is intended as an initial and necessary but not sufficient step for verification of plasma models within this hierarchy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analytically Derived Piezoelectric Ejecta Data Transformations, with Implications for Claims of Experimentally Observed Self-Similarity

Building upon a previously documented analytic formalism, we derive a set of data transformations that relate piezoelectrically inferred time-dependent ejecta masses, dynamical ejecta cloud densities, and "radiographic" ejecta cloud density distributions. These transformation rules are derived rigorously, with careful attention to the assumption of instant ejecta production which is inherent in the piezoelectric mass inference procedure. Some of these relationships have not appeared previously in the literature, including solutions for the unique ejecta velocity distribution and radiographic ejecta cloud density distribution consistent with the instant-production assumption for a given piezoelectrically inferred mass dataset. In deriving the latter, we prove that—again subject to the ubiquitous instant-creation assumption—measurements at a single sensor are sufficient to determine properties of the ejecta cloud everywhere at all times. Other data transformation relationships have appeared in the literature without a rigorous derivation, or have been stated in forms that obscure the key mathematical relationships. We apply these results to arguments for self-similar ejecta cloud evolution, thereby deriving mathematical expressions by which claims of self-similarity may be examined. We prove that one analysis used in the literature to claim experimental evidence of a short ejecta production timescale—and consequently of self-similar cloud evolution—in fact places no constraint the ejecta production interval and therefore does not support the associated conclusion. We also provide a potentially useful uniqueness proof.

30 DIRECT ENERGY CONVERSION↗

Analysis into Asymptotic Convergence to Full Nonlinear Solutions and Exploration of the Implication of Numerical Operator Mutation of Differential Systems

A robust, sufficiently accurate and practical hydrodynamic simulation toolset is required as a key component of the modeling and simulation of air-gap electrostatic discharge events. This work was performed to complement these ongoing efforts. In particular, hydrodynamic simulations must be vetted to ensure they are robust and sufficiently accurate over relevant characteristic scales. Verification models were generated in order to cultivate the technical knowledge and expertise needed to properly create, implement and execute numerical simulations. Furthermore, this effort was utilized extensively to educate students on the mathematical and numerical principles underlying hydrodynamic simulations. This education opportunity, provided in a holistic and rigorous manner, has greatly benefited developing scientists and engineers with the necessary understandings and toolsets required to excel at accomplishing the task at hand, and, more generally, it has enabled them to generate key programmatic deliverables. This report articulates several subtilties; specifically, how perturbations, nonlinear behavior, and dissipative mechanisms influence numerical stability, how to properly structure mathematical and numerical solutions, and how to properly generate error estimation/assignment. A more rigorous discussion of the consequences of such topics can be found in the body of this report in Chapters 2 and 3 with qualitative findings discussed in Chapter 4.

97 MATHEMATICS AND COMPUTING↗

The Kokkos Ecosystem [Brief]

In 2016/2017, the field of High-Performance Computing (HPC) entered a new era driven by fundamental physics challenges to produce ever more energy and cost-efficient processors. Since the convergence on the Message-Passing Interface (MPI) standard in the mid-1990s, application developers enjoyed a seemingly static view of the underlying machine — that of a distributed collection of homogeneous nodes executing in collaboration. However, after almost two decades of dominance, the sole use of MPI to derive parallelism acted as a limiter to improved future performance. While MPI is widely expected to continue to function as the basic mechanism for communication between compute nodes for the immediate future, additional parallelism is required on the computing node itself if high performance and efficiency goals are to be realized. When reviewing the architectures of the top HPC systems today, the change in paradigm is clear: the compute nodes of the leading machines in the world are either powered by many-core chips with a few dozen cores each, or use heterogeneous designs, where traditional CPUs marshal work to massively parallel compute accelerators which has as many as 200,000 processing threads in flight simultaneously. Complicating matters further for application developers, each processor vendor has its own preferred way of writing code for their architecture.The Kokkos EcoSystem was released by Sandia in 2017 to address this new era in HPC system design by providing a vendor independent performance portable programming system for scientific, engineering, and mathematical software applications written in the C++ programming language. Using Kokkos, application developers can be more productive because they will not have to create and maintain separate versions of their software for each architecture, nor will they have to be experts in each architecture's peculiar requirements. Instead, they will have a single method of programming for the diverse set of modern HPC architectures. While Kokkos started in 2011 as a programming model only, it soon became clear that complex applications needed more. It is also critical to have a portable mathematical functions and developers need tools to debug their applications, gain insight into the performance characteristics of their codes and tune algorithm performance parameters through automated processes. The Kokkos EcoSystem addresses those needs through its three main components: the Kokkos Core programming model, the Kokkos Kernels math library, and the Kokkos Tools project.

97 MATHEMATICS AND COMPUTING↗

Theory Manual for the Fuel Cycle Analysis Code REBUS

REBUS is a system of programs designed for the fuel cycle analysis of fast reactors and accelerator-driven systems. The first version of REBUS was developed in 1970 for calculating the equilibrium operating conditions of liquid metal fast breeder reactors. During the past five decades, various extensions and refinements have been made in the simulation of material motions in fuel cycle facilities and the solution of the neutronics and isotopic transmutation equations that govern the reactor behavior. The latest version complies with the standard code practices and interface dataset specifications of the committee on computer code coordination (CCCC). This report provides a detailed description of the physical processes and their mathematical models and solution methods of the current production version of REBUS. The models of the facilities and physical processes involved in fast reactor fuel cycle are first discussed. Then the mathematical formulation of these physical models is presented, followed by detailed discussions of solution methods of the resulting set of equations. Finally the output edit quantities are discussed along with their definitions.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Bound Constrained Partial DifferentialEquation Inverse Problem Solution by theSemi-Smooth Newton Method

We present the mathematical derivation, software implementation details, and computational results for a semi-smooth Newton method applied to two inverse problems governed by partial differential equations with bound constraints. The two problems share mathematical structural similarities to density-based topology optimization problems. The semi-smooth Newton method provides a mesh independent solution computation for the two test problems. A key step is that the complementarity part of the necessary optimality conditions are reformulated with the use of a complementarity functionφsuch that the complementarity conditions are satisfied if and only if a zero of a nonsmooth function has been obtained. The modular finite element package MFEM is utilized for the software implementation. In addition we constructed a matrix-free Operator to enable the use of efficient Krylov subspace IterativeSolver of MFEM for the solution of our two target problems.

97 MATHEMATICS AND COMPUTING↗