Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 919 records · Page 51

Demonstrating Computational Equivalence Between Continuous and Discrete Adjoint Methods by Calculating Time-Dependent Adjoint Solutions with Neutron Diffusion Models

The continuous adjoint method and the discrete adjoint method are two alternative approaches used to calculate adjoint solutions for adjoint systems. The continuous adjoint method derives adjoint equations analytically from continuous forward equations and then solves the adjoint equations either analytically or numerically in a discretized form whereas the discrete adjoint method calculates the adjoint solutions directly from the discretized forward equations. With regard to the methodology development and calculation procedure, distinct differences are well recognized between the two methods. For certain reasons, both methods are exclusively preferred and commonly used by different computational communities, but limited studies clarify the connections between the two adjoint methods from either of the communities. Herein, this paper demonstrates the computational equivalence between the continuous and discrete adjoint methods by investigating time-dependent adjoint solutions to the two-group neutron diffusion model in nuclear reactor analysis problems using both methods. Adjoint solutions can be used to estimate system parameters for reactor safety analysis. Appropriate final state conditions for the adjoint systems are specified in both of the methods, and the conditions are clarified with proper physical explanations. With the help of an event-based case study on neutron diffusion models, the accuracy of the time-dependent adjoint fluxes obtained from both methods is verified, and the pros and cons of both adjoint methods are examined. More importantly, the computational equivalence of both methods is demonstrated when they are applied to multigroup neutron diffusion systems. The advantage of calculating time-dependent adjoint fluxes by directly solving time-dependent adjoint systems rather than taking steady-state approximations as in common practice is also demonstrated.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

LANL Institutional Computing Close-out Report for Project t22_ocean_time_step

This year, my team made a very productive use of LANL IC time. Four papers were published that used IC resources, and two more are under review. These publications fall into three categories: 1.) Improving tide modeling in the global ocean by adding self attraction and loading (Barton et. al. 2022), ice shelf cavities (Pal et al. 2023), and local time stepping (Lilly et al. 2023). 2.) A new sea ice numerical formulation (Capodaglio 2023). 3.) Performance comparisons, methods, and test cases for ocean model development, This includes a verification suite for ocean models (Bishnu, submitted) and a comparison between Julia and Fortran (Strauss, submitted). A new time-stepping method was introduced in Calandrini et al. (2022). These publications, and the use of LANL IC resources, go hand-in-hand with our mentoring efforts to train young scientists. Two of the lead authors are graduate students who are conducting their PhD research: Kristin Barton at the University of Michigan and Jeremy Lilly at Oregon State. These are both their first publications, and they both have DOE funding and DOE mentors. In addition, Bishnu is a post-doctoral researcher at LANL; Strauss conducted his research as a senior in high school; and Capodaglio, Calandrini and Pal are all early-career scientists who were converted to staff in 2021 or 2022. Here we highlight two publications on improvements in tidal modeling: Barton et al. 2022 and Lilly et al. 2023.

58 GEOSCIENCES↗

Enhanced Cross-Correlation Inter-Detector Timing

Inter-detector timing is one of the key steps for compositing signals obtained by multiple detectors. Conventionally this is done via inversing time gamma functions of individual detectors and then matching their times at the same gamma level. The applicability of the gamma inverse approach is often restricted to the monotonic gamma functions. This presentation presents a novel approach for inter-detector timing. This new approach introduced an enhanced cross-correlation of gamma values between two time intervals of two detectors. If this enhanced cross-correlation is close to 1, then both intervals should cover the same gamma segment of the signal. Consequently the time shift between the two detector can be derived from the time shift of the these two time intervals. This work will be presented at the 4th Annual Reaction History Analysis Workshop in North Las Vegas.

97 MATHEMATICS AND COMPUTING↗

Advances in Machine and Deep Learning for Modeling and Real-time Detection of Multi-Messenger Sources

We live in momentous times. The science community is empowered with an arsenal of cosmic messengers to study the universe in unprecedented detail. Gravitational waves, electromagnetic waves, neutrinos, and cosmic rays cover a wide range of wavelengths and timescales. Combining and processing these datasets that vary in volume, speed, and dimensionality requires new modes of instrument coordination, funding, and international collaboration with a specialized human and technological infrastructure. In tandem with the advent of large-scale scientific facilities, the last decade has experienced an unprecedented transformation in computing and signal-processing algorithms. The combination of graphics processing units, deep learning, and the availability of open source, high-quality datasets has powered the rise of artificial intelligence. This digital revolution now powers a multibillion dollar industry, with far-reaching implications in technology and society. In this chapter, we describe pioneering efforts to adapt artificial intelligence algorithms to address computational grand challenges in multi-messenger astrophysics. We review the rapid evolution of these disruptive algorithms, from the first class of algorithms introduced in early 2017 to the sophisticated algorithms that now incorporate domain expertise in their architectural design and optimization schemes. We discuss the importance of scientific visualization and extreme-scale computing in reducing time-to-insight and obtaining new knowledge from the interplay between models and data.

Artificial Intelligence↗

Model-based, in-situ, non-destructive qualification and certification of parts made by autonomous additive manufacturing

To address the significant productivity challenges associated with the qualification and certification (Q&C) tasks of additively manufactured (AM) parts, which have traditionally relied on rigorous post‐build inspection and testing, we propose an integrated framework that combines model‐based qualification and certification (MBQ&C) with autonomous additive manufacturing (AAM). MBQ&C employs high‐fidelity predictive models, developed within the Integrated Computational Materials Engineering (ICME) paradigm, to simulate process–structure–property–performance relationships for assessing a part’s fitness for use. Since predictive models are commonly machine learning (ML)-based or reduced-order surrogates of validated physics models, they run efficiently, enabling timely inference. In parallel, the self-driving AAM utilises ML-based adaptive, closed‐loop control strategies to avoid, mitigate, or repair defects and anomalies during fabrication, thereby increasing the likelihood of producing acceptable parts. A key feature of the combined AAM-MBQ&C framework is that predictive models explicitly incorporate defects or anomalies that persist after the build, using instance-specific data captured via in-situ sensing. This customisation enables a build‐specific assessment of fitness for use, rather than relying on nominal or generic parameters. Such individualised evaluation provides a robust basis for Q&C-related acceptance decisions relating to each build. Additionally, the rapid solution capabilities of ML or reduced-order models enable the determination of a part’s suitability for service shortly after build completion. As the framework matures, it has the potential to substantially reduce reliance on conventional point‐design approaches—such as time‐consuming post‐build computed tomography scanning and costly destructive testing. Thus, the AAM-MBQ&C framework represents a transformative, scalable strategy for quality assurance of AM components, as parts produced within a stable, validated, and certified envelope can be certified with reduced testing. Key benefits include: (1) significant gains in Q&C productivity through efficient, model-centric assessment; (2) performance-based classification of defects into critical and non-critical categories; (3) the ability to predict potential deviations in the performance of parts affected by real-time, adaptive process control interventions relative to those produced under a certified process, and (4) the enabling of virtual Q&C for service environments that are difficult, hazardous, or impractical to access or reproduce experimentally. Collectively, these capabilities strengthen the business case for AM, particularly for high‐consequence and mission‐critical applications. Finally, although this work focuses on powder-based AM, the proposed techniques could be extended to AM processes employing alternative feedstock forms.

Gunasegaram, Dayalan↗

Chaos and complementarity in de Sitter space

We consider small perturbations to a static three-dimensional de Sitter geometry. For early enough perturbations that satisfy the null energy condition, the result is a shockwave geometry that leads to a time advance in the trajectory of geodesics crossing it. This brings the opposite poles of de Sitter space into causal contact with each other, much like a traversable wormhole in Anti-de Sitter space. In this background, we compute out-of-time-order correlators (OTOCs) to asses the chaotic nature of the de Sitter horizon and find that it is maximally chaotic: one of the OTOCs we study decays exponentially with a Lyapunov exponent that saturates the chaos bound. We discuss the consequences of our results for de Sitter complementarity and inflation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Relativistic spin hydrodynamics with torsion and linear response theory for spin relaxation

Using the second law of local thermodynamics and the first-order Palatini formalism, we formulate relativistic spin hydrodynamics for quantum field theories with Dirac fermions, such as QED and QCD, in a torsionful curved background. We work in a regime where spin density, which is assumed to relax much slower than other non-hydrodynamic modes, is treated as an independent degree of freedom in an extended hydrodynamic description. Spin hydrodynamics in our approach contains only three non-hydrodynamic modes corresponding to a spin vector, whose relaxation time is controlled by a new transport coefficient: the rotational viscosity. We study linear response theory and observe an interesting mode mixing phenomenon between the transverse shear and the spin density modes. We propose several field-theoretical ways to compute the spin relaxation time and the rotational viscosity, via the Green-Kubo formula based on retarded correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Creation of an Fe 3 P Schreibersite Density Functional Tight Binding Model for Astrobiological Simulations

The mineral schreibersite, e.g., Fe 3 P, is commonly found in iron-rich meteorites and could have served as an abiotic phosphorus source for prebiotic chemistry. However, atomistic calculations of its degradation chemistry generally require quantum simulation approaches, which can be too computationally cumbersome to study sufficient time and length scales for this process. In this regard, we have created a computationally efficient semiempirical quantum density functional tight binding (DFTB) model for iron and phosphorus-containing materials by adopting an existing semiautomated workflow that represents many-body interactions by linear combinations of Chebyshev polynomials. Here, we have utilized a relatively small training set to optimize a DFTB model that is accurate for schreibersite physical and chemical properties, including its bulk properties, surface energies, and water absorption. We then show that our model shows strong transferability to several iron phosphide solids as well as multiple allotropes of iron metal. Our resulting DFTB parametrization will allow us to interrogate schreibersite aqueous decomposition at longer time and length scales than standard quantum approaches, providing for more detailed investigations of its role in prebiotic chemistry on early Earth.

36 MATERIALS SCIENCE↗

Hindsight logging for model training

In modern Machine Learning, model training is an iterative, experimental process that can consume enormous computation resources and developer time. To aid in that process, experienced model developers log and visualize program variables during training runs. Exhaustive logging of all variables is infeasible, so developers are left to choose between slowing down training via extensive conservative logging, or letting training run fast via minimalist optimistic logging that may omit key information. As a compromise, optimistic logging can be accompanied by program checkpoints; this allows developers to add log statements post-hoc, and "replay" desired log statements from checkpoint---a process we refer to as hindsight logging. Unfortunately, hindsight logging raises tricky problems in data management and software engineering. Done poorly, hindsight logging can waste resources and generate technical debt embodied in multiple variants of training code. In this paper, we present methodologies for efficient and effective logging practices for model training, with a focus on techniques for hindsight logging. Our goal is for experienced model developers to learn and adopt these practices. To make this easier, we provide an open-source suite of tools for Fast Low-Overhead Recovery (flor) that embodies our design across three tasks: (i) efficient background logging in Python, (ii) adaptive periodic checkpointing, and (iii) an instrumentation library that codifies hindsight logging for efficient and automatic record-replay of model-training. Model developers can use each flor tool separately as they see fit, or they can use flor in hands-free mode, entrusting it to instrument their code end-to-end for efficient record-replay. Our solutions leverage techniques from physiological transaction logs and recovery in database systems. Evaluations on modern ML benchmarks demonstrate that flor can produce fast checkpointing with small user-specifiable overheads (e.g. 7%), and still provide hindsight log replay times orders of magnitude faster than restarting training from scratch.

Computer Science↗

Development of a Time-Height Profile Assimilation Technique for Large-Eddy Simulation

Mesoscale-to-microscale coupling (MMC) aims to address the limited scope of traditional large-eddy simulations by driving the microscale flow with information concerning large-scale weather patterns provided by mesoscale models. We present a new offline MMC technique for horizontally homogeneous microscale flow conditions, in which internal forcing terms are computed based on mesoscale time–height profiles of mean-flow quantities. The advantage of such an approach is that it can be used to drive a microscale simulation with either mesoscale or observational data, and that it does not rely on specific terms in the mesoscale budget equations, which are typically not part of the default output of a mesoscale solver. The performance of the proposed profile assimilation technique is assessed based on the simulation of a typical diurnal cycle over the Scaled Wind Farm Technology site in west Texas. Results indicate that simple data assimilation techniques lead to unphysically high levels of shear and turbulence caused by the algorithm’s inability to cope with inaccuracies in the mesoscale time–height profiles. Modifying the algorithm to account for vertical coherence in the mesoscale source terms gives the microscale solver a greater ability to correct the provided mesoscale time–height profiles, leading to improved predictions of shear and turbulence statistics. The resulting turbulence statistics are in good agreement with meteorological tower observations and simulation results obtained with state-of-the-art coupling techniques using mesoscale budget components.

data assimilation↗

Linear and Nonlinear Solvers for Simulating Multiphase Flow within Large-Scale Engineered Subsurface Systems

Simulation of multiphase flow in the subsurface is well-known to be computationally challenging. While there have been many studies that have explored approaches to overcoming these challenges, they often utilize relatively simple case studies. In this paper, we focus on the unique numerical challenges posed by modeling large-scale engineered subsurface systems, characterized by discrete features embedded in a heterogeneous natural subsurface setting. The man-made features such as shafts, tunnels, and barriers often cause multiple challenges in modeling the domain for multiphase porous media flow. This flow scenario can have a wide range of applications such as nuclear waste repositories, enhanced recovery of a petroleum reservoir, geothermal engineering, and carbon sequestration. An example of these severe numerical challenges is the case of performance assessment (PA) for Waste Isolation Pilot Plant (WIPP), the only operating deep geological repository in the US, which simulates extreme material properties of bedded salt rock formation and extreme contrast due to open excavation next to the formation. The models have extremes not only of permeability and porosity but also of the constitutive models needed for multiphase flow; additionally, they have process models like salt creep closure reducing porosity over time, fracturing in clay and anhydrite interbeds of the bedded salt, gas generation from the waste materials, and unintentional human borehole intrusions in some scenarios. Numerical simulations require the solution of coupled systems of nonlinear PDEs; in our work, we use the open-source simulator PFLOTRAN which is based on Finite Volume discretization. The solution of the nonlinear equations requires use of the Newton-Raphson iteration at each time step, which entails the solution of the linearized Jacobian system at each iteration. The effects of all the processes (i.e., large number of unknowns, highly nonlinear constitutive relations, large contrasts in material properties in short distances) lead to an ill-conditioned Jacobian matrix that severely challenges traditional linear solver, i.e., stabilized biconjugate gradient with block Jacobi incomplete LU preconditioner (BCGS-ILU) leading to non-convergence for traditional Newton-Raphson nonlinear solver causing unacceptably long computation time for each model. This paper presents linear solvers such as constrained pressure residual (CPR) two-stage preconditioner with alternate-block-factorization (ABF) and quasi- implicit pressure and explicit saturation (QIMPES) decouplers and flexible generalized residual solver (FGMRES). The new general-purpose nonlinear solver, Newton trust-region dogleg Cauchy (NTRDC), is also introduced to resolve extreme nonlinearities in the models. We demonstrate the effectiveness of each method relative to the default BCGS-Newton solver. The two best cases had nearly 50 times speed-up and achieved completion of a simulation in 14 hours that never completed due to non-convergence with the default solver. We also investigate the strong scalability of each method and discuss some of the deficiencies found for Block Jacobi preconditioner using parallel domain decomposition, and node packing effects of modern processor architecture.

Preconditioner, Nonlinear, Porous media, Multiphas↗

Boundary correlators and the Schwarzian mode

The effective low temperature dynamics of near-extremal black holes is governed by the quantum fluctuations of the Schwarzian mode of JT gravity. Utilizing as a proxy a planar charged black hole in asymptotically Anti-de-Sitter spacetime, we investigate the effects of these fluctuations on a probe scalar field. The corresponding holographic real-time boundary correlators are computed following a holographic renormalization procedure, using the dubbed gravitational Schwinger-Keldysh geometry (grSK) and known exact results of boundary correlators from the near-horizon region. This analysis gives rise to a retarded Green’s function that decays as a power law for late Lorentzian times. Its analytic structure indicates the presence of a branch cut in the complex frequency domain at finite temperature. These features are a non-perturbative hallmark that prevails as long as the planar transverse space is kept compact.

2D Gravity↗

Atomic Diffusion, Segregation, and Grain Boundary Migration in Nickel-Based Alloys from Molecular Dynamics Simulations

Grain boundary diffusion and metal mobility in alloys control material performance in many applications and yet remain poorly understood at a mechanistic level. With advances in accessible time and length scales for computational molecular simulations, and recent force field developments, we now possess tools to help unravel those mechanisms. Using large-scale molecular dynamics simulations, here we examined vacancy-mediated diffusion processes in Ni-5Cr alloy with low and high-energy grain boundaries. We show that atomic diffusion inside the grain boundary plane is about four times higher than bulk diffusion, at any temperature, and exhibits a typical Arrhenius behavior with a very small energy barrier (0~.8 eV for Cr and 0.7 eV for Ni within 1300-1600 K). Additionally, the fastest diffusing species inverts; Cr diffusion was faster than Ni in the bulk but slower in the grain boundaries. This is attributed to the creation of high cohesive energy clusters of Cr at the grain boundary. Grain boundary migration was also observed to be temperature dependent and appears to be two times higher in the 5% Cr alloy than in pure Ni, highlighting the important role of the alloying element on grain boundary motion.

Simonnin, Pauline GN↗

Modeling Flow and Particle Deposition in a Spent Nuclear Fuel Assembly

CFD (Computational Fluid Dynamic) simulation of aerosol-laden natural convective flow and particle deposition in a spent fuel storage canister with 37 assemblies is currently computationally prohibitive. PWR (Pressurized Water Reactor) assemblies have up to 289 pins or tubes with several spacer grids to align the pins. Spacer grids with mixing vanes induce swirling during operation to increase heat transfer. Each spacer grid contains hundreds of small structures such as retaining clips, channel walls, and openings. The largest canisters store 37 PWR assemblies thus, there are numerous pins, tubes, and spacer grids for which the flow region between and around these structures needs to be determined along with the movement and deposition of aerosol particles. Because of the complicated geometry, modeling the intricate flow even for just one assembly is currently impractical. Nonetheless, we are developing techniques for a practical model to assess the natural aerosol particle deposition process in a canister in the event that a release occurs from one or more fuel pins. In the previous work it was demonstrated that CFD can model the flow through a PWR spacer grid with mixing vanes, including particle deposition, in a reasonable amount of time on a personal computer. In this work, the analysis is extended to include the bypass region between an assembly and the canister basket walls. It is shown that the flow velocity in the bypass region is about three times that of the interstitial region between the pins. The lengths before and after the spacer grid are also extended to determine when the flow becomes fully developed. In addition, the approach of computationally “stitching together” segments of an assembly is demonstrated with the plan to ultimately model a full assembly. The fraction of particles that are deposited in a segment with a spacer grid is determined as a function of particle size and flow velocity.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Dynamics of superconducting qubit relaxation times

Superconducting qubits are a leading candidate for quantum computing but display temporal fluctuations in their energy relaxation times T 1 . This introduces instabilities in multi-qubit device performance. Furthermore, autocorrelation in these time fluctuations introduces challenges for obtaining representative measures of T 1 for process optimization and device screening. These T 1 fluctuations are often attributed to time varying coupling of the qubit to defects, putative two level systems (TLSs). In this work, we develop a technique to probe the spectral and temporal dynamics of T 1 in single junction transmons by repeated T 1 measurements in the frequency vicinity of the bare qubit transition, via the AC-Stark effect. Across 10 qubits, we observe strong correlations between the mean T 1 averaged over approximately nine months and a snapshot of an equally weighted T 1 average over the Stark shifted frequency range. These observations are suggestive of an ergodic-like spectral diffusion of TLSs dominating T 1 , and offer a promising path to more rapid T 1 characterization for device screening and process optimization.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An assessment of the utility of multirate time integration for the modeling of laser powder bed fusion

Finite element simulation of the laser powder bed fusion process is made challenging by the inherently multiscale nature of the process. When using the typical global time stepping techniques, slowly-evolving regions of the domain receive the same numerical treatment as the regions with the highest temperature rates. The current work details the implementation and evaluation of an implicit multirate method which is able to advance different regions of the domain with distinct time steps, depending on their current solution rate. Previous work indicates that this representation of the temporal scales of the problem can lead to significant reductions in wall clock run time, and it is shown herein that multirate time integration, when used with a uniform process-scale mesh, can result in speedups of approximately 19, 42, and 87 times, for domains with edge lengths of approximately 1 mm, 2 mm, and 5 mm, respectively. When used in conjunction with $\ h$-refinement (limited to two levels of refinement), the resulting speedups (taken relative to the uniform mesh) are around 28, 85, and 665 times. The method is demonstrated to converge as indicated by the literature, and its use with an AM-Bench domain is demonstrated.

42 ENGINEERING↗

Optimizing High-Throughput Inference on Graph Neural Networks at Shared Computing Facilities with the NVIDIA Triton Inference Server

Abstract With machine learning applications now spanning a variety of computational tasks, multi-user shared computing facilities are devoting a rapidly increasing proportion of their resources to such algorithms. Graph neural networks (GNNs), for example, have provided astounding improvements in extracting complex signatures from data and are now widely used in a variety of applications, such as particle jet classification in high energy physics (HEP). However, GNNs also come with an enormous computational penalty that requires the use of GPUs to maintain reasonable throughput. At shared computing facilities, such as those used by physicists at Fermi National Accelerator Laboratory (Fermilab), methodical resource allocation and high throughput at the many-user scale are key to ensuring that resources are being used as efficiently as possible. These facilities, however, primarily provide CPU-only nodes, which proves detrimental to time-to-insight and computational throughput for workflows that include machine learning inference. In this work, we describe how a shared computing facility can use the NVIDIA Triton Inference Server to optimize its resource allocation and computing structure, recovering high throughput while scaling out to multiple users by massively parallelizing their machine learning inference. To demonstrate the effectiveness of this system in a realistic multi-user environment, we use the Fermilab Elastic Analysis Facility augmented with the Triton Inference Server to provide scalable and high-throughput access to a HEP-specific GNN and report on the outcome.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗