Results for “Numberical Integration” — Page 7

DOE OSTI2022

Pellet cladding mechanical interaction as a potential failure mechanism during a control rod drop accident in a boiling water reactor

Boiling water reactors (BWRs) represent approximately one-third of the operating fleet in the United States, contributing significantly towards the global effort in reducing carbon emissions. Even though most of the operating fleet has been in operation for quite some time, continued advancements in new nuclear fuel (such as accident tolerant fuel) or operating regimes (such as power up-rates and higher burnup operation) necessitates similar advancements in modeling and simulation capabilities. Bison, a component of the Virtual Environment for Reactor Applications (VERA), is a high-fidelity fuel performance code able to explore the fuel performance of a wide variety of fuel types in one-, two-, and three-dimensions. Until recently, the code had not been used for analyses of BWRs. Modeling capabilities have been added for Gd-bearing UO{sub 2} and pure zirconium liners. New models have been added based upon the U.S. Nuclear Regulatory Commission (NRC) guide-lines for hydrogen pickup in Zircaloy-2 claddings and pellet-clad mechanical interaction (PCMI) failure during a reactivity insertion accident (RIA), known as a rod drop accident (CRDA) in BWRs. Implementing and/or improving Bison modeling capabilities extended its analytical reach to areas beyond its original intended purpose. This paper demonstrates one of these capabilities as a proof of concept. Recently developed models enable Bison to provide an alternate approach for cladding integrity determination in CRDA evaluations, which currently use bounding conservative estimates. As part of this demonstration, NRC guidance on hydrogen-pickup and PCMI failure models were utilized in this research. Even though more research is needed in establishing right inputs and process in this area, this paper demonstrates Bison's ability to determine cladding integrity in a CRDA evaluation. This first of a kind demonstration is a proof of concept in this area, which could potentially be extended to a number of other areas where a more accurate cladding integrity determination would be needed. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2025

The Viskores User's Guide, Release 1.1

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Persistent Homology Metrics Reveal Quantum Fluctuations and Reactive Atoms in Path Integral Dynamics

Nuclear quantum effects (NQEs) are known to impact a number of features associated with chemical reactivity and physicochemical properties, particularly for light atoms and at low temperatures. In the imaginary time path integral formalism, each atom is mapped onto a “ring polymer” whose spread is related to the quantum mechanical uncertainty in the particle’s position, i.e., its thermal wavelength. A number of metrics have previously been used to investigate and characterize this spread and explain effects arising from quantum delocalization, zero-point energy, and tunneling. Many of these shape metrics consider just the instantaneous structure of the ring polymers. However, given the significant interest in methods such as centroid molecular dynamics and ring polymer molecular dynamics that link the molecular dynamics of these ring polymers to real time properties, there exists significant opportunity to exploit metrics that also allow for the study of the fluctuations of the atom delocalization in time. Here we consider the ring polymer delocalization from the perspective of computational topology, specifically persistent homology, which describes the 3-dimensional arrangement of point cloud data, (i.e. atomic positions). We employ the Betti sequence probability distribution to define the ensemble of shapes adopted by the ring polymer. The Wasserstein distances of Betti sequences adjacent in time are used to characterize fluctuations in shape, where the Fourier transform and associated principal components provides added information differentiating atoms with different NQEs based on their dynamic properties. We demonstrate this methodology on two representative systems, a glassy system consisting of two atom types with dramatically different de Broglie thermal wavelengths, and ab initio molecular dynamics simulation of an aqueous 4 M HCl solution where the H-atoms are differentiated based on their participation in proton transfer reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

The Viskores User's Guide (V.1.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi-/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

VTK-m User's' Guide (V.1.7)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.This book includes contributions from the VTK-m community including the VTK-m development team and the user community.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

The VTK-m Users' Guide (V.1.9)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

The VTK-m Users' Guide (V.2.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

The VTK-m User's Guide (V. 2.2)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Calculation of machine precision second order derivatives using dual-complex numbers

It is well known that both complex and dual numbers can be employed to obtain machine precision first-order derivatives; however, neither, on their own, can compute machine precision 2nd order derivatives. To address this limitation, it is demonstrated in this paper that combined dual-complex numbers can be used to compute machine precision 1st and 2nd order derivatives. The dual-complex approach is simpler than utilizing multicomplex or hyper-dual numbers as existing dual libraries can be used as is or easily augmented to accept complex numbers, and the complexity of developing, integrating, and deploying multicomplex or hyper-dual libraries is avoided. The efficacy of this approach is demonstrated for both univariate and multivariate functions. Finally, source code examples using the Python, Julia, and Mathematica languages are provided as supplemental material.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Dissolved oxygen sensor in an automated hyporheic sampling system reveals biogeochemical dynamics

Many river corridor systems frequently experience rapid variations in river stage height, hydraulic head gradients, and residence times. The integrated hydrology and biogeochemistry of such systems is challenging to study, particularly in their associated hyporheic zones. Here we present an automated system to facilitate 4-dimensional study of dynamic hyporheic zones. It is based on combining real-time in-situ and ex-situ measurements from sensor/sampling locations distributed in 3-dimensions. A novel dissolved oxygen (DO) sensor was integrated into the system during a small scale study. We measured several biogeochemical and hydrologic parameters at three subsurface depths in the riverbed of the Columbia River in Washington State, USA, a dynamic hydropeaked river corridor system. During the study, episodes of significant DO variations (~+/- 4 mg/l) were observed, with minor variation in other parameters (e.g., <~+/-0.15 mg/l NO 3 ). DO concentrations were related to hydraulic head gradients, showing both hysteretic and non-hysteretic relationships with abrupt (hours) transitions between the two types of relationships. The observed relationships provide a number of hypotheses related to the integrated hydrology and biogeochemistry of dynamic hyporheic zones. We suggest that preliminary high-frequency monitoring is advantageous in guiding the design of long term monitoring campaigns. The study also demonstrated the importance of measuring multiple parameters in parallel, where the DO sensor provided the key signal for identifying/detecting transient phenomena.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2020

New candidates for regulated gene integrity revealed through precise mapping of integrative genetic elements

Abstract Integrative genetic elements (IGEs) are mobile multigene DNA units that integrate into and excise from host bacterial genomes. Each IGE usually targets a specific site within a conserved host gene, integrating in a manner that preserves target gene function. However, a small number of bacterial genes are known to be inactivated upon IGE integration and reactivated upon excision, regulating phenotypes of virulence, mutation rate, and terminal differentiation in multicellular bacteria. The list of regulated gene integrity (RGI) cases has been slow-growing because IGEs have been challenging to precisely and comprehensively locate in genomes. We present software (TIGER) that maps IGEs with unprecedented precision and without attB site bias. TIGER uses a comparative genomic, ping-pong BLAST approach, based on the principle that the IGE integration module (i.e. its int-attP region) is cohesive. The resultant IGEs from 2168 genomes, along with integrase phylogenetic analysis and gene inactivation tests, revealed 19 new cases of genes whose integrity is regulated by IGEs (including dut, eccCa1, gntT, hrpB, merA, ompN, prkA, tqsA, traG, yifB, yfaT and ynfE), as well as recovering previously known cases (in sigK, spsM, comK, mlrA and hlb genes). It also recovered known clades of site-promiscuous integrases and identified possible new ones.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2023

AI-ENABLED MONITORING OPTIONS TOWARDS SECURE MICROREACTOR DEPLOYMENT AND OPERATIONS

Global nuclear energy deployment scenarios suggest favorable economics for smaller, more versatile, and self-contained reactor technologies. Recognizing their key features as integrated, autonomous and either semi-remotely operated or fully remotely operated systems, microreactors are expected to be deployed in large numbers servicing off/micro-grids, many in geographically remote locations. Integrated nature of these systems as well as ease of their transportation as complete units, simplified installation and relocation/decommissioning challenge traditional continuity-of-knowledge practices used for conventional light water reactors where refueling is done onsite at designated times only replacing portions of their cores and only after their full commissioning for operations including completion of their containment building with security and safeguards measures in place. This effort is exploring AI (artificial intelligence)-enabled monitoring options that would be design agnostic and would assure secure unit deployment and operations. The principle is to maintain situational awareness via real-time evaluations of simultaneous and remotely transmitted monitoring data capturing key safeguards attributes including such characteristics as temperature, radiation, vibrational signals (inter alia), and others. The key principle is to provide reliable and resilient security options while maintaining simplified and economical deployment. The paper will review feasible options for AI-enabled solutions for such evaluations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2024

Dynamics and phases of nonunitary Floquet transverse-field Ising model

Inspired by current research on measurement-induced quantum phase transitions, we analyze the nonunitary Floquet transverse-field Ising model with complex nearest-neighbor couplings and complex transverse fields. Unlike its unitary counterpart, the model shows a number of steady phases, stable to integrability-breaking perturbations. Some phases have robust edge modes and/or spatiotemporal long-range orders in the bulk. The transitions between the phases have extensive entanglement entropy, whose scaling with the system size depends on the number of the real quasiparticle modes in the spectrum at the transition. In particular, the volume-law scaling appears on some critical lines, protected by pseudo-Hermiticity. Both the scaling of entanglement entropy in steady states and the evolution after a quench are compatible with the non-Hermitian generalization of the quasiparticle picture of Calabrese and Cardy at least qualitatively. Published by the American Physical Society 2024

Su, Lei (ORCID:0009000455290786)↗

DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

The Impact of Radiative Transfer at Reduced Spectral Resolution in Large‐Eddy Simulations of Convective Clouds

Abstract Many radiative transfer schemes approximate the spectral integration over ∼10 5 to ∼10 6 wavelengths with correlated k ‐distributions methods that typically require only 10 1 –10 2 spectral integration points ( g ‐points). The exact number of g ‐points is then chosen as an optimal balance between computational costs and accuracy, normally assessed in terms of a number of radiative quantities. How this radiative accuracy propagates to simulation accuracy, however, is not straightforward. In this study, we therefore explore the sensitivity of cloud properties in large‐eddy simulations (LES) to the accuracy of radiative fluxes and heating rates. We first generate smaller sets of g ‐points from existing k ‐distributions by repeatedly combining adjacent g ‐points while maintaining the highest possible accuracy on a chosen set of radiative metrics. Next, we perform three sets of LES with varying cloud—radiation coupling pathways, and therefore different requirements for the accuracy of the radiative transfer computations, to investigate how these smaller and thus less accurate k ‐distributions affect simulation characteristics. The decrease in radiative accuracy with 3–4 times smaller k ‐distributions results in biases in cloud properties that are relative small compared to their temporal fluctuations. These results show potential for speeding up radiative transfer computations in cloud‐resolving models by reducing the resolved spectral detail. However, more statistically converged simulations and a wider set of case studies is required to fully assess the robustness of our results.

Meteorology & Atmospheric Sciences↗

DOE OSTI2022

The rate of microtubule breaking increases exponentially with curvature

Microtubules, cylindrical assemblies of tubulin proteins with a 25 nm diameter and micrometer lengths, are a central part of the cytoskeleton and also serve as building blocks for nanobiodevices. Microtubule breaking can result from the activity of severing enzymes and mechanical stress. Breaking can lead to a loss of structural integrity, or an increase in the numbers of microtubules. We observed breaking of taxol-stabilized microtubules in a gliding motility assay where microtubules are propelled by surface-adhered kinesin-1 motor proteins. We find that over 95% of all breaking events are associated with the strong bending following pinning events (where the leading tip of the microtubule becomes stuck). Furthermore, the breaking rate increased exponentially with increasing curvature. These observations are explained by a model accounting for the complex mechanochemistry of a microtubule. The presence of severing enzymes is not required to observe breaking at rates comparable to those measured previously in cells.

42 ENGINEERING↗

DOE OSTI2022

Code-to-code comparison and validation of the radiation-hydrodynamics capabilities of the FLASH code using a laboratory astrophysical jet

The potential for laser-produced plasmas to yield fundamental insights into high energy density physics (HEDP) and deliver other useful applications can sometimes be frustrated by uncertainties in modeling the properties and behavior of these plasmas using radiation-hydrodynamics codes. In an effort to overcome this and to corroborate the accuracy of the HEDP capabilities in the publicly available FLASH radiation-hydrodynamics code, we present detailed code-to-code comparisons between FLASH and the HYDRA code developed at Lawrence Livermore National Laboratory using previously published HYDRA simulations from Grava et al. [Phys. Rev. E 78, 016403 (2008)]. That study describes a laser experiment that produced a jet-like feature that the authors compare to astrophysical jets. Importantly, the Grava et al. [Phys. Rev. E 78, 016403 (2008)] experiment included detailed x-ray interferometric measurements of electron number densities and a time-integrated measurement of the soft x-ray spectrum. Despite markedly different methods for treating the computational mesh, and different equations of state and opacity models, the FLASH results resemble the results from HYDRA and, most importantly, the experimental measurements of electron density. Having validated the FLASH code in this way, we use the code to further investigate and understand the formation of the jet seen in the Grava et al. [Phys. Rev. E 78, 016403 (2008)] experiment and discuss its relation to the Wan et al. [Phys. Rev. E 55, 6293 (1997)] experiment at the NOVA laser.

Orban, Chris (ORCID:0000000312004538)↗

DOE OSTI2020

Advanced Synchrophasor-based Application for Potential Distributed Energy Resources Management: Key Technology, Challenge and Vision

With an increasing number of distributed energy resources (DERs) integrating into the power system, the power grid is becoming more complex and uncertain. Owing to most of DERs are through grid-connected converters to integrate into the power system, the intermittent nature and resource-depended characteristic of the DERs are challenging their monitoring and control. Conventional synchronized measurement devices (SMDs) may be difficult to provide qualified data for DERs management for its accuracy and reporting-rate limitation. The monitoring systems developed basing on SMDs may be insufficient for depicting detailed dynamic manifestations of power systems with a high proportion integration of DERs. This paper shares some advanced synchrophasor-based applications developed in FNET/GridEye, which have a broad prospect for assisting system operator on the control and integration of the DERs.

Wang, Weikang↗