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 19 records

Numerical Investigation of Observational Flux Partitioning Methods for Water Vapor and Carbon Dioxide

Abstract While yearly budgets of CO 2 flux (F c ) and evapotranspiration (ET) above vegetation can be readily obtained from eddy‐covariance measurements, the separate quantification of their soil (respiration and evaporation) and canopy (photosynthesis and transpiration) components remains an elusive yet critical research objective. In this work, we investigate four methods to partition observed total fluxes into soil and plant sources: two new and two existing approaches that are based solely on analysis of conventional high frequency eddy‐covariance (EC) data. The physical validity of the assumptions of all four methods, as well as their performance under different scenarios, are tested with the aid of large‐eddy simulations, which are used to replicate eddy‐covariance field experiments. Our results indicate that canopies with large, exposed soil patches increase the mixing and correlation of scalars; this negatively impacts the performance of the partitioning methods, all of which require some degree of uncorrelatedness between CO 2 and water vapor. In addition, best performances for all partitioning methods were found when all four flux components are non‐negligible, and measurements are collected close to the canopy top. Methods relying on the water‐use efficiency (W) perform better whenWis known a priori, but are shown to be very sensitive to uncertainties in this input variable especially when canopy fluxes dominate. We conclude by showing how the correlation coefficient between CO 2 and water vapor can be used to infer the reliability of differentWparameterizations.

Environmental Sciences & Ecology↗

Dynamic flux surrogate-based partitioned methods for interface problems

Loosely coupled partitioned methods for multiphysics problems treat each subproblem as a separate entity and advance them independently in time. In so doing these methods enable code reuse, increase concurrency and provide a convenient framework for plug-and-play multiphysics simulations. However, mathematically loosely coupled schemes are equivalent to a single step of an iterative solution method, which can compromise their accuracy and stability. We present a new data-driven partitioned method for coupled parametric PDEs that can improve upon the accuracy of traditional loosely coupled methods without incurring a performance penalty. To that end, we replace conventional field transfers across the interface by a surrogate for the dynamics of the interface flux exchanged between the subdomains. To develop this surrogate we apply dynamic mode decomposition to a non-standard staggered-in-time state, comprising the interface flux and small solution patches near the interface. The new approach shifts the main computational burden to an offline training phase, whereas application of the surrogate in the online phase amounts to a single matrix–vector multiplication. In conclusion, we provide stability analysis of the surrogate-based partitioned scheme and include numerical results that demonstrate its potential.

Dynamic mode decomposition (DMD)↗

Analysis of Partitioned Methods for the Biot System

In this work, we present a comprehensive study of several partitioned methods for the coupling of flow and mechanics. We derive energy estimates for each method for the fully-discrete problem. We write the obtained stability conditions in terms of a key control parameter defined as a ratio of the coupling strength and the speed of propagation. Depending on the parameters in the problem, give the choice of the partitioned method which allows the largest time step. (C) 2015 Wiley Periodicals, Inc.

97 MATHEMATICS AND COMPUTING↗

An efficient implementation of the localized operator partitioning method for electronic energy transfer

The localized operator partitioning method [Y. Khan and P. Brumer, J. Chem. Phys. 137, 194112 (2012)] rigorously defines the electronic energy on any subsystem within a molecule and gives a precise meaning to the subsystem ground and excited electronic energies, which is crucial for investigating electronic energy transfer from first principles. However, an efficient implementation of this approach has been hindered by complicated one- and two-electron integrals arising in its formulation. Using a resolution of the identity in the definition of partitioning, we reformulate the method in a computationally efficient manner that involves standard one- and two-electron integrals. We apply the developed algorithm to the 9 − ((1 − naphthyl) − methyl) − anthracene (A1N) molecule by partitioning A1N into anthracenyl and CH{sub 2} − naphthyl groups as subsystems and examine their electronic energies and populations for several excited states using configuration interaction singles method. The implemented approach shows a wide variety of different behaviors amongst the excited electronic states.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effects of surface runoff and infiltration partition methods on hydrological modeling: A comparison of four schemes in two watersheds in the Northeastern US

The ratio according to which the precipitation/snowmelt is divided into surface and subsurface water is of primary importance to watershed scale hydrological modeling. The present study compared four different surface runoff and infiltration partition methods in the Richards-equation-based SWAT model (RSWAT), i.e., daily curve number method (DC-RSWAT), hourly curve number method (HC-RSWAT), Green-Ampt method (GA-RSWAT), and effective infiltration capacity method (EIC-RSWAT). These four versions of RSWAT and a daily-curve-number-based SWAT (DC-SWAT) were used to simulate daily flow rate (from 2001 to 2015) at the outlets of the Tuckahoe Creek Watershed (TCW) and Greensboro Watershed (GW) of the Chesapeake Bay in Maryland. Parameter sensitivity analysis, calibration, and prediction uncertainty analysis were conducted. The results indicate that surface runoff and infiltration partition methods have pronounced impacts on model performance. Comparative analysis showed that DC-RSWAT outperformed other versions of RSWAT for both calibration (from 2001 to2007) and validation (from 2008 to 2015) periods in the two test watersheds. In general, DC-RSWAT achieved more accurate deterministic flow simulation and reliable uncertainty estimation than other versions. As such, daily-curve-number method is recommended for surface runoff and infiltration partition in RSWAT for simulating stream flow.

hydrology, modeling, streamflow↗

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗

Design and Evaluation of MPI File Domain Partitioning Methods under Extent-Based File Locking Protocol

MPI collective I/O has been an effective method for parallel shared-file access and maintaining the canonical orders of structured data in files. Its implementation commonly uses a two-phase I/O strategy that partitions a file into disjoint file domains, assigns each domain to a unique process, redistributes the I/O data based on their locations in the domains, and has each process perform I/O for the assigned domain. The partitioning quality determines the maximal performance achievable by the underlying file system, as the shared-file I/O has long been impeded by the cost of file system's data consistency control, particularly due to the conflicted locks. This paper proposes a few file domain partitioning methods designed to reduce lock conflicts under the extent-based file locking protocol. Experiments from four I/O benchmarks on the IBM GPFS and Lustre parallel file systems show that the partitioning method producing minimum lock conflicts wins the highest performance. The benefit of removing conflicted locks can be so significant that more than thirty times of write bandwidth differences are observed between the best and worst methods.

Computer Science↗

Comment on: “Solving many-body Schrödinger equations with kinetic energy partition method”, Ann. Phys. 388 (2018) 54–68 by Y-H. Chen and S.D. Chao

We discuss a recent test of the performance of the kinetic energy partition method (KEP) through its application to two separable quantum-mechanical models. We argue that one of the benchmark models is exceedingly simple for testing any realistic approximate method and that almost any reasonable approach yields better results. In the second example our exact benchmark eigenvalues disagree considerably with those chosen by the authors for comparison, which casts doubts on the accuracy of their KEP approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nodal Admittance Matrix Based Area Partition Method for Small-Signal Stability Analysis of Large-Scale Power Electronics Based Power Systems

In power electronics-based power systems (PEPSs), small-signal stability is an important factor for system design and operation, where the impedance-based approach is often used. However, unlike small-scale PEPSs with simple and straightforward impedance models, it would take much more efforts to derive the large-scale PEPSs impedance model, which is very complicated and sometimes may get wrong results due to the elimination of right-half plane (RHP) poles during the impedance aggregation process. To simplify the derivation procedure and analyze the small-signal stability of large-scale PEPSs, this paper proposes a nodal admittance matrix (NAM) based area partition method. In this method, the large-scale PEPS is divided into several sub-areas, and the stability is analyzed within the sub-area first, and then the interconnection stability among these sub-areas is analyzed. The proposed method is scalable and can help to locate the weakest areas/converters that may cause instability in the whole system. In this paper, the concept of the proposed method and its application to an example system are introduced. Experimental results are also given to validate the effectiveness of the proposed method.

Qiao, Liang↗

Solving many-body Schrödinger equations with kinetic energy partition method

We present a general formulation of our previously developed kinetic energy partition (KEP) method for solving many-bodySchrödinger equations. In atomic physics, as well as in general molecular and solid state physics, solving many-electronSchrödinger equations is a very challenging task, often called Dirac’s challenge. The central problem is how to properly handle the electron–electron Coulomb repulsion interactions. Using the KEP solution scheme, in addition to dividing the kinetic energy into partial terms, the electron–electron Coulomb interaction is also separated into parts to be associated with a “negative mass” kinetic energy term. Therefore, the full Hamiltonian can be expressed as a simple sum of subsystem Hamiltonians, each representing an effective one-body problem. Using a Hartree-like product in constructing the wave-function, we achieve fast convergence in the calculations of the ground state energies. First, the model Moshinsky atoms are used to illustrate the solution procedure. We then apply this new KEP method to harmonium atoms and obtain precise energies with an error less than 5% using only two basis functions from each subsystem. It is thus very promising that this methodology, when further extended, can be useful for general many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Applying Graph Partitioning Methods in Measurement-Based Dynamic Load Balancing

Load imbalance can lead to wasted CPU hours especially when running on a large number of processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. Charm++, a migratable objects based programming model, provides a measurement-based dynamic load balancing frame work. This paper explores the use of graph partitioning algorithms, traditionally used for partitioning physical domains/meshes, for measurement based dynamic load balancing of parallel applications. In particular, we present repartitioning methods developed in a graph partitioning toolbox called Scotch that consider the previous mapping to minimize migration costs. We also discuss a new imbalance reduction algorithm for graphs with irregular load distributions. We compare several load balancing algorithms using a micro-benchmark and the NAS BT multi-zone bench mark. New algorithms developed in Scotch lead to better performance compared to other existing partitioners, both in terms of the application execution time and fewer number of objects migrated.

97 MATHEMATICS AND COMPUTING↗

Applying graph partitioning methods in measurement-based dynamic load balancing

Load imbalance leads to an increasing waste of resources as an application is scaled to more and more processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. However, finding near-optimal solutions to this problem for complex computational science and engineering applications is becoming increasingly important. Charm++, a migratable objects based programming model, provides a measurement-based dynamic load balancing framework. This framework instruments and then migrates over-decomposed objects to balance computational load and communication at runtime. This paper explores the use of graph partitioning algorithms, traditionally used for partitioning physical domains/meshes, for measurement-based dynamic load balancing of parallel applications. In particular, we present repartitioning methods developed in a graph partitioning toolbox called SCOTCH that consider the previous mapping to minimize migration costs. We also discuss a new imbalance reduction algorithm for graphs with irregular load distributions. We compare several load balancing algorithms using microbenchmarks on Intrepid and Ranger and evaluate the effect of communication, number of cores and number of objects on the benefit achieved from load balancing. New algorithms developed in SCOTCH lead to better performance compared to the METIS partitioners for several cases, both in terms of the application execution time and fewer number of objects migrated.

97 MATHEMATICS AND COMPUTING↗