Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer applications”

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 775 records · Page 43

ALTERNATIVES OF MACCS2 IN LANL DISPERSION ANALYSIS FOR ONSITE AND OFFSITE DOSES

In modeling atmospheric dispersion to determine accidental release of radiological material, one of the common statistical analysis tools used at Los Alamos National Laboratory (LANL) is MELCOR Accident Consequence Code System, Version 2 (MACCS2). MACCS2, however, has some limitations and shortfalls for both onsite and offsite applications. Alternative computer codes, which could provide more realistic calculations, are being investigated for use at LANL. In the Yucca Mountain Project (YMP), the suitability of MACCS2 for the calculation of onsite worker doses was a concern; therefore, ARCON96 was chosen to replace MACCS2. YMP's use of ARCON96 provided results which clearly demonstrated the program's merit for onsite worker safety analyses in a wide range of complex configurations and scenarios. For offsite public exposures, the conservatism of MACCS2 on the treatment of turbulence phenomena at LANL is examined in this paper. The results show a factor of at least two conservatism in calculated public doses. The new EPA air quality model, AERMOD, which implements advanced meteorological turbulence calculations, is a good candidate for LANL applications to provide more confidence in the accuracy of offsite public dose projections.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Programmer-guided reliability for extreme-scale applications

We present “programmer-guided reliability” (PGR) as a systematic conceptual approach to address the expected rise in soft errors in coming extreme-scale systems at the application level. The approach involves instrumentation of the application with code to detect data corruption errors. The location and nature of these error detectors are at the discretion of the programmer, who uses their knowledge and experience with the problem domain, the application, the solution algorithms, etc., to determine the most vulnerable areas of the code and the most appropriate ways to detect data corruption. To illustrate the approach, we provide examples of error detectors from four different benchmark-scale applications. We also describe a simple control framework that allows for runtime configuration of the error detectors without recompilation of the application, as well as dynamic reconfiguration during the execution of the application. Lastly, we discuss a number of future directions building on the basic PGR approach, including the incorporation of some general error detectors into the programming environment in order to make them more easily usable by the programmer.

97 MATHEMATICS AND COMPUTING↗

HDBind: encoding of molecular structure with hyperdimensional binary representations

Traditional methods for identifying “hit” molecules from a large collection of potential drug-like candidates rely on biophysical theory to compute approximations to the Gibbs free energy of the binding interaction between the drug and its protein target. These approaches have a significant limitation in that they require exceptional computing capabilities for even relatively small collections of molecules. Increasingly large and complex state-of-the-art deep learning approaches have gained popularity with the promise to improve the productivity of drug design, notorious for its numerous failures. However, as deep learning models increase in their size and complexity, their acceleration at the hardware level becomes more challenging. Hyperdimensional Computing (HDC) has recently gained attention in the computer hardware community due to its algorithmic simplicity relative to deep learning approaches. The HDC learning paradigm, which represents data with high-dimension binary vectors, allows the use of low-precision binary vector arithmetic to create models of the data that can be learned without the need for the gradient-based optimization required in many conventional machine learning and deep learning methods. This algorithmic simplicity allows for acceleration in hardware that has been previously demonstrated in a range of application areas (computer vision, bioinformatics, mass spectrometery, remote sensing, edge devices, etc.). To the best of our knowledge, our work is the first to consider HDC for the task of fast and efficient screening of modern drug-like compound libraries. We also propose the first HDC graph-based encoding methods for molecular data, demonstrating consistent and substantial improvement over previous work. We compare our approaches to alternative approaches on the well-studied MoleculeNet dataset and the recently proposed LIT-PCBA dataset derived from high quality PubChem assays. We demonstrate our methods on multiple target hardware platforms, including Graphics Processing Units (GPUs) and Field Programmable Gate Arrays (FPGAs), showing at least an order of magnitude improvement in energy efficiency versus even our smallest neural network baseline model with a single hidden layer. Our work thus motivates further investigation into molecular representation learning to develop ultra-efficient pre-screening tools. We make our code publicly available at https://github.com/LLNL/hdbind.

59 BASIC BIOLOGICAL SCIENCES↗

Performance Efficient Multiresilience Using Checkpoint Recovery in Iterative Algorithms

In this paper, we address the design challenge of building multiresilient iterative high-performance computing (HPC) applications. Multiresilience in HPC applications is the ability to tolerate and maintain forward progress in the presence of both soft errors and process failures. We address the challenge by proposing performance models which are useful to design performance efficient and resilient iterative applications. The models consider the interaction between soft error and process failure resilience solutions. We experimented with a linear solver application with two distinct kinds of soft error detectors: one detector has high overhead and high accuracy, whereas the second has low overhead and low accuracy. We show how both can be leveraged for verifying the integrity of checkpointed state used to recover from both soft errors and process failures. Our results show the performance efficiency and resiliency benefit of employing the low overhead detector with high frequency within the checkpoint interval, so that timely soft error recovery can take place, resulting in less re-computed work.

Ashraf, Rizwan↗

General formulas for adiabatic invariants in nearly periodic Hamiltonian systems

While it is well known that every nearly periodic Hamiltonian system possesses an adiabatic invariant, extant methods for computing terms in the adiabatic invariant series are inefficient. The most popular method involves the heavy intermediate calculation of a non-unique near-identity coordinate transformation, even though the adiabatic invariant itself is a uniquely defined scalar. Here, a less well-known method, developed by S. Omohundro, avoids calculating intermediate sequences of coordinate transformations but is also inefficient as it involves its own sequence of complex intermediate calculations. In order to improve the efficiency of future calculations of adiabatic invariants, we derive generally applicable, readily computable formulas for the first several terms in the adiabatic invariant series. To demonstrate the utility of these formulas, we apply them to charged-particle dynamics in a strong magnetic field and magnetic field-line dynamics when the field lines are nearly closed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Science-Based Acceleration of the Full Value Stream for Metal Additive Manufacturing: Expedited Powder Development and Additive Manufacturing Deployment in the Areas of Ni-Base Superalloy and Custom Alloy Powders for AM (Final Report)

The overall Science-based Acceleration of the Full Value Stream for Metal Additive Manufacturing (AM): Expedited Powder Development and Additive Manufacturing Deployment (“X-P4AM”) project objective is to drastically reduce the time-to-market barriers for new additive alloys of interest in automotive and aerospace applications, through computational alloy design with rapid screening and down- selection via synthesis of candidate alloys with rapid solidification. The project will also refine the technology in high pressure gas atomization to improve the production of commercial quantities of selected powders with high powder yields and enhanced powder quality. Production of modified nickel-based superalloys and a Ni-containing alloy based on a high entropy composition, enhanced powder production methods, and optimized AM build parameterization provided critical steps in widespread adoption of AM technology for aerospace applications, in this case. The individual backgrounds and capabilities of the Parties are ideally suited to the successful execution of this work. The included work enhanced the Contractors’ AM capabilities, a core competency of the Contractors, and develop a close working relationship with the Participant in the area of nickel-based powder superalloys and custom alloys and their end use.

36 MATERIALS SCIENCE↗

Science-Based Acceleration of the Full Value Stream for Metal Additive Manufacturing: Expedited Powder Development and Additive Manufacturing Deployment in the Areas of Ni-Base Superalloy and Custom Alloy Powders for AM

The overall Science-based Acceleration of the Full Value Stream for Metal Additive Manufacturing (AM): Expedited Powder Development and Additive Manufacturing Deployment (“X-P4AM”) project objective is to drastically reduce the time-to-market barriers for new additive alloys of interest in automotive and aerospace applications, through computational alloy design with rapid screening and down- selection via synthesis of candidate alloys with rapid solidification. The project will also refine the technology in high pressure gas atomization to improve the production of commercial quantities of selected powders with high powder yields and enhanced powder quality. Production of modified nickel-based superalloys and a Ni-containing alloy based on a high entropy composition, enhanced powder production methods, and optimized AM build parameterization provided critical steps in widespread adoption of AM technology for aerospace applications, in this case. The individual backgrounds and capabilities of the Parties are ideally suited to the successful execution of this work. The included work enhanced the Contractors’ AM capabilities, a core competency of the Contractors, and develop a close working relationship with the Participant in the areas of nickel-based powder superalloys and custom alloys and their end use.

36 MATERIALS SCIENCE↗

Science-Based Acceleration of the Full Value Stream for Metal Additive Manufacturing: Expedited Powder Development and Additive Manufacturing Deployment in the Areas of Ni-Base Superalloy and Custom Alloy Powders for AM

The overall Science-based Acceleration of the Full Value Stream for Metal Additive Manufacturing (AM): Expedited Powder Development and Additive Manufacturing Deployment (“X-P4AM”) project objective is to drastically reduce the time-to-market barriers for new additive alloys of interest in automotive and aerospace applications, through computational alloy design with rapid screening and down- selection via synthesis of candidate alloys with rapid solidification. The project will also refine the technology in high pressure gas atomization to improve the production of commercial quantities of selected powders with high powder yields and enhanced powder quality. Production of modified nickel-based superalloys and a Ni-containing alloy based on a high entropy composition, enhanced powder production methods, and optimized AM build parameterization provided critical steps in widespread adoption of AM technology for aerospace applications, in this case. The individual backgrounds and capabilities of the Parties are ideally suited to the successful execution of this work. The included work enhanced the Contractors’ AM capabilities, a core competency of the Contractors, and develop a close working relationship with the Participant in the areas of nickel-based powder superalloys and custom alloys and their end use.

36 MATERIALS SCIENCE↗

2019 Lighting R&D Opportunities

BTO’s Lighting R&D Opportunities is updated annually and covers foundational R&D needs for lighting technology and lighting application understanding that will result in maximum energy savings while also optimizing for building occupant well-being and productivity.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Input specific neural networks

Neural networks have emerged as powerful tools for mapping between inputs and outputs. However, their black-box nature limits the ability to encode or impose specific structural relationships between inputs and outputs. Many scientific and engineering problems, such as constitutive modeling in solid mechanics, require networks that can enforce convexity, monotonicity, or other structural constraints to ensure physical consistency. Here, we introduce the Input Specific Neural Network (ISNN), a new architecture that enables multiple, distinct constraints to be imposed on different input subsets for scalar-valued outputs. This framework unifies convex, monotone–convex, monotone, and arbitrary mappings within a single network for the first time. Two ISNN architectures with analytical first- and second-order derivatives are developed. We demonstrate the performance on synthetic toy problems, inverse problems in isotropic hyperelasticity, and finite element simulations. ISNNs achieve improved extrapolation behavior, require fewer invariant inputs than standard input convex networks for polyconvex potentials, and enable significant computational savings via manual differentiation. We also show how ISNNs can be used to learn structural relationships between inputs and outputs via a binary gating mechanism. Particularly, ISNNs are employed to model a homogenized anisotropic free energy potential in a decoupled multiscale setting. The network learns whether or not the potential should be modeled as polyconvex and retains only the relevant layers while using the minimum number of inputs. ISNNs provide a flexible foundation for embedding structural priors into neural networks, enhancing both interpretability and stability. They are broadly applicable across computational mechanics and other scientific domains requiring constrained functional relationships.

Jadoon, Asghar A. [Univ. of Texas, Austin, TX (Uni↗

Toward Automated Tools for Characterization of Molecular Porosity

The emerging advanced porous materials, e.g. extended framework materials and porous molecular materials, offer an unprecedented level of control of their structure and function. The enormous possibilities for tuning these materials by changing their building blocks mean that, in principle, optimally performing materials for a variety of applications can be systematically designed. However, the process of finding a set of optimal structures for a given application requires computational high-throughput tools to analyze and sieve through many candidate materials. In particular, in the case of porous molecular materials, the analysis and selection of a molecule is one of the key aspects as the structure of the molecule determines the structure of the resulting material, and very often the porosity of the molecule significantly contributes to the porous properties of the resulting material. In this work, we introduce definitions and algorithms to characterize porosity at the molecular level, along with a software implementation of these algorithms. We demonstrate applications of the software tool in the discovery and characterization of porous molecules among ca. 94 million molecules currently enlisted in the PubChem database.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quarter 4 Report: Report on Final Findings and Opportunities for Future Work in the Use of Mixed Precision in Iterative Solvers

The fourth quarter of the project was spent developing an error analysis of the s-step Lanczos and CG algorithms. Our theoretical bounds and numerical experiments show that the numerical behavior of the algorithm can be significantly improved by using extra precision in a small part of the computation related to the computation and application of the Gram matrix. We have published a technical report which includes all steps of the analysis [8]; a shortened version for journal submission is in preparation. We plan to submit this paper in the following weeks. Activities related to this also include a collaboration with Ichitaro Yamazaki on gathering performance results for these new mixed precision s-step Krylov subspace methods using single/double precision on GPUs. Namely, we would like to obtain performance results that show that the performance overhead of using double the working precision in these select computations is minimal. Other activities include attending biweekly xSDK meetings and presenting a pitch talk on this work to the group on February 25, 2021. In the remainder of the document, we summarize our findings on the potential for mixed precision in classical Krylov subspace methods and s-step Krylov subspace methods, as well as key opportunities for future work.

97 MATHEMATICS AND COMPUTING↗

Comprehensive uncertainty quantification (UQ) for full engineering models by solving probability density function (PDF) equation

This report details a new method for propagating parameter uncertainty (forward uncertainty quantification) in partial differential equations (PDE) based computational mechanics applications. The method provides full-field quantities of interest by solving for the joint probability density function (PDF) equations which are implied by the PDEs with uncertain parameters. Full-field uncertainty quantification enables the design of complex systems where quantities of interest, such as failure points, are not known apriori. The method, motivated by the well-known probability density function (PDF) propagation method of turbulence modeling, uses an ensemble of solutions to provide the joint PDF of desired quantities at every point in the domain. A small subset of the ensemble is computed exactly, and the remainder of the samples are computed with approximation of the driving (dynamics) term of the PDEs based on those exact solutions. Although the proposed method has commonalities with traditional interpolatory stochastic collocation methods applied directly to quantities of interest, it is distinct and exploits the parameter dependence and smoothness of the dynamics term of the governing PDEs. The efficacy of the method is demonstrated by applying it to two target problems: solid mechanics explicit dynamics with uncertain material model parameters, and reacting hypersonic fluid mechanics with uncertain chemical kinetic rate parameters. A minimally invasive implementation of the method for representative codes SPARC (reacting hypersonics) and NimbleSM (finite- element solid mechanics) and associated software details are described. For solid mechanics demonstration problems the method shows order of magnitudes improvement in accuracy over traditional stochastic collocation. For the reacting hypersonics problem, the method is implemented as a streamline integration and results show very good accuracy for the approximate sample solutions of re-entry flow past the Apollo capsule geometry at Mach 30.

42 ENGINEERING↗

Numerical uncertainty in computational engineering and physics

Obtaining a solution that approximates ordinary or partial differential equations on a computational mesh or grid does not necessarily mean that the solution is accurate or even 'correct'. Unfortunately assessing the quality of discrete solutions by questioning the role played by spatial and temporal discretizations generally comes as a distant third to test-analysis comparison and model calibration. This publication is contributed to raise awareness of the fact that discrete solutions introduce numerical uncertainty. This uncertainty may, in some cases, overwhelm in complexity and magnitude other sources of uncertainty that include experimental variability, parametric uncertainty and modeling assumptions. The concepts of consistency, convergence and truncation error are overviewed to explain the articulation between the exact solution of continuous equations, the solution of modified equations and discrete solutions computed by a code. The current state-of-the-practice of code and solution verification activities is discussed. An example in the discipline of hydro-dynamics illustrates the significant effect that meshing can have on the quality of code predictions. A simple method is proposed to derive bounds of solution uncertainty in cases where the exact solution of the continuous equations, or its modified equations, is unknown. It is argued that numerical uncertainty originating from mesh discretization should always be quantified and accounted for in the overall uncertainty 'budget' that supports decision-making for applications in computational physics and engineering.

97 MATHEMATICS AND COMPUTING↗

Addressing Load Imbalance in Bioinformatics and Biomedical Applications: Efficient Scheduling across Multiple GPUs

Computational bioinformatics and biomedical applications frequently contain heterogeneously sized units of work or tasks, for instance due to variability in the sizes of biological sequences and molecules. Variable-sized workloads lead to load imbalances in parallel implementations which detract from efficiency and performance. Many modern computing resources now have multiple graphics processing units(GPUs) per computer for acceleration. These multiple GPU resources need to be used efficiently through balancing of workloads across the GPUs. OpenMP is a portable directive-based parallel programming API used ubiquitously in bioscience applications to program CPUs; recently, the use of OpenMP directives for GPU acceleration has become possible. Here, motivated by experiences with imbalanced loads in GPU-accelerated bioinformatics applications, we address the load balancing problem using OpenMP task-to-GPU scheduling combined with OpenMP GPU offloading for multiply heterogeneous workloads – loads with both variable input sizes, and simultaneously, variable convergence rates for algorithms with a stochastic component – scheduled across multiple GPUs. We aim to develop strategies which are both easy to use and have lower overheads, and may be incorporated incrementally in existing programs which already make use of OpenMP for CPU-based threading in order to make use of multi-GPU computers. We test different combinations of input size variability and convergence rate variability, and characterize the effects of these different scenarios on the performance of scheduling strategies across multiple GPUs with OpenMP. We present several dynamic scheduling solutions for different parallel patterns, explore optimizations, and provide publicly available example computational kernels to make these strategies easy to use in programs. This work will enable application developers to efficiently and easily use multiple GPUs for imbalanced workloads found in bioinformatics and biomedical applications.

Thavappiragasam, Mathialakan↗

High Performance Computing Systems Tools, Visualization, and Management

High Performance Computing (HPC) systems are complex setups of servers, storage devices, network switches, and cables that are specifically designed to accommodate hundreds of users running highly computationally intensive applications at a time. These applications require numerous softwares, licenses, and various levels of storage as well. All of these resources must be monitored and managed by HPC administrators, which presents a daunting task. In this project, I created numerous software tools as part of an HPC Visualization and Management system, which is now used by HPC administrators on a daily basis.

97 MATHEMATICS AND COMPUTING↗

Quantum simulation of molecules without fermionic encoding of the wave function

Abstract Molecular simulations generally require fermionic encoding in which fermion statistics are encoded into the qubit representation of the wave function. Recent calculations suggest that fermionic encoding of the wave function can be bypassed, leading to more efficient quantum computations. Here we show that the two-electron reduced density matrix (2-RDM) can be expressed as a unique functional of the unencoded N -qubit-particle wave function without approximation, and hence, the energy can be expressed as a functional of the 2-RDM without fermionic encoding of the wave function. In contrast to current hardware-efficient methods, the derived functional has a unique, one-to-one (and onto) mapping between the qubit-particle wave functions and 2-RDMs, which avoids the over-parametrization that can lead to optimization difficulties such as barren plateaus. An application to computing the ground-state energy and 2-RDM of H 4 is presented.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantum Computing and Simulations for Energy-Related Applications

Quantum Information Science (QIS) is an emerging field that has the potential to cause revolutionary advances in many areas of science and engineering, and nations around the world are vying for dominance in the field. To support DOE urgent task to make sure the U.S. wins the quantum race, in Spring of 2019 NETL started to establish and maintain QIS competency by focusing on energy-related applications. After more than five years’ hard-working, NETL QUEST (quantum for energy systems & technologies) team has made great progress on quantum sensing and quantum computing for energy applications. Significant outcomes have been achieved. To report our research progress and to propose new research directions, in this presentation at the American Physical Society (APS) annual meeting, I'm highlighting the progress of QUEST team on quantum computing for energy-related applications.

quantum computing↗