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 613 records · Page 34

A novel framework for hosting capacity analysis with spatio-temporal probabilistic voltage sensitivity analysis

Smart grids are envisioned to accommodate high penetration of distributed photovoltaic (PV) generation, which may cause adverse grid impacts in terms of voltage violations. Therefore, PV Hosting capacity is being used as a planning tool to determine the maximum PV installation capacity that causes the first voltage violation and above which would require infrastructure upgrades. Additionally, traditional methods of Hosting capacity analysis are scenario based and computationally complex as they rely on iterative load flow algorithms that require investigating a large number of scenarios for accurate assessment of PV impacts. Therefore, this paper presents a computationally efficient analytical approach to compute the probability distribution of voltage change due to random behavior of randomly located multiple distributed PVs. The proposed approach is based on Spatio-temporal probabilistic voltage sensitivity analysis that exploits both spatial and temporal uncertainties associated with PV injections. Thereafter, the derived distribution is used to quantify voltage violations for various PV penetration levels and subsequently determine the hosting capacity of the system without the need to examine large number of scenarios. Results of the proposed framework are validated via conventional load flow based simulation approach on the IEEE 37 and IEEE 123 node test systems.

42 ENGINEERING↗

Statistical evaluation of microscale stress conditions leading to void nucleation in the weak shock regime

Here, we investigate the heterogeneity of the stress state driven by anisotropic deformation response at the single crystal level through five statistical volume element (SVE) calculations of polycrystalline BCC tantalum. This work focuses on grain boundaries as a prominent material defect type prone to void nucleation based upon experimental observations of predominantly intergranular void nucleation in this material. The SVEs are constructed to be statistically representative of larger volumes of material and are meshed such that mean and standard deviation of grain size and orientation information is reconstructed. The computational meshes feature hexahedral (brick) elements and smooth conformal grain boundaries where significant stress concentration is known to occur, a tail effect of interest in the extreme events process of dynamic ductile damage. An existing micromechanical crystallographic plasticity model shown to capture the single crystal behavior of BCC tantalum well is used to perform the polycrystal calculations. The model includes representation of the non-Schmid effect of non-planar screw dislocation kinetics in tantalum. A three-dimensional stress state time profile predicted by damage modeling of a flyer plate impact experiment is applied as boundary conditions to each SVE. Resulting grain boundary stress state statistics are strongly non-Gaussian. Significant structural evolution is observed within the compressive hold before unloading into tension in the stress profile. Strong angular dependence of grain boundary traction magnitude with shock direction is observed. Non-Schmid effects continue to suggest their influence on propensity of microstructural defect types to nucleate voids. A general void nucleation criterion is proposed using probability theory. The general framework is specified to polycrystalline BCC tantalum in the weak shock regime to include the SVE calculations and literature molecular dynamics calculations of grain boundary void nucleation strength. Probability density functions (PDFs) are used to describe the interaction between the local stress state heterogeneity and the distributed grain boundary void nucleation strength state. A causation entropy maximization procedure removes the requirement for ad hoc selection of a PDF functional form and provides a rigorous procedure for data-based PDF determination. The resulting physically informed PDF describes the spatial appearance frequency of nucleated voids as a function of applied macroscale pressure. Lower length scale physics are thus packaged in a precise and computationally efficient way to provide computational plasticity insight to macroscale dynamic ductile damage models.

36 MATERIALS SCIENCE↗

Displacement Fields and Self-Energies of Circular and Polygonal Dislocation Loops in Homogeneous and Layered Anisotropic Solids

There are large classes of materials problems that involve the solutions of stress, displacement, and strain energy of dislocation loops in elastically anisotropic solids, including increasingly detailed investigations of the generation and evolution of irradiation induced defect clusters ranging in sizes from the micro- to meso-scopic length scales. Based on a two-dimensional Fourier transform and Stroh formalism that are ideal for homogeneous and layered anisotropic solids, we have developed robust and computationally efficient methods to calculate the displacement fields for circular and polygonal dislocation loops. Using the homogeneous nature of the Green tensor of order -1, we have shown that the displacement and stress fields of dislocation loops can be obtained by numerical quadrature of a line integral. In addition, it is shown that the sextuple integrals associated with the strain energy of loops can be represented by the product of a pre-factor containing elastic anisotropy effects and a universal term that is singular and equal to that for elastic isotropic case. Furthermore, we have found that the self-energy pre-factor of prismatic loops is identical to the effective modulus of normal contact, and the pre-factor of shear loops differs from the effective indentation modulus in shear by only a few percent. These results provide a convenient method for examining dislocation reaction energetic and efficient procedures for numerical computation of local displacements and stresses of dislocation loops, both of which play integral roles in quantitative defect analyses within combined experimental–theoretical investigations.

36 MATERIALS SCIENCE↗

On efficient Hessian computation using the edge pushing algorithm in Julia

Evaluating the Hessian matrix of second-order derivatives at a sequence of points can be costly when applying second-order methods for nonlinear optimization. In this work, we discuss our experiences implementing the recently proposed Edge Pushing (EP) method in Julia as an experimental replacement for the current colouring-based methods used by JuMP, an open-source algebraic modelling language. We propose an alternative data structure for sparse Hessians to avoid the use of hash tables and analyse the space and time complexity of EP method. In our benchmarks, we find that EP is very competitive in terms of both preprocessing time and Hessian evaluation time. As a result, we identify cases where EP closes the performance gap between JuMP's previous implementation and the implementation in AMPL, a commercial software package with similar functionality.

97 MATHEMATICS AND COMPUTING↗

A comparison of two- and three-dimensional neutrino-hydrodynamics simulations of core-collapse supernovae

We present numerical results on two- (2D) and three-dimensional (3D) hydrodynamic core-collapse simulations of an 11.2 M {sub ☉} star. By changing numerical resolutions and seed perturbations systematically, we study how the postbounce dynamics are different in 2D and 3D. The calculations were performed with an energy-dependent treatment of the neutrino transport based on the isotropic diffusion source approximation scheme, which we have updated to achieve a very high computational efficiency. All of the computed models in this work, including nine 3D models and fifteen 2D models, exhibit the revival of the stalled bounce shock, leading to the possibility of explosion. All of them are driven by the neutrino-heating mechanism, which is fostered by neutrino-driven convection and the standing-accretion-shock instability. Reflecting the stochastic nature of multi-dimensional (multi-D) neutrino-driven explosions, the blast morphology changes from model to model. However, we find that the final fate of the multi-D models, whether an explosion is obtained or not, is little affected by the explosion stochasticity. In agreement with some previous studies, higher numerical resolutions lead to slower onset of the shock revival in both 2D and 3D. Based on the self-consistent supernova models leading to the possibility of explosions, our results systematically show that the revived shock expands more energetically in 2D than in 3D.

79 ASTRONOMY AND ASTROPHYSICS↗

A FAST POTENTIAL AND SELF-GRAVITY SOLVER FOR NONAXISYMMETRIC DISKS

Disk self-gravity could play an important role in the dynamic evolution of interaction between disks and embedded protoplanets. We have developed a fast and accurate solver to calculate the disk potential and disk self-gravity forces for disk systems on a uniform polar grid. Our method closely follows the method given by Chan et al., in which a fast Fourier transform in the azimuthal direction is performed and a direct integral approach in the frequency domain in the radial direction is implemented on a uniform polar grid. This method can be very effective for disks with vertical structures that depend only on the disk radius, achieving the same computational efficiency as for zero-thickness disks. We describe how to parallelize the solver efficiently on distributed parallel computers. We propose a mode-cutoff procedure to reduce the parallel communication cost and achieve nearly linear scalability for a large number of processors. For comparison, we have also developed a particle-based fast tree code to calculate the self-gravity of the disk system with a vertical structure. The numerical results show that our direct integral method is at least two orders of magnitude faster than our optimized tree-code approach.

79 ASTRONOMY AND ASTROPHYSICS↗

Simit: A Language for Physical Simulation

With existing programming tools, writing high-performance simulation code is labor intensive and requires sacrificing readability and portability. Here, the alternative is to prototype simulations in a high-level language like Matlab, thereby sacrificing performance. The Matlab programming model naturally describes the behavior of an entire physical system using the language of linear algebra. However, simulations also manipulate individual geometric elements, which are best represented using linked data structures like meshes. Translating between the linked data structures and linear algebra comes at significant cost, both to the programmer and to the machine. High-performance implementations avoid the cost by rephrasing the computation in terms of linked or index data structures, leaving the code complicated and monolithic, often increasing its size by an order of magnitude. In this article, we present Simit, a new language for physical simulations that lets the programmer view the system both as a linked data structure in the form of a hypergraph and as a set of global vectors, matrices, and tensors depending on what is convenient at any given time. Simit provides a novel assembly construct that makes it conceptually easy and computationally efficient to move between the two abstractions. Using the information provided by the assembly construct, the compiler generates efficient in-place computation on the graph. We demonstrate that Simit is easy to use: a Simit program is typically shorter than a Matlab program; that it is high performance: a Simit program running sequentially on a CPU performs comparably to hand-optimized simulations; and that it is portable: Simit programs can be compiled for GPUs with no change to the program, delivering 4 to 20× speedups over our optimized CPU code.

97 MATHEMATICS AND COMPUTING↗

Comparison of Distributive Consensus Algorithms for AnomalyDetection on the Power-Grid

As an increasing number of devices in the power-grid rely on high-precision clocks to measure electrical properties and time stamp data, GPS receivers have become a vulnerability on the power-grid. GPS spoofing attacks, in which a fake signal is transmitted, can cause sensor measurement errors that can misinform protective equipment and grid operators for both the transmission and distribution grid. The technology being developed to secure precision clocks in the transmission grid are not appropriate for the distribution grid. Thus, there is a need to developed anomaly detection algorithms that are suitable for the hardware available on the distribution grid. Traditionally, a distributed detection framework is comprised of spatially distributed nodes which acquire observations about a quantity of interest and sends the data to the fusion center, where a global decision is made. Instead the distribution grid has low-power devices, such as smart inverters and microPMUs, that could be used to perform highly parallelized calculations. Having on node calculations is beneficial since it is more network and computation efficient, as the more calculations can be performed where the data is being captured instead of communicating across a slow network to a centralized fusion center. Instead, we could employ an alternate peer-to-peer type of information exchange on the distribution grid that can still reach a global decision. A decentralized approach to anomaly detection makes efficient use of the computational and network bandwidth that exists, and it also lacks the single point of failure of a centralized approach. Thus, a decentralized local information exchange and/or inference is preferred. Lastly, the unreliability of the distribution grid network connections and potential noise or error in the measurements must be considered. In order to produce an effective detection tool, a Byzantine-fault tolerant and asynchronous algorithm must be developed. Thus, the first phase of our project is to develop a distributed, decentralized, asynchronous, Byzantine-fault tolerant, collaborative autonomy-based anomaly detection algorithm to collectively analyze clusters of data for signs of a malicious attack.

97 MATHEMATICS AND COMPUTING↗

Enabling Efficient Sparse Computations using Linear Algebra Aware Compilers

This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels.

97 MATHEMATICS AND COMPUTING↗

Simultaneous calculation of aircraft design loads and structural member sizes

A design process which accounts for the interaction between aerodynamic loads and changes in member sizes during sizing of aircraft structures is described. A simultaneous iteration procedure is used wherein both design loads and member sizes are updated during each cycle yielding converged, compatible loads and member sizes. A description is also given of a system of programs which incorporates this process using lifting surface theory to calculate aerodynamic pressure distributions, using a finite-element method for structural analysis, and using a fully stressed design technique to size structural members. This system is tailored to perform the entire process with computational efficiency in a single computer run so that it can be used effectively during preliminary design. Selected results, considering maneuver, taxi, and fatigue design conditions, are presented to illustrate convergence characteristics of this iterative procedure.

Giles, G. L.↗

Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

Mavriplis, Dimitri J.↗

Nonlinear filters for efficient shock computation

A new type of methods for the numerical approximation of hyperbolic conservation laws with discontinuous solution is introduced. The methods are based on standard finite difference schemes. The difference solution is processed with a nonlinear conservation form filter at every time level to eliminate spurious oscillations near shocks. It is proved that the filter can control the total variation of the solution and also produce sharp discrete shocks. The method is simpler and faster than many other high resolution schemes for shock calculations. Numerical examples in one and two space dimensions are presented.

Engquist, Bjorn↗