Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 523 records · Page 29

Improved Hybrid Modeling of Spent Fuel Storage Facilities

This work developed a new computational method for improving the ability to calculate the neutron flux in deep-penetration radiation shielding problems that contain areas with strong streaming. The “gold standard” method for radiation transport is Monte Carlo (MC) as it samples the physics exactly and requires few approximations. Historically, however, MC was not useful for shielding problems because of the computational challenge of following particles through dense shields. Instead, deterministic methods, which are superior in term of computational effort for these problems types but are not as accurate, were used. Hybrid methods, which use deterministic solutions to improve MC calculations through a process called variance reduction, can make it tractable from a computational time and resource use perspective to use MC for deep-penetration shielding. Perhaps the most widespread and accessible of these methods are the Consistent Adjoint Driven Importance Sampling (CADIS) and Forward-Weighted CADIS (FW-CADIS) methods. For problems containing strong anisotropies, such as power plants with pipes through walls, spent fuel cask arrays, active interrogation, and locations with small air gaps or plates embedded in water or concrete, hybrid methods are still insufficiently accurate. In this work, a new method for generating variance reduction parameters for strongly anisotropic, deep penetration radiation shielding studies was developed. This method generates an alternate form of the adjoint scalar flux quantity, Φ Ω , which is used by both CADIS and FW-CADIS to generate variance reduction parameters for local and global response functions, respectively. The new method, called CADIS-Ω, was implemented in the Denovo/ADVANTG software. Results indicate that the flux generated by CADIS-Ω incorporates localized angular anisotropies in the flux more effectively than standard methods. CADIS-Ω outperformed CADIS in several test problems. This initial work indicates that CADIS- may be highly useful for shielding problems with strong angular anisotropies. This is a benefit to the public by increasing accuracy for lower computational effort for many problems that have energy, security, and economic importance.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Standardized Definitions for Code Verification Test Problems

This document contains standardized definitions for several commonly used code verification test problems. These definitions are intended to contain sufficient information to set up the test problem in a computational physics code. These definitions are intended to be used in conjunction with exact solutions to these problems generated using Exact- Pack, www.github.com/lanl/exactpack.

97 MATHEMATICS AND COMPUTING↗

Preconditioning bandgap eigenvalue problems in three-dimensional photonic crystals simulations

To explore band structures of three-dimensional photonic crystals numerically, we need to solve the eigenvalue problems derived from the governing Maxwell equations. The solutions of these eigenvalue problems cannot be computed effectively unless a suitable combination of eigenvalue solver and preconditioner is chosen. Taking eigenvalue problems due to Yee's scheme as examples, we propose using Krylov-Schur method and Jacobi-Davidson method to solve the resulting eigenvalue problems. For preconditioning, we derive several novel preconditioning schemes based on various preconditioners, including a preconditioner that can be solved by Fast Fourier Transform efficiently. We then conduct intensive numerical experiments for various combinations of eigenvalue solvers and preconditioning schemes. We find that the Krylov-Schur method associated with the Fast Fourier Transform based preconditioner is very efficient. It remarkably outperforms all other eigenvalue solvers with common preconditioners like Jacobi, Symmetric Successive Over Relaxation, and incomplete factorizations. This promising solver can benefit applications like photonic crystal structure optimization.

36 MATERIALS SCIENCE↗

A frequentist approach to computer model calibration

The paper considers the computer model calibration problem and provides a general frequentist solution. Under the framework proposed, the data model is semiparametric with a non-parametric discrepancy function which accounts for any discrepancy between physical reality and the computer model. In an attempt to solve a fundamentally important (but often ignored) identifiability issue between the computer model parameters and the discrepancy function, the paper proposes a new and identifiable parameterization of the calibration problem. It also develops a two-step procedure for estimating all the relevant quantities under the new parameterization. This estimation procedure is shown to enjoy excellent rates of convergence and can be straightforwardly implemented with existing software. For uncertainty quantification, bootstrapping is adopted to construct confidence regions for the quantities of interest. As a result, the practical performance of the methodology is illustrated through simulation examples and an application to a computational fluid dynamics model.

97 MATHEMATICS AND COMPUTING↗

Simple and efficient relaxation methods for interfaces separating compressible fluids, cavitating flows and shocks in multiphase mixtures

Numerical approximation of the five-equation two-phase flow of Kapila et al. [A.K. Kapila, R. Menikoff, J.B. Bdzil, S.F. Son, D.S. Stewart, Two-phase modeling of deflagration-to-detonation transition in granular materials: reduced equations, Physics of Fluids 13(10) (2001) 3002-3024] is examined. This model has shown excellent capabilities for the numerical resolution of interfaces separating compressible fluids as well as wave propagation in compressible mixtures [A. Murrone, H. Guillard, A five equation reduced model for compressible two phase flow problems, Journal of Computational Physics 202(2) (2005) 664-698; R. Abgrall, V. Perrier, Asymptotic expansion of a multiscale numerical scheme for compressible multiphase flows, SIAM Journal of Multiscale and Modeling and Simulation (5) (2006) 84-115; F. Petitpas, E. Franquet, R. Saurel, O. Le Metayer, A relaxation-projection method for compressible flows. Part II. The artificial heat exchange for multiphase shocks, Journal of Computational Physics 225(2) (2007) 2214-2248]. However, its numerical approximation poses some serious difficulties. Among them, the non-monotonic behavior of the sound speed causes inaccuracies in wave's transmission across interfaces. Moreover, volume fraction variation across acoustic waves results in difficulties for the Riemann problem resolution, and in particular for the derivation of approximate solvers. Volume fraction positivity in the presence of shocks or strong expansion waves is another issue resulting in lack of robustness. To circumvent these difficulties, the pressure equilibrium assumption is relaxed and a pressure non-equilibrium model is developed. It results in a single velocity, non-conservative hyperbolic model with two energy equations involving relaxation terms. It fulfills the equation of state and energy conservation on both sides of interfaces and guarantees correct transmission of shocks across them. This formulation considerably simplifies numerical resolution. Following a strategy developed previously for another flow model [R. Saurel, R. Abgrall, A multiphase Godunov method for multifluid and multiphase flows, Journal of Computational Physics 150 (1999) 425-467], the hyperbolic part is first solved without relaxation terms with a simple, fast and robust algorithm, valid for unstructured meshes. Second, stiff relaxation terms are solved with a Newton method that also guarantees positivity and robustness. The algorithm and model are compared to exact solutions of the Euler equations as well as solutions of the five-equation model under extreme flow conditions, for interface computation and cavitating flows involving dynamics appearance of interfaces. In order to deal with correct dynamic of shock waves propagating through multiphase mixtures, the artificial heat exchange method of Petitpas et al. [F. Petitpas, E. Franquet, R. Saurel, O. Le Metayer, A relaxation-projection method for compressible flows. Part II. The artificial heat exchange for multiphase shocks, Journal of Computational Physics 225(2) (2007) 2214-2248] is adapted to the present formulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Advancements in Multiphysics Microdepletion Analysis of an eVinci TM -like Microreactor Leveraging OpenMC-CRAB Workflow

Nuclear microreactors (MRs) are a class of nuclear reactor technology, characterized by reduced dimensions, modular design, and reduced power output in contrast to conventional Light Water Reactors (LWRs). MRs are proposed for supplying electricity and eventual process heat to remote locations, such as military installations and disaster-affected areas. Current research work sponsored by the US Department of Energy Microreactor Program (MRP) is devoted to the development of novel modeling and simulation tools to better support MR vendors and regulatory bodies. Notably, the NRC is projected to utilize the CRAB multiphysics software driver for executing both design and beyond-design-basis accident analyses. Furthermore, the NRC has been utilizing the MELCOR code to calculate mechanistic source terms during accidents. Since MELCOR relies on isotopic inventory and reactor temperature/power profiles under accident conditions, which theoretically can be derived from CRAB, the goal is to establish a comprehensive CRAB-MELCOR computational framework. Past work was focused on testing and demonstrating CRAB's capability to generate results that can be used to inform mechanistic source term calculations in MELCOR. In particular, a computational workflow leveraging OpenMC-generated microscopic cross sections and CRAB was first applied to perform multiphysics microscopic depletion calculation followed by an accident scenario for a stylized microreactor problem. In fiscal year 2024, the research work has been focused on applying the OpenMC-CRAB workflow, which was first tested in fiscal year 2023, to a realistic 3D heat-pipe cooled MR problem representative of the eVinci TM design. The latter computational problem was developed with inputs from WEC to conserve selected neutronic and thermal characteristics of the eVinci TM design without releasing proprietary data. The results of this simulation, encompassing isotopic inventory, power density distribution, and kinetic parameters, will inform both MELCOR and the WEC-developed FATE code for mechanistic source terms calculations. The results from the two codes will then be compared for code verification purposes. This report contains the design characteristics of the realist heat pipe cooled microreactor developed as a use-case for the verification exercise, and the current results for the multiphysics microscopic depletion performed with the OpenMC-CRAB workflow. The results include eigenvalue as a function of time, power distribution at EOL, in addition to nuclides inventory's time evolution and spatial distribution. Finally, we report improvements to the workflow efficiency achieved through a collaboration with the NEAMS programs. Through this collaborative effort, we were able to strongly decrease the computational time for the multiphysics microdepletion calculation (i.e., from 17.4 hours to 5.7 hours on 280 processors) in addition to simplifying the interface to generate isotopics spatial distribution utilizable by FATE and MELCOR. Future work, including the improvement of the current microscopic cross-sections' library and the simulation of an accident scenario at EOL, is also discussed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Heuristic methods and performance bounds for photonic design

In the photonic design problem, a scientist or engineer chooses the physical parameters of a device to best match some desired device behavior. Many instances of the photonic design problem can be naturally stated as a mathematical optimization problem that is computationally difficult to solve globally. Because of this, several heuristic methods have been developed to approximately solve such problems. These methods often produce very good designs, and, in many practical applications, easily outperform ‘traditional’ designs that rely on human intuition. Yet, because these heuristic methods do not guarantee that the approximate solution found is globally optimal, the question remains of just how much better a designer might hope to do. This question is addressed by performance bounds or impossibility results, which determine a performance level that no design can achieve. We focus on algorithmic performance bounds, which involve substantial computation to determine. We illustrate a variety of both heuristic methods and performance bounds on two examples. In these examples (and many others not reported here) the performance bounds show that the heuristic designs are nearly optimal, and can be considered globally optimal in practice. This review serves to clearly set up the photonic design problem and unify existing approaches for calculating performance bounds, while also providing some natural generalizations and properties.

Angeris, Guillermo (ORCID:0000000249503990)↗

Minimum fuel trajectories for round trip lunar missions

In this work, a study about minimum fuel trajectories in a round trip journey to the Moon is presented. It is assumed that the velocity changes are instantaneous, that is, the propulsion system is capable of delivering impulses such that the fuel consumption is represented by the total velocity increment applied to the space vehicle. It is also assumed that the velocity increments are applied tangentially to the terminal orbits, and, the outgoing trip and the return trip are analyzed separately such that the whole mission is performed with four impulses (two impulses in each trip). The mathematical models used to describe the motion of the space vehicle are three: the lunar patched-conic approximation; the classic planar circular restricted three-body problem, and, the planar bi-circular restricted four-body problem (PBR4BP). For computing the optimal trajectories, the Sequential Gradient-Restoration Algorithm with constraints is used. The influence of the Sun on round trip lunar missions is analyzed through the PBR4BP model. For all models, the trajectories studied are direct ascent maneuvers, and, both the outgoing and return trips are considered. The results obtained through the different models are compared with each other. The optimal results for the PBR4BP model show that a small reduction of the fuel consumption can be achieved if the initial phase angle of the Sun is chosen properly.

79 ASTRONOMY AND ASTROPHYSICS↗

Extended virtual element method for the Laplace problem with singularities and discontinuities

In this paper, we propose the extended virtual element method (X-VEM) to treat singularities and crack discontinuities that arise in the Laplace problem. The virtual element method (VEM) is a stabilized Galerkin formulation on arbitrary polytopal meshes, wherein the basis functions are implicit (virtual)—they are not known explicitly nor do they need to be computed within the problem domain. In this work, suitable projection operators are used to decompose the bilinear form on each element into two parts: a consistent term that reproduces the first-order polynomial space and a correction term that ensures stability. A similar approach is pursued in the X-VEM with a few notable extensions. To capture singularities and discontinuities in the discrete space, we augment the standard virtual element space with an additional contribution that consists of the product of virtual nodal basis (partition-of-unity) functions with enrichment functions. For discontinuities, basis functions are discontinuous across the crack and for singularities a weakly singular enrichment function that satisfies the Laplace equation is chosen. For the Laplace problem with a singularity, we devise an extended projector that maps functions that lie in the extended virtual element space onto linear polynomials and the enrichment function, whereas for the discontinuous problem, the consistent element stiffness matrix has a block-structure that is readily computed. An adaptive homogeneous numerical integration method is used to accurately and efficiently (no element-partitioning is required) compute integrals with integrands that are weakly singular. Once the element projection matrix is computed, the same steps as in the standard VEM are followed to compute the element stabilization matrix. Numerical experiments are performed on quadrilateral and polygonal (convex and nonconvex elements) meshes for the problem of an $\textit{L}$-shaped domain with a corner singularity and the problem of a cracked membrane under mode III loading, and results are presented that affirm the sound accuracy and demonstrate the optimal rates of convergence in the $\textit{L}^2$ norm and energy of the proposed method.

42 ENGINEERING↗

Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗

Separability criteria and method of measurement for entanglement

Quantum computers have the potentials to solve certain problems faster than classical computers. In quantum computer, entanglement is one of the elements beside superposition. Recently, with the advent of quantum information theory, entanglement has become an important resource for Quantum Information and Computation. The purpose of this paper is to discuss the separability criteria and method of measurement for entanglement. This paper is aimed at viewing the method that has been proposed in previous works in bipartite and multipartite entanglement. The outcome of this paper is to classify the different method that used to measure entanglement for bipartite and multipartite cases including the advantage and disadvantage of each method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Algorithm for High Energy Physics Simulations

Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

DiaMonD is a multi-institutional DOE MMICC effort that aims to address the challenges of end-to-end, data-to-decisions modeling and simulation for complex computational science and engineering problems in a unified, systematic, and integrated fashion. Institutions involved are Colorado State, Florida State, Los Alamos, MIT, Oak Ridge, Stanford, and UT-Austin. The goals of DiaMonD are (1) to develop advanced mathematical methods and analysis for multimodel, multiphysics, multiscale model problems driven by frontier DOE applications, including those in subsurface energy and environmental flows, materials for energy storage and conversion, and ice sheet dynamics; (2) to create theory and algorithms for integrated inversion, optimization, and uncertainty quantification for these complex problems; and (3) to disseminate the philosophy of an integrated end-to-end, data-to-decisions approach to modeling and simulation of complex problems to the broader applied math and computational science communities through workshops and other outreach.

42 ENGINEERING↗

Side-channel Leakage Assessment Metrics: A Case Study of GIFT Block Ciphers

Determination of an adequate level of security and providing subsequent mechanisms to achieve it, is one of the most pressing problems regarding embedded computing devices. While there are some solutions available for resource-rich computer systems, direct application of these solutions to resource-constrained environments are often unfeasible. The fundamental problem for such resource-constrained systems is the fact that current cryptographic algorithms utilize significant energy consumption and storage overhead. Both the cryptographic algorithm and its physical implementation affect the resilience of a cryptosystem against side-channel attacks. A side-channel attack represents a process that exploits leakages in order to extract sensitive information such as the key. This paper focuses on Correlation Power Analysis (CPA) which is side-channel attack based on the power consumption leakage. In 2016 the U.S. Commerce Department’s National Institute of Standards and Technology (NIST) initiated the call for proposals of new cryptographic algorithms to strengthen the cryptographic defense of networked devices against cyberattacks and to protect the data created by those innumerable device. This work evaluates S-boxes used by NIST candidates PICCOLO, GIFT, and PRESENT, as well as several S-box variants that demonstrated sufficient weaknesses against classical cryptanalysis, for a quantitative comparison in terms of resiliency to CPA attack. Three well-known theoretical metrics are evaluated: transparency order (TO and RTO), nonlinearity, and signal-to-noise (SNR) ratio, aiming to characterize the resistance of these S-boxes against adversaries exploiting physical leakages. Experimental results from attacks on an 8- bit XMEGA were obtained via the ChipWhisperer platform and of all the S-boxes evaluated, GIFT64 with a PICCOLO S-box was found to be the most susceptible to CPA. Results showed that variations in TO and RTO were not sufficient to ensure practical CPA resistance and that among S-boxes with equal non-linearity there were no significant differences in the TO and SNR variants.

97 MATHEMATICS AND COMPUTING↗

Side-channel Leakage Assessment Metrics: A Case Study of GIFT Block Ciphers

Determination of an adequate level of security and providing subsequent mechanisms to achieve it, is one of the most pressing problems regarding embedded computing devices. While there are some solutions available for resource-rich computer systems, direct application of these solutions to resource-constrained environments are often unfeasible. The fundamental problem for such resource-constrained systems is the fact that current cryptographic algorithms utilize significant energy consumption and storage overhead. Both the cryptographic algorithm and its physical implementation affect the resilience of a cryptosystem against side-channel attacks. A side-channel attack represents a process that exploits leakages in order to extract sensitive information such as the key. This paper focuses on Correlation Power Analysis (CPA) which is side-channel attack based on the power consumption leakage. In 2016 the U.S. Commerce Department’s National Institute of Standards and Technology (NIST) initiated the call for proposals of new cryptographic algorithms to strengthen the cryptographic defense of networked devices against cyberattacks and to protect the data created by those innumerable device. This work evaluates S-boxes used by NIST candidates PICCOLO, GIFT, and PRESENT, as well as several S-box variants that demonstrated sufficient weaknesses against classical cryptanalysis, for a quantitative comparison in terms of resiliency to CPA attack. Three well-known theoretical metrics are evaluated: transparency order (TO and RTO), nonlinearity, and signal-to-noise (SNR) ratio, aiming to characterize the resistance of these S-boxes against adversaries exploiting physical leakages. Experimental results from attacks on an 8- bit XMEGA were obtained via the ChipWhisperer platform and of all the S-boxes evaluated, GIFT64 with a PICCOLO S-box was found to be the most susceptible to CPA. Results showed that variations in TO and RTO were not sufficient to ensure practical CPA resistance and that among S-boxes with equal non-linearity there were no significant differences in the TO and SNR variants.

97 MATHEMATICS AND COMPUTING↗

Scout: high-performance heterogeneous computing made simple

Researchers must often write their own simulation and analysis software. During this process they simultaneously confront both computational and scientific problems. Current strategies for aiding the generation of performance-oriented programs do not abstract the software development from the science. Furthermore, the problem is becoming increasingly complex and pressing with the continued development of many-core and heterogeneous (CPU-GPU) architectures. To acbieve high performance, scientists must expertly navigate both software and hardware. Co-design between computer scientists and research scientists can alleviate but not solve this problem. The science community requires better tools for developing, optimizing, and future-proofing codes, allowing scientists to focus on their research while still achieving high computational performance. Scout is a parallel programming language and extensible compiler framework targeting heterogeneous architectures. It provides the abstraction required to buffer scientists from the constantly-shifting details of hardware while still realizing higb-performance by encapsulating software and hardware optimization within a compiler framework.

97 MATHEMATICS AND COMPUTING↗

Extending ALE3D, an Arbitrarily Connected hexahedral 3D Code, to Very Large Problem Size (U)

As the number of compute units increases on the ASC computers, the prospect of running previously unimaginably large problems is becoming a reality. In an arbitrarily connected 3D finite element code, like ALE3D, one must provide a unique identification number for every node, element, face, and edge. This is required for a number of reasons, including defining the global connectivity array required for domain decomposition, identifying appropriate communication patterns after domain decomposition, and determining the appropriate load locations for implicit solvers, for example. In most codes, the unique identification number is defined as a 32-bit integer. Thus the maximum value available is 231, or roughly 2.1 billion. For a 3D geometry consisting of arbitrarily connected hexahedral elements, there are approximately 3 faces for every element, and 3 edges for every node. Since the nodes and faces need id numbers, using 32-bit integers puts a hard limit on the number of elements in a problem at roughly 700 million. The first solution to this problem would be to replace 32-bit signed integers with 32-bit unsigned integers. This would increase the maximum size of a problem by a factor of 2. This provides some head room, but almost certainly not one that will last long. Another solution would be to replace all 32-bit int declarations with 64-bit long long declarations. (long is either a 32-bit or a 64-bit integer, depending on the OS). The problem with this approach is that there are only a few arrays that actually need to extended size, and thus this would increase the size of the problem unnecessarily. In a future computing environment where CPUs are abundant but memory relatively scarce, this is probably the wrong approach. Based on these considerations, we have chosen to replace only the global identifiers with the appropriate 64-bit integer. The problem with this approach is finding all the places where data that is specified as a 32-bit integer needs to be replaced with the 64-bit integer. that need to be replaced. In the rest of this paper we describe the techniques used to facilitate this transformation, issues raised, and issues still to be addressed. This poster will describe the reasons, methods, issues associated with extending the ALE3D code to run problems larger than 700 million elements.

97 MATHEMATICS AND COMPUTING↗