Search NASA⌕ Search

SEARCH · Search NASA

Results for “computing systems”

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,333 records · Page 74
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

The Schwinger-Keldysh coset construction

The coset construction is a tool for systematically building low energy effective actions for Nambu-Goldstone modes. This technique is typically used to compute time-ordered correlators appropriate for S-matrix computations for systems in their ground state. In this paper, we extend this technique to the Schwinger-Keldysh formalism, which enables one to calculate a wider variety of correlators and applies also to systems in a mixed state. We focus our attention on internal symmetries and demonstrate that, after identifying the appropriate symmetry breaking pattern, Schwinger-Keldysh effective actions for Nambu-Goldstone modes can be constructed using the standard rules of the coset construction. Particular emphasis is placed on the thermal state and ensuring that correlators satisfy the KMS relation. We also discuss explicitly the power counting scheme underlying our effective actions. We comment on the similarities and differences between our approach and others that have previously appeared in the literature. In particular, our prescription does not require the introduction of additional “diffusive” symmetries and retains the full non-linear structure generated by the coset construction. We conclude with a series of explicit examples, including a computation of the finite-temperature two-point functions of conserved spin currents in non-relativistic paramagnets, antiferromagnets, and ferromagnets. Along the way, we also clarify the discrete symmetries that set antiferromagnets apart from ferromagnets, and point out that the dynamical KMS symmetry must be implemented in different ways in these two systems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

A practical discrete-adjoint method for high-fidelity compressible turbulence simulations

Methods and computing hardware advances have enabled accurate predictions of complex compressible turbulence phenomena, such as the generation of jet noise that motivates the present effort. However, limited understanding of underlying physical mechanisms restricts the utility of such predictions since they do not, by themselves, indicate a route to design improvements. Gradient-based optimization using adjoints can circumvent the flow complexity to guide designs, though this is predicated on the availability of a sufficiently accurate solution of the forward and adjoint systems. These are challenging to obtain, since both the chaotic character of the turbulence and the typical use of discretizations near their resolution limits in order to efficiently represent its smaller scales will amplify any approximation errors made in the adjoint formulation. Formulating a practical exact adjoint that avoids such errors is especially challenging if it is to be compatible with state-of-the-art simulation methods used for the turbulent flow itself. Automatic differentiation (AD) can provide code to calculate a nominally exact adjoint, but existing general-purpose AD codes are inefficient to the point of being prohibitive for large-scale turbulence simulations. Here, we analyze the compressible flow equations as discretized using the same high-order workhorse methods used for many high-fidelity compressible turbulence simulations, and formulate a practical space–time discrete-adjoint method without changing the basic discretization. A key step is the definition of a particular discrete analog of the continuous norm that defines our cost functional; our selection leads directly to an efficient Runge–Kutta-like scheme, though it would be just first-order accurate if used outside the adjoint formulation for time integration, with finite-difference spatial operators for the adjoint system. Its computational cost only modestly exceeds that of the flow equations. We confirm that its accuracy is limited by computing precision, and we demonstrate it on the aeroacoustic control of a mixing layer with a challengingly broad range of turbulence scales. For comparison, the error from a corresponding discretization of the continuous-adjoint equations is quantified to potentially explain its limited success in past efforts to control jet noise. The differences are illuminating: the continuous-adjoint is shown to suffer from exponential error growth in (reverse) time even for the best-resolved largest turbulence scales. Implications for jet noise reduction and turbulence control in general are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Generalized Quasi-Static Mooring System Modeling with Analytic Jacobians

This paper presents a generalized and efficient method for quasi-static analysis of mooring systems, including complex scenarios such as when shared mooring lines interconnect multiple floating wind or wave energy devices. While quasi-static mooring models are well established, most published formulations are focused on specific applications, and no publicly available implementations provide efficient handling of large mooring system networks. The present formulation addresses these gaps by: (1) formulating solutions for edge cases not typically supported by quasi-static models; (2) creating a fully generalized model structure such that any combination of mooring lines, point masses, and floating bodies can be assembled; and (3) deriving analytic expressions for the system Jacobians (stiffness matrices) so that systems with many degrees of freedom can be solved efficiently. These techniques form the theory basis of MoorPy, an open-source mooring analysis library. The model is demonstrated on nine scenarios of increasing complexity with features of interest for offshore renewable energy applications. When compared with steady-state results from a lumped-mass dynamic model, the results show that the quasi-static formulation accurately calculates profiles and tensions and that its analytic approach provides more efficient and reliable computation of system stiffness matrices than finite-differencing methods. These results verify the accuracy of the MoorPy model.

16 TIDAL AND WAVE POWER↗
DOE OSTI2017

Computer Security for I and C Systems at Nuclear Facilities - 116

Cyber-attacks on Instrumentation and Control (I and C) systems may jeopardize the safety and security of nuclear facilities by contributing to sabotage or aiding in the unauthorized removal of nuclear material. The effects of cyber-attacks on I and C systems important to safety to safety may result in a wide range of consequences, such as a temporary loss of process control or unacceptable radiological consequences. Public awareness of cyber-attacks that affect I and C systems may also undermine confidence in the safety and security of nuclear facilities. The International Atomic Energy Agency (IAEA) recognizes the need for the guidance on the protection of I and C systems that provide safety, security, or auxiliary functions at nuclear facilities from cyber-attacks. To meet this need, The IAEA has developed a new Nuclear Security Series publication with the provisional title Computer Security of Instrumentation and Control Systems at Nuclear Facilities which builds upon and expands the guidance published in Nuclear Security Series No. 17 Computer Security at Nuclear Facilities (2011) . This publication will be formally released in 2017 as Technical Guidance and will be the second international consensus publication dedicated to Computer Security at Nuclear Facilities. It was developed in parallel with the new IAEA Nuclear Safety publications providing recommendations on I and C systems at research reactors (RR) and nuclear power plants (NPP) . The purpose of this paper is to provide an overview of this publication and its application. The paper will also discuss its relation to other IAEA Nuclear Security Series (NSS) publications on computer security. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

BWR Full Fuel Assembly Testing and Validation

This report describes the Consortium for Advanced Simulation of Light Water Reactors (CASL) work conducted for completion of the Thermal Hydraulics Methods (THM) Level 3 milestone THM.CLS.P15.10: BWR Full Fuel Assembly Testing and Validation. The extension of existing boiling closure designed for Pressurized Water Reactors (PWRs) to the high void fraction condition of Boiling Water Reactors (BWRs) is one of the challenges for Multiphase Computational Fluid Dynamics (M-CFD) applications. In the efforts aimed at developing the advanced boiling closure for BWRs, the baseline closure model, so-called ‘Zero’ closure, has been developed based on the GEN-I closure for PWRs which was used as a starting point. Since this simplest closure model is robust but does not contain any explicit description of the complex high void fraction mechanisms, the applicability of M-CFD needs to be evaluated before developing advanced closures for BWRs. To support this need, the high fidelity M-CFD simulation with Zero closure has been conducted for the BWR full fuel assembly. The capabilities of M-CFD with Zero closure were evaluated against the international OECD/NRC BFBT benchmark data. The scalability of the M-CFD application to the nuclear fuel assembly was demonstrated with the INL High Performance Computing (HPC) system. This report presents the recent view of the best practices on M-CFD for BWRs to provide a useful reference to identify and overcome common challenges in the M-CFD applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2017

Towards New Metrics for High-Performance Computing Resilience

Ensuring the reliability of applications is becoming an increasingly important challenge as high-performance computing (HPC) systems experience an ever-growing number of faults, errors and failures. While the HPC community has made substantial progress in developing various resilience solutions, it continues to rely on platform-based metrics to quantify application resiliency improvements. The resilience of an HPC application is concerned with the reliability of the application outcome as well as the fault handling efficiency. To understand the scope of impact, effective coverage and performance efficiency of existing and emerging resilience solutions, there is a need for new metrics. In this paper, we develop new ways to quantify resilience that consider both the reliability and the performance characteristics of the solutions from the perspective of HPC applications. As HPC systems continue to evolve in terms of scale and complexity, it is expected that applications will experience various types of faults, errors and failures, which will require applications to apply multiple resilience solutions across the system stack. The proposed metrics are intended to be useful for understanding the combined impact of these solutions on an application's ability to produce correct results and to evaluate their overall impact on an application's performance in the presence of various modes of faults.

Fault Tolerance↗
DOE OSTI2015

Computational redesign reveals allosteric mutation hotspots of organophosphate hydrolase that enhance organophosphate hydrolysis

Organophosphates are widely used for peaceful (agriculture) and military purposes (chemical warfare agents). The extraordinary toxicity of organophosphates and the risk of deployment, make it critical to develop means for their rapid and efficient deactivation. Organophosphate hydrolase (OPH) already plays an important role in organophosphate remediation, but is insufficient for therapeutic or prophylactic purposes primarily due to low substrate affinity. Current efforts focus on directly modifying the active site to differentiate substrate specificity and increase catalytic activity. Here, we present a novel strategy for enhancing the general catalytic efficiency of OPH through computational redesign of the residues that are allosterically coupled to the active site and validated our design by mutagenesis. Specifically, we identify five such hot-spot residues for allosteric regulation and assay these mutants for hydrolysis activity against paraoxon, a chemical-weapons simulant. A high percentage of the predicted mutants exhibit enhanced activity over wild-type (k cat =16.63 s -1 ), such as T199I/T54I (899.5 s -1 ) and C227V/T199I/T54I (848 s -1 ), while the Km remains relatively unchanged in our high-throughput cell-free expression system. Further computational studies of protein dynamics reveal four distinct distal regions coupled to the active site that display significant changes in conformation dynamics upon these identified mutations. These results validate a computational design method that is both efficient and easily adapted as a general procedure for enzymatic enhancement.

organophosphate hydrolase↗
DOE OSTI2025

Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes

We introduce a framework for simulating, on an ( n + 1 )-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2 n modes. Specifically, we encode the initial bosonic state’s expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼ 8 × 10 9 modes, illustrating the power of our framework. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Temperature Rise on Liner Surfaces of Fuel Cell Electric Vehicle Tanks during Fueling Process

Herein, the temperature of the inner tank walls, or plastic liners, of composite pressure tanks in fuel cell electric vehicles during fueling using three‐dimensional computational fluid dynamics (CFD) models is evaluated. The liner materials are limited to 85.0 °C to prevent thermal stress causing material failure that would result in a hydrogen leak. Therefore, the temperature of hydrogen gas must be limited to below 85.0 °C during the fueling process as dictated by the current fueling protocol. However, there are limited experimental or simulation data confirming that the temperature changes do not exceed the threshold. Herein, the liner temperatures with CFD tank models for two sizes of type IV tanks representative of the upper and lower system bounds that are close to the SAE J2601 fueling protocol (36.0 and 244.0 L) are evaluated. First, each model's reliability is validated with experimental data and then analyzed, and the data are used to evaluate the maximum hydrogen and liner temperatures under real‐world fueling conditions. The evaluation shows that the maximum liner surface temperature of each tank model is at least 7 °C lower than that of the hydrogen. Additionally, there is at least 12 °C difference found between the upper limit and actual liner temperatures.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2023

Universal and interpretable classification of atomistic structural transitions via unsupervised graph learning

Materials processing often occurs under extreme dynamic conditions leading to a multitude of unique structural environments. These structural environments generally occur at high temperatures and/or high pressures, often under non-equilibrium conditions, which results in drastic changes in the material's structure over time. Computational techniques, such as molecular dynamics simulations, can probe the atomic regime under these extreme conditions. However, characterizing the resulting diverse atomistic structures as a material undergoes extreme changes in its structure has proved challenging due to the inherently non-linear relationship between structures as large-scale changes occur. Here, we introduce SODAS++, a universal graph neural network framework, that can accurately and intuitively quantify the atomistic structural evolution corresponding to the transition between any two arbitrary phases. We showcase SODAS++ for both solid–solid and solid–liquid transitions for systems of increasing geometric and chemical complexity, such as colloidal systems, elemental Al, rutile and amorphous TiO 2 , and the non-stoichiometric ternary alloy Ag 26 Au 5 Cu 19 . Finally, we show that SODAS++ can accurately quantify all transitions in a physically interpretable manner, showcasing the power of unsupervised graph neural network encodings for capturing the complex and non-linear pathway, a material's structure takes as it evolves.

36 MATERIALS SCIENCE↗
DOE OSTI2019

ComDMFT: A massively parallel computer package for the electronic structure of correlated-electron systems

ComDMFT is a massively parallel computational package to study the electronic structure of correlated-electron systems (CES). Our approach is a parameter-free method based on ab initio linearized quasiparticle self-consistent GW (LQSGW) and dynamical mean field theory (DMFT). The non-local part of the electronic self-energy is treated within ab initio LQSGW and the local strong correlation is treated within DMFT. In addition to ab initio LQSGW+DMFT, charge self-consistent LDA+DMFT methodology is also implemented, enabling multiple methods in one open-source platform for the electronic structure of CES. Here, this package can be extended for future developments to implement other methodologies to treat CES.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2014

Production of Fatty Acid-Derived Valuable Chemicals in Synthetic Microbes

Fatty acid derivatives, such as hydroxy fatty acids, fatty alcohols, fatty acid methyl/ethyl esters, and fatty alka(e)nes, have a wide range of industrial applications including plastics, lubricants, and fuels. Currently, these chemicals are obtained mainly through chemical synthesis, which is complex and costly, and their availability from natural biological sources is extremely limited. Metabolic engineering of microorganisms has provided a platform for effective production of these valuable biochemicals. Notably, synthetic biology-based metabolic engineering strategies have been extensively applied to refactor microorganisms for improved biochemical production. Here, we reviewed: (i) the current status of metabolic engineering of microbes that produce fatty acid-derived valuable chemicals, and (ii) the recent progress of synthetic biology approaches that assist metabolic engineering, such as mRNA secondary structure engineering, sensor-regulator system, regulatable expression system, ultrasensitive input/output control system, and computer science-based design of complex gene circuits. Furthermore, key challenges and strategies were discussed. Finally, we concluded that synthetic biology provides useful metabolic engineering strategies for economically viable production of fatty acid-derived valuable chemicals in engineered microbes.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Resilience Design Patterns: A Structured Approach to Resilience at Extreme Scale (V.2.0)

Reliability is a serious concern for future extreme-scale high-performance computing (HPC) systems. Projections based on the current generation of HPC systems and technology roadmaps suggest the prevalence of very high fault rates in future systems. The errors resulting from these faults will propagate and generate various kinds of failures, which may result in outcomes ranging from result corruptions to catastrophic application crashes. Therefore, the resilience challenge for extreme-scale HPC systems requires coordination between various hardware and software technologies that are capable of handling a broad set of fault models at accelerated fault rates. Also, due to practical limits on power consumption in future HPC systems, they are likely to embrace innovative architectures, increasing the levels of hardware and software complexities. Therefore, the techniques that seek to improve resilience must navigate the complex trade-off space between resilience and the overheads to power consumption and performance. While the HPC community has developed various resilience solutions, application-level techniques as well as system-based solutions, the solution space of HPC resilience techniques remains fragmented. There are no formal methods to integrate the various HPC resilience techniques into composite solutions, nor are there methods to holistically evaluate the adequacy and efficacy of such solutions in terms of their protection coverage, and their performance & power efficiency characteristics. Additionally, few implementations of current resilience solutions are portable to newer architectures and software environments that will be deployed on future systems. We developed a new structured approach to the management of HPC resilience using the concept of resilience-based design patterns. In general, a design pattern is a repeatable solution to a commonly occurring problem. We identified the well-known solutions that are commonly used to deal with faults, errors and failures in HPC systems. In the initial design patterns specification (version 1.0), we described the various solutions, which address specific problems in the design of resilient HPC environments, in the form of patterns. Each pattern describes a problem caused by a fault, error or failure event in an HPC environment, and then describes the core of the solution of the problem in such a way that this solution may be adapted to different systems and implemented at different layers of the system stack. The catalog of these resilience design patterns provides designers with a collection of design elements. To construct complete resilience solutions using combinations of various patterns, we defined a framework that enhances HPC designers' understanding of the important constraints and the opportunities for the design patterns to be implemented and deployed at various layers of the system stack. The design framework is also useful for establishing interfaces and mechanisms to coordinate flexible fault management across hardware and software components, as well as to consider the trade-off between performance, resilience, and power consumption when constructing a solution. The resilience design patterns specification version 1.1 included more detailed explanations of the pattern solutions, the context in which the patterns are applicable, and the implications for hardware or software design. It also provided several additional examples and detailed case studies to demonstrate the use of patterns to build realistic solutions. In version 1.2 of the specification document, we have improved the pattern descriptions, including graphical representations of the pattern components. These improvements are largely based on critical comments, feedback and suggestions received from pattern experts and readers of the previous versions of the specification. The pattern classification has been modified to further clarify the relationships between pattern categories. This version of the specification also introduces a pattern language for resilience design patterns. The pattern language presents the patterns in the catalog as a network, revealing the relations among the resilience patterns. The language provides designers with the means to explore alternative techniques for handling a specific fault model that may have different efficiency and complexity characteristics. Using the pattern language also enables the design and implementation of comprehensive resilience solutions as a set of interconnected resilience patterns that can be instantiated across layers of the system stack. The overall goal of this work is to provide hardware and software designers, as well as the users and operators of HPC systems, a systematic methodology for the design and evaluation of resilience technologies in HPC systems that keep scientific applications running to a correct solution in a timely and cost-efficient manner despite frequent faults, errors, and failures of various types. Version 2.0 expands the resilience design pattern classification and catalog to include self-stabilization patterns and reliability, availability and performance models for each structural pattern.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Quality Assessment of GPU Power Profiling Mechanisms

Accurate component-level power measurements are nowadays essential for the design and optimization of high-performance computing (HPC) systems and applications. Particularly, as more and more heterogeneous HPC systems are developed, the characterizations of GPU power profiles have become extremely crucial because, although GPUs provide exceptional performance, they do consume substantial amounts of power. Currently, there are various GPU power profiling mechanisms available; however, there is no standard way to assess the quality of such profiling schemes. To address this issue, in this paper, we develop an assessment methodology to rate the quality and performance of the profiling mechanism itself. Specifically, we present the assessments of four different GPU power profiling techniques: (i) Nvidia's NVML via Allinea MAP, (ii) Nvidia's NVML via direct reads, and (iii) Penguin Computing's PowerInsight (PI) via two vendor-provided drivers, and (iv) PowerInsight via Allinea MAP. In addition, we discuss the effects of moving-average filters to explain the slow variations of some of the measured power profiles. Based on our assessment, the GPU power profiling mechanism using PI device outperforms the other schemes by reliably measuring the ground-truth power profile generated by a GPU stress-test benchmark.

Sen, Satyabrata↗
DOE OSTI2025

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗
DOE OSTI2018

Few-body universality in the deuteron- α system

We treat 6 Li as an effective three-body (n-p-α) system and compute the d-α S-wave scattering length and three-body separation energy of 6 Li for a wide variety of nucleon-nucleon and α-nucleon potentials which have the same (or nearly the same) phase shifts. The Coulomb interaction in the p-α subsystem is omitted. The results of all calculations lie on a one-parameter curve in the plane defined by the d-α S-wave scattering length and the amount by which 6 Li is bound with respect to the n-p-α threshold. We argue that these aspects of the n-p-α system can be understood using few-body universality and that 6 Li can thus usefully be thought of as a two-nucleon halo nucleus.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Rapid Initial-State Preparation for the Quantum Simulation of Strongly Correlated Molecules

Studies on quantum algorithms for ground-state energy estimation often assume perfect ground-state preparation; however, in reality the initial state will have imperfect overlap with the true ground state. Here, we address that problem in two ways: by faster preparation of matrix-product-state (MPS) approximations and by more efficient filtering of the prepared state to find the ground-state energy. We show how to achieve unitary synthesis with a Toffoli complexity about 7 × lower than that in prior work and use that to derive a more efficient MPS-preparation method. For filtering, we present two different approaches: sampling and binary search. For both, we use the theory of window functions to avoid large phase errors and minimize the complexity. We find that the binary-search approach provides better scaling with the overlap at the cost of a larger constant factor, such that it will be preferred for overlaps less than about 0.003 . Finally, we estimate the total resources to perform ground-state energy estimation of Fe - S cluster systems, including the Fe Mo cofactor by estimating the overlap of different MPS initial states with potential ground states of the Fe Mo cofactor using an extrapolation procedure. With a modest MPS bond dimension of 4000 , our procedure produces an estimate of approximately 0.9 overlap squared with a candidate ground state of the Fe Mo cofactor, producing a total resource estimate of 7.3 × 10 10 Toffoli gates; neglecting the search over candidates and assuming the accuracy of the extrapolation, this validates prior estimates that have used perfect ground-state overlap. This presents an example of a practical path to prepare states of high overlap in a challenging-to-compute chemical system. Published by the American Physical Society 2025

Berry, Dominic W. (ORCID:0000000334461449)↗
DOE OSTI2025

Informing ARC divertor design and plasma facing material selection through integrated modeling

This INFUSE 2023 project between UCLA and Commonwealth Fusion Systems used computer modeling to test whether tungsten materials can survive in CFS's ARC fusion reactor divertor. The team simulated plasma conditions and material responses, finding that tungsten-rhenium alloys resist grain growth better than pure tungsten, and that hydrogen buildup depends more on particle flux than temperature. The work helps CFS design durable plasma-facing components for their fusion power plant.

36 MATERIALS SCIENCE↗