Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned methods”

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 739 records · Page 41

Flow Partitioning in Fully Saturated Soil Aggregates

Microbes play an important role in facilitating organic matter decomposition in soils, which is a major component of the global carbon cycle. Microbial dynamics are intimately coupled to environmental transport processes, which control access to labile organic matter and other nutrients that are needed for the growth and maintenance of microorganisms. Transport of soluble nutrients in the soil system is arguably most strongly impacted by preferential flow pathways in the soil. Since the physical structure of soils can be characterized as being formed from constituent micro aggregates which contain internal porosity, one pressing question is the partitioning of the flow among the “inter-aggregate” and “intra-aggregate” pores and how this may impact overall solute transport within heterogeneous soil structures. The answer to this question is particularly important in evaluating assumptions to be used in developing upscaled simulations based on highly-resolved mechanistic models. We constructed a number of diverse multi-aggregate structures with different packing ratios by stacking micro-aggregates containing internal pores and varying the size and shape of inter-aggregate pore spacing between them. We then performed pore-scale flow simulations using computational fluid dynamics methods to determine the flow patterns in these aggregate-of-aggregates structures and computed the partitioning of the flow through intra- and inter-aggregate pores as a function of the spacing between the aggregates. The results of these numerical experiments demonstrate that soluble nutrients are largely transported via flows through inter-aggregate pores. Although this result is consistent with intuition, we have also been able to quantify the relative flow capacity of the two domains under various conditions. For example, in our simulations, the flow capacity through the aggregates (intra-aggregate flow) was less than 2% of the total flow when the spacing between the aggregates was larger than 18 micron. Inter-aggregate pores continued to be the dominant flow pathways even at much smaller spacing; intra-aggregate flow was less than 10% of the total flow when the inter- and intra-aggregate pore sizes were comparable. Such studies are making it possible to identify which model upscaling assumptions are realistic and what computational methods are required for detailed numerical investigation of microbial carbon cycling dynamics in soil systems.

computational fluid dynamics↗

A new method for diagnosing effective radiative forcing from aerosol–cloud interactions in climate models

Aerosol–cloud interactions (ACIs) are a leading source of uncertainty in estimates of the historical effective radiative forcing (ERF). One reason for this uncertainty is the difficulty in estimating the ERF from aerosol–cloud interactions (ERFaci) in climate models, which typically requires multiple calls to the radiation code. Most commonly used methods also cannot disentangle the contributions from different processes to ERFaci. Here, we develop a new, computationally efficient method for estimating the shortwave (SW) ERFaci from liquid clouds using histograms of monthly averaged cloud fraction partitioned by cloud droplet effective radius (r e ) and liquid water path (LWP). Multiplying the histograms with SW cloud radiative kernels gives the total SW ERFaci from liquid clouds, which can be decomposed into contributions from the Twomey effect, LWP adjustments, and cloud fraction (CF) adjustments. We test the method with data from five CMIP6-era models, using the Moderate Resolution Imaging Spectroradiometer (MODIS) satellite instrument simulator to generate the histograms. Our method gives similar total SW ERFaci estimates to other established methods in regions of prevalent liquid cloud and indicates that the Twomey effect, LWP adjustments, and CF adjustments have contributed -0.34 ± 0.23, -0.22 ± 0.13, and -0.09 ± 0.11 W m -2 , respectively, to the effective radiative forcing of the climate since 1850 in the ensemble mean (95 % confidence). These results demonstrate that widespread adoption of a MODIS r e –LWP joint histogram diagnostic would allow the SW ERFaci and its components to be quickly and accurately diagnosed from climate model outputs, a crucial step for reducing uncertainty in the historical ERF.

54 ENVIRONMENTAL SCIENCES↗

Automatic off-body overset adaptive Cartesian mesh method based on an octree approach

This paper describes a method for generating adaptive structured Cartesian grids within a near-body/off-body mesh partitioning framework for the flow simulation around complex geometries. The off-body Cartesian mesh generation derives from an octree structure, assuming each octree leaf node defines a structured Cartesian block. This enables one to take into account the large scale discrepancies in terms of resolution between the different bodies involved in the simulation, with minimum memory requirements. Two different conversions from the octree to Cartesian grids are proposed: the first one generates Adaptive Mesh Refinement (AMR) type grid systems, and the second one generates abutting or minimally overlapping Cartesian grid set. We also introduce an algorithm to control the number of points at each adaptation, that automatically determines relevant values of the refinement indicator driving the grid refinement and coarsening. An application to a wing tip vortex computation assesses the capability of the method to capture accurately the flow features.

97 MATHEMATICS AND COMPUTING↗

Efficient Synthesis of Graph Methods: a Dynamically Scheduled Architecture

RDF databases naturally map to a graph representation and employ languages, such as SPARQL, that implements queries as graph pattern matching routines. Graph methods exhibit an irregular behavior: they present unpredictable, fine-grained data accesses, and are synchronization inten- sive. Graph data structures expose large amounts of dy- namic parallelism, but are difficult to partition without gen- erating load unbalance. In this paper, we present a novel ar- chitecture to improve the synthesis of graph methods. Our design addresses the issues of these algorithms with two com- ponents: a Dynamic Task Scheduler (DTS), which reduces load unbalance and maximize resource utilization, and a Hi- erarchical Memory Interface controller (HMI), which pro- vides support for concurrent memory operations on multi- ported/multi-banked shared memories. We evaluate our ap- proach by generating the accelerators for a set of SPARQL queries from the Lehigh University Benchmark (LUBM). We first analyze the load unbalance of these queries, showing that execution time among tasks can differ even of order of magnitudes. We then synthesize the queries and com- pare the performance of the resulting accelerators against the current state of the art. Experimental results show that our solution provides a speedup over the serial implementa- tion close to the theoretical maximum and a speedup up to 3.45 over a baseline parallel implementation. We conclude our study by exploring the design space to achieve maximum memory channels utilization. The best design used at least three of the four memory channels for more than 90% of the execution time.

architecture↗

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids

Increase in the proliferation of distributed energy resources require real-time situational awareness for efficient grid operations. State estimation plays an important role for the real-time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hier-archical spectral clustering-based network partitioning algorithm followed by a decentralized compressive sensing (DCS)-based state estimation. The applicability of the proposed network partitioning algorithm is tested on an IEEE 123-bus network, an IEEE 8,500-node system, and a 6,000+ node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum number of edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6,000+ node distribution network after dividing the network into 18 optimal partitions. Simulation results show that the DCS-based state estimation recovers the system states with high accuracy and low complexity.

alternating direction method of multipliers↗

Meshless discretization of the discrete-ordinates transport equation with integration based on Voronoi cells

The time-dependent, gray, linear radiation transport equation is discretized using the meshless local Petrov-Galerkin method with reproducing kernels. The integration is performed using a Voronoi tessellation, which creates a partition of unity that only depends on the position and extent of the kernels. The resolution of the integration automatically follows the particles and requires no manual adjustment. The discretization includes streamline-upwind Petrov-Galerkin stabilization to prevent oscillations and improve numerical conditioning. The angular quadrature is selectively refineable to increase angular resolution in chosen directions. The time discretization is done using backward Euler. The transport solve for each direction and the solve for the scattering source are both done using Krylov iterative methods. The results indicate first-order convergence in time and second-order convergence in space for linear reproducing kernels.

97 MATHEMATICS AND COMPUTING↗

Unifying All Classical Spin Models in a Lattice Gauge Theory

The partition function of all classical spin models, including all discrete standard statistical models and all Abelian discrete lattice gauge theories (LGTs), is expressed as a special instance of the partition function of the 4D Z{sub 2} LGT. This unifies all classical spin models with apparently very different features in a single complete model. This result is applied to establish a new method to compute the mean-field theory of Abelian discrete LGTs with d{>=}4, and to show that computing the partition function of the 4D Z{sub 2} LGT is computationally hard (P hard). The 4D Z{sub 2} LGT is also proved to be approximately complete for Abelian continuous models. The proof uses techniques from quantum information.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The effects of charge transfer on the aqueous solvation of ions

Ab initio-based charge partitioning of ionic systems results in ions with non-integer charges. This charge-transfer (CT) effect alters both short- and long-range interactions. Until recently, the effects of CT have been mostly neglected in molecular dynamics (MD) simulations. The method presented in this paper for including charge transfer between ions and water is consistent with ab initio charge partitioning and does not add significant time to the simulation. The ions of sodium, potassium, and chloride are parameterized to reproduce dimer properties and aqueous structures. The average charges of the ions from MD simulations (0.900, 0.919, and -0.775 for Na{sup +}, K{sup +}, and Cl{sup -}, respectively) are consistent with quantum calculations. The hydration free energies calculated for these ions are in agreement with experimental estimates, which shows that the interactions are described accurately. The ions also have diffusion constants in good agreement with experiment. Inclusion of CT results in interesting properties for the waters in the first solvation shell of the ions. For all ions studied, the first shell waters acquire a partial negative charge, due to the difference between water-water and water-ion charge-transfer amounts. CT also reduces asymmetry in the solvation shell of the chloride anion, which could have important consequences for the behavior of chloride near the air-water interface.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Assessing Corn Stover Composition and Sources of Variability via NIRS

Corn stover, the above-ground, non-grain portion of the crop, is a large, currently available source of biomass that potentially could be collected as a biofuels feedstock. Biomass conversion process economics are directly affected by the overall biochemical conversion yield, which is assumed to be proportional to the carbohydrate content of the feedstock materials used in the process. Variability in the feedstock carbohydrate levels affects the maximum theoretical biofuels yield and may influence the optimum pretreatment or saccharification conditions. The aim of this study is to assess the extent to which commercial hybrid corn stover composition varies and begin to partition the variation among genetic, environmental, or annual influences. A rapid compositional analysis method using near-infrared spectroscopy/partial least squares multivariate modeling (NIR/PLS) was used to evaluate compositional variation among 508 commercial hybrid corn stover samples collected from 47 sites in eight Corn Belt states after the 2001, 2002, and 2003 harvests. The major components of the corn stover, reported as average (standard deviation) % dry weight, whole biomass basis, were glucan 31.9 (2.0), xylan 18.9 (1.3), solubles composite 17.9 (4.1), and lignin (corrected for protein) 13.3 (1.1). We observed wide variability in the major corn stover components. Much of the variation observed in the structural components (on a whole biomass basis) is due to the large variation found in the soluble components. Analysis of variance (ANOVA) showed that the harvest year had the strongest effect on corn stover compositional variation, followed by location and then variety. The NIR/PLS rapid analysis method used here is well suited to testing large numbers of samples, as tested in this study, and will support feedstock improvement and biofuels process research.

09 BIOMASS FUELS↗

A proximity‐based image‐processing algorithm for colloid assignment in segmented multiphase flow datasets

Summary Colloidal transport and deposition are of both environmental and engineering importance. Easier access to x‐ray microtomography (XMT) coupled with improved imaging resolution has made XMT a unique and viable tool for visualizing and quantifying these processes. Currently, there is scant information in the literature addressing colloid segmentation and analysis in saturated and unsaturated porous media, in particular related to spatial partitioning of colloids. To support this need, an approach to assign segmented colloidal particles and aggregates to different partitioning classes based on their proximity to different phases is presented here. The method uses different markers for each attachment site (e.g. wetting‐nonwetting phase interfaces). An example XMT dataset from a drainage experiment is used to demonstrate the efficacy of the image processing algorithms. Flow conditions, and fluid and colloid properties, can thus be compared to the behaviour of colloids within the porous medium. This algorithm can help elucidate colloidal deposition mechanisms and the importance of different attachment sites, explore the importance of fluid properties, as well as the arrangement and shape of the colloids.

BRUECK, C. L.↗

Counterrotating prop-fan simulations which feature a relative-motion multiblock grid decomposition enabling arbitrary time-steps

Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.

Janus, J. Mark↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius↗

FAILSAFE Health Management for Embedded Systems

The FAILSAFE project is developing concepts and prototype implementations for software health management in mission- critical, real-time embedded systems. The project unites features of the industry-standard ARINC 653 Avionics Application Software Standard Interface and JPL s Mission Data System (MDS) technology (see figure). The ARINC 653 standard establishes requirements for the services provided by partitioned, real-time operating systems. The MDS technology provides a state analysis method, canonical architecture, and software framework that facilitates the design and implementation of software-intensive complex systems. The MDS technology has been used to provide the health management function for an ARINC 653 application implementation. In particular, the focus is on showing how this combination enables reasoning about, and recovering from, application software problems.

Horvath, Gregory A.↗

Check-Standard Testing Across Multiple Transonic Wind Tunnels with the Modern Design of Experiments

This paper reports the result of an analysis of wind tunnel data acquired in support of the Facility Analysis Verification & Operational Reliability (FAVOR) project. The analysis uses methods referred to collectively at Langley Research Center as the Modern Design of Experiments (MDOE). These methods quantify the total variance in a sample of wind tunnel data and partition it into explained and unexplained components. The unexplained component is further partitioned in random and systematic components. This analysis was performed on data acquired in similar wind tunnel tests executed in four different U.S. transonic facilities. The measurement environment of each facility was quantified and compared.

Deloach, Richard↗

A scalable mixed-integer decomposition approach for optimal power system restoration

The optimal restoration problem lies at the foundation of the evaluation and improvement of resilience in power systems. In this paper we present a scalable decomposition algorithm, based on the integer L-shaped method, for solving this problem for realistic power systems. The algorithm works by partitioning the problem into a master problem and a slave problem. The master problem optimizes over energization sequences of generators, buses and branches, for the entire restoration horizon, while respecting stylized energization requirements. The slave problem verifies that there exist power flow solutions supporting the energization sequences proposed by the master problem, adding cuts to the master if an infeasible sequence is detected. The power flow verification is carried out using a piece-wise linear approximation of the power flow equations, capable of capturing overvoltage situations common in restoration procedures. We develop specialized binary cuts and hybrid Benders-binary cuts for separating infeasible islands, which are stronger than regular no-good cuts, as well as heuristics for obtaining feasible solutions. We present numerical results for the IEEE 39- and 118-bus systems, and for the Chilean 1500-bus grid, where our algorithm finds near-optimal restoration sequences orders of magnitude faster than the state-of-the-art, demonstrating the effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Coupling of organic and inorganic aerosol systems and the effect on gas–particle partitioning in the southeastern US

Abstract. Several models were used to describe the partitioning of ammonia, water, and organic compounds between the gas and particle phases for conditions in the southeastern US during summer 2013. Existing equilibrium models and frameworks were found to be sufficient, although additional improvements in terms of estimating pure-species vapor pressures are needed. Thermodynamic model predictions were consistent, to first order, with a molar ratio of ammonium to sulfate of approximately 1.6 to 1.8 (ratio of ammonium to 2 × sulfate, R N/2S ≈ 0.8 to 0.9) with approximately 70 % of total ammonia and ammonium (NH x ) in the particle. Southeastern Aerosol Research and Characterization Network (SEARCH) gas and aerosol and Southern Oxidant and Aerosol Study (SOAS) Monitor for AeRosols and Gases in Ambient air (MARGA) aerosol measurements were consistent with these conditions. CMAQv5.2 regional chemical transport model predictions did not reflect these conditions due to a factor of 3 overestimate of the nonvolatile cations. In addition, gas-phase ammonia was overestimated in the CMAQ model leading to an even lower fraction of total ammonia in the particle. Chemical Speciation Network (CSN) and aerosol mass spectrometer (AMS) measurements indicated less ammonium per sulfate than SEARCH and MARGA measurements and were inconsistent with thermodynamic model predictions. Organic compounds were predicted to be present to some extent in the same phase as inorganic constituents, modifying their activity and resulting in a decrease in [H + ] air (H + in µg m -3 air), increase in ammonia partitioning to the gas phase, and increase in pH compared to complete organic vs. inorganic liquid–liquid phase separation. In addition, accounting for nonideal mixing modified the pH such that a fully interactive inorganic–organic system had a pH roughly 0.7 units higher than predicted using traditional methods (pH = 1.5 vs. 0.7). Particle-phase interactions of organic and inorganic compounds were found to increase partitioning towards the particle phase (vs. gas phase) for highly oxygenated (O : C ≥ 0.6) compounds including several isoprene-derived tracers as well as levoglucosan but decrease particle-phase partitioning for low O : C, monoterpene-derived species.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive mesh refinement for steady flows in Nek5000

Adaptive mesh refinement is performed in the framework of the spectral element method augmented by approaches to error estimation and control. The h-refinement technique is used for adapting the mesh, where selected grid elements are split by a quadtree (2D) or octree (3D) structure. Continuity between parent-child elements is enforced by high-order interpolation of the solution across the common faces. Parallel mesh partitioning and grid management respectively, are taken care of by the external libraries ParMETIS and p4est. Two methods are considered for estimating and controlling the error of the solution. The first error estimate is local and based on the spectral properties of the solution on each element. This method gives a local measure of the L-2-norm of the solution over the entire computational domain. The second error estimate uses the dual-weighted residuals method - it is based on and takes into account both the local properties of the solution and the global dependence of the error in the solution via an adjoint problem. The objective of this second approach is to optimize the computation of a given functional of physical interest. The simulations are performed by using the code Nek5000 and three steady-state test cases are studied: a two-dimensional lid-driven cavity at Re = 7, 500, a two-dimensional flow past a cylinder at Re = 40, and a three-dimensional lid-driven cavity at Re = 2,000 with a moving lid tilted by an angle of 30 degrees. Finally, the efficiency of both error estimators is compared in terms of refinement patterns and accuracy on the functional of interest. In the case of the adjoint error estimators, the trend on the error of the functional is shown to be correctly represented up to a multiplicative constant.

42 ENGINEERING↗

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗