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 1,063 records · Page 59

Nonlinear burn control in ITER using adaptive allocation of actuators with uncertain dynamics

Abstract ITER will be the first tokamak to sustain a fusion-producing, or burning, plasma. If the plasma temperature were to inadvertently rise in this burning regime, the positive correlation between temperature and the fusion reaction rate would establish a destabilizing positive feedback loop. Careful regulation of the plasma’s temperature and density, or burn control, is required to prevent these potentially reactor-damaging thermal excursions, neutralize disturbances and improve performance. In this work, a Lyapunov-based burn controller is designed using a full zero-dimensional nonlinear model. An adaptive estimator manages destabilizing uncertainties in the plasma confinement properties and the particle recycling conditions (caused by plasma–wall interactions). The controller regulates the plasma density with requests for deuterium and tritium particle injections. In ITER-like plasmas, the fusion-born alpha particles will primarily heat the plasma electrons, resulting in different electron and ion temperatures in the core. By considering separate response models for the electron and ion energies, the proposed controller can independently regulate the electron and ion temperatures by requesting that different amounts of auxiliary power be delivered to the electrons and ions. These two commands for a specific control effort (electron and ion heating) are sent to an actuator allocation module that optimally maps them to the heating actuators available to ITER: an electron cyclotron heating system (20 MW), an ion cyclotron heating system (20 MW), and two neutral beam injectors (16.5 MW each). Two different actuator allocators are presented in this work. The first actuator allocator finds the optimal mapping by solving a convex quadratic program that includes actuator saturation and rate limits. It is nonadaptive and assumes that the mapping between the commanded control efforts and the allocated actuators (i.e. the effector model) contains no uncertainties. The second actuator allocation module has an adaptive estimator to handle uncertainties in the effector model. This uncertainty includes actuator efficiencies, the fractions of neutral beam heating that are deposited into the plasma electrons and ions, and the tritium concentration of the fueling pellets. Furthermore, the adaptive allocator considers actuator dynamics (actuation lag) that contain uncertainty. This adaptive allocation algorithm is more computationally efficient than the aforementioned nonadaptive allocator because it is computed using dynamic update laws so that finding the solution to a static optimization problem is not required at every time step. A simulation study assesses the performance of the proposed adaptive burn controller augmented with each of the actuator allocation modules.

Physics↗

Fluid simulations with atomistic resolution: a hybrid multiscale method with field-wise coupling

We present a new hybrid method for simulating dense fluid systems that exhibit multiscale behaviour, in particular, systems in which a Navier–Stokes model may not be valid in parts of the computational domain. We apply molecular dynamics as a local microscopic refinement for correcting the Navier–Stokes constitutive approximation in the bulk of the domain, as well as providing a direct measurement of velocity slip at bounding surfaces. Our hybrid approach differs from existing techniques, such as the heterogeneous multiscale method (HMM), in some fundamental respects. In our method, the individual molecular solvers, which provide information to the macro model, are not coupled with the continuum grid at nodes (i.e. point-wise coupling), instead coupling occurs over distributed heterogeneous fields (here referred to as field-wise coupling). This affords two major advantages. Whereas point-wise coupled HMM is limited to regions of flow that are highly scale-separated in all spatial directions (i.e. where the state of non-equilibrium in the fluid can be adequately described by a single strain tensor and temperature gradient vector), our field-wise coupled HMM has no such limitations and so can be applied to flows with arbitrarily-varying degrees of scale separation (e.g. flow from a large reservoir into a nano-channel). The second major advantage is that the position of molecular elements does not need to be collocated with nodes of the continuum grid, which means that the resolution of the microscopic correction can be adjusted independently of the resolution of the continuum model. This in turn means the computational cost and accuracy of the molecular correction can be independently controlled and optimised. The macroscopic constraints on the individual molecular solvers are artificial body-force distributions, used in conjunction with standard periodicity. We test our hybrid method on the Poiseuille flow problem for both Newtonian (Lennard-Jones) and non-Newtonian (FENE) fluids. The multiscale results are validated with expensive full-scale molecular dynamics simulations of the same case. Very close agreement is obtained for all cases, with as few as two micro elements required to accurately capture both the Newtonian and non-Newtonian flowfields. Our multiscale method converges very quickly (within 3–4 iterations) and is an order of magnitude more computationally efficient than the full-scale simulation.

97 MATHEMATICS AND COMPUTING↗

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

Computing material volume fractions on a superimposed mesh as applied to Monte Carlo particle transport simulations

Here, we present a newly implemented ray tracing algorithm in OpenMC for efficiently computing material volume fractions on superimposed meshes in complex geometries. By firing rays along each coordinate direction through the geometry, the approach accumulates track-length data in each mesh element, thereby determining the fractional composition of each material. Scaling studies on three different models—a random tetrahedra configuration, the Frascati Neutron Generator ITER dose rate benchmark, and a stellarator design—show excellent parallel performance, with nearly linear speedup on modern multi-threaded and distributed-memory systems. An analysis of the residual error relative to high-resolution reference solutions demonstrated that under optimal conditions it decreases as 1/R, where R is the number of rays fired, making it straightforward to achieve user-prescribed accuracy. This new functionality enables practical, mesh-based approaches for detailed nuclear analyses in production Monte Carlo workflows without resorting to expensive, fully conformal or unstructured meshing.

Monte Carlo↗

Automated and efficient local adaptive regression for principal component-based reduced-order modeling of turbulent reacting flows

Principal Component Analysis can be used to reduce the cost of Computational Fluid Dynamics simulations of turbulent reacting flows by reducing the dimensionality of the transported variables through projection of the thermochemical state onto a lower-dimensional manifold. However, because of the nonlinearity of the principal component source terms, nonlinear regression techniques must be utilized for the source terms in terms of the principal components. Unfortunately, widely available and utilized nonlinear regression techniques can have prohibitive computational requirements and/or accuracy that is highly dependent on user experience in ad hoc tuning of model architecture and hyperparameters. Here, in this work, a new nonlinear regression approach is proposed that is both computationally efficient and automated so does not require any user input. The approach is evaluated through a priori prediction of principal component source terms using data from a Direct Numerical Simulation of a turbulent nonpremixed n-heptane/air jet flame. In particular, the proposed framework consists of local regressions whose complexity is adapted according to the local nonlinearity of the data: local linear regression when accurate enough and local Artificial Neural Networks when nonlinear regression is required. The number of local clusters for local regression is determined automatically using the Davies-Bouldin index. In addition, Bayesian optimization is utilized for model training (i.e., to select the best architectures and hyperparameters of the nonlinear regressions in an unsupervised fashion), eliminating ad hoc hand-tuning and/or expensive grid searches. Overall, compared to a single, global neural network, the new local adaptive regression approach is shown to have comparable accuracy but 69% less training time due to the utilization of local linear regression and faster training of local neural networks.

42 ENGINEERING↗

Neurobiological computational models in structural analysis and design

The present paper examines the role of neural computing strategies in structural analysis and design. A principal focus of the work resides in the use of neural networks to represent the force-displacement relationship in static structural analysis. Such models provide computationally efficient capabilities for reanalysis, and appear to be well suited for application in numerical optimum design. The paper presents an overview of the neural computing approach, with special emphasis on supervised learning techniques adopted in the present work. Special features of such learning strategies which have a direct bearing on numerical accuracy and efficiency, are examined in the context of representative structural optimization problems.

Hajela, P.↗

Neurobiological computational models in structural analysis and design

This paper examines the role of neural computing strategies in structural analysis and design. A principal focus of the work resides in the use of neural networks to represent the force-displacement relationship in static structural analysis. Such models provide computationally efficient capabilities for reanalysis, and appear to be well suited for application in numerical optimum design. The paper presents an overview of the neutral computing approach, with special emphasis on supervised learning techniques adopted in the present work. Special features of such learning strategies which have a direct bearing on numerically accuracy and efficiency, are examined in the context of representative structural optimization problems.

Hajela, P.↗

Technical Report: Toward a Scalable Algorithm to Compute High-Dimensional Integrals of Arbitrary Functions

Neutron experiments at the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory (ORNL) frequently generate large amounts of data (on the order of 106-1012 data points). Hence, traditional data analysis tools run on a single CPU take too long to be practical and scientists are unable to efficiently analyze all data generated by experiments. Our goal is to develop a scalable algorithm to efficiently compute high-dimensional integrals of arbitrary functions. This algorithm can then be used to integrate the four-dimensional integrals that arise as part of modeling intensity from the experiments at the SNS. Here, three different one-dimensional numerical integration solvers from the GNU Scientific Library were modified and implemented to solve four-dimensional integrals. The results of these solvers on a final integrand provided by scientists at the SNS can be compared to the results of other methods, such as quasi-Monte Carlo methods, computing the same integral. A parallelized version of the most efficient method can allow scientists the opportunity to more effectively analyze all experimental data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Augmented Lagrangian formulation of orbital-free density functional theory

We present an Augmented Lagrangian formulation and its real-space implementation for non-periodic Orbital-Free Density Functional Theory (OF-DFT) calculations. In particular, we rewrite the constrained minimization problem of OF-DFT as a sequence of minimization problems without any constraint, thereby making it amenable to powerful unconstrained optimization algorithms. Further, we develop a parallel implementation of this approach for the Thomas–Fermi–von Weizsacker (TFW) kinetic energy functional in the framework of higher-order finite-differences and the conjugate gradient method. With this implementation, we establish that the Augmented Lagrangian approach is highly competitive compared to the penalty and Lagrange multiplier methods. Additionally, we show that higher-order finite-differences represent a computationally efficient discretization for performing OF-DFT simulations. Overall, we demonstrate that the proposed formulation and implementation are both efficient and robust by studying selected examples, including systems consisting of thousands of atoms. We validate the accuracy of the computed energies and forces by comparing them with those obtained by existing plane-wave methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Object detection with deep learning for rare event search in the GADGET II TPC

In the pursuit of identifying rare two-particle events within the GADGET II Time Projection Chamber (TPC), this paper presents a comprehensive approach for leveraging Convolutional Neural Networks (CNNs) and various data processing methods. To address the inherent complexities of 3D TPC track reconstructions, the data is expressed in 2D projections and 1D quantities. This approach capitalizes on the diverse data modalities of the TPC, allowing for the efficient representation of the distinct features of the 3D events, with no loss in topology uniqueness. Additionally, it leverages the computational efficiency of 2D CNNs and benefits from the extensive availability of pre-trained models. Given the scarcity of real training data for the rare events of interest, simulated events are used to train the models to detect real events. To account for potential distribution shifts when predominantly depending on simulations, significant perturbations are embedded within the simulations. This produces a broad parameter space that works to account for potential physics parameter and detector response variations and uncertainties. These parameter-varied simulations are used to train sensitive 2D CNN object detectors. When combined with 1D histogram peak detection algorithms, this multi-modal detection framework is highly adept at identifying rare, two-particle events in data taken during experiment 21072 at the Facility for Rare Isotope Beams (FRIB), demonstrating a 100% recall for events of interest. Here, we present the methods and outcomes of our investigation and discuss the potential future applications of these techniques.

Convolutional neural network↗

High-Accuracy Semiempirical Quantum Models Based on a Minimal Training Set

A great need exists for computationally efficient quantum simulation approaches that can achieve an accuracy similar to high-level theories at a fraction of the computational cost. In this regard, we have leveraged a machine-learned interaction potential based on Chebyshev polynomials to improve density functional tight binding (DFTB) models for organic materials. The benefit of our approach is two-fold: (1) many-body interactions can be corrected for in a systematic and rapidly tunable process, and (2) high-level quantum accuracy for a broad range of compounds can be achieved with ~0.3% of data required for one advanced deep learning potential. Our model exhibits both transferability and extensibility through comparison to quantum chemical results for organic clusters, solid carbon phases, and molecular crystal phase stability rankings. Overall, our efforts thus allow for high-throughput physical and chemical predictions with up to coupled-cluster accuracy for systems that are computationally intractable with standard approaches.

36 MATERIALS SCIENCE↗

Diagnosing heterogeneous dynamics in single-molecule/particle trajectories with multiscale wavelets

In this study, we describe a simple automated method to extract and quantify transient heterogeneous dynamical changes from large data sets generated in single-molecule/particle tracking experiments. Based on wavelet transform, the method transforms raw data to locally match dynamics of interest. This is accomplished using statistically adaptive universal thresholding, whose advantage is to avoid a single arbitrary threshold that might conceal individual variability across populations. How to implement this multiscale method is described, focusing on local confined diffusion separated by transient transport periods or hopping events, with three specific examples: in cell biology, biotechnology, and glassy colloid dynamics. The discussion is generalized within the framework of continuous time random walk. This computationally efficient method can run routinely on hundreds of millions of data points analyzed within an hour on a desktop personal computer.

36 MATERIALS SCIENCE↗

Multi-reward reinforcement learning based development of inter-atomic potential models for silica

Abstract Silica is an abundant and technologically attractive material. Due to the structural complexities of silica polymorphs coupled with subtle differences in Si–O bonding characteristics, the development of accurate models to predict the structure, energetics and properties of silica polymorphs remain challenging. Current models for silica range from computationally efficient Buckingham formalisms (BKS, CHIK, Soules) to reactive (ReaxFF) and more recent machine-learned potentials that are flexible but computationally costly. Here, we introduce an improved formalism and parameterization of BKS model via a multireward reinforcement learning (RL) using an experimental training dataset. Our model concurrently captures the structure, energetics, density, equation of state, and elastic constants of quartz (equilibrium) as well as 20 other metastable silica polymorphs. We also assess its ability in capturing amorphous properties and highlight the limitations of the BKS-type functional forms in simultaneously capturing crystal and amorphous properties. We demonstrate ways to improve model flexibility and introduce a flexible formalism, machine-learned ML-BKS, that outperforms existing empirical models and is on-par with the recently developed 50 to 100 times more expensive Gaussian approximation potential (GAP) in capturing the experimental structure and properties of silica polymorphs and amorphous silica.

36 MATERIALS SCIENCE↗

Rotational molecular dynamics of laser-manipulated bromotrifluoromethane studied by x-ray absorption

We present a computational study of the rotational molecular dynamics of bromotrifluoromethane (CF{sub 3}Br) molecules in gas phase. The rotation is manipulated with an off-resonant 800 nm laser. The molecules are treated as rigid rotors. Frequently, we use a computationally efficient linear rotor model for CF{sub 3}Br, which we compare with selected results for full symmetric-rotor computations. The expectation value <cos{sup 2} {theta}>(t) is discussed. Especially, the transition from impulsive to adiabatic alignment, the temperature dependence of the maximally achievable alignment, and its intensity dependence are investigated. In a next step, we examine resonant x-ray absorption as an accurate tool to study laser manipulation of molecular rotation. Specifically, we investigate the impact of the x-ray pulse duration on the signal (particularly its temporal resolution) and study the temperature dependence of the achievable absorption. Most importantly, we demonstrated that using picosecond x-ray pulses, one can accurately measure the expectation value <cos{sup 2} {theta}>(t) for impulsively aligned CF{sub 3}Br molecules. We point out that a control of the rotational dynamics opens up a novel way to imprint shapes onto long x-ray pulses on a picosecond time scale. For our computations, we determine the dynamic polarizability tensor of CF{sub 3}Br using ab initio molecular linear-response theory in conjunction with wave function models of increasing sophistication: Coupled-cluster singles (CCS), second-order approximate coupled-cluster singles and doubles (CC2), and coupled-cluster singles and doubles (CCSD)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Collisional transport across the magnetic field in drift-fluid models

Drift ordered fluid models are widely applied in studies of low-frequency turbulence in the edge and scrape-off layer regions of magnetically confined plasmas. Here, we show how collisional transport across the magnetic field is self-consistently incorporated into drift-fluid models without altering the drift-fluid energy integral. We demonstrate that the inclusion of collisional transport in drift-fluid models gives rise to diffusion of particle density, momentum, and pressures in drift-fluid turbulence models and, thereby, obviates the customary use of artificial diffusion in turbulence simulations. We further derive a computationally efficient, two-dimensional model, which can be time integrated for several turbulence de-correlation times using only limited computational resources. The model describes interchange turbulence in a two-dimensional plane perpendicular to the magnetic field located at the outboard midplane of a tokamak. The model domain has two regions modeling open and closed field lines. The model employs a computational expedient model for collisional transport. Numerical simulations show good agreement between the full and the simplified model for collisional transport.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DETECTING UNSPECIFIED STRUCTURE IN LOW-COUNT IMAGES

Unexpected structure in images of astronomical sources often presents itself upon visual inspection of the image, but such apparent structure may either correspond to true features in the source or be due to noise in the data. This paper presents a method for testing whether inferred structure in an image with Poisson noise represents a significant departure from a baseline (null) model of the image. To infer image structure, we conduct a Bayesian analysis of a full model that uses a multiscale component to allow flexible departures from the posited null model. As a test statistic, we use a tail probability of the posterior distribution under the full model. This choice of test statistic allows us to estimate a computationally efficient upper bound on a p-value that enables us to draw strong conclusions even when there are limited computational resources that can be devoted to simulations under the null model. We demonstrate the statistical performance of our method on simulated images. Applying our method to an X-ray image of the quasar 0730+257, we find significant evidence against the null model of a single point source and uniform background, lending support to the claim of an X-ray jet.

79 ASTRONOMY AND ASTROPHYSICS↗

WE-G-207-02: Full Sequential Projection Onto Convex Sets (FS-POCS) for X-Ray CT Reconstruction

Purpose: To develop an iterative reconstruction method for X-ray CT, in which the reconstruction can quickly converge to the desired solution with much reduced projection views. Methods: The reconstruction is formulated as a convex feasibility problem, i.e. the solution is an intersection of three convex sets: 1) data fidelity (DF) set – the L2 norm of the difference of observed projections and those from the reconstructed image is no greater than an error bound; 2) non-negativity of image voxels (NN) set; and 3) piecewise constant (PC) set - the total variation (TV) of the reconstructed image is no greater than an upper bound. The solution can be found by applying projection onto convex sets (POCS) sequentially for these three convex sets. Specifically, the algebraic reconstruction technique and setting negative voxels as zero are used for projection onto the DF and NN sets, respectively, while the projection onto the PC set is achieved by solving a standard Rudin, Osher, and Fatemi (ROF) model. The proposed method is named as full sequential POCS (FS-POCS), which is tested using the Shepp-Logan phantom and the Catphan600 phantom and compared with two similar algorithms, TV-POCS and CP-TV. Results: Using the Shepp-Logan phantom, the root mean square error (RMSE) of reconstructed images changing along with the number of iterations is used as the convergence measurement. In general, FS- POCS converges faster than TV-POCS and CP-TV, especially with fewer projection views. FS-POCS can also achieve accurate reconstruction of cone-beam CT of the Catphan600 phantom using only 54 views, comparable to that of FDK using 364 views. Conclusion: We developed an efficient iterative reconstruction for sparse-view CT using full sequential POCS. The simulation and physical phantom data demonstrated the computational efficiency and effectiveness of FS-POCS.

60 APPLIED LIFE SCIENCES↗

Using quantum chemistry muscle to flex massive systems: How to respond to something perturbing

Computational chemistry uses the theoretical advances of quantum mechanics and the algorithmic and hardware advances of computer science to give insight into chemical problems. It is currently possible to do highly accurate quantum chemistry calculations, but the most accurate methods are very computationally expensive. Thus it is only feasible to do highly accurate calculations on small molecules, since typically more computationally efficient methods are also less accurate. The overall goal of my dissertation work has been to try to decrease the computational expense of calculations without decreasing the accuracy. In particular, my dissertation work focuses on fragmentation methods, intermolecular interactions methods, analytic gradients, and taking advantage of new hardware.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗