Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational efficiency”

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 487 records · Page 27

Heterogeneous high throughput scientific computing with APM X-Gene and Intel Xeon Phi

Electrical power requirements will be a constraint on the future growth of Distributed High Throughput Computing (DHTC) as used by High Energy Physics. Performance-per-watt is a critical metric for the evaluation of computer architectures for cost- efficient computing. Additionally, future performance growth will come from heterogeneous, many-core, and high computing density platforms with specialized processors. In this paper, we examine the Intel Xeon Phi Many Integrated Cores (MIC) co-processor and Applied Micro X-Gene ARMv8 64-bit low-power server system-on-a-chip (SoC) solutions for scientific computing applications. As a result, we report our experience on software porting, performance and energy efficiency and evaluate the potential for use of such technologies in the context of distributed computing systems such as the Worldwide LHC Computing Grid (WLCG).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Gaussian approximation potentials for accurate thermal properties of two-dimensional materials

Two-dimensional materials (2DMs) continue to attract a lot of attention, particularly for their extreme flexibility and superior thermal properties. Molecular dynamics simulations are among the most powerful methods for computing these properties, but their reliability depends on the accuracy of interatomic interactions. While first principles approaches provide the most accurate description of interatomic forces, they are computationally expensive. In contrast, classical force fields are computationally efficient, but have limited accuracy in interatomic force description. Machine learning interatomic potentials, such as Gaussian Approximation Potentials, trained on density functional theory (DFT) calculations offer a compromise by providing both accurate estimation and computational efficiency. Here, in this work, we present a systematic procedure to develop Gaussian approximation potentials for selected 2DMs, graphene, buckled silicene, and h-XN (X = B, Al, and Ga, as binary compounds) structures. We validate our approach through calculations that require various levels of accuracy in interatomic interactions. The calculated phonon dispersion curves and lattice thermal conductivity, obtained through harmonic and anharmonic force constants (including fourth order) are in excellent agreement with DFT results. HIPHIVE calculations, in which the generated GAP potentials were used to compute higher-order force constants instead of DFT, demonstrated the first-principles level accuracy of the potentials for interatomic force description. Molecular dynamics simulations based on phonon density of states calculations, which agree closely with DFT-based calculations, also show the success of the generated potentials in high-temperature simulations.

2D Materials↗

The Stochastic Parcel Model: A deterministic parameterization of stochastically entraining convection

Convective entrainment is a process that is poorly represented in existing convective parameterizations. By many estimates, convective entrainment is the leading source of error in global climate models. As a potential remedy, an Eulerian implementation of the Stochastic Parcel Model (SPM) is presented here as a convective parameterization that treats entrainment in a physically realistic and computationally efficient way. Drawing on evidence that convecting clouds comprise air parcels subject to Poisson-process entrainment events, the SPM calculates the deterministic limit of an infinite number of such parcels. For computational efficiency, the SPM groups parcels at each height by their purity, which is a measure of their total entrainment up to that height. This reduces the calculation of convective fluxes to a sequence of matrix multiplications. The SPM is implemented in a single-column model and compared with a large-eddy simulation of deep convection.

54 ENVIRONMENTAL SCIENCES↗

Parallel Implementation of the Recursive Approximation of an Unsupervised Hierarchical Segmentation Algorithm

The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.

Tilton, James C.↗

Rigorous justification for the space–split sensitivity algorithm to compute linear response in Anosov systems

Ruelle gave a formula for linear response of transitive Anosov diffeomorphisms. Recently, practically computable realizations of Ruelle's formula have emerged that potentially enable sensitivity analysis of certain high-dimensional chaotic numerical simulations encountered in the applied sciences. In this paper, we provide full mathematical justification for the convergence of one such efficient computation, the space–split sensitivity, or S3, algorithm. In S3, Ruelle's formula is computed as a sum of two terms obtained by decomposing the perturbation vector field into a coboundary and a remainder that is parallel to the unstable direction. Such a decomposition results in a splitting of Ruelle's formula that is amenable to efficient computation. Here, we prove the existence of the S3 decomposition and the convergence of the computations of both resulting components of Ruelle's formula.

97 MATHEMATICS AND COMPUTING↗

Computing Interactions Of Free-Space Radiation With Matter

High Charge and Energy Transport (HZETRN) computer program computationally efficient, user-friendly package of software adressing problem of transport of, and shielding against, radiation in free space. Designed as "black box" for design engineers not concerned with physics of underlying atomic and nuclear radiation processes in free-space environment, but rather primarily interested in obtaining fast and accurate dosimetric information for design and construction of modules and devices for use in free space. Computational efficiency achieved by unique algorithm based on deterministic approach to solution of Boltzmann equation rather than computationally intensive statistical Monte Carlo method. Written in FORTRAN.

Wilson, J. W.↗

A dynamic multi-timescale method for combustion modeling with detailed and reduced chemical kinetic mechanisms

A new on-grid dynamic multi-timescale (MTS) method is presented to increase significantly the computation efficiency involving multi-physical and chemical processes using detailed and reduced kinetic mechanisms. The methodology of the MTS method using the instantaneous timescales of different species is introduced. The definition of the characteristic time for species is examined and compared with that of the computational singular perturbation (CSP) and frozen reaction rate methods by using a simple reaction system. A hybrid multi-timescale (HMTS) algorithm is constructed by integrating the MTS method with an implicit Euler scheme, respectively, for species with and without the requirement of accurate time histories at sub-base timescales. The efficiency and the robustness of the MTS and HMTS methods are demonstrated by comparing with the Euler and VODE solvers for homogenous ignition and unsteady flame propagation of hydrogen, methane, and n-decane-air mixtures. The results show that both MTS and HMTS reproduce well the species and temperature histories and are able to decrease computation time by about one-order with the same kinetic mechanism. Compared to MTS, HMTS has slightly better computation efficiency but scarifies the stability at large base time steps. The results also show that with the increase of mechanism size and the decrease of time step, the computation efficiency of multi-timescale method increases compared to the VODE solver. In addition, it is shown that the integration of the multi-timescale method with the path flux analysis based mechanism reduction approach can further increase the computation efficiency. Unsteady simulations of outwardly propagating spherical n-decane-air premixed flames demonstrate that the multi-timescale method is rigorous for direct numerical simulations with both detailed and reduced chemistry and can dramatically improve the computation efficiency. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Velocity-Space Hybridization of Direct Simulation Monte Carlo and a Quasi-Particle Boltzmann Solver

This paper presents a new method for modeling rarefied gas flows based on hybridization of direct simulation Monte Carlo (DSMC) and discrete velocity method (DVM)-based quasi-particle representations of the velocity distribution function. It is aimed at improving the resolution of the tails of the distribution function (compared with DSMC) and computational efficiency (compared with DVM). Details of the method, such as the collision algorithm and the particle merging scheme, are discussed. The hybrid approach is applied to the study of noise in a Maxwellian distribution, computation of electron-impact ionization rate coefficient, as well as numerical simulation of a supersonic Couette flow. The hybrid-based solver is compared with pure DSMC and DVM approaches in terms of accuracy, computational speed, and memory use. It is shown that such a hybrid approach can provide a lower computational cost than a pure DVM approach, while being able to retain accuracy in modeling high-velocity tails of the distribution function. For problems where trace species have a significant impact on the flow physics, the proposed method is shown to be capable of providing better computational efficiency and accuracy compared with standard fixed-weight DSMC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-scale inverse model analyses employing fast randomized data reduction: INVERSE MODELING WITH DATA REDUCTION

When the number of observations is large, it is computationally challenging to apply classical inverse modeling techniques. We have developed a new computationally efficient technique for solving inverse problems with a large number of observations (e.g., on the order of 10 7 or greater). Our method, which we call the randomized geostatistical approach (RGA), is built upon the principal component geostatistical approach (PCGA). We employ a data reduction technique combined with the PCGA to improve the computational efficiency and reduce the memory usage. Specifically, we employ a randomized numerical linear algebra technique based on a so-called “sketching” matrix to effectively reduce the dimension of the observations without losing the information content needed for the inverse analysis. In this way, the computational and memory costs for RGA scale with the information content rather than the size of the calibration data. Our algorithm is coded in Julia and implemented in the MADS open-source high-performance computational framework (http://mads.lanl.gov). We apply our new inverse modeling method to invert for a synthetic transmissivity field. Compared to a standard geostatistical approach (GA), our method is more efficient when the number of observations is large. Moreover, our method is capable of solving larger inverse problems than the standard GA and PCGA approaches. Thus, our new model inversion method is a powerful tool for solving large-scale inverse problems. The method can be applied in any field and is not limited to hydrogeological applications such as the characterization of aquifer heterogeneity.

54 ENVIRONMENTAL SCIENCES↗

Accelerating self-consistent field iterations in Kohn-Sham density functional theory using a low-rank approximation of the dielectric matrix

We present an efficient preconditioning technique for accelerating the fixed-point iteration in real-space Kohn-Sham density functional theory (DFT) calculations. The preconditioner uses a low-rank approximation of the dielectric matrix (LRDM) based on Gâteaux derivatives of the residual of fixed-point iteration along appropriately chosen direction functions. We develop a computationally efficient method to evaluate these Gâteaux derivatives in conjunction with the Chebyshev filtered subspace iteration procedure, an approach widely used in large-scale Kohn-Sham DFT calculations. Further, we propose a variant of LRDM preconditioner based on adaptive accumulation of low-rank approximations from previous self-consistent field iterations, and also extend the LRDM preconditioner to spin-polarized Kohn-Sham DFT calculations. We demonstrate the robustness and efficiency of the LRDM preconditioner against other widely used preconditioners on a range of benchmark systems with sizes ranging from ~100 to 1100 atoms (~500–20,000 electrons). The benchmark systems include various combinations of metal-insulating-semiconducting heterogeneous material systems, nanoparticles with localized d orbitals near the Fermi energy, nanofilm with metal dopants, and magnetic systems. In all benchmark systems, the LRDM preconditioner converges robustly within 20–30 iterations. In contrast, other widely used preconditioners show slow convergence in many cases, as well as divergence of the fixed-point iteration in some cases. Lastly, we demonstrate the computational efficiency afforded by the LRDM method, with up to 3.4-fold reduction in computational cost for the total ground-state calculation compared to other preconditioners.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

MO-FG-CAMPUS-TeP2-01: A Graph Form ADMM Algorithm for Constrained Quadratic Radiation Treatment Planning

Purpose: In radiation therapy optimization the constraints can be either hard constraints which must be satisfied or soft constraints which are included but do not need to be satisfied exactly. Currently the voxel dose constraints are viewed as soft constraints and included as a part of the objective function and approximated as an unconstrained problem. However in some treatment planning cases the constraints should be specified as hard constraints and solved by constrained optimization. The goal of this work is to present a computation efficiency graph form alternating direction method of multipliers (ADMM) algorithm for constrained quadratic treatment planning optimization and compare it with several commonly used algorithms/toolbox. Method: ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. Various proximal operators were first constructed as applicable to quadratic IMRT constrained optimization and the problem was formulated in a graph form of ADMM. A pre-iteration operation for the projection of a point to a graph was also proposed to further accelerate the computation. Result: The graph form ADMM algorithm was tested by the Common Optimization for Radiation Therapy (CORT) dataset including TG119, prostate, liver, and head & neck cases. Both unconstrained and constrained optimization problems were formulated for comparison purposes. All optimizations were solved by LBFGS, IPOPT, Matlab built-in toolbox, CVX (implementing SeDuMi) and Mosek solvers. For unconstrained optimization, it was found that LBFGS performs the best, and it was 3–5 times faster than graph form ADMM. However, for constrained optimization, graph form ADMM was 8 – 100 times faster than the other solvers. Conclusion: A graph form ADMM can be applied to constrained quadratic IMRT optimization. It is more computationally efficient than several other commercial and noncommercial optimizers and it also used significantly less computer memory.

60 APPLIED LIFE SCIENCES↗

Development of a Multiphase Adjoint Capability in OpenFOAM

Thermal hydraulic predictions of flow regimes within nuclear reactor cores require significant computational resources and accuracy to ensure that the core design does not violate the thermal limits of materials. Multiphase computational fluid dynamics (CFD) has become a valuable computational capability for predicting flow characteristics as they relate to applications such as nuclear reactor safety and mixing phenomena around spacer grids within fuel assemblies. Multiphase CFD requires closure relationships for both the effects of turbulence as well as the transfer of mass, momentum, and energy between phases. Understanding the sensitivity of the parameters used in closure relationships is important for improving accuracy, but performing rigorous sensitivity analysis is computationally expensive. Adjoint mathematics have been utilized for reactor physics and fluid dynamics applications with respect to verification, sensitivity analysis, adaptive mesh refinement, and optimization. The usage of adjoint methods to predict the sensitivities of a variety of closure relationship parameters within a given problem has been shown to return sensitivity responses with significantly fewer computations than normal 'large-scale' methods. As the complexity of multiphase CFD methods increases, the demand for accurate verification tools and improvements in computational efficiency also increases, making the development of adjoint capabilities an attractive option. Closure relationships that describe interphase momentum physics in multiphase CFD modelling rely heavily on prescribed constants determined from experimental data. Due to the computational efficiency of an adjoint approach, the time to derive these closure relationships could be dramatically reduced, and data assimilation techniques could be used to return probability density functions of closure models derived using experimental data. This work develops a multiphase adjoint capability for the Eulerian-Eulerian two field, two phase equations. Specifically, the adjoint capability has been developed for the sub-cooled nucleate boiling solver boilEulerFoam developed by Dr. Nam Dinh of NC State University within the open-source CFD library OpenFOAM.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

IRIS-MASH: Efficient Multi-device Asynchronous Multi-Stream Heterogeneous Computing

In the rapidly evolving field of high-performance computing (HPC), effectively leveraging heterogeneous devices through asynchronous task programming is paramount. This paper presents a robust asynchronous task programming model tailored for a multi-device, multi-stream execution environment that incorporates a diverse array of heterogeneous computing units, including GPUs from various vendors and other accelerators. Current state-of-the-art task programming models provide methodologies to support asynchronous task executions, but they typically handle homogeneous devices using native programming languages, while support for heterogeneous devices is limited to frameworks like OpenCL. This gap presents significant challenges in abstracting heterogeneous devices to harness their true asynchronous capabilities effectively using their native programming languages. By implementing asynchronous task execution, our model significantly boosts the performance of tiled algorithm task graphs through overlapping data transfers with computation and enabling the simultaneous execution of multiple kernels. We integrate this approach into a heterogeneous Intelligent Runtime System (IRIS) and assess its performance using a suite of tiled algorithm benchmarks from the heterogeneous math kernels library (MatRIS) based on IRIS. Experimental results demonstrate a performance improvement ranging from 1.6 × to 2 × over IRIS without asynchronous support, and a notable 22% performance enhancement compared to established runtime systems such as StarPU and PaRSEC. This approach significantly improves computation efficiency of HPC workflows and provides a solid base for future exploration and development in the area of asynchronous task programming in heterogeneous systems.

Miniskar, Narasinga Rao [ORNL] (ORCID:000000018259↗

Recursive Newton-Euler formulation of manipulator dynamics

A recursive Newton-Euler procedure is presented for the formulation and solution of manipulator dynamical equations. The procedure includes rotational and translational joints and a topological tree. This model was verified analytically using a planar two-link manipulator. Also, the model was tested numerically against the Walker-Orin model using the Shuttle Remote Manipulator System data. The hinge accelerations obtained from both models were identical. The computational requirements of the model vary linearly with the number of joints. The computational efficiency of this method exceeds that of Walker-Orin methods. This procedure may be viewed as a considerable generalization of Armstrong's method. A six-by-six formulation is adopted which enhances both the computational efficiency and simplicity of the model.

Nasser, M. G.↗

Inverse methods for design of soft materials

Functional soft materials, comprising colloidal and molecular building blocks that self-organize into complex structures as a result of their tunable interactions, enable a wide array of technological applications. Inverse methods provide a systematic means for navigating their inherently high-dimensional design spaces to create materials with targeted properties. Furthermore, while multiple physically motivated inverse strategies have been successfully implemented in silico, their translation to guiding experimental materials discovery has thus far been limited to a handful of proof-of-concept studies. In this perspective, we discuss recent advances in inverse methods for design of soft materials that address two challenges: (1) methodological limitations that prevent such approaches from satisfying design constraints and (2) computational challenges that limit the size and complexity of systems that can be addressed. Strategies that leverage machine learning have proven particularly effective, including methods to discover order parameters that characterize complex structural motifs and schemes to efficiently compute macroscopic properties from the underlying structure. We also highlight promising opportunities to improve the experimental realizability of materials designed computationally, including discovery of materials with functionality at multiple thermodynamic states, design of externally directed assembly protocols that are simple to implement in experiments, and strategies to improve the accuracy and computational efficiency of experimentally relevant models.

36 MATERIALS SCIENCE↗

An Eulerian multimaterial framework for simulating high-explosive aquarium tests

Aquarium tests of cylindrical high-explosive charges provide optical data of the detonation front velocity and shape, propagation of the shock wave in the surrounding water, and expansion rates of the detonation products behind the front. Data from aquarium experiments is often used for calibration of reactive burn models based on phenomenological equations of state (EOS) and reaction rate laws. This paper presents a multimaterial numerical modeling framework to solve the 2D axisymmetric reactive Euler equations for high-explosive aquarium tests, in particular for ammonium nitrate - fuel oil (ANFO) explosives. An extension of the Ghost Fluid Method (GFM) is used to handle the dynamic material interfaces for the ANFO explosion products, the charge-confining material (polymethyl methacrylate PMMA), and the surrounding water. This study analyzes the sensitivity of calculations (both computational efficiency and numerical accuracy) to different algorithms for the material interface models including the original GFM versus Riemann solver-based strategies. A novel method for defining the left and right states in the interfacial Riemann problem eliminates the need for sorting or nodal interpolation during the projection along the material interface. Numerical tests indicate that populating the interface node values using the Riemann solution mitigate the overheating error observed in steady-state calculations. Solution convergence and computational efficiency are explored as a function of the spatial and temporal order of the schemes. Results from the computational model with analytical equations of state and fitted reaction rate parameters show very good quantitative agreement with experimentally observed detonation front velocity, reaction products expansion, and shock wave propagation in the surrounding water for a cylindrical ANFO charge encased in PMMA. Finally, the proposed modeling framework, in conjunction with experimental tests, provides a reliable tool to assess equations of state and reaction rate expressions for reactive burn models of confined high explosives.

42 ENGINEERING↗

Efficient Precoding for Single Carrier Modulation in Multi-User Massive MIMO Networks

Abstract—Frequency domain (FD) multi-user detection (MUD) and precoding has been shown to be an effective means of approaching the theoretical per-user capacity for single carrier modulation (SCM) schemes in massive MIMO scenarios with highly dispersive channels. When a cyclic prefix is added to the SCM waveform, the circulant structures of the resulting convolutional channel matrix allows for relatively simple expressions for the FD detection and precoding. In this paper, we further refine the computationally efficient minimum mean squared error (MMSE) FD-MUD technique in a time-division duplexing (TDD) massive MIMO setup by pre-computing the scale factor needed to produce an unbiased estimate. The resulting scale factor and the matrix inverse that was calculated for the uplink is then reused for the downlink to form a computationally efficient precoding scheme with superior performance compared to zero-forcing (ZF) precoding. Performance analysis is provided and confirmed through simulation results.

5G and Beyond Communications↗

Spoofing Cross-Entropy Measure in Boson Sampling

Cross-entropy (XE) measure is a widely used benchmark to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconducting qubits and boson sampling (BS). We present a heuristic classical algorithm that attains a better XE than the current BS experiments in a verifiable regime and is likely to attain a better XE score than the near-future BS experiments in a reasonable running time. The key idea behind the algorithm is that there exist distributions that correlate with the ideal BS probability distribution and that can be efficiently computed. The correlation and the computability of the distribution enable us to postselect heavy outcomes of the ideal probability distribution without computing the ideal probability, which essentially leads to a large XE. Our method scores a better XE than the recent Gaussian BS experiments when implemented at intermediate, verifiable system sizes. Much like current state-of-the-art experiments, we cannot verify that our spoofer works for quantum-advantage-size systems. However, we demonstrate that our approach works for much larger system sizes in fermion sampling, where we can efficiently compute output probabilities. Finally, we provide analytic evidence that the classical algorithm is likely to spoof noisy BS efficiently.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗