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 793 records · Page 44

Efficient High Pressure MixtureState Equations

A method is presented for an accurate noniterative, computationally efficient calculation of high pressure fluid mixture equations of state, especially targeted to gas turbines and rocket engines. Pressures above 1 bar and temperatures above 100 K are addressed. The method is based on curve fitting an effective reference state relative to departure funcitons formed using the Peng-Robinson cubic state equation. Fit parameters for H(sub 2), O(sub 2), N(sub 2), propane, n-heptane and methanol are given.

thermodynamics state equations noniterative mixtur↗

Efficient Algorithm for Rectangular Spiral Search

An algorithm generates grid coordinates for a computationally efficient spiral search pattern covering an uncertain rectangular area spanned by a coordinate grid. The algorithm does not require that the grid be fixed; the algorithm can search indefinitely, expanding the grid and spiral, as needed, until the target of the search is found. The algorithm also does not require memory of coordinates of previous points on the spiral to generate the current point on the spiral.

Brugarolas, Paul↗

Efficient modeling of interconnects and capacitive discontinuities in high-speed digital circuits

Modeling of interconnects and associated discontinuities with the recent advances high-speed digital circuits has gained a considerable interest over the last decade although the theoretical bases for analyzing these structures were well-established as early as the 1960s. Ongoing research at the present time is focused on devising methods which can be applied to more general geometries than the ones considered in earlier days and, at the same time, improving the computational efficiency and accuracy of these methods. In this thesis, numerically efficient methods to compute the transmission line parameters of a multiconductor system and the equivalent capacitances of various strip discontinuities are presented based on the quasi-static approximation. The presented techniques are applicable to conductors embedded in an arbitrary number of dielectric layers with two possible locations of ground planes at the top and bottom of the dielectric layers. The cross-sections of conductors can be arbitrary as long as they can be described with polygons. An integral equation approach in conjunction with the collocation method is used in the presented methods. A closed-form Green's function is derived based on weighted real images thus avoiding nested infinite summations in the exact Green's function; therefore, this closed-form Green's function is numerically more efficient than the exact Green's function. All elements associated with the moment matrix are computed using the closed-form formulas. Various numerical examples are considered to verify the presented methods, and a comparison of the computed results with other published results showed good agreement.

Oh, K. S.↗

DEEP CELLULAR RECURRENT NEURAL ARCHITECTURE FOR EFFICIENT MULTIDIMENSIONAL TIME-SERIES DATA PROCESSING

Efficient processing of time series data is a fundamental yet challenging problem in pattern recognition. Though recent developments in machine learning and deep learning have enabled remarkable improvements in processing large scale datasets in many application domains, most are designed and regulated to handle inputs that are static in time. Many real-world data, such as in biomedical, surveillance and security, financial, manufacturing and engineering applications, are rarely static in time, and demand models able to recognize patterns in both space and time. Current machine learning (ML) and deep learning (DL) models adapted for time series processing tend to grow in complexity and size to accommodate the additional dimensionality of time. Specifically, the biologically inspired learning based models known as artificial neural networks that have shown extraordinary success in pattern recognition, tend to grow prohibitively large and cumbersome in the presence of large scale multi-dimensional time series biomedical data such as EEG. Consequently, this work aims to develop representative ML and DL models for robust and efficient large scale time series processing. First, we design a novel ML pipeline with efficient feature engineering to process a large scale multi-channel scalp EEG dataset for automated detection of epileptic seizures. With the use of a sophisticated yet computationally efficient time-frequency analysis technique known as harmonic wavelet packet transform and an efficient self-similarity computation based on fractal dimension, we achieve state-of-the-art performance for automated seizure detection in EEG data. Subsequently, we investigate the development of a novel efficient deep recurrent learning model for large scale time series processing. For this, we first study the functionality and training of a biologically inspired neural network architecture known as cellular simultaneous recurrent neural network (CSRN). We obtain a generalization of this network for multiple topological image processing tasks and investigate the learning efficacy of the complex cellular architecture using several state-of-the?art training methods. Finally, we develop a novel deep cellular recurrent neural network (CDRNN) architecture based on the biologically inspired distributed processing used in CSRN for processing time series data. The proposed DCRNN leverages the cellular recurrent architecture to promote extensive weight sharing and efficient, individualized, synchronous processing of multi-source time series data. Experiments on a large scale multi-channel scalp EEG, and a machine fault detection dataset show that the proposed DCRNN offers state-of-the-art recognition performance while using substantially fewer trainable recurrent units.

Vidyaratne, Lasitha S.↗

Computation of two-phase shear-layer flow using an Eulerian-Lagrangian analysis

A combined Eulerian-Lagrangian analysis which combines a linearized block implicit Navier-Stokes analysis for the continuous phase with a Lagrangian analysis for the discrete phase has been utilized to simulate a two-phase shear-layer flow in a two-dimensional channel flow configuration. The motion of the particles is tracked in computational coordinate space, resulting in improved computational efficiency, and interphase coupling terms for the Eulerian analysis are computed from the instantaneous distribution of the particles rather than the trajectory information. The use of the implicit Navier-Stokes analysis for the continuous phase has made it possible to efficiently use a highly stretched mesh. A low Reynolds number form of the k-epsilon turbulence model was used with near-wall resolution, thus eliminating the need to use the 'wall-function' approach. The streamwise velocity profiles for the continuous and the discrete phases have been compared with experimental data for two test cases.

Sabnis, Jayant S.↗

Applying Time-Parallelization to Turbulent Flows

Parallelization of the temporal domain is explored for the solution of turbulent flows. Multigrid reduction-in-time (MGRIT) is used to advance the large-scale fluid dynamics in time sequentially on the coarsest space-time grid but propagate the information in time parallel on all other levels. The goal of this process is to accurately and efficiently resolve the coarse-scale turbulence structure and use that to drive the fine-scales of the turbulent flow. The extra forcing from nonlinear multigrid facilitates the coupling and interaction between fine and coarse scales, through which the multiscale nonlinear physics is properly captured. Adaptive mesh refinement is employed to finely resolve only the regions with strong gradients, which provides further computational efficiency. The underlying computational fluid dynamics solver is a fourth-order finite-volume scheme with the standard 4-stage Runge-Kutta method. An advanced approach is devised and implemented to enable MGRIT to solve highly turbulent flows successfully. Furthermore, the method is applied to solve a Taylor-Green vortex problem and a doubleshear-layer turbulent mixing flow. Results are promising, validating that MGRIT with the filtering approach has the potential to efficiently solve general turbulent flows.

Computational Fluid Dynamics↗

Heat transfer in directly-irradiated high-temperature solid–gas flows laden with polydisperse particles

Heat transfer in directly-irradiated high-temperature solid–gas flows laden with polydisperse particles is investigated using a novel transient three-dimensional computational fluid dynamics model. The model couples particle–gas hydrodynamics of solid–gas flows laden with polydisperse particles, radiative heat transfer in non-grey absorbing, emitting and anisotropically-scattering multi-component participating media, conduction heat transfer in the gas phase, and interfacial convection heat transfer. The multiphase particle-in-cell method is used to predict high-fidelity solid–gas flow characteristics, such as the local discrete particle size distribution, with increased computational efficiency by combining the advantages of both Eulerian and Lagrangian methods. The multi-component radiative transfer model is implemented using an advanced collision-based Monte Carlo ray-tracing method. The number of the prescribed discrete particle components is found to be the key parameter affecting the computational accuracy and efficiency, which primarily depends on the size distribution of the particles. For the model particle–gas flow featuring free-falling Gamma-distributed ceramic particles exposed to concentrated solar irradiation, the particle volume fraction, radiative, fluid flow and thermal characteristics appear to converge with the increasing number of the discrete particle components. Five particle components are sufficient to obtain physically meaningful results. A further increase in the number of the particle components only slightly increases the accuracy of the numerical predictions at the expense of a rapidly increasing computational time. For five particle components, the particle vertical velocity at the receiver exit for particles with the diameter of 43.4 μm is 57% of that for the particles with the diameter of 202.8 μm. The temperatures of these two particle components increase from the initial ambient values by factors of 2 and 1.2, respectively, during the simulation time. In conclusion, the model developed allows for increased fidelity of particle–gas flow simulations with significant radiative effects.

97 MATHEMATICS AND COMPUTING↗

An Analysis Framework for Investigating the Trade-offs Between System Performance and Energy Consumption in a Heterogeneous Computing Environment

Rising costs of energy consumption and an ongoing effort for increases in computing performance are leading to a significant need for energy-efficient computing. Before systems such as supercomputers, servers, and datacenters can begin operating in an energy-efficient manner, the energy consumption and performance characteristics of the system must be analyzed. In this paper, we provide an analysis framework that will allow a system administrator to investigate the tradeoffs between system energy consumption and utility earned by a system (as a measure of system performance). We model these trade-offs as a bi-objective resource allocation problem. We use a popular multi-objective genetic algorithm to construct Pareto fronts to illustrate how different resource allocations can cause a system to consume significantly different amounts of energy and earn different amounts of utility. We demonstrate our analysis framework using real data collected from online benchmarks, and further provide a method to create larger data sets that exhibit similar heterogeneity characteristics to real data sets. This analysis framework can provide system administrators with insight to make intelligent scheduling decisions based on the energy and utility needs of their systems.

Friese, Ryan↗

An Information Theoretic Approach to Identify Dominant Voltage Influencers for Unbalanced Distribution Systems

Smart distribution grid with multiple renewable energy sources can experience random voltage fluctuations due to variable generation, which may result in voltage violations. Traditional voltage control algorithms are inadequate to handle fast voltage variations. Therefore, new dynamic control methods are being developed that can significantly benefit from the knowledge of dominant voltage influencer (DVI) nodes. DVI nodes for a particular node of interest refer to nodes that have a relatively high impact on the voltage fluctuations at that node. Conventional power flow-based algorithms to identify DVI nodes are computationally complex, which limits their use in real-time applications. This paper proposes a novel information theoretic voltage influencing score (VIS) that quantifies the voltage influencing capacity of nodes with DERs/active loads in a three phase unbalanced distribution system. VIS is then employed to rank the nodes and identify the DVI set. VIS is derived analytically in a computationally efficient manner and its efficacy to identify DVI nodes is validated using the IEEE 37-node test system. It is shown through experiments that KL divergence and Bhattacharyya distance are effective indicators of DVI nodes with an identifying accuracy of more than 90%. Additionally, the computation burden is also reduced by an order of 5, thus providing the foundation for efficient voltage control.

42 ENGINEERING↗

Fast methods for multisite charge transfer processes. I. Constrained, state averaged CASSCF(1,n) and CASSCF(2n − 1,n) simulations

We design a dynamically weighted state-averaged constrained complete active space self-consistent field (DW-SA-cCASSCF) algorithm to treat electrons or holes moving between n molecular fragments (where n can be larger than 2). Within such a so-called eDSCn/hDSCn approach, we consider configurations that are mutually single excitations of each other, and we apply a generalized set of constraints to tailor the method for studying charge transfer problems. The constrained optimization problem is efficiently solved using a DIIS-SQP algorithm, thus maintaining computational efficiency. We demonstrate the method for a finite Su–Schrieffer–Heeger chain, successfully reproducing the expected exponential decay of diabatic couplings with distance. When combined with a gradient, the current extension immediately enables efficient nonadiabatic dynamics simulations of complex multi-state charge transfer processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automated Development of Accurate Algorithms and Efficient Codes for Computational Aeroacoustics

The simulation of sound generation and propagation in three space dimensions with realistic aircraft components is a very large time dependent computation with fine details. Simulations in open domains with embedded objects require accurate and robust algorithms for propagation, for artificial inflow and outflow boundaries, and for the definition of geometrically complex objects. The development, implementation, and validation of methods for solving these demanding problems is being done to support the NASA pillar goals for reducing aircraft noise levels. Our goal is to provide algorithms which are sufficiently accurate and efficient to produce usable results rapidly enough to allow design engineers to study the effects on sound levels of design changes in propulsion systems, and in the integration of propulsion systems with airframes. There is a lack of design tools for these purposes at this time. Our technical approach to this problem combines the development of new, algorithms with the use of Mathematica and Unix utilities to automate the algorithm development, code implementation, and validation. We use explicit methods to ensure effective implementation by domain decomposition for SPMD parallel computing. There are several orders of magnitude difference in the computational efficiencies of the algorithms which we have considered. We currently have new artificial inflow and outflow boundary conditions that are stable, accurate, and unobtrusive, with implementations that match the accuracy and efficiency of the propagation methods. The artificial numerical boundary treatments have been proven to have solutions which converge to the full open domain problems, so that the error from the boundary treatments can be driven as low as is required. The purpose of this paper is to briefly present a method for developing highly accurate algorithms for computational aeroacoustics, the use of computer automation in this process, and a brief survey of the algorithms that have resulted from this work. A review of computational aeroacoustics has recently been given by Lele.

Goodrich, John W.↗

Shaping Diffraction-Grating Grooves to Optimize Efficiency

A method of shaping diffraction-grating grooves to optimize the spectral efficiency, spectral range, and image quality of a spectral imaging instrument is under development. The method is based on the use of an advanced design algorithm to determine the possibly complex shape of grooves needed to obtain a desired efficiency-versus-wavelength response (see figure). Then electron- beam fabrication techniques are used to realize the required groove shape. The method could be used, for example, to make the spectral efficiency of the grating in a given wavelength range proportional to the inverse of the spectral efficiency of a photodetector array so that the overall spectral efficiency of the combination of the grating and the photodetector array would be flat. The method has thus far been applied to one-dimensional gratings only, but in principle, it is also applicable to two-dimensional gratings. The algorithm involves calculations in the spatial-frequency domain. The spatial-frequency spectrum of a grating is represented as a diffraction-order spectral-peak-width function multiplied by an efficiency function for a single grating groove. This representation affords computational efficiency and accuracy by making it possible to consider only the response from one grating groove (one period of the grating), instead of from the whole grating area, in determining the response from the entire grating. This combination of efficiency and accuracy is crucial for future extensions of the algorithm to two-dimensional designs and to designs in which polarization must also be taken into account. The algorithm begins with the definition of target values of relative efficiency that represent the desired spectral response of the grating in certain spectral frequencies calculated from the diffraction order and wavelength. The grating period is divided into a number of cells - typically, 100. The phase contribution from each cell is determined from the phase of the incident electromagnetic wave and the height of the grating surface in the cell. The total contribution from all cells to each target value is then calculated. Then a method known to specialists as the optimum-rotation-angle method is used to adjust the height of each cell so that the total response from all cells is optimized. The computation is iterative and continues until the desired response is obtained. In the event that the desired response is unphysical, the algorithm nevertheless strives to generate a grating-grove profile for which the response approximates the desired one as closely as possible.

Backlund, John↗

Fast computation algorithms for speckle pattern simulation

We present our development of a series of efficient computation algorithms, generally usable to calculate light diffraction and particularly for speckle pattern simulation. We use mainly the scalar diffraction theory in the form of Rayleigh-Sommerfeld diffraction formula and its Fresnel approximation. Our algorithms are based on a special form of the convolution theorem and the Fast Fourier Transform. They are able to evaluate the diffraction formula much faster than by direct computation and we have circumvented the restrictions regarding the relative sizes of the input and output domains, met on commonly used procedures. Moreover, the input and output planes can be tilted each to other and the output domain can be off-axis shifted.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Computer Program for the Calculation of Three-Dimensional Transonic Nacelle/Inlet Flowfields

A highly efficient computer analysis was developed for predicting transonic nacelle/inlet flowfields. This algorithm can compute the three dimensional transonic flowfield about axisymmetric (or asymmetric) nacelle/inlet configurations at zero or nonzero incidence. The flowfield is determined by solving the full-potential equation in conservative form on a body-fitted curvilinear computational mesh. The difference equations are solved using the AF2 approximate factorization scheme. This report presents a discussion of the computational methods used to both generate the body-fitted curvilinear mesh and to obtain the inviscid flow solution. Computed results and correlations with existing methods and experiment are presented. Also presented are discussions on the organization of the grid generation (NGRIDA) computer program and the flow solution (NACELLE) computer program, descriptions of the respective subroutines, definitions of the required input parameters for both algorithms, a brief discussion on interpretation of the output, and sample cases to illustrate application of the analysis.

Vadyak, J.↗

Computational analysis of a stability robustness margin for structured real-parameter perturbations

An efficient computational method is presented for stability robustness analysis with structured real-parameter perturbations. A generic model of a class of uncertain dynamical systems is used as an example. The parameter uncertainty is characterized by a real scalar, epsilon. Multilinearity of the closed-loop characteristic polynomial is exploited to permit application of the mapping theorem to calculate the stability robustness margin. It is found that sensitive geometry of the stability boundary in the epsilon, omega-plane renders problematic the calculation of the minimum epsilon as a function of omega. This difficulty is avoided by calculating the minimum distance to the image of the uncertainty domain over omega as a function of epsilon. It is also shown that a certain class of uncertain dynamical systems has the required multilinearity property and are thus amenable to the proposed technique.

Wedell, Evan↗

Track reconstruction as a service for collider physics

Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa.TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Efficiency and discrepancy in the direct simulation methods

The paper reviews the factors that affect the versatility, computational efficiency, and accuracy of the various direct simulation methods that are being applied to problems in rarefied gas dynamics. The influence of computer hardware developments on the cost-effectiveness is discussed, as are the software factors that influence the speed with which simulation programs can be applied to new problems. Particular attention is given to a novel method that improves the efficiency of the simulation for complex 3D problems. The topical issues of reduced resolution procedures, stored lists, and variance reduction schemes are discussed in some detail.

Bird, G. A.↗

Collective mode Brownian dynamics: A method for fast relaxation of statistical ensembles

Sampling equilibrium configurations of correlated systems of particles with long relaxation times (e.g., polymeric solutions) using conventional molecular dynamics and Monte Carlo methods can be challenging. This is especially true for systems with complicated, extended bond network topologies and other interactions that make the use and design of specialized relaxation protocols infeasible. We introduce a method based on Brownian dynamics simulations that can reduce the computational time it takes to reach equilibrium and draw decorrelated samples. Importantly, the method is completely agnostic to the particle configuration and the specifics of interparticle forces. In particular, we develop a mobility matrix that excites non-local, collective motion of N particles and can be computed efficiently in $\mathcal{O}(N)$ time. Particle motion in this scheme is computed by integrating the overdamped Langevin equation with an Euler–Maruyama scheme, in which Brownian displacements are drawn efficiently using a low-rank representation of the mobility matrix in position and wave space. We demonstrate the efficacy of the method with various examples from the realm of soft condensed matter and release a massively parallel implementation of the code as a plugin for the open-source package HOOMD-blue [J. A. Anderson et al., J. Comput. Phys. 227, 5342 (2008) and J. Glaser et al., Comput. Phys. Commun. 192, 97 (2015)] which runs on graphics processing units

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗