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 109 records · Page 6

Quantum many-body effects in x-ray spectra efficiently computed using a basic graph algorithm

The mounting interest in using x-ray spectroscopy for refined materials characterization calls for an accurate electronic-structure theory to interpret the x-ray near-edge fine structure. Here, we propose an efficient and unified framework to describe all the many-electron processes in a Fermi liquid after a sudden perturbation (such as a core hole). This problem has been visited by the Mahan-Noziéres-De Dominicis (MND) theory, but it is intractable to implement various Feynman diagrams within first-principles calculations. In our report, we adopt a nondiagrammatic approach and treat all the many-electron processes in the MND theory on an equal footing. Starting from a recently introduced determinant formalism [Phys. Rev. Lett. 118, 096402 (2017)], we exploit the linear dependence of determinants describing different final states involved in the spectral calculations. An elementary graph algorithm, breadth-first search, can be used to quickly identify the important determinants for shaping the spectrum, which avoids the need to evaluate a great number of vanishingly small terms. This search algorithm is performed over the tree-structure of the many-body expansion, which mimics a path-finding process. We demonstrate that the determinantal approach is computationally inexpensive even for obtaining x-ray spectra of extended systems. Using Kohn-Sham orbitals from two self-consistent fields (ground and core-excited state) as input for constructing the determinants, the calculated x-ray spectra for a number of transition metal oxides are in good agreement with experiments. Many-electron aspects beyond the Bethe-Salpeter equation, as captured by this approach, are also discussed, such as shakeup excitations and many-body wave function overlap considered in Anderson's orthogonality catastrophe.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computationally Efficient Multiscale Neural Networks Applied to Fluid Flow in Complex 3D Porous Media

Abstract The permeability of complex porous materials is of interest to many engineering disciplines. This quantity can be obtained via direct flow simulation, which provides the most accurate results, but is very computationally expensive. In particular, the simulation convergence time scales poorly as the simulation domains become less porous or more heterogeneous. Semi-analytical models that rely on averaged structural properties (i.e., porosity and tortuosity) have been proposed, but these features only partly summarize the domain, resulting in limited applicability. On the other hand, data-driven machine learning approaches have shown great promise for building more general models by virtue of accounting for the spatial arrangement of the domains’ solid boundaries. However, prior approaches building on the convolutional neural network (ConvNet) literature concerning 2D image recognition problems do not scale well to the large 3D domains required to obtain a representative elementary volume (REV). As such, most prior work focused on homogeneous samples, where a small REV entails that the global nature of fluid flow could be mostly neglected, and accordingly, the memory bottleneck of addressing 3D domains with ConvNets was side-stepped. Therefore, important geometries such as fractures and vuggy domains could not be modeled properly. In this work, we address this limitation with a general multiscale deep learning model that is able to learn from porous media simulation data. By using a coupled set of neural networks that view the domain on different scales, we enable the evaluation of large ( $$>512^3$$ > 512 3 ) images in approximately one second on a single graphics processing unit. This model architecture opens up the possibility of modeling domain sizes that would not be feasible using traditional direct simulation tools on a desktop computer. We validate our method with a laminar fluid flow case using vuggy samples and fractures. As a result of viewing the entire domain at once, our model is able to perform accurate prediction on domains exhibiting a large degree of heterogeneity. We expect the methodology to be applicable to many other transport problems where complex geometries play a central role.

36 MATERIALS SCIENCE↗

Computation-Efficient Algorithm for Distributed Feedback Optimization of Distribution Grids

Feedback-based optimization algorithms use real-time measurements to update the optimal control for the underlying system which may not be fully identified. Recently, we have developed a distributed feedback-based algorithm [1] that avoids the requirement of fast communication between central computing and local actuator/sensor agents. This paper extends the work by greatly reducing the number of copies of variables involved in the distributed feedback-based algorithm, which results in faster convergence and lower communication requirement. The main idea is to leverage the specific structural properties of the admittance matrix for distribution systems with tree network topology. We also show the effectiveness of the proposed algorithm in simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An efficient computational method for solving nonlinear stochastic Itô integral equations: Application for stochastic problems in physics

Because of the nonlinearity, closed-form solutions of many important stochastic functional equations are virtually impossible to obtain. Thus, numerical solutions are a viable alternative. In this paper, a new computational method based on the generalized hat basis functions together with their stochastic operational matrix of Itô-integration is proposed for solving nonlinear stochastic Itô integral equations in large intervals. In the proposed method, a new technique for computing nonlinear terms in such problems is presented. The main advantage of the proposed method is that it transforms problems under consideration into nonlinear systems of algebraic equations which can be simply solved. Error analysis of the proposed method is investigated and also the efficiency of this method is shown on some concrete examples. The obtained results reveal that the proposed method is very accurate and efficient. As two useful applications, the proposed method is applied to obtain approximate solutions of the stochastic population growth models and stochastic pendulum problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient computational algorithm for pricing European, barrier and American options

In this work, we use the spectral collocation technique for spatial derivatives and predictor–corrector method for time integration to solve the Black–Scholes (B–S) equation. If the spectral collocation method is worked properly, then we get high accuracy in the numerical solutions. Firstly, theory of application of Chebyshev spectral collocation technique and domain decomposition method on the B–S equation is presented. This method gets a stiff system of differential equations. Secondly, by using the predictor–corrector method with variable step size, we obtain the high accuracy approximate solution in the numerical integration of the stiff system of DEs. We present the order of accuracy for the proposed method. The numerical results show the efficiency and validity of the method.

97 MATHEMATICS AND COMPUTING↗

A computationally efficient method for tempered fractional differential equations with application

This paper investigates the numerical approximation of the tempered fractional integral by using the Sinc-collocation scheme. The algorithm is extended to solve a class of tempered fractional differential equations that converges to the solution with exponential rate. Several numerical examples compare the numerical approximations with the exact solutions. The behavioral responses of the lumped capacitance model with tempered fractional order for transient conduction are investigated. The efficiency and accuracy of the proposed scheme are analyzed in the perspective of the L{sub 2}-norm error and convergence order.

97 MATHEMATICS AND COMPUTING↗

Discrete Green’s functions and spectral graph theory for computationally efficient thermal modeling

Here, this work concerns solutions of the heat equation with the spectral graph method, for which the temperature is defined at discrete points in the domain and the spatial relationship among the points is described by a graph. The heat equation on the graph is solved using matrix techniques involving the eigenvectors and eigenvalues of the Laplacian matrix. The spectral graph approach precludes the computationally intensive meshing and numerous time-integration steps of the finite element method. In the present work, the spectral graph method is extended to include heat loss at the boundaries with a generalized boundary condition, and physics-based edge weights are introduced which simplify the calibration process. From this approach a discrete Green’s function is defined which allows for solutions under a variety of heating conditions including: space-varying initial conditions; time-and-space varying internal heating; and, time-and-space-varying heating at boundaries of type 1 (Dirichlet), type 2 (Neumann) and type 3 (Robin). Results are provided for benchmark heat transfer problems in one spatial dimension and in three spatial dimensions, and verification is provided by comparison with exact analytical solutions and finite difference solutions. The spectral graph method converges within 0.4% error of the analytical solution. The practical utility of the approach is demonstrated by thermal simulation of a multilayer additive manufacturing process. The spectral graph results are compared to experimentally-obtained temperature data for two metal parts, with error less than 5% of the experimental measurements, with computation time less than one minute on a desktop computer.

36 MATERIALS SCIENCE↗

Computationally efficient evaluation of optimum homogeneous charge compression ignition operating range with accelerated multizone engine cycle simulation

The very intensive calculations necessary to define a performance map requiring evaluation of over a hundred individual operating points can be efficiently conducted with accelerated multizone for engine cycle simulation, leading to a definition of regions of acceptable and optimum homogeneous charge compression ignition operation. Accelerated multizone for engine cycle simulation has the virtue of enabling accurate evaluation of many operating conditions based on thermal stratification data from a single fluid mechanics run at motored conditions. This is possible because thermal stratification is more sensitive to engine geometry than to operating conditions. In this article, accuracy of accelerated multizone for engine cycle simulation is demonstrated by comparison with experimental data for iso-octane homogeneous charge compression ignition operation over a broad range of lean equivalence ratios (0.14–0.28). The validated accelerated multizone for engine cycle simulation model is then applied to generating a performance map for an engine controlled by appropriately adjusting equivalence ratio and internal exhaust gas recirculation. Regions of acceptable and optimum combustion are identified. It is finally demonstrated that while indicated mean effective pressure remains low for optimum homogeneous charge compression ignition operation (1–4 bar), this is sufficient for a large fraction of typical driving in light-duty vehicles. Much driving including idle can therefore be done in homogeneous charge compression ignition mode at high efficiency and low (essentially zero) NOx and particulate matter emissions.

30 DIRECT ENERGY CONVERSION↗

Enhanced computational efficiency in the direct determination of the two-electron reduced density matrix from the anti-Hermitian contracted Schrödinger equation with application to ground and excited states of conjugated π-systems

Determination of the two-electron reduced density matrix (2-RDM) from the solution of the anti-Hermitian contracted Schrödinger equation (ACSE) yields accurate energies and properties for both ground and excited states. Here, we develop a more efficient method to solving the ACSE that uses second-order information to select a more optimal step towards the solution. Calculations on the ground and excited states of water, hydrogen fluoride, and conjugated π systems show that the improved ACSE algorithm is 10-20 times faster than the previous ACSE algorithm. The ACSE can treat both single- and multi-reference electron correlation with the initial 2-RDM from a complete-active-space self-consistent-field (CASSCF) calculation. Using the improved algorithm, we explore the relationship between truncation of the active space in the CASSCF calculation and the accuracy of the energy and 2-RDM from the ACSE calculation. The accuracy of the ACSE, we find, is less sensitive to the size of the active space than the accuracy of other wavefunction methods, which is useful when large active space calculations are computationally infeasible.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computationally efficient and error aware surrogate construction for numerical solutions of subsurface flow through porous media

Limiting the injection rate to restrict the pressure below a threshold at a critical location can be an important goal of simulations that model the subsurface pressure between injection and extraction wells. The pressure is approximated by the solution of Darcy’s partial differential equation for a given permeability field. The subsurface permeability is modeled as a random field since it is known only up to statistical properties. This induces uncertainty in the computed pressure. Solving the partial differential equation for an ensemble of random permeability simulations enables estimating a probability distribution for the pressure at the critical location. These simulations are computationally expensive, and practitioners often need rapid online guidance for real-time pressure management. An ensemble of numerical partial differential equation solutions is used to construct a Gaussian process regression model that can quickly predict the pressure at the critical location as a function of the extraction rate and permeability realization. The Gaussian process surrogate analyzes the ensemble of numerical pressure solutions at the critical location as noisy observations of the true pressure solution, enabling robust inference using the conditional Gaussian process distribution. Our first novel contribution is to identify a sampling methodology for the random environment and matching kernel technology for which fitting the Gaussian process regression model scales as O ( n log n ) instead of the typical O ( n 3 ) rate in the number of samples n used to fit the surrogate. The surrogate model allows almost instantaneous predictions for the pressure at the critical location as a function of the extraction rate and permeability realization. Our second contribution is a novel algorithm to calibrate the uncertainty in the surrogate model to the discrepancy between the true pressure solution of Darcy’s equation and the numerical solution. Finally, although our method is derived for building a surrogate for the solution of Darcy’s equation with a random permeability field, the framework broadly applies to solutions of other partial differential equations with random coefficients.

54 ENVIRONMENTAL SCIENCES↗

Comparison of plug flow and multi-node stratified tank modeling approaches regarding computational efficiency and accuracy

Residential water heaters contain water stratified by temperature-driven density differences. This implies that a water tank can reach a state in which the top and bottom sections have different temperatures, unless mixing happens. A high degree of thermal stratification can improve the efficiency of some water heaters, by saving the amount of energy required for the heat-up process. Studies of stratification became popular in the 1970s and it remains an active research topic today. The research has led to the development of different models and techniques to better predict and define a stratified tanks behavior. By comparing these models and techniques used previously to describe thermal stratification, the phenomenon could be better understood, exploited, and used to increase efficiency and thermal energy capacity in modern water tanks. From the existing models, we found the one-dimensional standard plug-flow and a multi node model to be appropriate for analyzing the processes of the heat up and cool-down in a water tank. These two models are based on energy balances. This work involved comparing the accuracy and computational effort needed to implement these models. To assess accuracy, we compared both types of existing models to experimental data (also collected in this work) which included a heat up process using an external heat pump. This external process included a layering process that has an eddy diffusivity at five times the rate of thermal diffusion. For this project, we implemented the models in MATLAB, the multi-paradigm numerical computing environment. We quantified model accuracy using the root mean squared error between modeled data and experimental data for six measured tank temperatures. Comparing the accuracy and the computational time taken to run the simulation provides a method to contrast the performance of each model and a way to rate it. The multi node model was run using from 6 to 96 spatial nodes; the plug flow model was run using 1 to 0.001 º C temperature bin sizes. Additionally, timesteps were varied from 4 to 236 s. The results quantify the tradeoff between accuracy and computational time, providing guidance for simulations to intelligently select the best model type and simulation parameters. This research can be used to validate the pre-existing models and possibly improve the modern water tank.

Bulnes, Fernando Karg↗

A computationally efficient approach for calculating galaxytwo-point correlations

We developed a modification to the calculation of the two-point correlation function commonly used in the analysis of large-scale structure in cosmology. An estimator of the two-point correlation function is constructed by contrasting the observed distribution of galaxies with that of a uniformly populated random catalogue. The assumption that the distribution of random galaxies in redshift is independent of angular position allows us to replace pair-wise combinatorics with fast integration over probability maps. The new method significantly reduces the computation time while simultaneously increasing the precision of the calculation. Also, it only requires cosmological parameters at the last and least computationally expensive stage, which allows for faster exploration of the parameter space.

79 ASTRONOMY AND ASTROPHYSICS↗

Applying computationally efficient schemes for biogeochemical cycles (ACES4BGC)

NCAR contributed to the ACES4BGC project through software engineering work on aerosol model implementation, build system and script changes, coupler enhancements for biogeochemical tracers, improvements to the Community Land Model (CLM) code and testing infrastructure, and coordinating and integrating code changes from the various project participants.

54 ENVIRONMENTAL SCIENCES↗

A Computational Efficient Space-Vector Modulation Scheme for A Hybrid Seven-Level Converter for Medium Voltage Grid-Tied Applications

In this paper, a fast space-vector modulation (SVM) scheme is proposed for a hybrid 7-level (7-L) converter, i.e., cascaded T-type converter and H-bridge converters, for grid-tied applications. Using oblique coordinate reference, the proposed SVM can quickly locate the switching triangle enclosing the reference vector in the 7-L space vector diagram. Then all available switching sequences and vector duty cycles are acquired by straightforward calculation without using any look-up tables, which significantly reduces the computational cost. The floating capacitor voltages are also stabilized by using the proposed SVM. Experimental studies on a scale-down prototype are presented in this work to validate the effectiveness of the proposed scheme.

Diao, Fei↗

Star–Galaxy Image Separation with Computationally Efficient Gaussian Process Classification

Abstract We introduce a novel method for discerning optical telescope images of stars from those of galaxies using Gaussian processes (GPs). Although applications of GPs often struggle in high-dimensional data modalities such as optical image classification, we show that a low-dimensional embedding of images into a metric space defined by the principal components of the data suffices to produce high-quality predictions from real large-scale survey data. We develop a novel method of GP classification hyperparameter training that scales approximately linearly in the number of image observations, which allows for application of GP models to large-size Hyper Suprime-Cam Subaru Strategic Program data. In our experiments, we evaluate the performance of a principal component analysis embedded GP predictive model against other machine-learning algorithms, including a convolutional neural network and an image photometric morphology discriminator. Our analysis shows that our methods compare favorably with current methods in optical image classification while producing posterior distributions from the GP regression that can be used to quantify object classification uncertainty. We further describe how classification uncertainty can be used to efficiently parse large-scale survey imaging data to produce high-confidence object catalogs.

79 ASTRONOMY AND ASTROPHYSICS↗

A Step towards Energy Efficient Computing: Redesigning a Hydrodynamic Application on CPU-GPU, In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium

Power and energy consumption are becoming an increasing concern in high performance computing. Compared to multi-core CPUs, GPUs have a much better performance per watt. In this paper we discuss efforts to redesign the most computation intensive parts of BLAST, an application that solves the equations for compressible hydrodynamics with high order finite elements, using GPUs BLAST, Dobrev. In order to exploit the hardware parallelism of GPUs and achieve high performance, we implemented custom linear algebra kernels. We intensively optimized our CUDA kernels by exploiting the memory hierarchy, which exceed the vendor's library routines substantially in performance. We proposed an auto tuning technique to adapt our CUDA kernels to the orders of the finite element method. Compared to a previous base implementation, our redesign and optimization lowered the energy consumption of the GPU in two aspects: 60% less time to solution and 10% less power required. Compared to the CPU-only solution, our GPU accelerated BLAST obtained a 2.5× overall speedup and 1.42× energy efficiency (green up) using 4th order (Q_4) finite elements, and a 1.9× speedup and 1.27× green up using 2nd order (Q2) finite elements.

Computer Science↗