Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “collocation”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Data centers as dispatchable loads to harness stranded power

Here, we analyze how traditional data center placement and optimal placement of dispatchable data centers affect power grid efficiency. We use detailed network models, stochastic optimization formulations, and diverse renewable generation scenarios to perform our analysis. Our results reveal that significant spillage and stranded power will persist in power grids as wind power levels are increased. A counter-intuitive finding is that collocating data centers with inflexible loads next to wind farms has limited impacts on renewable portfolio standard (RPS) goals because it provides limited system-level flexibility. Such an approach can, in fact, increase stranded power and fossil-fueled generation. In contrast, optimally placing data centers that are dispatchable provides system-wide flexibility, reduces stranded power, and improves efficiency. In short, optimally placed dispatchable computing loads can enable better scaling to high RPS. In our case study, we find that these dispatchable computing loads are powered to 60-80% of their requested capacity, indicating that there are significant economic incentives provided by stranded power.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Geostatistical Mapping of Salinity Conditioned on Borehole Logs, Montebello Oil Field, California

We present a geostatistics-based stochastic salinity estimation framework for the Montebello Oil Field that capitalizes on available total dissolved solids (TDS) data from groundwater samples as well as electrical resistivity (ER) data from borehole logging. Data from TDS samples (n = 4924) was coded into an indicator framework based on falling below four selected thresholds (500, 1000, 3000, and 10,000 mg/L). Collocated TDS-ER data from the surrounding groundwater basin were then employed to produce a kernel density estimator to establish conditional probabilities for ER data (n = 8 boreholes) falling below the selected TDS thresholds within the Montebello Oil Field area. Directional variograms were estimated from these indicator coded data, and 500 TDS realizations from conditional indicator simulation were generated for the subsurface region above the Montebello Oil Field reservoir. Simulations were summarized as 3D maps of median TDS, most likely salinity class, and probability for exceeding each of the specified TDS thresholds. Results suggested TDS was below 500 mg/L in most of the study area, with a trend toward higher values (500 to 1000 mg/L) to the southwest; consistent with the average regional groundwater flow direction. Discrete localized zones of TDS greater than 1000 mg/L were observed, with one of these zones in the greater than 10,000 mg/L range; however, these areas were not prevalent. The probabilistic approach used here is adaptable and is readily modified to include additional data and types and can be employed in time-lapse salinity modeling through Bayesian updating.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

The Effect of Environmental Contour Selection on Expected Wave Energy Converter Response

A wave energy converter must be designed to both maximize power production and to ensure survivability, which requires the prediction of future sea states. It follows that precision in the prediction of those sea states should be important in determining a final WEC design. One common method used to estimate extreme conditions employs environmental contours of extreme conditions. This report compares five environmental contour methods and their repercussions on the response analysis of Reference Model 3 (RM3). The most extreme power take off (PTO) force is predicted for the RM3 via each contour and compared to identify the potential difference in WEC response due to contour selection. The analysis provides insight into the relative performance of each of the contour methods and demonstrates the importance of an environmental contour in predicting extreme response. Ideally, over-predictions should be avoided, as they can add to device cost. At the same time, any "exceedances," that is to say sea states that exceed predictions of the contour, should be avoided so that the device does not fail. For the extreme PTO force response studied here, relatively little sensitivity to the contour method is shown due to the collocation of the device's resonance with a region of agreement between the contours. However, looking at the level of observed exceedances for each contour may still give a higher level of confidence to some methods.

42 ENGINEERING↗
DOE OSTI2014

Retrieval of Areal-averaged Spectral Surface Albedo from Transmission Data Alone: Computationally Simple and Fast Approach

We introduce and evaluate a simple retrieval of areal-averaged surface albedo using ground-based measurements of atmospheric transmission alone at five wavelengths (415, 500, 615, 673 and 870nm), under fully overcast conditions. Our retrieval is based on a one-line semi-analytical equation and widely accepted assumptions regarding the weak spectral dependence of cloud optical properties, such as cloud optical depth and asymmetry parameter, in the visible and near-infrared spectral range. To illustrate the performance of our retrieval, we use as input measurements of spectral atmospheric transmission from Multi-Filter Rotating Shadowband Radiometer (MFRSR). These MFRSR data are collected at two well-established continental sites in the United States supported by the U.S. Department of Energy’s (DOE’s) Atmospheric Radiation Measurement (ARM) Program and National Oceanic and Atmospheric Administration (NOAA). The areal-averaged albedos obtained from the MFRSR are compared with collocated and coincident Moderate Resolution Imaging Spectroradiometer (MODIS) white-sky albedo. In particular, these comparisons are made at four MFRSR wavelengths (500, 615, 673 and 870nm) and for four seasons (winter, spring, summer and fall) at the ARM site using multi-year (2008-2013) MFRSR and MODIS data. Good agreement, on average, for these wavelengths results in small values (≤0.01) of the corresponding root mean square errors (RMSEs) for these two sites. The obtained RMSEs are comparable with those obtained previously for the shortwave albedos (MODIS-derived versus tower-measured) for these sites during growing seasons. We also demonstrate good agreement between tower-based daily-averaged surface albedos measured for “nearby” overcast and non-overcast days. Thus, our retrieval originally developed for overcast conditions likely can be extended for non-overcast days by interpolating between overcast retrievals.

atmospheric transmission↗
DOE OSTI2015

How Well Can We Estimate Areal-Averaged Spectral Surface Albedo from Ground-Based Transmission in an Atlantic Coastal Area?

Areal-averaged albedos are particularly difficult to measure in coastal regions, because the surface is not homogenous, consisting of a sharp demarcation between land and water. With this difficulty in mind, we evaluate a simple retrieval of areal-averaged surface albedo using ground-based measurements of atmospheric transmission alone under fully overcast conditions. To illustrate the performance of our retrieval, we find the areal-averaged albedo using measurements from the Multi-Filter Rotating Shadowband Radiometer (MFRSR) at five wavelengths (415, 500, 615, 673, and 870 nm). These MFRSR data are collected at a coastal site in Graciosa Island, Azores supported by the U.S. Department of Energy’s (DOE’s) Atmospheric Radiation Measurement (ARM) Program. The areal-averaged albedos obtained from the MFRSR are compared with collocated and coincident Moderate Resolution Imaging Spectroradiometer (MODIS) white-sky albedo at four nominal wavelengths (470, 560, 670 and 860 nm). These comparisons are made during a 19-month period (June 2009 - December 2010). We also calculate composite-based spectral values of surface albedo by a weighted-average approach using estimated fractions of major surface types observed in an area surrounding this coastal site. Taken as a whole, these three methods of finding albedo show spectral and temporal similarities, and suggest that our simple, transmission-based technique holds promise, but with estimated errors of about ±0.03. Additional work is needed to reduce this uncertainty in areas with inhomogeneous surfaces.

Kassianov, Evgueni I.↗
DOE OSTI2021

Whole-lithosphere shear during oblique rifting

Processes controlling the formation of continental whole-lithosphere shear zones are debated, but their existence requires that the lithosphere is mechanically coupled from base to top. We document the formation of a dextral, whole-lithosphere shear zone in the Death Valley region (DVR), southwest United States. Dextral deflections of depth gradients in the lithosphere-asthenosphere boundary and Moho are stacked vertically, defining a 20–50-km-wide, lower lithospheric shear zone with ~60 km of shear. These deflections underlie an upper-crustal fault zone that accrued ~60 km of dextral slip since ca. 8–7 Ma, when we infer that whole-lithosphere shear began. This dextral offset is less than net dextral offset on the upper-crustal fault zone (~90 km, ca. 13–0 Ma) and total upper-crustal extension (~250 km, ca. 16–0 Ma). We show that, before ca. 8–7 Ma, weak middle crust decoupled upper-crustal deformation from deformation in the lower crust and mantle lithosphere. Between 16 and 7 Ma, detachment slip thinned, uplifted, cooled, and thus strengthened the middle crust, which is exposed in metamorphic core complexes collocated with the whole-lithosphere shear zone. Midcrustal strengthening coupled the layered lithosphere vertically and therefore enabled whole-lithosphere dextral shear. Where thick crust exists (as in pre–16 Ma DVR), midcrustal strengthening is probably a necessary condition for whole-lithosphere shear.

58 GEOSCIENCES↗
DOE OSTI2016

Inverse Subspace Iteration for Spectral Stochastic Finite Element Methods

We study random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric positive-definite matrix operator, we explore the performance of algorithms for computing its eigenvalues and eigenvectors represented using polynomial chaos expansions. We formulate a version of stochastic inverse subspace iteration, which is based on the stochastic Galerkin finite element method, and we compare its accuracy with that of Monte Carlo and stochastic collocation methods. The coefficients of the eigenvalue expansions are computed from a stochastic Rayleigh quotient. Our approach allows the computation of interior eigenvalues by deflation methods, and we can also compute the coefficients of multiple eigenvectors using a stochastic variant of the modified Gram-Schmidt process. The effectiveness of the methods is illustrated by numerical experiments on benchmark problems arising from vibration analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

We propose an algorithm for recovering sparse orthogonal polynomial expansions via collocation. A standard sampling approach for recovering sparse polynomials uses Monte Carlo sampling, from the density of orthogonality, which results in poor function recovery when the polynomial degree is high. Our proposed approach aims to mitigate this limitation by sampling with respect to the weighted equilibrium measure of the parametric domain and subsequently solves a preconditioned $\ell^1$-minimization problem, where the weights of the diagonal preconditioning matrix are given by evaluations of the Christoffel function. Our algorithm can be applied to a wide class of orthogonal polynomial families on bounded and unbounded domains, including all classical families. We present theoretical analysis to motivate the algorithm and numerical results that show our method is superior to standard Monte Carlo methods in many situations of interest. In conclusion, numerical examples are also provided to demonstrate that our proposed algorithm leads to comparable or improved accuracy even when compared with Legendre- and Hermite-specific algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Space–Time Least-Squares Petrov–Galerkin Projection for Nonlinear Model Reduction

This work proposes a space--time least-squares Petrov--Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov--)Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space--time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space--time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted $\ell^2$-norm. This norm can be defined to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space--time collocation and space--time Gauss--Newton with Approximated Tensors (GNAT) variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov--Galerkin projection include a reduction of both the spatial and temporal dimensions of the dynamical system, and a priori error bounds that bound the solution error by the best space--time approximation error and whose stability constants exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy for a fixed spatio-temporal discretization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Low-Memory, Discrete Ordinates, Discontinuous Galerkin Methods for Radiative Transport

The discrete ordinates discontinuous Galerkin (SN-DG) method is a well-established and practical approach for solving the radiative transport equation. In this paper, we study a low-memory variation of the upwind SN-DG method. The proposed method uses a smaller finite element space that is constructed by coupling spatial unknowns across collocation angles, thereby yielding an approximation with fewer degrees of freedom than the standard method. Like the original SN-DG method, the low-memory variation still preserves the asymptotic diffusion limit and maintains the characteristic structure needed for mesh sweeping algorithms. While we observe second-order convergence in the scattering dominated, diffusive regime, the low-memory method is in general only first-order accurate. To address this issue, we use upwind reconstruction to recover second-order accuracy. Finally, for both methods, numerical procedures based on upwind sweeps are proposed to reduce the system dimension in the underlying Krylov solver strategy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Parasol: An Architecture for Cross-Cloud Federated Graph Querying

Large scale data fusion of multiple datasets can often provide in- sights that examining datasets individually cannot. However, when these datasets reside in different data centers and cannot be collocated due to technical, administrative, or policy barriers, a unique set of problems arise that hamper querying and data fusion. To ad- dress these problems, a system and architecture named Parasol is presented that enables federated queries over graph databases residing in multiple clouds. Parasol’s design is flexible and requires only minimal assumptions for participant clouds. Query optimization techniques are also described that are compatible with Parasol’s lightweight architecture. Experiments on a prototype implementation of Parasol indicate its suitability for cross-cloud federated graph queries.

Graph database, federated database, data fusion, s↗
DOE OSTI2017

Mixed Presence Collaboration using Scalable Visualizations in Heterogeneous Display Spaces

Mixed presence collaboration involves remote collaboration between multiple collocated groups. This paper presents the design and results of a user study that focused on mixed presence collaboration using large-scale tiled display walls. The research was conducted in order to compare data synchronization schemes for multi-user visualization applications. Our study compared three techniques for sharing data between display spaces with varying constraints and affordances. The results provide empirical evidence that using data sharing techniques with continuous synchronization between the sites lead to improved collaboration for a search and analysis task between remotely located groups. We have also identified aspects of synchronized sessions that result in increased remote collaborator awareness and parallel task coordination. It is believed that this research will lead to better utilization of large-scale tiled display walls for distributed group work.

data-conferencing↗
DOE OSTI2018

Distributed caching for processing raw arrays

As applications continue to generate multi-dimensional data at exponentially increasing rates, fast analytics to extract meaningful results is becoming extremely important. The database community has developed array databases that alleviate this problem through a series of techniques. In-situ mechanisms provide direct access to raw data in the original format---without loading and partitioning. Parallel processing scales to the largest datasets. In-memory caching reduces latency when the same data are accessed across a workload of queries. However, we are not aware of any work on distributed caching of multi-dimensional raw arrays. In this paper, we introduce a distributed framework for cost-based caching of multi-dimensional arrays in native format. Given a set of files that contain portions of an array and an online query workload, the framework computes an effective caching plan in two stages. First, the plan identifies the cells to be cached locally from each of the input files by continuously refining an evolving R-tree index. In the second stage, an optimal assignment of cells to nodes that collocates dependent cells in order to minimize the overall data transfer is determined. We design cache eviction and placement heuristic algorithms that consider the historical query workload. A thorough experimental evaluation over two real datasets in three file formats confirms the superiority -- by as much as two orders of magnitude -- of the proposed framework over existing techniques in terms of cache overhead and workload execution time.

Zhao, Weijie↗
DOE OSTI2019

Shortest Path and Neighborhood Subgraph Extraction on a Spiking Memristive Neuromorphic Implementation

Spiking neuromorphic computers (SNCs) are promising as a post Moore's law technology partly because of their potential for very low power computation. SNCs have primarily been demonstrated on machine learning and neural network applications, but they can also be used for applications beyond machine learning that can leverage SNC properties such as massively parallel computation and collocated processing and memory. Here, we demonstrate two graph problems (shortest path and neighborhood subgraph extraction) that can be solved using SNCs. We discuss the approach for mapping these applications to an SNC. We also estimate the performance of a memristive SNC for these applications on three real-world graphs.

Schuman, Catherine↗
DOE OSTI2023

Efficient Reformulation of Linear and Nonlinear Solid-Phase Diffusion in Lithium-ion Battery Models using Symmetric Polynomials: Mass Conservation and Computational Efficiency

Lithium-ion batteries are typically modeled using porous electrode theory coupled with various transport and reaction mechanisms, along with suitable discretization or approximations for the solid-phase diffusion equation. The solid-phase diffusion equation represents the main computational burden for typical pseudo-2-dimensional (p2D) models since these equations in the pseudo r -dimension must be solved at each point in the computational grid. This substantially increases the complexity of the model as well as the computational time. Traditional approaches towards simplifying solid-phase diffusion possess certain significant limitations, especially in modeling emerging electrode materials which involve phase changes and variable diffusivities. A computationally efficient representation for solid-phase diffusion is discussed in this paper based on symmetric polynomials using Orthogonal Collocation and Galerkin formulation (weak form). A systematic approach is provided to increase the accuracy of the approximation (p form in finite element methods) to enable efficient simulation with a minimal number of semi-discretized equations, ensuring mass conservation even for non-linear diffusion problems involving variable diffusivities. These methods are then demonstrated by incorporation into the full p2D model, illustrating their advantages in simulating high C-rates and short-time dynamic operation of Lithium-ion batteries.

25 ENERGY STORAGE↗
DOE OSTI2014

Risk Analysis Virtual ENvironment

RAVEN has 3 major functionalities: 1. Provides a Graphical User Interface for the pre- and post-processing of the RELAP-7 input and output. 2. Provides the capability to model nuclear power plants control logic for the RELAP-7 code and dynamic control of the accident scenario evolution. This capability is based on a software structure that realizes a direct connection between the RELAP-7 solver engine (MOOSE) and a python environment where the variables describing the plant status are accessible in a scripting environment. RAVEN support the generation of the probabilistic scenario control by supplying a wide range of probability and cumulative distribution functions and their inverse functions. 3. Provides a general environment to perform probability risk analysis for RELAP-7, RELAP-5 and any generic MOOSE based applications. The probabilistic analysis is performed by sampling the input space of the coupled code parameters and it is enhanced by using modern artificial intelligence algorithms that accelerate the identification of the areas of major risk (in the input parameter space). This environment also provides a graphical visualization capability to analyze the outcomes. Among other approaches, the classical Monte Carlo and Latin Hypercube sampling algorithms are available. For the acceleration of the convergence of the sampling methodologies, Support Vector Machines, Bayesian regression, and collocation stochastic polynomials chaos are implemented. The same methodologies here described could be used to solve optimization and uncertainties propagation problems using the RAVEN framework.

Rabiti, Cristian↗