Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “large grids”

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 271 records · Page 15

Spatio-Temporal Surrogates for Interaction of a Jet with High Explosives: Part II - Clustering Extremely High-Dimensional Grid-Based Data

Building an accurate surrogate model for the spatio-temporal outputs of a computer simulation is a challenging task. A simple approach to improve the accuracy of the surrogate is to cluster the outputs based on similarity and build a separate surrogate model for each cluster. This clustering is relatively straightforward when the output at each time step is of moderate size. However, when the spatial domain is represented by a large number of grid points, numbering in the millions, the clustering of the data becomes more challenging. In this report, we consider output data from simulations of a jet interacting with high explosives. These data are available on spatial domains of different sizes, at grid points that vary in their spatial coordinates, and in a format that distributes the output across multiple files at each time step of the simulation. We first describe how we bring these data into a consistent format prior to clustering. Borrowing the idea of random projections from data mining, we reduce the dimension of our data by a factor of thousand, making it possible to use the iterative k-means method for clustering. We show how we can use the randomness of both the random projections, and the choice of initial centroids in k-means clustering, to determine the number of clusters in our data set. Our approach makes clustering of extremely high dimensional data tractable, generating meaningful cluster assignments for our problem, despite the approximation introduced in the random projections.

97 MATHEMATICS AND COMPUTING↗

Multigrid with Overlapping Patches

Solving boundary value problems with optimal efficiency requires adaptivity and multilevel techniques. Previously, an implementation of the AFACx algorithm is presented that is based on rectangular Cartesian grids. This implementation does not allow for the over]ap of grids that lie on the same level of refinement. We investigate the case in which these grids overlap. A standard technique for overlapping grids is the Schwarz algorithm. Some ways of using the Schwarz algorithm in a standard multigrid scheme are presented. Also, a problem that arises in some situations with non-aligned, overlapping grids is described. This situation comes up in a natural way when the Schwarz algorithm is used as a relaxation scheme within a multilevel algorithm. We identify the reason for the bad convergence and show that by more sophisticated interpolation the difficulties can be overcome. Then we present a multiplicative Schwarz algorithm for a large number of grids that has a high potential for parallelization. Finally we give some numerical results for the FACx algorithm with overlapping grids on each refinement level. The implementation of the described codes uses C++ and the array class libraries A++ and P++. Using the A++/P++ programming environment, it was possible to move from a serial code to a parallel code within a few days.

Berndt, Markus↗

Tools and Techniques for Measuring and Improving Grid Performance

This viewgraph presentation provides information on NASA's geographically dispersed computing resources, and the various methods by which the disparate technologies are integrated within a nationwide computational grid. Many large-scale science and engineering projects are accomplished through the interaction of people, heterogeneous computing resources, information systems and instruments at different locations. The overall goal is to facilitate the routine interactions of these resources to reduce the time spent in design cycles, particularly for NASA's mission critical projects. The IPG (Information Power Grid) seeks to implement NASA's diverse computing resources in a fashion similar to the way in which electric power is made available.

Biswas, Rupak↗

Complexity Computational Environment: Data Assimilation SERVOGrid

We are using Web (Grid) service technology to demonstrate the assimilation of multiple distributed data sources (a typical data grid problem) into a major parallel high-performance computing earthquake forecasting code. Such a linkage of Geoinformatics with Geocomplexity demonstrates the value of the Solid Earth Research Virtual Observatory (SERVO) Grid concept, and advance Grid technology by building the first real-time large-scale data assimilation grid Here we develop the next steps for both the SERVO concept and the identified need for a Solid Earth problem-solving environment. We use a challenging motivating problem of importance to NASA namely integrating NASA space geodetic observations with numerical simulations of a changing earth.

data assimiliation↗

QuakeSim and the Solid Earth Research Virtual Observatory

We are developing simulation and analysis tools in order to develop a solid Earth science framework for understanding and studying active tectonic and earthquake processes. The goal of QuakeSim and its extension, the Solid Earth Research Virtual Observatory (SERVO), is to study the physics of earthquakes using state-of-the-art modeling, data manipulation, and pattern recognition technologies. We are developing clearly defined accessible data formats and code protocols as inputs to simulations, which are adapted to high-performance computers. The solid Earth system is extremely complex and nonlinear resulting in computationally intensive problems with millions of unknowns. With these tools it will be possible to construct the more complex models and simulations necessary to develop hazard assessment systems critical for reducing future losses from major earthquakes. We are using Web (Grid) service technology to demonstrate the assimilation of multiple distributed data sources (a typical data grid problem) into a major parallel high-performance computing earthquake forecasting code. Such a linkage of Geoinformatics with Geocomplexity demonstrates the value of the Solid Earth Research Virtual Observatory (SERVO) Grid concept, and advances Grid technology by building the first real-time large-scale data assimilation grid.

virtual observatory↗

Potential of Data Center Controls in Grid Services

The rapid proliferation of large data centers brings both challenges and opportunities for grid reliability. The data center resources and their potential flexibility have the potential to contribute resources to grid operations. Through capabilities like energy shifting and resource coordination, data centers can help reduce their net demand on the transmission network, as well as provide additional grid services to support reliable operation on the grid. While transient and long-term grid planning and operations are the scenarios that draw most attention, the quasi-steady state timeseries (QSTS) operation of data centers and grid bring interesting scenarios that can help evaluate the data center controls to aid grid services. This work is focused on modeling data centers for QSTS applications – incorporating the AI data center load profiles and building on the PNNL digital twin model for the thermal management loads to enable simulation studies to reveal the impact of data center controls on grid performance. This includes the integration of a QSTS battery and natural gas generator model to incorporate local resource impacts to the system. The simulation study is performed with a modified IEEE 24-Bus transmission system. Scenarios are focused on evaluating the data center load impacts on the transmission system and leveraging both data center and local generation controls to mitigate those impacts and provide additional grid services. The data center controls revealed the ability to contribute to two main kinds of grid services: preventing congestion on a weak grid by coordinating the data center resources with the collocated BESS and onsite generation; and the ability to help the grid operations during stressed times of operation like during a contingency. Leveraging these and other capabilities has the potential to help data centers become grid responsive assets, aiding in both their integration into the power system and grid reliability.

power grid simulation↗

Extension of Large Fire Emissions From Summer to Autumn and Its Drivers in the Western US

Abstract Burned areas in the western US have increased ten‐fold since 1980s, which are attributable to multiple factors, including increasing heat, changing precipitation patterns, and extended drought. To better understand how these factors contribute to large fire emissions (gridded monthly fire emissions >95th percentile of all the fire emissions in the western US; 0.009 Gg/month), we build a machine learning model to predict fire emissions (PM 2.5 ) over the western US at 0.25° resolution, interpreted using explainable artificial intelligence (XAI). From the predictor contributions derived from XAI, we conduct k‐means clustering analysis to identify four clusters of predictor variables representing different drivers of large fire emissions. The four clusters feature the contributions of fuel load (Cluster 1) and different levels of dryness (Cluster 2–4), controlled by fuel moisture, drought condition, and fire‐favorable large‐scale meteorological patterns featuring high temperature, high pressure, and low relative humidity. In the past two decades, large fire emissions peak in summer. However, large fire emissions increased significantly in September and October in 2010–2020 relative to 2000–2009, extending the peak large fire emissions from summer to autumn. The larger enhancements of large fire emissions during autumn compared to summer are contributed by decreased fuel moisture, along with more frequent concurrent fire‐favorable large‐scale meteorological patterns and drought. These results highlight fuel drying as a common driver supported by multiple drivers, such as warmer temperature and more frequent synoptic patterns favorable for fires, in increasing the autumn risk of large fire emissions across the western US.

54 ENVIRONMENTAL SCIENCES↗

PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes

Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required a fine initial mesh. Results indicate that our parallel load balancing strategy will remain viable on large numbers of processors.

Oliker, Leonid↗

Design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured-grid Euler solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effects of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of 3 performance improvement. The overall solution efficiency is compared with that obtained on the Cray Y-MP vector supercomputer.

Das, R.↗

A Modular Optimal Power Flow Method for Integrating New Technologies in Distribution Grids

This work proposes a modular concept to build optimal power flow (OPF) models for distribution networks containing various emerging technologies under diverse ownership structures, to efficiently deal with evolving technology capabilities and information sharing or privacy constraints. This concept will support any typical OPF application (e.g., optimal dispatch of a given asset without violating grid constraints) by coordinating between grid module and technology module without the need to recreate various modeling elements as technology capability changes due to innovation. Moreover, the modularity of the proposed concept enables achieving system level objectives without sharing detailed information on module level objectives and constraints among modules. To achieve this, the proposed work develops a gradient-descent algorithm which builds upon the literature on the state-of-the-art power flow approximation. The proposed concept is demonstrated with two case studies of i) controllable loads and ii) battery energy storage system (BESS) on an actual large-scale distribution grid.

Hanif, Sarmad↗

Surrogate Model Development of Spent Fuel Degradation for Repository Performance Assessment

In model simulations of deep geologic repositories, UO 2 fuel matrix degradation typically begins as soon as the waste package breaches and groundwater contacts the fuel surface. The initial degradation rate depends on the timing of these events, burnup of the fuel, temperature, and concentrations of dissolved reactants. Estimating the initial rate of degradation is fairly straightforward, but as UO 2 corrosion products precipitate on the fuel surface and the movement of dissolved species between the fuel surface and environment is impeded by the precipitated solids, the rate is more difficult to quantify. At that point, calculating the degradation rate becomes a reactive-transport problem in which a large number of equations must be solved by iteration for a large number of grid cells at each time step. The consequence is that repository simulations, which are already expensive, become much more expensive, especially when hundreds or thousands of waste packages breach. The Fuel Matrix Degradation (FMD) model is the process model of the Spent Fuel and Waste Science and Technology (SFWST) campaign of the US Department of Energy (DOE). It calculates spent fuel degradation rates as a function of radiolysis, redox reactions, electrochemical reactions, alteration layer growth, and diffusion of reactants through the alteration layer. Like other similar fuel degradation process models, it is a complicated model requiring a large number of calculations and iterations at each time step.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel communication rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗

Opportunities for Industry to Provide Flexibility While Increasing Profitability

Supply and demand flexibility will both be needed to ensure the electricity system functions properly as the share from variable renewable generation continues to grow. Industrial manufacturing currently consumes about a third of primary energy worldwide, and electricity is projected to supply an increasing share of this demand as the global economy decarbonizes. Therefore, the ability for industry to flex demand poses an enticing opportunity to enable grid flexibility. However, large capital outlays prevent industry from voluntarily altering demand. Here we show that as battery costs continue to fall, industry will soon be able to profitably alter demand in accordance with electricity price variations. Focusing on two established industries– chlor-alkali and electric arc furnaces – and two industries with large future potential – methane pyrolysis and atmospheric CO 2 capture, we use a linear program (LP) optimization to assess the technoeconomic feasibility of flexible industrial demand across both historical and future-looking wholesale day-ahead marginal prices for the Electricity Reliability Council of Texas (ERCOT). We find positive net present values (NPV) from $\$$400K to $\$$50M using projected 2050 battery prices for industrial purchase of behind-the-meter batteries, using only arbitrage as a source of value. These results indicate that, with projected battery prices, profit-seeking industrial players could voluntarily play a future role in stabilizing a high-renewables grid where electricity prices act as accurate signals of grid needs.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Speed to Power: Solutions for Accelerating Large Load Connections

Rapid growth in demand from data centers and other large loads is creating a range of new challenges for electricity planners, investors, system operators, and regulators, leading to bottlenecks that have slowed connection of large loads to the electric grid. In response, innovative solutions for accelerating large load connections are beginning to emerge across the U.S. Drawing on an extensive document and literature review, this report identifies more than 40 potential solutions for accelerating large load connections, organized into five functional areas: load forecasting, interconnection, resource planning and procurement, markets and operations, and cost allocation and ratemaking. The five functional areas provide a framework for organizing challenges and solutions to large load connection bottlenecks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗

A numerically exact full wave packet approach to molecule-surface scattering

A numerically exact spectral method for solving the time-dependent Schroedinger equation in spherical coordinates is described. The angular dependence of the wave function is represented on a two-dimensional grid of evenly spaced points. The fast Fourier transform algorithm is used to transform between the angle space representation of the wave function and its conjugate representation in momentum space. The time propagation of the wave function is evaluated using an expansion of the time evolution operator as a series of Chebyshev polynomials. Calculations performed for a model system representing H2 scattering from a rectangular corrugated surface yield transition probabilities that are in excellent agreement with those obtained using the close-coupling wave packet (CCWP) method. However, the new method is found to require substantially more computation time than the CCWP method because of the large number of grid points needed to represent the angular dependence of the wave function and the variation in the number of terms required in the Chebyshev representation of the time evolution operator.

Mowrey, R. C.↗

MOLA Topography of Impact Basins in the Northern Hemisphere of Mars

Coverage of the northern hemisphere of Mars by the Mars Orbiter Laser Altimeter (MOLA) during the aerobraking hiatus and the two Science Phasing Operation periods provides improved definition and characterization of large impact basins. Gridded MOLA data show the Utopia Basin has a pronounced bowl-like structure, as opposed to the interior rises suggested by the earlier USGS DEM. The elevation structure is concentric about the basin center as mapped by McGill. In particular, the proposed inner ring closely follows the -4 km contour over much of the southern, western and northwestern sides. Higher topography along portions of the dichotomy boundary aligns with the basin's outer ring. High topography in the polar region also occurs where the outer ring should lie, raising the possibility that perhaps some of the polar topography is due to basin structure as well as ice. Two MOLA passes near Phison Rupes provide evidence for a large "stealth" hole where Viking imagery show little evidence of any major structure. The 2 km deep, 600 km wide depression at 31OW, 3ON is as large as the Cassini impact basin 1000 km to the SW. While Cassini is easily recognized in image data, the "MOLA Hole" is not. If this depression is a deeply eroded and buried impact basin (as perhaps suggested by a decrease in the crater density and somewhat smoother terrain than in adjacent areas), it is not clear why it has managed to maintain its great depth. In Tempe at the dichotomy boundary a 300 km wide impact basin is revealed by pronounced bowl-like topography centered at 87W, 47N, even though only about 1/3 of the basin rim structure is obvious. The basin lies on a sloping boundary zone, with the more buried N rim up to 2 km below the rugged S rim. A similar N-S asymmetry in basin ring structure occurs for the much larger Isidis Basin, where the S rim rises 6 km but the subdued N rim rises barely 2 km above the floor. There is essentially no topographic expression of the main ring in the NE quadrant of Isidis where, if it exists, it lies below Hesperian-age plains.

Frey, Herbert↗

Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

The ability of computers to solve hitherto intractable problems and simulate complex processes using mathematical models makes them an indispensable part of modern science and engineering. Computer simulations of large-scale realistic applications usually require solving a set of non-linear partial differential equations (PDES) over a finite region. For example, one thrust area in the DOE Grand Challenge projects is to design future accelerators such as the SpaHation Neutron Source (SNS). Our colleagues at SLAC need to model complex RFQ cavities with large aspect ratios. Unstructured grids are currently used to resolve the small features in a large computational domain; dynamic mesh adaptation will be added in the future for additional efficiency. The PDEs for electromagnetics are discretized by the FEM method, which leads to a generalized eigenvalue problem Kx = AMx, where K and M are the stiffness and mass matrices, and are very sparse. In a typical cavity model, the number of degrees of freedom is about one million. For such large eigenproblems, direct solution techniques quickly reach the memory limits. Instead, the most widely-used methods are Krylov subspace methods, such as Lanczos or Jacobi-Davidson. In all the Krylov-based algorithms, sparse matrix-vector multiplication (SPMV) must be performed repeatedly. Therefore, the efficiency of SPMV usually determines the eigensolver speed. SPMV is also one of the most heavily used kernels in large-scale numerical simulations.

Oliker, Leonid↗