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 181 records · Page 10

Simple Hybrid Sea Ice Nudging Method for Improving Control Over Partitioning of Sea Ice Concentration and Thickness

Abstract To assess the effect of ocean‐atmosphere coupling in the climate response to forced sea ice loss, the Polar Amplification Model Intercomparison Project protocol includes centennial coupled atmosphere‐ocean general circulation model simulations with imposed sea ice loss. The protocol, which specifies sea ice concentration and thickness distribution targets, does not prescribe a method for achieving them. Although different methods for imposing sea ice loss (or growth) in models have been documented, testing of the method‐dependence of the resulting climate responses has been limited. Achieving the targeted sea ice state has proven to be challenging using the so‐called ghost‐flux nudging method, which induces ice melt from below, as this method does not constrain the partitioning between thickness and concentration. We propose, describe and test a simple method that combines the advantages of direct sea ice nudging and ghost‐flux nudging. The hybrid nudging method better captures the partitioning between thickness and concentration while conserving total water content. We document how this novel sea ice constraining method reaches specific targets, enhances surface turbulent heat flux responses to sea ice loss, and induces tropospheric warming for both polar regions.

54 ENVIRONMENTAL SCIENCES↗

Life prediction of thermal-mechanical fatigue using strain-range partitioning

The applicability is described of the method of Strainrange Partitioning to the life prediction of thermal-mechanical strain-cycling fatigue. An in-phase test on 316 stainless steel is analyzed as an illustrative example. The observed life is in excellent agreement with the life predicted by the method using the recently proposed Step-Stress Method of experimental partitioning, the Interation Damage Rule, and the life relationships determined at an isothermal temperature of 705 C. Implications of the study are discussed relative to the general thermal fatigue problem.

Halford, G. R.↗

Nonlinear structural and life analyses of a combustor liner

Three dimensional, nonlinear finite element structural analyses were performed for a simulated combustor liner specimen to assess the capability of nonlinear analyses using classical inelastic material models to represent the thermoplastic creep response of the one half scale component. Results indicate continued cyclic hardening and ratcheting while experimental data suggested a stable stress strain response after only a few loading cycles. The computed stress strain history at the critical location was put into two life prediction methods, strainrange partitioning and a Pratt and Whitney combustor life prediction method to evaluate their ability to predict cyclic crack initiation. It is found that the life prediction analyses over predicted the observed cyclic crack initiation life.

Moreno, V.↗

Life prediction of thermal-mechanical fatigue using strainrange partitioning

This paper describes the applicability of the method of Strainrange Partitioning to the life prediction of thermal-mechanical strain-cycling fatigue. An in-phase test on 316 stainless steel is analyzed as an illustrative example. The observed life is in excellent agreement with the life predicted by the method using the recently proposed Step-Stress Method of experimental partitioning, the Interaction Damage Rule, and the life relationships determined at an isothermal temperature of 705 C. Implications of the present study are discussed relative to the general thermal fatigue problem.

Halford, G. R.↗

Partition of unity finite element method for quantum mechanical materials calculations

The current state of the art for large-scale quantum-mechanical simulations is the planewave (PW) pseudopotential method, as implemented in codes such as VASP, ABINIT, and many others. However, since the PW method uses a global Fourier basis, with strictly uniform resolution at all points in space, it suffers from substantial inefficiencies in calculations involving atoms with localized states, such as first-row and transition-metal atoms, and requires significant nonlocal communications, which limit parallel efficiency. Real-space methods such as finite-differences (FD) and finite-elements (FE) have partially addressed both resolution and parallel-communications issues but have been plagued by one key disadvantage relative to PW: excessive number of degrees of freedom (basis functions) needed to achieve the required accuracies. In this paper, we present a real-space partition of unity finite element (PUFE) method to solve the Kohn–Sham equations of density functional theory. In the PUFE method, we build the known atomic physics into the solution process using partition-of-unity enrichment techniques in finite element analysis. The method developed herein is completely general, applicable to metals and insulators alike, and particularly efficient for deep, localized potentials, as occur in calculations at extreme conditions of pressure and temperature. Full self-consistent Kohn–Sham calculations are presented for LiH, involving light atoms, and CeAl, involving heavy atoms with large numbers of atomic-orbital enrichments. We find that the new PUFE approach attains the required accuracies with substantially fewer degrees of freedom, typically by an order of magnitude or more, than the PW method. As a result, we compute the equation of state of LiH and show that the computed lattice constant and bulk modulus are in excellent agreement with reference PW results, while requiring an order of magnitude fewer degrees of freedom to obtain.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Isotope partitioning of soil respiration: A Bayesian solution to accommodate multiple sources of variability

Isotopic methods offer great potential for partitioning trace gas fluxes such as soil respiration into their different source contributions. Traditional partitioning methods face challenges due to variability introduced by different measurement methods, fractionation effects, and end-member uncertainty. To address these challenges, we describe in this paper a hierarchical Bayesian (HB) approach for isotopic partitioning of soil respiration that directly accommodates such variability. We apply our HB method to data from an experiment conducted in a shortgrass steppe ecosystem, where decomposition was previously shown to be stimulated by elevated CO 2 . Our approach simultaneously fits Keeling plot (KP) models to observations of soil or soil-respired δ 13 C and [CO 2 ] obtained via chambers and gas wells, corrects the KP intercepts for apparent fractionation (Δ) due to isotope-specific diffusion rates and/or method artifacts, estimates method- and treatment-specific values for Δ, propagates end-member uncertainty, and calculates proportional contributions from two distinct respiration sources (“old” and “new” carbon). The chamber KP intercepts were estimated with greater confidence than the well intercepts and compared to the theoretical value of 4.4‰, our results suggest that Δ varies between 2 and 5.2‰ depending on method (chambers versus wells) and CO 2 treatment. Because elevated CO 2 plots were fumigated with 13 C-depleted CO 2 , the source contributions were tightly constrained, and new C accounted for 64% (range = 55–73%) of soil respiration. The contributions were less constrained for the ambient CO 2 treatments, but new C accounted for significantly less (47%, range = 15–82%) of soil respiration. Finally, our new HB partitioning approach contrasts our original analysis (higher contribution of old C under elevated CO 2 ) because it uses additional data sources, accounts for end-member bias, and estimates apparent fractionation effects.

54 ENVIRONMENTAL SCIENCES↗

Distributed memory compiler methods for irregular problems: Data copy reuse and runtime partitioning

Outlined here are two methods which we believe will play an important role in any distributed memory compiler able to handle sparse and unstructured problems. We describe how to link runtime partitioners to distributed memory compilers. In our scheme, programmers can implicitly specify how data and loop iterations are to be distributed between processors. This insulates users from having to deal explicitly with potentially complex algorithms that carry out work and data partitioning. We also describe a viable mechanism for tracking and reusing copies of off-processor data. In many programs, several loops access the same off-processor memory locations. As long as it can be verified that the values assigned to off-processor memory locations remain unmodified, we show that we can effectively reuse stored off-processor data. We present experimental data from a 3-D unstructured Euler solver run on iPSC/860 to demonstrate the usefulness of our methods.

Das, Raja↗

Applications of Fuzzy Clustering Techniques to Stratified by Tropopause MSU Temperature Retrievals

The fuzzy partitioned clustering method was applied to predict tropopause height only using microwave information with an eye towards using it on real data under cloudy conditions. In the second stage stratified by tropopause regression temperature retrievals included using only the three or four microwave channels for each 40 mb range. The first step in the experiment is the fuzzy partitioned clustering of the microwave brightness temperatures. This method is a combination of standard hard clustering and discriminant analysis. The fuzzy partitioned clustering uses all the generated probabilities of membership of each pattern vector in any of the given clusters. These probabilities are generated by discriminant analysis to locate the correct cluster. The ultimate goal of standard discriminant analysis is to provide the unique (correct) cluster to which the pattern vector belongs. It was only the maximum of all the generated probabilities. The method uses all the probabilities and weight the regressions generated within each cluster. These regression formulas predict the tropopause height from the microwave brightness temperatures. In the second step the microwave regression temperature retrievals are stratified by tropopause height every 40 mb. The control experiment is defined, the data are stratified by land/ocean, summer/winter, and latitude bands.

Munteanu, M. J.↗

Sensitivity evaluation of dynamic speckle activity measurements using clustering methods

We evaluate and compare the use of competitive neural networks, self-organizing maps, the expectation-maximization algorithm, K-means, and fuzzy C-means techniques as partitional clustering methods, when the sensitivity of the activity measurement of dynamic speckle images needs to be improved. The temporal history of the acquired intensity generated by each pixel is analyzed in a wavelet decomposition framework, and it is shown that the mean energy of its corresponding wavelet coefficients provides a suited feature space for clustering purposes. The sensitivity obtained by using the evaluated clustering techniques is also compared with the well-known methods of Konishi-Fujii, weighted generalized differences, and wavelet entropy. The performance of the partitional clustering approach is evaluated using simulated dynamic speckle patterns and also experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spatial decomposition of structured grids for nuclear reactor simulations

Spatial decomposition methods based on graph partitioning are developed and implemented in the high fidelity neutron transport code MPACT. These graph-based spatial decomposition methods are more general than previous decomposition methods and typically provide better load balance and reduced runtimes due to their improved parallel efficiency. Correlations are drawn between simulation runtime and the balance of the partition for 2D simulations. Comparisons are made using partition balance metrics for different decomposition schemes in 2D and 3D simulations. Finally, for typical ranges of subdomains, graph-based partitioning methods offer significant reductions to runtimes. However, for highly decomposed problems, these graph-based methods may decrease convergence rates, thus reducing parallel efficiency compared to older methods.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

FLAPS (Fatigue Life Analysis Programs): Computer Programs to Predict Cyclic Life Using the Total Strain Version of Strainrange Partitioning and Other Life Prediction Methods

This manual presents computer programs FLAPS for characterizing and predicting fatigue and creep-fatigue resistance of metallic materials in the high-temperature, long-life regime for isothermal and nonisothermal fatigue. The programs use the Total Strain version of Strainrange Partitioning (TS-SRP), and several other life prediction methods described in this manual. The user should be thoroughly familiar with the TS-SRP and these life prediction methods before attempting to use any of these programs. Improper understanding can lead to incorrect use of the method and erroneous life predictions. An extensive database has also been developed in a parallel effort. The database is probably the largest source of high-temperature, creep-fatigue test data available in the public domain and can be used with other life-prediction methods as well. This users' manual, software, and database are all in the public domain and can be obtained by contacting the author. The Compact Disk (CD) accompanying this manual contains an executable file for the FLAPS program, two datasets required for the example problems in the manual, and the creep-fatigue data in a format compatible with these programs.

Arya, Vinod K.↗

Scope and Abstraction: Two Criteria for Localized Planning

Localization is a general-purpose representational technique for partitioning problem requirements into subproblems. Localized search utilizes a partitioning by breaking the overall search space into several smaller search spaces, one for each subproblem. Unlike most methods of partitioning, localization allows for subproblems that overlap -- i.e., multiple search spaces may be involved in constructing shared pieces of the overall plan. In this paper we focus on two criteria for forming localizations: abstraction and scope. Abstraction-based localizations are motivated by activation relationships between problem requirements. In contrast, scope-based localizations are motivated by the relevance of problem requirements to specific portions of the overall plan. This paper also describes a method for automatically generating scope and abstraction-based localizations. Empirical results are provided that contrast their use in an office-building construction planning domain.

Lansky, Amy L.↗

Computational Study of Electron-Molecule Collisions Related to Low-Temperature Plasmas

Computational study of electron-molecule collisions not only complements experimental measurements, but can also be used to investigate processes not readily accessible experimentally. A number of ab initio computational methods are available for these types of calculations. Here we describe a recently developed technique, the finite element Z-matrix method, Analogous to the R-matrix, method, it partitions the space into regions and employs real matrix elements. However, unlike the implementation of the R-matrix method commonly used in atomic and molecular physics, the Z-matrix method is fully variational. In the present implementation, a mixed basis of finite elements and Gaussians is used to represent the continuum electron, thus offering full flexibility without imposing fixed boundary conditions. Numerical examples include the electron-impact dissociation of N2 via the metastable A3Su+ state, a process which may be important in the lower thermosphere, and the dissociation of the CF radical, a process of interest to plasma etching. To understand the dissociation pathways, large scale quantum chemical calculations have been carried out for all target states which dissociate to the lowest five limits in the case of N2, and to the lowest two limits in the case of CF. For N2, the structural calculations clearly show the preference for predissociation if the initial state is the ground X1 Sg+ state, but direct dissociation appears to be preferable if the initial state is the A3Su+ state. Multi-configuration SCF target functions are used in the collisional calculation.

Huo, Winifred M.↗

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗

Parallel scalability of Hartree–Fock calculations

Quantum chemistry is increasingly performed using large cluster computers consisting of multiple interconnected nodes. For a fixed molecular problem, the efficiency of a calculation usually decreases as more nodes are used, due to the cost of communication between the nodes. This paper empirically investigates the parallel scalability of Hartree–Fock calculations. The construction of the Fock matrix and the density matrix calculation are analyzed separately. For the former, we use a parallelization of Fock matrix construction based on a static partitioning of work followed by a work stealing phase. For the latter, we use density matrix purification from the linear scaling methods literature, but without using sparsity. When using large numbers of nodes for moderately sized problems, density matrix computations are network-bandwidth bound, making purification methods potentially faster than eigendecomposition methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗