Search NASA⌕ Search

SEARCH · Search NASA

Results for “Partitioned scheme”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A Higher Order, Stable Partitioned Scheme for Fluid-Structure Interaction Problems

Although still a very active area of research with many open questions, there exist highly-accurate and efficient algorithms for numerically estimating solutions to the equations of fluid motion. Similarly, great strides have been made in numerically modeling the motion of solids. However, there exist many practical applications where one must solve both fluid and structure in tandem. There is a gap in the literature for high order unconditionally stable partitioned algorithms for problems of this type. We investigate a new partitioned scheme which shows promise in filling this gap. We use a finite-element-based model with an added mass approach on problems coupling the Euler beam equation with the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Adaptive QM/MM for Molecular Dynamics Simulations: 5. On the Energy-Conserved Permuted Adaptive-Partitioning Schemes

In combined quantum-mechanical/molecular-mechanical (QM/MM) dynamics simulations, the adaptive-partitioning (AP) schemes reclassify atoms on-the-fly as QM or MM in a smooth manner. This yields a mobile QM subsystem with contents that are continuously updated as needed. Here, we tailor the Hamiltonian adaptive many-body correction (HAMBC) proposed by Boreboom et al. [J. Chem. Theory Comput. 2016, 12, 3441] to the permuted AP (PAP) scheme. The treatments lead to the HAMBC-PAP method (HPAP), which both conserves energy and produces accurate solvation structures in the test of “water-in-water” model system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Periodic GFN1-xTB Tight Binding: A Generalized Ewald Partitioning Scheme for the Klopman–Ohno Function

A novel formulation is presented for the treatment of electrostatics in the periodic GFN1-xTB tight-binding model. Periodic GFN1-xTB is hindered by the functional form of the second-order electrostatics, which only recovers Coulombic behavior at large interatomic distances and lacks a closed-form solution for its Fourier transform. We address this by introducing a binomial expansion of the Klopman–Ohno function to partition short- and long-range interactions, enabling the use of a generalized Ewald summation for the solution of the electrostatic energy. This approach is general and is applicable to any damped potential of the form |R n + c| –m . Benchmarks on the X23 molecular crystal dataset and a range of prototypical bulk semiconductors demonstrate that this systematic treatment of the electrostatics eliminates unphysical behavior in the equation of state curves. In the bulk systems studied, we observe a mean absolute error in total energy of 35 meV/atom, comparable to the machine-learned universal force field, M3GNet, and sufficiently precise for structure relaxation. These results highlight the promising potential of GFN1-xTB as a universal tight-binding parametrization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2017

Machine and Application Aware Partitioning for Adaptive Mesh Refinement Applications. In: HPDC '17 Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing

Load balancing and partitioning are critical when it comes to parallel computations. Popular partitioning strategies based on space filling curves focus on equally dividing work. The partitions produced are independent of the architecture or the application. Given the ever-increasing relative cost of data movement and increasing heterogeneity of our architectures, it is no longer sufficient to only consider an equal partitioning of work. Minimizing communication costs are equally if not more important. Our hypothesis is that an unequal partitioning that minimizes communication costs significantly can scale and perform better than conventional equal-work partitioning schemes. This tradeoff is dependent on the architecture as well as the application. We validate our hypothesis in the context of a finite-element computation utilizing adaptive mesh-refinement. Our central contribution is a new partitioning scheme that minimizes the overall runtime of subsequent computations by performing architecture and application-aware non-uniform work assignment in order to decrease time to solution, primarily by minimizing data-movement. We evaluate our algorithm by comparing it against standard space-filling curve based partitioning algorithms and observing time-to-solution as well as energy-to-solution for solving Finite Element computations on adaptively refined meshes. We demonstrate excellent scalability of our new partition algorithm up to $262,144$ cores on ORNL's Titan and demonstrate that the proposed partitioning scheme reduces overall energy as well as time-to-solution for application codes by up to 22.0%.

Fernando, Milinda↗
DOE OSTI2021

Protein C-GeM: A Coarse-Grained Electron Model for Fast and Accurate Protein Electrostatics Prediction

The electrostatic potential (ESP) is a powerful property for understanding and predicting electrostatic charge distributions that drive interactions between molecules. In this study, we compare various charge partitioning schemes including fitted charges, density-based quantum mechanical (QM) partitioning schemes, charge equilibration methods, and our recently introduced coarse-grained electron model, C-GeM, to describe the ESP for protein systems. Furthermore, when benchmarked against high quality density functional theory calculations of the ESP for tripeptides and the crambin protein, we find that the C-GeM model is of comparable accuracy to ab initio charge partitioning methods, but with orders of magnitude improvement in computational efficiency since it does not require either the electron density or the electrostatic potential as input.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Toward scalable many-body calculations for nuclear open quantum systems using the Gamow Shell Model

Drip-line nuclei have very different properties from those of the valley of stability, as they are weakly bound and resonant. Therefore, the models devised for stable nuclei can no longer be applied therein. Hence, a new theoretical tool, the Gamow Shell Model (GSM), has been developed to study the many-body states occurring at the limits of the nuclear chart. GSM is a configuration interaction model based on the use of the so-called Berggren basis, which contains bound, resonant and scattering states, so that inter-nucleon correlations are fully taken into account and the asymptotes of extended many-body wave functions are precisely handled. However, large complex symmetric matrices must be diagonalized in this framework, therefore the use of very powerful parallel machines is needed therein. So, in order to fully take advantage of their power, a 2D partitioning scheme using hybrid MPI/OpenMP parallelization has been developed in our GSM code. The specificities of the 2D partitioning scheme in the GSM framework will be described and illustrated with numerical examples. It will then be shown that the introduction of this scheme in the GSM code greatly enhances its capabilities.

2D partitioning↗
DOE OSTI2021

A multi-center quadrature scheme for the molecular continuum

We report a common way to evaluate electronic integrals for polyatomic molecules is to use Becke’s partitioning scheme (Becke and Chem, 1988) in conjunction with overlapping grids centered at each atomic site. The Becke scheme was designed for integrands that fall off rapidly at large distances, such as those approximating bound electronic states. When applied to states in the electronic continuum, however, Becke scheme exhibits slow convergence and it is highly redundant. Here, we present a modified version of Becke scheme that is applicable to functions of the electronic continuum, such as those involved in molecular photoionization and electron–molecule scattering, and which ensures convergence and efficiency comparable to those realized in the calculation of bound states. In this modified scheme, the atomic weights already present in Becke’s partition are smoothly switched off within a range of few bond lengths from their respective nuclei, and complemented by an asymptotically unitary weight. The atomic integrals are evaluated on small spherical grids, centered on each atom, with size commensurate to the support of the corresponding atomic weight. The residual integral of the interstitial and long-range region is evaluated with a central master grid. The accuracy of the method is demonstrated by evaluating integrals involving integrands containing Gaussian Type Orbitals and Yukawa potentials, on the atomic sites, as well as spherical Bessel functions centered on the master grid. These functions are representative of those encountered in realistic electron-scattering and photoionization calculations in polyatomic molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling

A hierarchical solver is proposed for solving sparse ill-conditioned linear systems in parallel. The solver is based on a modification of the LoRaSp method, but employs a deferred-compression technique, which provably reduces the approximation error and significantly improves efficiency. Moreover, the deferred-compression technique introduces minimal overhead and does not affect parallelism. As a result, the new solver achieves linear computational complexity under mild assumptions and excellent parallel scalability. To demonstrate the performance of the new solver, we focus on applying it to solve sparse linear systems arising from ice sheet modeling. The strong anisotropic phenomena associated with the thin structure of ice sheets creates serious challenges for existing solvers. To address the anisotropy, we additionally developed a customized partitioning scheme for the solver, which captures the strong-coupling direction accurately. In general, the partitioning can be computed algebraically with existing software packages, and thus the new solver is generalizable for solving other sparse linear systems. Our results show that ice sheet problems of about 300 million degrees of freedom have been solved in just a few minutes using a thousand processors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

pyEF: A Python Framework for QM and QM/MM Atom-Wise Electric Field Analysis

We introduce pyEF, a software package for computing molecular electric fields, electrostatic interaction energies, and electrostatic potentials from quantum mechanical (QM) atom-centered multipole expansions with atom-wise decomposable contributions. We demonstrate the computational efficiency and accuracy of this QM-derived electric field evaluation tool through several tests. To assess the influence of the underlying QM method and charge partitioning scheme on these electrostatic quantities, we analyze over 250 configurations of an acetone solute molecule in five solvents of variable polarity. We find that electric field calculations are highly sensitive to the choice of charge partitioning method. Even among real-space charge schemes, acetone Stark tuning rates differ by up to a factor of 2. Benchmarking computed solvent dipole moments against experimental bulk values, we conclude that the CM5, ADCH, and Hirshfeld-I charge schemes most reliably capture solvent electrostatics and therefore provide a more faithful foundation for computing electric fields. When constructed from these real-space charges, electric fields are nearly insensitive to basis set size and monotonically increase in magnitude with higher Fock exchange. We also demonstrate efficient convergence of QM electrostatics when more distant molecules are represented solely by MM point charges, reducing computational overhead. Leveraging these findings, we demonstrate the use of pyEF to deduce environmental effects on a transition metal complex from a Ga 4 L 6 12– nanocage and quantify the dominant role of organic linkers in orchestrating electrostatic preorganization.

electric fields↗
DOE OSTI2023

Interface flux recovery framework for constructing partitioned heterogeneous time-integration methods

A common approach for the development of partitioned schemes employing different time integrators on different subdomains is to lag the coupling terms in time. This can lead to accuracy issues, especially in multistage methods. Here, in this article, we present a novel framework for partitioned heterogeneous time-integration methods, which allows the coupling of arbitrary multistage and multistep methods without reducing their order of accuracy. At the core of our approach are accurate estimates of the interface flux obtained from the Schur complement of an auxiliary monolithic system. We use these estimates to construct a polynomial-in-time approximation of the interface flux over the current time coupling window. This approximation provides the interface boundary conditions necessary to decouple the subdomain problems at any point within the coupling window. In so doing our framework enables a flexible choice of time-integrators for the individual subproblems without compromising the time-accuracy at the coupled problem level. This feature is the main distinction between our framework and other approaches. To demonstrate the framework, we construct a family of partitioned heterogeneous time-integration methods, combining multistage and multistep methods, for a simplified tracer transport component of the coupled air-sea system in Earth system models. We report numerical tests evaluating accuracy and flux conservation for different pairs of time-integrators from the explicit Runge-Kutta and Adams-Moulton families.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Implications of reduced-complexity aerosol thermodynamics on organic aerosol mass concentration and composition over North America

Atmospheric organic aerosol (OA) mass concentrations can be affected by water uptake through its impact on the gas–particle partitioning of semi-volatile compounds. Current chemical transport models (CTMs) neglect this process. We have implemented the Binary Activity Thermodynamics model coupled to a volatility basis set partitioning scheme in the GEOS-Chem CTM, providing an efficient reduced-complexity OA model that predicts relative-humidity-dependent mixing and partitioning thermodynamics, while limiting the impact on computational efficiency. We provide a quantitative assessment of this water-sensitive OA treatment, focusing on a subdomain over North America. The updated OA scheme predicts a spatiotemporal mean enhancement in surface-level OA mass concentration of 145 % for January 2019 and 76 % for July 2019 compared to GEOS-Chem's most advanced OA scheme. The temporal mean surface-level OA organic mass concentration can increase by up to ∼590 % for January 2019 and ∼280 % for July 2019, with the greatest enhancements occurring over the ocean. The updated OA scheme also quantifies the OA-associated water content. The simulations show how different OA precursors and related OA surrogates contribute and respond to water uptake, including that due to changes in temperature and relative humidity over the diurnal cycle in selected winter and summer months. These results are independent of future CTM improvements involving updates to chemical reaction schemes and emission inventories. Our water-sensitive OA scheme allows for a better representation of the seasonal and regional variations in OA mass concentration in CTMs.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2017

High Performance Computing Based Parallel HIearchical Modal Association Clustering (HPAR HMAC)

For many applications, clustering is a crucial step in order to gain insight into the makeup of a dataset. The best approach to a given problem often depends on a variety of factors, such as the size of the dataset, time restrictions, and soft clustering requirements. The HMAC algorithm seeks to combine the strengths of 2 particular clustering approaches: model-based and linkage-based clustering. One particular weakness of HMAC is its computational complexity. HMAC is not practical for mega-scale data clustering. For high-definition imagery, a user would have to wait months or years for a result; for a 16-megapixel image, the estimated runtime skyrockets to over a decade! To improve the execution time of HMAC, it is reasonable to consider an multi-core implementation that utilizes available system resources. An existing imple-mentation (Ray and Cheng 2014) divides the dataset into N partitions - one for each thread prior to executing the HMAC algorithm. This implementation benefits from 2 types of optimization: parallelization and divide-and-conquer. By running each partition in parallel, the program is able to accelerate computation by utilizing more system resources. Although the parallel implementation provides considerable improvement over the serial HMAC, it still suffers from poor computational complexity, O(N2). Once the maximum number of cores on a system is exhausted, the program exhibits slower behavior. We now consider a modification to HMAC that involves a recursive partitioning scheme. Our modification aims to exploit divide-and-conquer benefits seen by the parallel HMAC implementation. At each level in the recursion tree, partitions are divided into 2 sub-partitions until a threshold size is reached. When the partition can no longer be divided without falling below threshold size, the base HMAC algorithm is applied. This results in a significant speedup over the parallel HMAC.

Patlolla, Dilip R↗
DOE OSTI2018

Partitioning and Communication Strategies for Sparse Non-negative Matrix Factorization

Non-negative matrix factorization (NMF), the problem of finding two non-negative low-rank factors whose product approximates an input matrix, is a useful tool for many data mining and scientific applications such as topic modeling in text mining and unmixing in microscopy. In this paper, we focus on scaling algorithms for NMF to very large sparse datasets and massively parallel machines by employing effective algorithms, communication patterns, and partitioning schemes that leverage the sparsity of the input matrix. We consider two previous works developed for related problems, one that uses a fine-grained partitioning strategy using a point-to-point communication pattern and one that uses a Cartesian, or checkerboard, partitioning strategy using a collective-based communication pattern. We show that a combination of the previous approaches balances the demands of the various computations within NMF algorithms and achieves high efficiency and scalability. From the experiments, we see that our proposed strategy runs up to 10x faster than the state of the art on real-world datasets.

Kaya, Oguz↗
DOE OSTI2021

Projector-Based Quantum Embedding for Molecular Systems: An Investigation of Three Partitioning Approaches

Projector-based embedding is a relatively recent addition to the collection of methods that seek to utilize chemical locality to provide improved computational efficiency. This work considers the interactions between the different proposed procedures for this method and their effects on the accuracy of the results. The interplay between the embedded background, projector type, partitioning scheme, and level of atomic orbital (AO) truncation are investigated on a selection of reactions from the literature. The Huzinaga projection approach proves to be more reliable than the level-shift projection when paired with other procedural options. Active subsystem partitioning from the subsystem projected AO decomposition (SPADE) procedure proves slightly better than the combination of Pipek-Mezey localization and Mulliken population screening (PMM). Along with these two options, a new partitioning criteria is proposed based on subsystem von Neumann entropy and the related subsystem orbital occupancy. This new method overlaps with the previous PMM method, but the screening process is computationally simpler. Finally, AO truncation proves to be a robust option for the tested systems when paired with the Huzinaga projection, with satisfactory results being acquired at even the most severe truncation level.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗