Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational”

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,423 records · Page 79

On the Usage of Ultrasound Computational Models for Decision Making Under Ambiguity

Computer modeling and simulation is becoming pervasive within the non-destructive evaluation (NDE) industry as a convenient tool for designing and assessing inspection techniques. This raises a pressing need for developing quantitative techniques for demonstrating the validity and applicability of the computational models. Computational models provide deterministic results based on deterministic and well-defined input, or stochastic results based on inputs defined by probability distributions. However, computational models cannot account for the effects of personnel, procedures, and equipment, resulting in ambiguity about the efficacy of inspections based on guidance from computational models only. In addition ambiguity arises when model inputs, such as the representation of realistic cracks, cannot be defined deterministically, probabilistically, or by intervals. In this work, Pacific Northwest National Laboratory demonstrates the ability of computational models to represent field measurements under known variabilities, and quantify the differences using maximum amplitude and power spectrum density metrics. Sensitivity studies are also conducted to quantify the effects of different input parameters on the simulation results.

Dib, Gerges↗

Domain wall-magnetic tunnel junction spin–orbit torque devices and circuits for in-memory computing

There are pressing problems with traditional computing, especially for accomplishing data-intensive and real-time tasks, that motivate the development of in-memory computing devices to both store information and perform computation. Magnetic tunnel junction memory elements can be used for computation by manipulating a domain wall, a transition region between magnetic domains, but the experimental study of such devices has been limited by high current densities and low tunnel magnetoresistance. Here, we study prototypes of three-terminal domain wall-magnetic tunnel junction in-memory computing devices that can address data processing bottlenecks and resolve these challenges by using perpendicular magnetic anisotropy, spin–orbit torque switching, and an optimized lithography process to produce average device tunnel magnetoresistance TMR = 171% and average resistance-area product RA = 29 Ω μm2, close to the RA of the unpatterned film. Device initialization variation in switching voltage is shown to be curtailed to 7%–10% by controlling the domain wall initial position, which we show corresponds to 90%–96% accuracy in a domain wall-magnetic tunnel junction full adder simulation. Repeatability of writing and resetting the device is shown. A circuit shows an inverter operation between two devices, showing that a voltage window is large enough, compared to the variation noise, to repeatably operate a domain wall-magnetic tunnel junction circuit. These results make strides in using magnetic tunnel junctions and domain walls for in-memory and neuromorphic computing applications.

Alamdar, Mahshid (ORCID:0000000221732935)↗

Pressure-driven tearing and thermal transport in finite-beta reversed field pinch computations

In this work, nonlinear resistive-magnetohydrodynamics (MHD) computation with heating and anisotropic transport is applied to examine the interaction between thermal energy and magnetic fluctuations in inductively driven reversed-field pinches (RFPs). The magnetic fluctuations underlie magnetic field reversal through dynamo-like correlations, and they enhance thermal energy transport through fluctuations of parallel heat flux density. With the unfavorable magnetic curvature that exists across the RFP profile, thermal energy also affects the magnetic fluctuations. Computations with the NIMROD code [Sovinec et al., J. Comput. Phys. 195, 355–386 (2004)] integrate nonlinear MHD dynamics with energy transport and reproduce an RFP state with experimentally relevant values of plasma-β. Equilibria constructed from results of the 3D computations are analyzed to assess the sources of free energy in the saturated nonlinear state. Linear computations for these profiles show unstable modes of tearing parity. Their eigenfunctions are used to evaluate and compare stabilizing and destabilizing contributions to the kinetic energy integral. An assessment of the drives in the integral reveals that the pressure gradient drive is of comparable magnitude to the parallel current drive, and only the sum of the two surpasses the stabilizing contributions. Correlation of magnetic and parallel heat flux density fluctuations in the nonlinear computations shows that fluctuation-induced thermal conduction is the dominant mode of energy loss, as expected from experimental evidence. Decomposition of the fluctuating heat flux density shows that second-order correlations, alone, do not explain the total energy transport. Higher-order correlations are also important.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Computational approaches to model X-ray photon correlation spectroscopy from molecular dynamics

X-ray photon correlation spectroscopy (XPCS) allows for the resolution of dynamic processes within a material across a wide range of length and time scales. X-ray speckle visibility spectroscopy (XSVS) is a related method that uses a single diffraction pattern to probe ultrafast dynamics. Interpretation of the XPCS and XSVS data in terms of underlying physical processes is necessary to establish the connection between the macroscopic responses and the microstructural dynamics. To aid the interpretation of the XPCS and XSVS data, we present a computational framework to model these experiments by computing the X-ray scattering intensity directly from the atomic positions obtained from molecular dynamics simulations. We compare the efficiency and accuracy of two alternative computational methods: the direct method computing the intensity at each diffraction vector separately, and a method based on fast Fourier transform that computes the intensities at all diffraction vectors at once. Furthermore, the computed X-ray speckle patterns capture the density fluctuations over a range of length and time scales and are shown to reproduce the known properties and relations of experimental XPCS and XSVS for liquids.

36 MATERIALS SCIENCE↗

UNEDF: Advanced Scientific Computing Collaboration Transforms the Low-Energy Nuclear Many-Body Problem

The demands of cutting-edge science are driving the need for larger and faster computing resources. With the rapidly growing scale of computing systems and the prospect of technologically disruptive architectures to meet these needs, scientists face the challenge of effectively using complex computational resources to advance scientific discovery. Multi-disciplinary collaborating networks of researchers with diverse scientific backgrounds are needed to address these complex challenges. The UNEDF SciDAC collaboration of nuclear theorists, applied mathematicians, and computer scientists is developing a comprehensive description of nuclei and their reactions that delivers maximum predictive power with quantified uncertainties. This paper describes UNEDF and identifies attributes that classify it as a successful computational collaboration. Finally, we illustrate significant milestones accomplished by UNEDF through integrative solutions using the most reliable theoretical approaches, most advanced algorithms, and leadership-class computational resources.

Nam, H.↗

A case study evaluating the portability of an executable computable phenotype algorithm across multiple institutions and electronic health record environments

Abstract Electronic health record (EHR) algorithms for defining patient cohorts are commonly shared as free-text descriptions that require human intervention both to interpret and implement. We developed the Phenotype Execution and Modeling Architecture (PhEMA, http://projectphema.org) to author and execute standardized computable phenotype algorithms. With PhEMA, we converted an algorithm for benign prostatic hyperplasia, developed for the electronic Medical Records and Genomics network (eMERGE), into a standards-based computable format. Eight sites (7 within eMERGE) received the computable algorithm, and 6 successfully executed it against local data warehouses and/or i2b2 instances. Blinded random chart review of cases selected by the computable algorithm shows PPV ≥90%, and 3 out of 5 sites had >90% overlap of selected cases when comparing the computable algorithm to their original eMERGE implementation. This case study demonstrates potential use of PhEMA computable representations to automate phenotyping across different EHR systems, but also highlights some ongoing challenges.

Pacheco, Jennifer A.↗

Quantum-classical hybrid algorithm using an error-mitigating N -representability condition to compute the Mott metal-insulator transition

Quantum algorithms for molecular electronic structure have been developed with lower computational scaling than their classical counterparts, but emerging quantum hardware is far from being capable of the coherence, connectivity, and gate errors required for their experimental realization. Here we propose a class of quantumclassical hybrid algorithms that computes the energy from a two-electron reduced density matrix (2-RDM). The 2-RDM is constrained by $N$-representability conditions, constraints for representing an $N$-electron wave function, which mitigate noise from the quantum circuit. We compute the strongly correlated dissociation of doublet H 3 into three hydrogen atoms. The hybrid quantum-classical computer matches the energies from full configuration interaction to 0.1 kcal/mol, one-tenth of “chemical accuracy,” even in the strongly correlated limit of dissociation. Furthermore, the spatial locality of the computed one-electron RDM reveals that the quantum computer accurately predicts the Mott metal-insulator transition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Group theoretical approach to computing phonons and their interactions

Phonons and their interactions are necessary for determining a wide range of materials properties. In this paper, we present four independent advances which facilitate the computation of phonons and their interactions from first principles. First, we implement a group-theoretical approach to construct the order $\mathcal {N}$ Taylor series of a d-dimensional crystal purely in terms of space group irreducible derivatives (ID), which guarantees symmetry by construction and allows for a practical means of communicating and storing phonons and their interactions. Second, we prove that the smallest possible supercell which accommodates $\mathcal {N}$ given wave vectors in a d-dimensional crystal is determined using the Smith normal form of the matrix formed from the corresponding wave vectors; resulting in negligible computational cost to find said supercell, in addition to providing the maximum required multiplicity for uniform supercells at arbitrary $\mathcal {N}$ and d. Third, we develop a series of finite displacement methodologies to compute phonons and their interactions which exploit the first two developments: lone and bundled irreducible derivative (LID and BID) approaches. LID computes a single ID, or as few as possible, at a time in the smallest supercell possible, while BID exploits perturbative derivatives for some order less than $\mathcal {N}$ (e.g., Hellman-Feynman forces) in order to extract all ID in the smallest possible supercells using the fewest possible computations. Finally, we derive an equation for the order N volume derivatives of the phonons in terms of the order $\mathcal {N}$ = N + 2 ID. Given that the former are easily computed, they can be used as a stringent, infinite ranged test of the ID. Our general framework is illustrated on graphene, yielding irreducible phonon interactions to fifth order. Additionally, we provide a cost analysis for the rocksalt structure at $\mathcal {N}$ = 3, demonstrating a massive speedup compared to popular finite displacement methods in the literature.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Dual computations of non-Abelian Yang-Mills theories on the lattice

In the past several decades there have been a number of proposals for computing with dual forms of non-Abelian Yang-Mills theories on the lattice. Motivated by the gauge-invariant, geometric picture offered by dual models and successful applications of duality in the U(1) case, we revisit the question of whether it is practical to perform numerical computation using non-Abelian dual models. Specifically, we consider three-dimensional SU(2) pure Yang-Mills as an accessible yet nontrivial case in which the gauge group is non-Abelian. Using methods developed recently in the context of spin foam quantum gravity, we derive an algorithm for efficiently computing the dual amplitude and describe Metropolis moves for sampling the dual ensemble. We relate our algorithms to prior work in non-Abelian dual computations of Hari Dass and his collaborators, addressing several problems that have been left open. We report results of spin expectation value computations over a range of lattice sizes and couplings that are in agreement with our conventional lattice computations. We conclude with an outlook on further development of dual methods and their application to problems of current interest.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Computational efficiency of frequency- and time-domain calculations of extreme mass-ratio binaries: Equatorial orbits

Gravitational waveforms and fluxes from extreme mass-ratio inspirals can be computed using time-domain methods with accuracy that is fast approaching that of frequency-domain methods. We study in detail the computational efficiency of these methods for equatorial orbits of fast spinning Kerr black holes, and find the number of modes needed in either method--as functions of the orbital parameters--in order to achieve a desired accuracy level. We then estimate the total computation time and argue that for high-eccentricity orbits the time-domain approach may be more efficient computationally. We suggest that in practice low-m modes are computed using the frequency-domain approach, and high-m modes are computed using the time-domain approach, where m is the azimuthal mode number.

79 ASTRONOMY AND ASTROPHYSICS↗

Accurate optimization of amino acid form factors for computing small-angle X-ray scattering intensity of atomistic protein structures

Structure modelling via small-angle X-ray scattering (SAXS) data generally requires intensive computations of scattering intensity from any given biomolecular structure, where the accurate evaluation of SAXS profiles using coarse-grained (CG) methods is vital to improve computational efficiency. To date, most CG SAXS computing methods have been based on a single-bead-per-residue approximation but have neglected structural correlations between amino acids. To improve the accuracy of scattering calculations, accurate CG form factors of amino acids are now derived using a rigorous optimization strategy, termed electron-density matching (EDM), to best fit electron-density distributions of protein structures. This EDM method is compared with and tested against other CG SAXS computing methods, and the resulting CG SAXS profiles from EDM agree better with all-atom theoretical SAXS data. By including the protein hydration shell represented by explicit CG water molecules and the correction of protein excluded volume, the developed CG form factors also reproduce the selected experimental SAXS profiles with very small deviations. Taken together, these EDM-derived CG form factors present an accurate and efficient computational approach for SAXS computing, especially when higher molecular details (represented by the q range of the SAXS data) become necessary for effective structure modelling.

Tong, Dudu↗

Biomimetic, Soft-Material Synapse for Neuromorphic Computing: from Device to Network

Neuromorphic computing refers to a variety of brain-inspired computers, devices, and models inspired by the interconnectivity, performance, and energy efficiency of the human brain. Unlike the ubiquitous von Neumann computer architectures with complex processor cores and sequential computation, biological neurons and synapses operate by storing and processing information simultaneously with the capacity of flexible adaptation resulting in massive computational capability with much less power consumption. The search for a synaptic material which can closely imitate bio-synapse has led to an alamethicin-doped, synthetic biomembrane which can emulate key synaptic functions due to generic memristive property enabling learning and computation. This two-terminal, biomolecular memristor, in contrast to its solid-state counterparts, features similar structure, switching mechanism, and ionic transport modality as biological synapses while consuming considerably lower power. In this paper, we outline a methodology for using this biomolecular synapse to build neural networks capable of solving real-world problems. The physical mechanism underlying its volatile memristance is explored followed by the development of a model of this device for circuit simulation. We outline a circuit design technique to integrate this synapse with solid-state neuron circuit for hardware implementation. Based on these results, we develop a high level simulation framework and use a training scheme called Evolutionary Optimization for Neuromorphic System (EONS) to generate networks for solving two problems, namely iris dataset classification and EEG classification task. The small network size and comparable to state-of-the-art accuracy of these preliminary networks show its potential to enhance synaptic functionality in next generation neuromorphic hardware.

Sakib hasan, Md↗

A High Performance Computational Framework for Dynamic Security Assessment under Uncertainty

Dynamic security assessment (DSA) is a critical function to evaluate power grids’ capability to survive the transition caused by a set of disturbances to an acceptable steady-state condition. Its computational burden is heavy. With the challenges brought by renewable energy and new smart grid technologies, DSA under uncertainty has to be considered to study the impact of forecast errors on DSA simulation, which further increases the computational burden. To address this challenge, this paper presents a high performance computational framework to support DSA simulation user uncertainty. The computational framework aims to provide a seamless workflow that links data from high performance computing, statistical analysis, to visualization so that a problem can be easily expressed in a way compatible with different functions. It also enables software compatibility such that application development can be more efficient. Case study results of the ESCA60 system and a western U.S. size system show the advantages and efficiency of the computational framework.

dynamic security assessment, high performance comp↗

Towards Redefining the Reproducibility in Quantum Computing: A Data Analysis Approach on NISQ Devices

Although the building of quantum computers has kept making rapid progress in recent years, noise is still the main challenge for any application to leverage the power of quantum computing. Existing works addressing noise in quantum devices proposed noise reduction when deploying a quantum algorithm to a specified quantum computer. The reproducibility issue of quantum algorithms has been raised since the noise levels vary on different quantum computers. Importantly, existing works largely ignore the fact that the noise of quantum devices varies as time goes by. Therefore, reproducing the results on the same hardware will even become a problem. We analyze the reproducibility of quantum machine learning (QML) algorithms based on daily model training and execution data collection. Our analysis shows a correlation between our QML models’ test accuracy and quantum computer hardware’s calibration features. We also demonstrate that noisy simulators for quantum computers are not a reliable tool for quantum machine learning applications.

Senapati, Priyabrata↗

Exploring Cloud Computing for Large-scale Scientific Applications

This paper explores cloud computing for large-scale data-intensive scientific applications. Cloud computing is attractive because it provides hardware and software resources on-demand, which relieves the burden of acquiring and maintaining a huge amount of resources that may be used only once by a scientific application. However, unlike typical commercial applications that often just requires a moderate amount of ordinary resources, large-scale scientific applications often need to process enormous amount of data in the terabyte or even petabyte range and require special high performance hardware with low latency connections to complete computation in a reasonable amount of time. To address these challenges, we build an infrastructure that can dynamically select high performance computing hardware across institutions and dynamically adapt the computation to the selected resources to achieve high performance. We have also demonstrated the effectiveness of our infrastructure by building a system biology application and an uncertainty quantification application for carbon sequestration, which can efficiently utilize data and computation resources across several institutions.

Lin, Guang↗

Select Advances in Computational Accelerator Physics

Computational accelerator physics has changed and broadened over the last decade or so. Part of the change is due to the advent of multiple ways of parallel computing. Another part comes from algorithmic developments. The multiple ways of parallel computing include distributed memory parallelism and on-chip parallelism, with the latter coming from architectures (CPU and GPU) having multiple processing elements (cores or streaming multiprocessors) and wide vector (SIMD) instruction units. The basics of these new architectures and their application to computational accelerator physics are briefly reviewed. Algorithmic advances in the select areas of spin tracking, cavity calculations, plasma acceleration, and electron cooling are also reviewed. In some cases the algorithms provide increased fidelity improving the overall accuracy, while in other cases, such as controlled dispersion, the algorithms provide increased fidelity by better modeling the essential physical interaction. Finally, the use of computational frameworks, which provide the basic computational infrastructure, while allowing the capability developer to concentrate on the math and physics, is reviewed in the context of the Vorpal application, which has found use across accelerator physics and many other fields.

Engineering↗

Enhancing risk and crisis communication with computational methods: A systematic literature review

Abstract Recent developments in risk and crisis communication (RCC) research combine social science theory and data science tools to construct effective risk messages efficiently. However, current systematic literature reviews (SLRs) on RCC primarily focus on computationally assessing message efficacy as opposed to message efficiency. We conduct an SLR to highlight any current computational methods that improve message construction efficacy and efficiency. We found that most RCC research focuses on using theoretical frameworks and computational methods to analyze or classify message elements that improve efficacy. For improving message efficiency, computational and manual methods are only used in message classification. Specifying the computational methods used in message construction is sparse. We recommend that future RCC research apply computational methods toward improving efficacy and efficiency in message construction. By improving message construction efficacy and efficiency, RCC messaging would quickly warn and better inform affected communities impacted by current hazards. Such messaging has the potential to save as many lives as possible.

Mathematical Methods In Social Sciences↗

Comparison of a Full-Scale and a 1:10 Scale Low-Speed Two-Stroke Marine Engine Using Computational Fluid Dynamics

International marine shipping is a growing component of international trade; a vast majority of all the world’s goods are being transported on large ocean-going vessels. The International Maritime Organization (IMO) introduced the Energy Efficiency Design Index in 2013, a regulatory framework of associated metrics for reducing emissions of CO 2 per tonne-mile from shipping by approximately 10% each decade. Therefore, decarbonizing the maritime sector requires the development of new fuel sources. Because of the extremely large physical size of the internal combustion engines present in shipping vessels, experimental iterative development of the engine and fuel system is cost-prohibitive. Thus, the ability to perform combustion system development in a scaled platform that can be more easily operated and modeled computationally is of interest. To that end, scaling relationships are needed to translate the results from a smaller engine to a larger counterpart. Scaling studies to date have been restricted to low scaling ratios, four-stroke light-duty engines, and under-resolved computational fluid dynamic simulations that likely do not accurately capture the physics of scaling. In this work, computational models of a 1:10 scale and a full-scale two-stroke crosshead low-speed marine engine were created and validated against experiments obtained in a real 1:10 scale engine installed at Oak Ridge National Laboratory. Further, due to the large size of the full-scale engine, the model required large high-performance computing resources to be evaluated. The availability of high-performance computing resources at the Department of Energy’s Leadership Computing Facilities is an enabler of the current work. The results of the small- and large-scale engine simulations were compared to analyze the effectiveness of the appropriate scaling laws under these extreme scaling ratio conditions.

33 ADVANCED PROPULSION SYSTEMS↗