Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Fourier domain dynamic correction method for complex optical fringes in laser spectrometers

A method is provided for Fourier domain dynamic correction of optical fringes in a laser spectrometer. The method includes Fourier transforming a background spectrum contaminated with the optical fringes to obtain baseline fringes in a frequency domain. The method includes partitioning the baseline fringes in the frequency domain to obtain partitioned baseline fringes. The method includes reconstructing the partitioned baseline fringes as separate spectra. The method includes constructing a fitting model to approximate the background spectrum by assigning a first and a second free parameter to each of partitioned baseline fringe components to respectively allow for drift and amplitude adjustments during a fitting of the fitting model. The method includes applying the fitting model to a newly acquired spectrum to provide an interpretation of the newly acquired spectrum having a reduced influence of spectral contamination on concentration retrieval.

Teng, Cheyenne↗
DOE OSTI2024

Oxidative Catalytic Fractionation of Lignocellulosic Biomass Using a Co-N-P-C Catalyst and One-Step Isolation of Aromatic Monomers via Centrifugal Partition Chromatography

Methods for catalytic fractionation of biomass provide a means to convert lignin directly into monomers while generating a high-quality cellulosic stream, contrasting conventional biomass pretreatment strategies that prioritize the cellulosic fraction. Here, a nonprecious-metal Co-N-P-C catalyst is identified for aerobic oxidative catalytic fractionation (OCF) of poplar feedstock in dimethyl carbonate that achieves significantly higher yields of aromatic monomers (24 wt %) relative to those obtained with a recently reported Co-N-C catalyst in acetone solvent (15 wt %). Mechanistic studies indicate that the acidic properties of the catalyst contribute to its improved performance by promoting extraction of lignin from insoluble polysaccharides. This OCF process is complemented by the development of a new centrifugal partition chromatography (CPC) method that supports isolation of all five major aromatic monomers (syringic acid, syringaldehyde, vanillic acid, vanillin, and para-hydroxybenzoic acid) in a single liquid–liquid extraction purification step. Furthermore, this OCF/CPC sequence has important implications for future lignin valorization efforts.

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

Evapotranspiration partitioning estimates from 8 methods from 47 NEON sites, 2019-2021

This dataset provides daily estimates of evapotranspiration (ET) and the transpiration-to-evapotranspiration ratio (T/ET) across 47 terrestrial National Ecological Observatory Network (NEON) sites spanning diverse environmental and biome conditions in the United States across three years of data (2019-2021). Daily ET is reported in both energy units (MJ m⁻² day⁻¹) and equivalent water depth (mm day⁻¹), assuming a constant latent heat of vaporization of 2.45 MJ/kg. The primary method uses a hybrid recurrent neural network–Penman–Monteith framework (RNN-PM), which integrates physically based surface energy balance constraints with data-driven learning to partition ET into transpiration and evaporation components. Model inputs include in situ meteorological observations (air temperature, vapor pressure deficit, wind speed, and radiation) combined with satellite-derived land surface temperature, leaf area index, and soil moisture. For benchmarking and uncertainty assessment, T/ET estimates from seven additional models are included: Priestley-Taylor Jet Propulsion Laboratory (PT-JPL), Penman-Monteith (P-M), Two-Source Energy Balance (TSEB), Support Vector Regression (SVR), and Categorical Boosting (CatBoost), among others—spanning empirical, machine-learning, and process-based approaches (see methods section or linked publication for detailed descriptions). Data Package Contents: The dataset a csv files containing daily ET and T/ET estimates for each site and model, along with associated metadata files these variables. Data can be accessed using common spreadsheet software (e.g., Microsoft Excel, LibreOffice) or programming environments such as R or Python. Together, these data support cross-site comparisons of ecosystem water use, evaluation of ET partitioning methods, and development of improved land–atmosphere exchange models.

EARTH SCIENCE > ATMOSPHERE↗
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 OSTI2021

Implicit Multirate GARK Methods

This article considers multirate generalized-structure additively partitioned Runge–Kutta methods for solving stiff systems of ordinary differential equations with multiple time scales. These methods treat different partitions of the system with different timesteps for a more targeted and efficient solution compared to monolithic single rate approaches. With implicit methods used across all partitions, methods must find a balance between stability and the cost of solving nonlinear equations for the stages. In order to characterize this important trade-off, we explore multirate coupling strategies, problems for assessing linear stability, and techniques to efficiently implement Newton iterations for stage equations. Unlike much of the existing multirate stability analysis which is limited in scope to particular methods, we present general statements on stability and describe fundamental limitations for certain types of multirate schemes. New implicit multirate methods up to fourth order are derived, and their accuracy and efficiency properties are verified with numerical tests.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Fast shared-memory streaming multilevel graph partitioning

In this report we show that a fast parallel graph partitioner can benefit many applications by reducing data transfers. The online methods for partitioning graphs have to be fast and they often rely on simple one-pass streaming algorithms, while the offline methods for partitioning graphs contain more involved algorithms and the most successful methods in this category belong to the multilevel approaches. In this work, we assess the feasibility of using streaming graph partitioning algorithms within the multilevel framework. Our end goal is to come up with a fast parallel offline multilevel partitioner that can produce competitive cutsize quality. We rely on a simple but fast and flexible streaming algorithm throughout the entire multilevel framework. This streaming algorithm serves multiple purposes in the partitioning process: a clustering algorithm in the coarsening, an effective algorithm for the initial partitioning, and a fast refinement algorithm in the uncoarsening. Its simple nature also lends itself easily for parallelization. The experiments on various graphs show that our approach is on the average up to 5.1x faster than the multi-threaded MeTiS, which comes at the expense of only 2x worse cutsize.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A novel approach to partitioning evapotranspiration into evaporation and transpiration in flooded ecosystems

Reliable partitioning of micrometeorologically measured evapotranspiration (ET) into evaporation (E) and transpiration (T) would greatly enhance our understanding of the water cycle and its response to climate change related shifts in local-to-regional climate conditions and rising global levels of vapor pressure deficit (VPD). While some methods on ET partitioning have been developed, their underlying assumptions make them difficult to apply more generally, especially in sites with large contributions of E. Here, we report a novel ET partitioning method using artificial neural networks (ANNs) in combination with a range of environmental input variables to predict daytime E from nighttime ET measurements. The study uses eddy covariance data from four restored wetlands in the Sacramento-San Joaquin Delta, California, USA, as well as leaf-level T data for validation. The four wetlands vary in their vegetation make-up and structure, representing a range of ET conditions. The ANNs were built with increasing complexity by adding the input variable that resulted in the next highest average value of model testing R 2 across all sites. The order of variable inclusion (and importance) was: VPD > gap-filled sensible heat flux (H_gf) > air temperature (T air ) > friction velocity (u * ) > other variables. The model using VPD, H_gf, T air , and u * showed the best performance during validation with independent data and had a mean testing R 2 value of 0.853 (averaged across all sites, range from 0.728 to 0.910). In comparison to other methods, our ANN method generated T/ET partitioning results which were more consistent with CO 2 exchange data especially for more heterogeneous sites with large E contributions. Further, our method improves the understanding of T/ET partitioning. While it may be particularly suited to flooded ecosystems, it can also improve T/ET partitioning in other systems, increasing our knowledge of the global water cycle and ecosystem functioning.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Overset-Grid Method with Smooth Orbital Partitioning for Molecular Scattering Calculations

To solve molecular photoionization and electron scattering problems, we use an overset-grid representation of electronic continuum functions, which has an extended central spherical grid that overlaps small spherical grids (subgrids) centered on each atom of a polyatomic molecule. Here, in this work, we present an improved algorithm that smoothly partitions the total wave function between the central grid and the atomic subgrids. The smooth partitioning allows one to use approximately one-fourth the number of partial waves on the central grid compared to our previous implementation with switching functions. The resulting numerical method for treating electron scattering and photoionization of polyatomic molecules combines the accuracy and flexibility of pure numerical grid representations with the rapid convergence of hybrid combinations of atom-centered basis-set expansions and grid methods. The overset-grid representation is implemented using the complex Kohn variational principle for scattering and photoionization amplitudes. The faster convergence with respect to the number of central grid partial waves is demonstrated and accuracy is verified by comparisons with the previous implementation and with far more computationally demanding single-center numerical expansions in electron-molecule scattering and photoionization calculations on the neon dimer (Ne 2 ) system, carbon tetrafluoride (CF 4 ) molecule, and the pyridine (C 5 H 5 N) molecule in the static-exchange approximation.

Molecules↗
DOE OSTI2022

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↗
DOE OSTI2021

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↗
DOE OSTI2020

Higher spin partition functions via the quasinormal mode method in de Sitter quantum gravity

In this note we compute the 1-loop partition function of spin- s s fields on Euclidean de Sitter space S^{2n+1} S 2 n + 1 using the quasinormal mode method. Instead of computing the quasinormal mode frequencies from scratch, we use the analytic continuation prescription L_{\text{AdS}}\to iL_{\text{dS}} L AdS → i L dS , appearing in the dS/CFT correspondence, and Wick rotate the normal mode frequencies of fields on thermal \text{AdS}_{2n+1} AdS 2 n + 1 into the quasinormal mode frequencies of fields on de Sitter space. We compare the quasinormal mode and heat kernel methods of calculating 1-loop determinants, finding exact agreement, and furthermore explicitly relate these methods via a sum over the conformal dimension. We discuss how the Wick rotation of normal modes on thermal \text{AdS}_{2n+1} AdS 2 n + 1 can be generalized to calculating 1-loop partition functions on the thermal spherical quotients S^{2n+1}/\mathbb{Z}_{p} S 2 n + 1 / ℤ p . We further show that the quasinormal mode frequencies encode the group theoretic structure of the spherical spacetimes in question, analogous to the analysis made for thermal AdS in [1-3] .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks

We present a novel method for graph partitioning, based on reinforcement learning and graph convolutional neural networks. Our approach is to recursively partition coarser representations of a given graph. The neural network is implemented using SAGE graph convolution layers, and trained using an advantage actor critic (A2C) agent. We present two variants, one for finding an edge separator that minimizes the normalized cut or quotient cut, and one that finds a small vertex separator. The vertex separators are then used to construct a nested dissection ordering to permute a sparse matrix so that its triangular factorization will incur less fill-in. The partitioning quality is compared with partitions obtained using METIS and SCOTCH, and the nested dissection ordering is evaluated in the sparse solver SuperLU. Our results show that the proposed method achieves similar partitioning quality as METIS and SCOTCH. Furthermore, the method generalizes across different classes of graphs, and works well on a variety of graphs from the SuiteSparse sparse matrix collection.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2025

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems↗
DOE OSTI2020

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

MSTor 2023 : A new version of the computer code for multistructural torsional anharmonicity, now with automatic torsional identification using redundant internal coordinates

The MSTor program is a computer program for calculating partition functions and thermodynamic functions of complex gas-phase molecules with multiple torsions; the multi-structural approximation with torsional anharmonicity (MS-T) can be used based on either a coupled torsional potential or an uncoupled torsional potential. The program can also carry out calculations in the multiple-structure local harmonic (MS-LH) approximation or multi-structural local quasiharmonic (MS-LQ) approximation or by the dual-level MS-T method. Furthermore, the program package includes eight utility codes that can be used as stand-alone programs to help the user to generate the input files for the code or to generate comparison results. The 2023 version of MSTor includes a new capability, namely automatic identification of torsional modes with redundant internal coordinates.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

ThH 5 : An Actinide–Containing Superhalogen Molecule

Thorium and its compounds have been widely investigated as important nuclear materials. Previous research focused on the potential use of thorium hydrides, such as ThH 2 , ThH 4 , and Th 4 H 15 , as nuclear fuels. Here, we report studies of the anion, ThH 5 , by anion photoelectron spectroscopy and computations. The resulting experimental and theoretical vertical detachment energies (VDE) for ThH 5 are 4.09 eV and 4.11 eV, respectively. These values and the agreement between theory and experiment facilitated the characterization of the structure of the ThH 5 anion and showed its neutral counterpart, ThH 5 to be a superhalogen. ThH 5 , which exhibits a C 4v structure with five Th–H single bonds, possesses the largest known H/M ratio among the actinide elements, M. Here, the adaptive natural density partitioning (AdNDP) method was used to further analyze the chemical bonding of ThH 5 – and to confirm the existence of five Th–H single bonds in the ThH 5 – molecular anion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗