Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioning algorithms”

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 775 records · Page 43

Extending the applicability of the Tkatchenko-Scheffler dispersion correction via iterative Hirshfeld partitioning

Recently we have demonstrated that the applicability of the Tkatchenko-Scheffler (TS) method for calculating dispersion corrections to density-functional theory can be extended to ionic systems if the Hirshfeld method for estimating effective volumes and charges of atoms in molecules or solids (AIM’s) is replaced by its iterative variant [T. Bučko, S. Lebègue, J. Hafner, and J. Ángyán, J. Chem. Theory Comput. 9, 4293 (2013)]. The standard Hirshfeld method uses neutral atoms as a reference, whereas in the iterative Hirshfeld (HI) scheme the fractionally charged atomic reference states are determined self-consistently. We show that the HI method predicts more realistic AIM charges and that the TS/HI approach leads to polarizabilities and C{sub 6} dispersion coefficients in ionic or partially ionic systems which are, as expected, larger for anions than for cations (in contrast to the conventional TS method). For crystalline materials, the new algorithm predicts polarizabilities per unit cell in better agreement with the values derived from the Clausius-Mosotti equation. The applicability of the TS/HI method has been tested for a wide variety of molecular and solid-state systems. It is demonstrated that for systems dominated by covalent interactions and/or dispersion forces the TS/HI method leads to the same results as the conventional TS approach. The difference between the TS/HI and TS approaches increases with increasing ionicity. A detailed comparison is presented for isoelectronic series of octet compounds, layered crystals, complex intermetallic compounds, and hydrides, and for crystals built of molecules or containing molecular anions. It is demonstrated that only the TS/HI method leads to accurate results for systems where both electrostatic and dispersion interactions are important, as illustrated for Li-intercalated graphite and for molecular adsorption on the surfaces in ionic solids and in the cavities of zeolites.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Application of the variational autoencoder to detect the critical points of the anisotropic Ising model

We generalize the previous study on the application of variational autoencoders to the two-dimensional Ising model to a system with anisotropy. Due to the self-duality property of the system, the critical points can be located exactly for the entire range of anisotropic coupling. This presents an excellent test bed for the validity of using a variational autoencoder to characterize an anisotropic classical model. Furthermore, we reproduce the phase diagram for a wide range of anisotropic couplings and temperatures via a variational autoencoder without the explicit construction of an order parameter. Considering that the partition function of ($d$ + 1)-dimensional anisotropic models can be mapped to that of the $d$-dimensional quantum spin models, the present study provides numerical evidence that a variational autoencoder can be applied to analyze quantum systems via the quantum Monte Carlo method.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Distributionally Robust Decentralized Volt-Var Control With Network Reconfiguration

Here, this paper presents a decentralized volt-var optimization (VVO) and network reconfiguration strategy to address the challenges arising from the growing integration of distributed energy resources, particularly photovoltaic (PV) generation units, in active distribution networks. To reconcile control measures with different time resolutions and empower local control centers to handle intermittency locally, the proposed approach leverages a two-stage distributionally robust optimization; decisions on slow-responding control measures and set points that link neighboring subnetworks are made in advance while considering all plausible distributions of uncertain PV outputs. We present a decomposition algorithm with an acceleration scheme for solving the proposed model. Numerical experiments on the IEEE 123 bus distribution system are given to demonstrate its outstanding out-of-sample performance and computational efficiency, which suggests that the proposed method can effectively localize uncertainty via risk-informed proactive timely decisions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Observing Ice in Clouds from Space

There are many satellite observations of cloud top properties and the liquid and rain content of clouds, however, we do not yet quantitatively understand the processes that control the water budget of the upper troposphere where ice is the predominant phase, and how these processes are linked to precipitation processes and the radiative energy budget. The ice in clouds in the upper troposphere either melts into rain or is detrained, and persists, as cirrus clouds affecting the hydrological and energy cycle, respectively. Fully modeling the Earth's climate and improving weather and climate forecasts requires accurate satellite measurements of various cloud properties at the temporal and spatial scales of cloud processes. These properties include cloud horizontal and vertical structure, cloud water content and some measure of particle sizes and shapes. The uncertainty in knowledge of these ice characteristics is reflected in the large discrepancies in model simulations of the upper tropospheric water budget. Model simulations are sensitive to the partition of ice between precipitation and outflow processes, i.e., to the parameterization of ice clouds and ice processes. One barrier to achieving accurate global ice cloud properties is the lack of adequate observations at millimeter and submillimeter wavelengths (183-874 GHz). Recent advances in instrumentation have allowed for the development and implementation of an airborne submillimeter-wave radiometer. The brightness temperatures at these frequencies are especially sensitive to cirrus ice particle sizes (because they are comparable to the wavelength). This allows for more accurate ice water path estimates when multiple channels are used to probe into the cloud layers. Further, submillimeter wavelengths offer simplicity in the retrieval algorithms because they do not probe into the liquid and near surface portions of clouds, thus requiring only one term of the radiative transfer equation (ice scattering) to relate brightness temperatures to ice. The next step is a satellite mission designed to acquire global Earth radiance measurements in the submillimeter-wave region, thus bridging the measurement gap between microwave sounders and shorter-wavelength infrared and visible sensors. This presentation provides scientific justification and an approach to measuring ice water path and particle size from a satellite platform that spans a range encompassing both the hydrologically active and radiatively active components of cloud systems.

Ackerman, S.↗

PERSIANN-Unet: A Global Deep Learning Framework for Near-Real-Time Precipitation Estimation Using Infrared Data

Access to high-quality, high-resolution, near-real-time precipitation data is essential for hydrological and meteorological research and disaster mitigation. Traditional tools such as rain gauges and radar networks, though effective, have limitations, including sparse coverage in remote areas and high operational costs. Satellite data, with its global coverage and high spatial and temporal resolutions, mitigates limitations in coverage. Satellite precipitation products like Hydro Estimator (HE), Integrated Multi-satellitE Retrievals for Global Precipitation Measurement (IMERG), and Precipitation Estimation from Remotely Sensed Information using Artificial Neural Networks (PERSIANN) utilize both geosynchronous thermal infrared (IR) and passive microwave (PMW) data in their operation. PMW sensors offer detailed atmospheric profiles but suffer from higher latency, whereas IR sensors provide lower latency but only capture cloud-top information. Despite this constraint, IR data remains attractive for low-latency precipitation estimation. Recent advances in deep learning, particularly convolutional neural networks (CNNs), have further improved satellite precipitation retrievals. This study introduces PERSIANN-Unet (PUnet or PERSIANN V3), a quasi-global algorithm covering 60°N–60°S that combines IR data, monthly climatology, and the UNet architecture to produce half-hourly precipitation estimates at 0.04° resolution. The product is evaluated against HE, IMERG, and PDIR-Now for 2022–2023. Results show that PUnet closely matches its training target, IMERG V07 Final, at the global scale, and performance is further evaluated against Stage IV as a reference over CONUS. Training PUnet on IMERG (2016–2021) leverages a high-quality, integrated PMW IR-gauge precipitation product while developing an IR-based framework not reliant on PMW availability. By operating on a single global image, PUnet avoids tile partitioning and blending steps, reducing edge discontinuities, and produces more spatially consistent precipitation fields across hemispheres.

Phu Nguyen↗

Fragme∩t: An Open‐Source Framework for Multiscale Quantum Chemistry Based on Fragmentation

Fragment-based quantum chemistry offers a means to circumvent the nonlinear computational scaling of conventional electronic structure calculations, by partitioning a large calculation into smaller subsystems then considering the many-body interactions between them. Variants of this approach have been used to parameterize classical force fields and machine learning potentials, applications that benefit from interoperability between quantum chemistry codes. However, there is a dearth of software that provides interoperability yet is purpose-built to handle the combinatorial complexity of fragment-based calculations. To fill this void we introduce “Fragme∩t”, an open-source software application that provides a tool for community validation of fragment-based methods, a platform for developing new approximations, and a framework for analyzing many-body interactions. Fragme∩t includes algorithms for automatic fragment generation and structure modification, and for distance- and energy-based screening of the requisite subsystems. Checkpointing, database management, and parallelization are handled internally and results are archived in a portable database. Interfaces to various quantum chemistry engines are easy to write and exist already for Q-Chem, PySCF, xTB, Orca, CP2K, MRCC, Psi4, NWChem, GAMESS, and MOPAC. Applications reported here demonstrate parallel efficiencies around 96% on more than 1000 processors but also showcase that the code can handle large-scale protein fragmentation using only workstation hardware, all with a codebase that is designed to be usable by non-experts. Fragme∩t conforms to modern software engineering best practices and is built upon well established technologies including Python, SQLite, and Ray. The source code is available under the Apache 2.0 license.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Rule groupings in expert systems using nearest neighbour decision rules, and convex hulls

Expert System shells are lacking in many areas of software engineering. Large rule based systems are not semantically comprehensible, difficult to debug, and impossible to modify or validate. Partitioning a set of rules found in CLIPS (C Language Integrated Production System) into groups of rules which reflect the underlying semantic subdomains of the problem, will address adequately the concerns stated above. Techniques are introduced to structure a CLIPS rule base into groups of rules that inherently have common semantic information. The concepts involved are imported from the field of A.I., Pattern Recognition, and Statistical Inference. Techniques focus on the areas of feature selection, classification, and a criteria of how 'good' the classification technique is, based on Bayesian Decision Theory. A variety of distance metrics are discussed for measuring the 'closeness' of CLIPS rules and various Nearest Neighbor classification algorithms are described based on the above metric.

Anastasiadis, Stergios↗

Controlling the numerical Cerenkov instability in PIC simulations using a customized finite difference Maxwell solver and a local FFT based current correction

In this study we present a customized finite-difference-time-domain (FDTD) Maxwell solver for the particle-in-cell (PIC) algorithm. The solver is customized to effectively eliminate the numerical Cerenkov instability (NCI) which arises when a plasma (neutral or non-neutral) relativistically drifts on a grid when using the PIC algorithm. We control the EM dispersion curve in the direction of the plasma drift of a FDTD Maxwell solver by using a customized higher order finite difference operator for the spatial derivative along the direction of the drift (1ˆ direction). We show that this eliminates the main NCI modes with moderate |k 1 |, while keeps additional main NCI modes well outside the range of physical interest with higher |k 1 |. These main NCI modes can be easily filtered out along with first spatial aliasing NCI modes which are also at the edge of the fundamental Brillouin zone. The customized solver has the possible advantage of improved parallel scalability because it can be easily partitioned along 1ˆ which typically has many more cells than other directions for the problems of interest. We show that FFTs can be performed locally to current on each partition to filter out the main and first spatial aliasing NCI modes, and to correct the current so that it satisfies the continuity equation for the customized spatial derivative. This ensures that Gauss’ Law is satisfied. Lastly, we present simulation examples of one relativistically drifting plasma, of two colliding relativistically drifting plasmas, and of nonlinear laser wakefield acceleration (LWFA) in a Lorentz boosted frame that show no evidence of the NCI can be observed when using this customized Maxwell solver together with its NCI elimination scheme.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

JPL control/structure interaction test bed real-time control computer architecture

The Control/Structure Interaction Program is a technology development program for spacecraft that exhibit interactions between the control system and structural dynamics. The program objectives include development and verification of new design concepts - such as active structure - and new tools - such as combined structure and control optimization algorithm - and their verification in ground and possibly flight test. A focus mission spacecraft was designed based upon a space interferometer and is the basis for design of the ground test article. The ground test bed objectives include verification of the spacecraft design concepts, the active structure elements and certain design tools such as the new combined structures and controls optimization tool. In anticipation of CSI technology flight experiments, the test bed control electronics must emulate the computation capacity and control architectures of space qualifiable systems as well as the command and control networks that will be used to connect investigators with the flight experiment hardware. The Test Bed facility electronics were functionally partitioned into three units: a laboratory data acquisition system for structural parameter identification and performance verification; an experiment supervisory computer to oversee the experiment, monitor the environmental parameters and perform data logging; and a multilevel real-time control computing system. The design of the Test Bed electronics is presented along with hardware and software component descriptions. The system should break new ground in experimental control electronics and is of interest to anyone working in the verification of control concepts for large structures.

Briggs, Hugh C.↗

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Work stealing for GPU-accelerated parallel programs in a global address space framework

Task parallelism is an attractive approach to automatically load balance the computation in a parallel system and adapt to dynamism exhibited by parallel systems. Exploiting task parallelism through work stealing has been extensively studied in shared and distributed-memory contexts. In this paper, we study the design of a system that uses work stealing for dynamic load balancing of task-parallel programs executed on hybrid distributed-memory CPU-graphics processing unit (GPU) systems in a global-address space framework. We take into account the unique nature of the accelerator model employed by GPUs, the significant performance difference between GPU and CPU execution as a function of problem size, and the distinct CPU and GPU memory domains. We consider various alternatives in designing a distributed work stealing algorithm for CPU-GPU systems, while taking into account the impact of task distribution and data movement overheads. These strategies are evaluated using microbenchmarks that capture various execution configurations as well as the state-of-the-art CCSD(T) application module from the computational chemistry domain

97 MATHEMATICS AND COMPUTING↗

Seawater Debye Model Function at L-Band and Its Impact on Salinity Retrieval From Aquarius Satellite Data

A model function of seawater, which specifies the dielectric constant of seawater as a function of salinity, temperature, and frequency, is important for the retrieval of sea surface salinity using satellite data. In 2017, a model function has been developed based on measurement data at 1.4134 GHz using a third-order polynomial expression in salinity ( S ) and temperature ( T ). Although the model showed improvements in salinity retrieval, it had an inconsistent behavior between partitioned salinities. To improve the stability of the model, new dielectric measurements of seawater have been made recently over a broad range of salinities and temperatures to expand the data set used for developing the model function. The structure of the model function has been changed from a polynomial expansion in S and T to a physics-based model consisting of a Debye molecular resonance term plus a conductivity term. Each unknown parameter is expressed in S and T based on the expanded measurement data set. Physical arguments have been used to limit the number of unknown coefficients in these expressions to improve the stability of the model function. The new model function has been employed in the retrieval algorithm of the Aquarius satellite mission to obtain a global salinity map. The retrieved salinity using a different model function is compared with in situ data collected by Argo floats to evaluate the impact and the performance of model functions. The results indicate that the new model function has significant improvements in salinity retrieval compared with other existing models.

Seawater↗

Accurate Infrared Line Lists for 20 Isotopologues of CS 2 at Room Temperature

To facilitate atmospheric and spectroscopic studies of carbon disulfide, or CS 2 , in both planetary and exoplanetary atmospheres, we adopt the “Best Theory + Reliable High-resolution Experiment” algorithm to generate semiempirical IR line lists for the 20 most abundant CS 2 isotopologues, denoted as Ames-296K. The IR lists are computed using the Ames-1 potential energy surface, refined using the experimental transition set and an ab initio dipole moment surface fitted from CCSD(T)/aug-cc-pV(T/Q/5+d)Z dipoles extrapolated to a one-particle basis set limit. The IR lists cover the range of 0–10,000 cm -1 , with an S 296K cutoff at 10 -31 cm -1 /molecule·cm -2 (abundance included). A “natural” IR line list at 296 K includes about 10 million lines of the 20 isotopologues, with their intensities scaled by the corresponding abundances. The zero-point energy, partition functions, and abundances are reported for each isotopologue. The energy levels in the global effective Hamiltonian model for 12 C 32 S 2 are adopted to improve the line position accuracy. This new IR list for the main isotopologue is denoted as A+I.296K. Reliable HITRAN2020 line positions are also utilized to improve the accuracy of the 32 S 12 C 34 S, 32 S 12 C 33 S, and 32 S 13 C 32 S isotopologue line lists. The final composite line list is validated against Pacific Northwest National Laboratory experimental cross sections, showing excellent agreement. The agreement supports the quality of the composite line list and the power of synergy between experiment and theory. The new data are proposed for use in updating and expanding the CS 2 data in HITRAN and other high-resolution IR databases. Supplementary files are available in Zenodo and AHED.

Exoplanet atmospheric composition↗

Parallel Heuristics for Scalable Community Detection

Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited support for community detection on large-scale parallel computers, largely owing to the irregular and inherently sequential nature of the underlying heuristics. In this paper, we present parallelization heuristics for fast community detection using the Louvain method as the serial template. The Louvain method is an iterative heuristic for modularity optimization. Originally developed by Blondel et al. in 2008, the method has become increasingly popular owing to its ability to detect high modularity community partitions in a fast and memory-efficient manner. However, the method is also inherently sequential, thereby limiting its scalability to problems that can be solved on desktops. Here, we observe certain key properties of this method that present challenges for its parallelization, and consequently propose multiple heuristics that are designed to break the sequential barrier. Our heuristics are agnostic to the underlying parallel architecture. For evaluation purposes, we implemented our heuristics on shared memory (OpenMP) and distributed memory (MapReduce-MPI) machines, and tested them over real world graphs derived from multiple application domains (internet, biological, natural language processing). Experimental results demonstrate the ability of our heuristics to converge to high modularity solutions comparable to those output by the serial algorithm in nearly the same number of iterations, while also drastically reducing time to solution.

clustering, graph algorithms↗

Solving a trillion unknowns per second with HPGMG on Sunway TaihuLight

Benchmarks for supercomputers are important tools, not only for evaluating and ranking modern supercomputers, but also for providing hints for future architecture design. As a new benchmark, HPGMG (high performance geometric multigrid) solves a linear equation set with a full geometric multi-grid algorithm. It involves computation on different scales, data movement with various volumes, global communication and neighbor communication with both large and small messages, etc., and is more correlated to real world applications than traditional benchmarks such as LINPACK. Therefore, it is desirable to examine how well HPGMG can perform on leadership supercomputers such as Sunway Taihulight. Sunway Taihulight, the No. 1 supercomputer in the Top 500 list from June 2016 to June 2018, which uses a specially designed many-core architecture SW26010, is of great interest to the community of high performance computing. With careful analysis and code design, we came up with an efficient implementation of HPGMG on SW26010 processors. We not only employed traditional optimization techniques such as 2.5D partitioning, double buffering, and collective data load, but also introduced a micro-benchmark to help with the choice of optimization direction and parameter tuning. Another contribution is that we proposed a new procedure for the major operations, by granulating and reordering the smooth function and the ghost exchange operation, leading to reduced memory copy and accelerated communication process. Our optimized implementation of HPGMG on Sunway TaihuLight achieved a ground-breaking performance of 1.036 × 10 12 Degrees of Freedom per second at the finest level, which is No. 1 on the HPGMG list of Nov 2017.

97 MATHEMATICS AND COMPUTING↗

Applying Graph Theory to Problems in Air Traffic Management

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it isshown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

computational complexity↗

A Mission to Observe Ice in Clouds from Space

To date there have been multiple satellite missions to observe and retrieve cloud top properties and the liquid in, and precipitation from, clouds. There are currently a few missions that attempt to measure cloud ice properties as a byproduct of other observations. However, we do not yet quantitatively understand the processes that control the water budget of the upper troposphere where ice is the predominant phase, and how these processes are linked to precipitation processes and the radiative energy budget. The ice in clouds either melts into rain or is detrained, and persists, as cirrus clouds affecting the hydrological and energy cycle, respectively. Fully modeling the Earth's climate and improving weather and climate forecasts requires accurate satellite measurements of various cloud properties at the temporal and spatial scales of cloud processes. The uncertainty in knowledge of these ice characteristics is reflected in the large discrepancies in model simulations of the upper tropospheric water budget. Model simulations are sensitive to the partition of ice between precipitation and outflow processes, i.e., to the parameterization of ice clouds and ice processes. This presentation will describe the Submillimeter-wave InfraRed Ice Cloud Experiment (SIRICE) concept, a satellite mission designed to acquire global Earth radiance measurements in the infrared and submillimeter-wave region (183-874 GHz). If successful, this mission will bridge the measurement gap between microwave sounders and shorter-wavelength infrared and visible sensors. The brightness temperatures at submillimeter-wave frequencies are especially sensitive to cirrus ice particle sizes (because they are comparable to the wavelength). This allows for more accurate ice water path estimates when multiple channels are used to probe into the cloud layers. Further, submillimeter wavelengths offer simplicity in the retrieval algorithms because they do not probe into the liquid and near surface portions of clouds, thus requiring only one term of the radiative transfer equation (ice scattering) to relate brightness temperatures to ice. Scientific justification and the SIRICE approach to measuring ice water path and particle size that span a range encompassing both the hydrologically active and radiatively active components of cloud systems will be presented.

Ackerman, S.↗