Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics computing”

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 649 records · Page 36

An unsupervised machine-learning checkpoint-restart algorithm using Gaussian mixtures for particle-in-cell simulations

We propose an unsupervised machine-learning checkpoint-restart (CR) algorithm for particle-in-cell (PIC) algorithms using Gaussian mixtures (GM). The algorithm compresses the particle population per spatial cell by constructing a velocity distribution function using GM. Particles are reconstructed at restart time by local resampling of the Gaussians. To guarantee fidelity of the CR process, we ensure the exact preservation of invariants such as charge, momentum, and energy for both compression and reconstruction stages, everywhere on the mesh. We also ensure the preservation of Gauss' law after particle reconstruction by exactly matching the density profile at restart time. As a result, the GM CR algorithm is shown to provide a clean, conservative restart capability while potentially affording orders of magnitude savings in input/output requirements. Here, we demonstrate the algorithm using a recently developed exactly energy- and charge-conserving PIC algorithm using both electrostatic and electromagnetic tests. The tests demonstrate not only a high-fidelity CR capability, but also its potential for enhancing the fidelity of the PIC solution for a given particle resolution.

97 MATHEMATICS AND COMPUTING↗

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Community-Driven Methods for Open and Reproducible Software Tools for Analyzing Datasets from Atom Probe Microscopy

Atom probe tomography, and related methods, probe the three-dimensional architecture of a material. The software tools that microscopists use, and how these tools are connected into workflows, makes a substantial contribution to the accuracy and precision of such a material characterization experiment. Typically, we adapt methods from other communities like mathematics, data science, computational geometry, artificial intelligence, or scientific computing. We also realize that improving on research data management is a challenge when it comes to align with the FAIR data stewardship principles. Faced with this global challenge, we are convinced that collaborating is useful. Here, we report the results and challenges with an inter-laboratory call for developing test cases for several types of atom probe software tools. The results support why defining detailed recipes of software workflows and sharing these recipes is necessary and rewarding: Open source tools and (meta)data exchange can help to make our day-to-day data processing tasks become more efficient, the training of new users and knowledge transfer become easier, and assist us with automated quantification of uncertainties to gain access to substantiated results.

36 MATERIALS SCIENCE↗

Evaluating the Importance of Conformers for Understanding the Vacuum-Ultraviolet Spectra of Oxiranes: Experiment and Theory

Vacuum-ultraviolet (VUV) absorption spectroscopy enables electronic transitions that offer the unambiguous identification of molecules. As target molecules become more complex, multifunctional species present a great challenge to both experimental and computational spectroscopy. This research reports both experimental and theoretical studies of oxiranes. Computationally, the nuclear ensemble approach has been used to accurately predict experimental spectra for a variety of molecules. However, this approach incurs great computational cost, as ensembles generally consist of thousands of geometries. The present study aims to drastically reduce the ensemble by evaluating the significance of the conformers to the predicted spectra. This approach was applied to 11 substituted oxiranes using the Conformer Rotamer Ensemble Sampling Tool (CREST) of Grimme to generate an ensemble of unique conformers determined by their Boltzmann populations. Five TD-DFT functionals (BMK, CAM-B3LYP, M06-2X, MN15, ωB97X-D) and EOM-CCSD were used to simulate the spectrum of each substituted oxirane ensemble. Computed spectra were then compared to the experiment using both qualitative and quantitative metrics. Based on these metrics, it was observed that certain conformers may not be necessary to characterize this set of oxiranes despite the temperature (323 K) of the experiment. A single conformer can then be used with TD-DFT and EOM-CCSD to replicate the experimental spectra of these medium-sized combustion species.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Alkali-Metal Interlocking of 2D V 4 O 10 Sheets Defines Discretized Interlayer Shear Relationships

Low-dimensional materials manifest structural anisotropy, quantum confinement, and tightly bound excitonic states, which make them attractive building blocks that can be assembled within three-dimensional laterally stitched heterostructures, stacked van der Waals solids, and complex moiré superlattices. Ion intercalation in the galleries between layered materials provides a means of modifying interlayer separation and coupling, but it is also known to drive the shearing of the layers. In this article, we explore the distinct ligand coordination environments afforded by vanadyl oxygens of singular [V 4 O 10 ] sheets and examine how the size, polarizability, and stoichiometry of Group I cations sandwiched between such layers determine the interlocking of the sheets in stacked structures. Based on the topochemical insertion of alkali-metal ions into the layered λ-V 2 O 5 , we identify seven types of guest ion coordination sites discretized into four distinct regimes of interlayer shear in units of half octahedral widths. The coordination preferences of intercalated cations govern how they interlock 2D [V 4 O 10 ] sheets and engender specific shear conformations. We present evidence that static and dynamic disorder in guest ion arrangement modulate the magnetic structure of the intercalated compounds based on electrostatic polarization, localization of charge and spin density, and lattice distortion. The results illustrate the use of topochemical ion insertion to modulate stacking relationships and magnetic transition characteristics.

36 MATERIALS SCIENCE↗

Learning physics-based reduced-order models from data using nonlinear manifolds

Here we present a novel method for learning reduced-order models of dynamical systems using nonlinear manifolds. First, we learn the manifold by identifying nonlinear structure in the data through a general representation learning problem. The proposed approach is driven by embeddings of low-order polynomial form. A projection onto the nonlinear manifold reveals the algebraic structure of the reduced-space system that governs the problem of interest. The matrix operators of the reduced-order model are then inferred from the data using operator inference. Numerical experiments on a number of nonlinear problems demonstrate the generalizability of the methodology and the increase in accuracy that can be obtained over reduced-order modeling methods that employ a linear subspace approximation.

97 MATHEMATICS AND COMPUTING↗

Neutronics Calculation Advances at Los Alamos: Manhattan Project to Monte Carlo

The history and advances of neutronics calculations at Los Alamos during the Manhattan Project through the present are reviewed. Substantial improvements to neutron diffusion methods and the invention of both the Monte Carlo neutron transport methods in 1947 and deterministic discrete ordinates Sn in 1953 were all made at Los Alamos just after the Manhattan Project. We briefly summarize early simpler and more approximate neutronics methods and then describe the need to better predict neutronics behavior through consideration of theoretical equations, models and algorithms, experimental measurements, and available computing capabilities and their limitations. This paper briefly covers key advances in deterministic methods during the Manhattan Project. These capabilities, coupled with increasing postwar defense needs and the invention of electronic computing with the Electronic Numeric Integrator and Computer, known as ENIAC, and the Mathematical Analyzer Numerical Integrator and Automatic Computer Model, known as MANIAC, led to the creation of Monte Carlo and deterministic discrete ordinates neutronics transport methods. We note the important role that the scientific comradery between the Los Alamos scientists played in the process. This paper briefly covers the early methods, algorithms, computers, and electronic and women pioneers that enabled Monte Carlo to spread to all areas of science. We focus heavily on these early developments and the subsequent creation of the MCNP® code, advances in its associated nuclear data, and its applications to problems of national defense at Los Alamos.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hydrodynamic Interactions in Topologically Linked Ring Polymers.

Despite decades of interdisciplinary research on topologically linked ring polymers, their dynamics remain largely unstudied. These systems represent a major scientific challenge as they are often subject to both topological and hydrodynamic interactions (HI), which render dynamical solutions either mathematically intractable or computationally prohibitive. Here we circumvent these limitations by preaveraging the HI of linked rings. We show that the symmetry of ring polymers leads to a hydrodynamic decoupling of ring dynamics. This decoupling is valid even for nonideal polymers and nonequilibrium conditions. Physically, our findings suggest that the effects of topology and HI are nearly independent and do not act cooperatively to influence polymer dynamics. We use this result to develop highly efficient Brownian dynamics algorithms that offer enormous performance improvements over conventional methods and apply these algorithms to simulate catenated ring polymers at equilibrium, confirming the independence of topological effects and HI. The methods developed here can be used to study and simulate large systems of linked rings with HI, including kinetoplast DNA, Olympic gels, and poly[n]catenanes.

Rauscher, Phillip M.↗

Active matter shepherding and clustering in inhomogeneous environments

Here, we consider a mixture of active and passive run-and-tumble disks in an inhomogeneous environment where only half of the sample contains quenched disorder or pinning. The disks are initialized in a fully mixed state of uniform density. We identify several distinct dynamical phases as a function of motor force and pinning density. At high pinning densities and high motor forces, there is a two-step process initiated by a rapid accumulation of both active and passive disks in the pinned region, which produces a large density gradient in the system. This is followed by a slower species phase separation process where the inactive disks are shepherded by the active disks into the pin-free region, forming a nonclustered fluid and producing a more uniform density with species phase separation. For higher pinning densities and low motor forces, the dynamics becomes very slow and the system maintains a strong density gradient. For weaker pinning and large motor forces, a floating clustered state appears, and the time-averaged density of the system is uniform. We illustrate the appearance of these phases in a dynamic phase diagram.

97 MATHEMATICS AND COMPUTING↗

Feature Engineering and Ensemble Methods for Imbalanced ICS Intrusion Detection: Pipeline Audit and Constrained Evaluation

Industries are becoming increasingly connected and are more vulnerable to cyberattacks due to the widened attack surface. Industrial Control Systems (ICS) are among the most critical sectors that malicious actors can target, as such attacks can cause significant operational disruption and physical damage. It is imperative to detect such attacks as early as possible. This paper evaluates constraint-conditioned optimistic performance estimates for traditional ML models in ICS intrusion detection (i.e., estimates obtained under contiguous, non-shuffled temporal evaluation without test-set alteration, but with pre-split feature engineering that may introduce temporal leakage, due to dataset constraints). Our findings are threefold. First, we quantify how iterative feature engineering affects tree-based ensemble performance and examine how pipeline decisions (split strategy, sampling scope, and cleaning policy) can inflate or reduce reported IDS results under constraint-bound evaluation. Second, we compare intrinsic class-imbalance handling across ensemble models. Third, under our current pipeline constraints (including pre-split feature engineering), CatBoost achieves the best performance on Water Storage Tank (accuracy: 0.9831, class-1 F1: 0.9682), while Light- GBM achieves the best performance on Gas Pipeline (accuracy: 0.9618, class-1 F1: 0.9086).

97 MATHEMATICS AND COMPUTING↗

The Impact of Time-Aware Design Choices in ICS Anomaly Detection

Industrial control systems (ICS) remain vulnerable to increasingly sophisticated cyberattacks, yet evaluating anomaly detection models in these environments is challenging due to temporal dependencies, missing-not-at-random patterns, and extremely imbalanced datasets. These factors make common practices—especially random data splits and na¨ıve imputation— prone to severe temporal leakage, which can inflate reported performance and obscure real-world limitations. In this work, we systematically examine classical machine learning models, temporal deep learning architecture, and tensordecomposition– based methods on a gas-pipeline dataset using a fully temporally separated evaluation pipeline designed to mimic realistic deployment conditions. Our findings show that proper temporal handling and MNAR-aware preprocessing significantly alter the relative performance of popular anomaly-detection methods, providing practical guidance for designing reliable, leakage-resistant ICS intrusion-detection systems.

97 MATHEMATICS AND COMPUTING↗

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

Additive Polynomial Time Integrators, Part I: Framework and Fully Implicit-Explicit Collocation Methods

In this paper we generalize the polynomial time integration framework to additively partitioned initial value problems. The framework we present is general and enables the construction of many new families of additive integrators with arbitrary order-of-accuracy and varying degree of implicitness. In this first work, we focus on a new class of implicit-explicit polynomial block methods that are based on fully implicit Runge–Kutta methods with Radau nodes and that possess high stage order. Here, we show that the new fully implicit-explicit (FIMEX) integrators have improved stability compared to existing IMEX Runge–Kutta methods, while also being more computationally efficient due to recent developments in preconditioning techniques for solving the associated systems of nonlinear equations. For PDEs on periodic domains where the implicit component is trivial to invert, we will show how parallelization of the right-hand side evaluations can be exploited to obtain significant speedup compared to existing serial IMEX Runge–Kutta methods. For parallel (in space) finite element discretizations, the new methods can achieve orders of magnitude better accuracy than existing IMEX Runge–Kutta methods and/or achieve a given accuracy several times times faster in terms of computational runtime.

97 MATHEMATICS AND COMPUTING↗

Beyond PCA: Additional Dimension Reduction Techniques to Consider in the Development of Climate Fingerprints

Abstract Dimension reduction techniques are an essential part of the climate analyst’s toolkit. Due to the enormous scale of climate data, dimension reduction methods are used to identify major patterns of variability within climate dynamics, to create compelling and informative visualizations, and to quantify major named modes such as El Niño–Southern Oscillation. Principal components analysis (PCA), also known as the method of empirical orthogonal functions (EOFs), is the most commonly used form of dimension reduction, characterized by a remarkable confluence of attractive mathematical, statistical, and computational properties. Despite its ubiquity, PCA suffers from several difficulties relevant to climate science: high computational burden with large datasets, decreased statistical accuracy in high dimensions, and difficulties comparing across multiple datasets. In this paper, we introduce several variants of PCA that are likely to be of use in climate sciences and address these problems. Specifically, we introduce non-negative , sparse , and tensor PCA and demonstrate how each approach provides superior pattern recognition in climate data. We also discuss approaches to comparing PCA-family results within and across datasets in a domain-relevant manner. We demonstrate these approaches through an analysis of several runs of the E3SM climate model from 1991 to 1995, focusing on the simulated response to the Mt. Pinatubo eruption; our findings are consistent with a recently identified stratospheric warming fingerprint associated with this type of stratospheric aerosol injection.

Weylandt, Michael↗

Current possibilities and future opportunities for erasure coded computations

The key capability established through the research funded by this award are erasure coded computations for linear systems, in serial and in parallel. This capability enables powerful efficient and scalable alternatives to existing linear system solvers in fault-prone computational systems.

97 MATHEMATICS AND COMPUTING↗

Arianna Wright Rosenbluth

Brief article discussing the contributions of Dr. Arianna Wright Rosenbluth to work done at Los Alamos and to computer science in general.

97 MATHEMATICS AND COMPUTING↗

Variable Precision Computing (VPC) (Final Report)

The overall goal of the Variable Precision Computing project is exploring and identifying ways to reduce internodal communication cost in production physics simulation experiments running on a distributed-memory systems by compressing data, either in a lossy or lossless way, thus resulting in a significant computational performance increase. Among the several approaches proposed, the one discussed here has been proposed, designed and implemented by me. It concerns the application of information theory-derived metrics to classical molecular dynamics and computational fluid dynamics simulation experiments.

97 MATHEMATICS AND COMPUTING↗