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 253 records · Page 14

Spectral (Finite) Volume Method for Conservation Laws on Unstructured Grids II: Extension to Two Dimensional Scalar Equation

The framework for constructing a high-order, conservative Spectral (Finite) Volume (SV) method is presented for two-dimensional scalar hyperbolic conservation laws on unstructured triangular grids. Each triangular grid cell forms a spectral volume (SV), and the SV is further subdivided into polygonal control volumes (CVs) to supported high-order data reconstructions. Cell-averaged solutions from these CVs are used to reconstruct a high order polynomial approximation in the SV. Each CV is then updated independently with a Godunov-type finite volume method and a high-order Runge-Kutta time integration scheme. A universal reconstruction is obtained by partitioning all SVs in a geometrically similar manner. The convergence of the SV method is shown to depend on how a SV is partitioned. A criterion based on the Lebesgue constant has been developed and used successfully to determine the quality of various partitions. Symmetric, stable, and convergent linear, quadratic, and cubic SVs have been obtained, and many different types of partitions have been evaluated. The SV method is tested for both linear and non-linear model problems with and without discontinuities.

Wang, Z. J.↗

Data-Driven Smoothers for Extreme-Scale Computing

Patch-based relaxation refers to a family of methods for solving linear systems which partitions the matrix into smaller pieces often corresponding to groups of adjacent degrees of freedom residing within patches of the computational domain. The two most common families of patch-based methods are block-Jacobi and Schwarz methods, where the former typically corresponds to non-overlapping domains and the later implies some overlap. We focus on cases where each patch consists of the degrees of freedom on a finite element method mesh cell. Patch methods often capture complex local physics much more effectively than simpler point-smoothers such as Jacobi; however, forming, inverting, and applying each patch can be prohibitively expensive in terms of both storage and computation time. To this end, we propose several approaches for performing analysis on these patches and constructing a reduced representation. The compression techniques rely on either matrix norm comparisons or unsupervised learning via a clustering approach. We illustrate how it is frequently possible to retain/factor less than 5% of all patches and still develop a method that converges only a little slower than when all patches are stored/factored.

97 MATHEMATICS AND COMPUTING↗

Spectral-partitioned Kohn-Sham density functional theory

Here we introduce a general, variational scheme for systematic approximation of a given Kohn-Sham free-energy functional by partitioning the density matrix into distinct spectral domains, each of which may be spanned by an independent diagonal representation without requirement of mutual orthogonality. It is shown that by generalizing the entropic contribution to the free energy to allow for independent representations in each spectral domain, the free energy becomes an upper bound to the exact (unpartitioned) Kohn-Sham free energy, attaining this limit as the representations approach Kohn-Sham eigenfunctions. A numerical procedure is devised for calculation of the generalized entropy associated with spectral partitioning of the density matrix. The result is a powerful framework for Kohn-Sham calculations of systems whose occupied subspaces span multiple energy regimes. As a case in point, we apply the proposed framework to warm- and hot-dense matter described by finite-temperature density functional theory, where at high energies the density matrix is represented by that of the free-electron gas, while at low energies it is variationally optimized. We derive expressions for the spectral-partitioned Kohn-Sham Hamiltonian, atomic forces, and macroscopic stresses within the projector-augmented wave (PAW) and the norm-conserving pseudopotential methods. It is demonstrated that at high temperatures, spectral partitioning facilitates accurate calculations at dramatically reduced computational cost. Moreover, as temperature is increased, fewer exact Kohn-Sham states are required for a given accuracy, leading to further reductions in computational cost. Finally, it is shown that standard multiprojector expansions of electronic orbitals within atomic spheres in the PAW method lack sufficient completeness at high temperatures. Spectral partitioning provides a systematic solution for this fundamental problem.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems

If problems involving unstructured meshes are to be solved efficiently on distributed-memory parallel computers, the meshes must be partitioned and distributed across processors in a way that balances tile computational load and minimizes communication. The recursive spectral bisection method (RSB) has been shown to be very effective for such partitioning problems compared to alternative methods, but RSB in its simplest form is expensive. Here a multilevel version of RSB is introduced that attains about an order-of-magnitude improvement in run time on typical examples.

Barnard, Stephen T.↗

Normalized Cut Algorithm for Automated Assignment of Protein Domains

We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.

Samanta, M. P.↗

Total strain version of strainrange partitioning for thermomechanical fatigue at low strains

A new method is proposed for characterizing and predicting the thermal fatigue behavior of materials. The method is based on three innovations in characterizing high temperature material behavior: (1) the bithermal concept of fatigue testing; (2) advanced, nonlinear, cyclic constitutive models; and (3) the total strain version of traditional strainrange partitioning.

Halford, G. R.↗

Generalized Linear Covariance Analysis

We review and extend in two directions the results of prior work on generalized covariance analysis methods. This prior work allowed for partitioning of the state space into "solve-for" and "consider" parameters, allowed for differences between the formal values and the true values of the measurement noise, process noise, and a priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and a priori solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator s anchor time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the "variance sandpile" and the "sensitivity mosaic," and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.

Carpenter, J. Russell↗

Concurrent Enhancement of Acetylene Uptake Capacity and Selectivity by Progressive Core Expansion and Extra–Framework Anions in Pore–Space–Partitioned Metal–Organic Frameworks

A multi-stage core-expansion method is proposed here as one component of the integrative binding-site/extender/core-expansion (BEC) strategy. The conceptual deconstruction of the partitioning ligand into three editable parts draws our focus onto progressive core expansion and allows the optimization of both acetylene uptake and selectivity. Herein the effectiveness of this strategy is shown through a family of eight cationic pore-partitioned materials containing three different partitioning ligands and various counter anions. The optimized structure, Co 3 -cpt-tph-Cl (Hcpt=4-(p-carboxyphenyl)-1,2,4-triazole, H-tph=(2,5,8-tri-(4-pyridyl)-1,3,4,6,7,9-hexaazaphenalene) with the largest surface area and highest C 2 H 2 uptake capacity (200 cm 3 /g at 298 K), also exhibits (desirably) the lowest CO 2 uptake and hence the highest C 2 H 2 /CO 2 selectivity. The successful boost in both C 2 H 2 capacity and IAST selectivity allows Co 3 -cpt-tph-Cl to rank among the best crystalline porous materials, ionic MOFs in particular, for C 2 H 2 uptake and C 2 H 2 /CO 2 experimental breakthrough separation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi–Modular Design of Stable Pore–Space–Partitioned Metal–Organic Frameworks for Gas Separation Applications

Pore space partition (PSP) is an effective materials design method for developing high-performance small-pore materials for storage and separation of gas molecules. The continued success of PSP depends on broad availability and judicious choice of pore-partition ligands and better understanding of each structural module on stability and sorption properties. Here, by using substructural bioisosteric strategy (sub-BIS), a dramatic expansion of pore-partitioned materials is targeted by using ditopic dipyridyl ligands with non-aromatic cores or extenders, as well as by expanding heterometallic clusters to uncommon nickel–vanadium and nickel–indium clusters rarely known before in porous materials. The dual-module iterative refinement of pore-partition ligands and trimers leads to remarkable enhancement of chemical stability and porosity. Here a family of 23 pore-partitioned materials synthesized from five pore-partition ligands and seven types of trimeric clusters is reported. New materials with such compositionally and structurally diverse framework modules reveal key factors that dictate stability, porosity, and gas separation properties. Among these, materials based on heterometallic vanadium–nickel trimeric clusters give rise to the highest long-term hydrolytic stability and remarkable uptake capacity for CO 2 , C 2 H 2 /C 2 H 4 /C 2 H 6 , and C 3 H 6 /C 3 H 8 hydrocarbon gases. Here, the breakthrough experiment shows the potential application of new materials for separating gas mixtures such as C 2 H 2 /CO 2 .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0

SUNDIALS is a well-established numerical library that provides robust and efficient time integrators and nonlinear solvers. This article overviews several significant improvements and new features added over the last 3 years to support scientific simulations run on high-performance computing systems. Notably, three new classes of one-step methods have been implemented: low storage Runge–Kutta, symplectic partitioned Runge–Kutta, and operator splitting. In addition, we describe new timestep adaptivity support for multirate methods, adjoint sensitivity analysis capabilities for explicit Runge–Kutta methods, additional options for Anderson acceleration in nonlinear solvers, and improved error handling and logging.

Computer science↗

Real-Time Temperature Field State Observer and Digital Replica to Support Cyber-Physical Testing

Cyber-physical testing is a class of experimental methods in which a system is partitioned into physical and numerical components to study its overall behavior. Transfer systems are typically needed to capture relevant interactions by enforcing appropriate interface conditions between the physical and numerical portions. While cyber-physical testing is often performed using lumped-parameter systems, thermomechanical cyber-physical testing requires the use of thermal actuators as transfer systems to apply a thermal condition over a spatially distributed region or surface. Thus, the interactions between the numerical and physical components are of a distributed nature, i.e., a field rather than point values. In this paper, we develop and experimentally validate a state observer for temperature fields to enable thermomechanical cyber-physical testing. The state observer provides continuous estimates of temperature over a surface of the thermal actuator using only temperature measurements at discrete locations. The estimated temperature field is then leveraged to account for localized mechanical defects in the interface condition. The method consists of building a digital replica of one portion of the control plant. By imposing defects in the digital replica it is used to generate and output the response of a thermal load pattern that represents that of a physical system with mechanical defects.

Manuel Salmeron↗

Calculating Mode Mixity in Interlaminar Fracture of Composite Laminates

To accurately predict delamination under mixed-mode loading, cohesive elements must partition the energies dissipated in Mode I and Mode II correctly. The ability of cohesive models to predict mode mixity was evaluated by performing analyses of the single leg bending (SLB) test, which exhibits a variable mode mixity with crack length. Accordingly, two numerical integration methods were developed to compute the energy partitioning: (i) a local calculation of the accumulated work of tractions at each point along the crack path, and (ii) a global J-integral “snapshot” calculation along a contour around the process zone. In the case of a composite laminate with properties characterized by short fracture process zone (FPZ), the results of these two methods correlate well with each other and with a linear elastic fracture mechanics solution. However, FPZscan be long due to fiber bridging or due to the intrinsic toughness of the material. Then, the results of mode-mixity calculations obtained with various methods vary widely from each other. It is argued that the global J-integral calculation is the most accurate interpretation of the energy release rate and mode mixity for either short or long process zones. This solution will provide a more accurate characterization of resistance curves and mode mixity in experimental results, and it will also guide the development of more accurate mixed-mode cohesive laws for tougher materials characterized by strong R-curve responses, such as thermo-plastic composites.

cohesive zone analysis↗

Solvent Selection for the Separation of Lignin-Derived Monomers Using the Conductor-like Screening Model for Real Solvents

The separation of desired monomers from a liquid-phase mixture of lignin depolymerization products is necessary to facilitate their upscaling and upgrading for industrial applications. One effective method to separate multiple liquid-phase products is countercurrent chromatography (CCC), which is a common liquid chromatography technique that separates target solutes based on differences in their partitioning in a biphasic solvent system. Effective CCC separation requires the selection of solvent compositions to tune solute partition coefficients. Here, to alleviate the experimental burden of selecting optimal solvent systems, we apply the conductor-like screening model for real solvents (COSMO-RS) method to compute partition coefficients of representative lignin monomers from four currently used depolymerization strategies in standard solvent systems. We further design new ternary and quaternary solvent systems that are predicted to further improve separation efficacy. On the basis of these predicted partition coefficients and empirical solvent selection criteria for CCC measurements, we suggest a range of solvent systems that would be suitable for the effective separation of aromatic lignin-derived products via CCC or similar liquid–liquid extraction methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

BTZ one-loop determinants via the Selberg zeta function for general spin

We relate the heat kernel and quasinormal mode methods of computing the 1-loop partition function of arbitrary spin fields on a rotating (Euclidean) BTZ background using the Selberg zeta function associated with H 3 /Z, extending (arXiv:1811.08433) [1]. Previously, Perry and Williams [2] showed for a scalar field that the zeros of the Selberg zeta function coincide with the poles of the associated scattering operator upon a relabeling of integers. We extend the integer relabeling to the case of general spin, and discuss its relationship to the removal of non-square-integrable Euclidean zero modes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast and Invertible Simplicial Approximation of Magnetic‐Following Interpolation for Visualizing Fusion Plasma Simulation Data

We introduce a fast and invertible approximation for fusion plasma simulation data represented as 2D planar meshes with connectivities approximating magnetic field lines along the toroidal dimension in deformed 3D toroidal spaces. Scientific variables (e.g., density and temperature) in these fusion data are interpolated following a complex magnetic-field-line-following scheme in the toroidal space represented by a cylindrical coordinate system. This deformation in the 3D space poses challenges for root-finding and interpolation. To this end, we propose a novel paradigm for visualizing and analyzing such data based on a newly developed algorithm for constructing a 3D simplicial mesh within the deformed 3D space. Our algorithm generates a tetrahedral mesh that connects the 2D meshes using tetrahedra while adhering to the constraints on node connectivities imposed by the magnetic field-line scheme. Specifically, we first divide the space into smaller partitions to reduce complexity based on the input geometries and constraints on connectivities. Then, we independently search for a feasible tetrahedralization of each partition, considering nonconvexity. We demonstrate our method with two X-Point Gyrokinetic Code (XGC) simulation datasets on the International Thermonuclear Experimental Reactor (ITER) and Wendelstein 7-X (W7-X), and use an ocean simulation dataset to substantiate broader applicability of our method. An open source implementation of our algorithm is available at https://github.com/rcrcarissa/DeformedSpaceTet.

Ren, Congrong [The Ohio State Univ., Columbus, OH ↗

BARC Element Classifier (barc)

SAND2024-02120O This program enumerates and classifies all possible functional elements in several different categories within the Ballistic Asynchronous Reversible Computing (barc) model of computation. barc software is a research tool that is being used to help document the possible digital behaviors of primitive functional elements in the ABRC a.k.a. BARC model of computation. The method of operation of this software leverages elementary concepts and methods from discrete mathematics: combinatorics (permutations), partitions and equivalence classes, symmetry transformations, and the theory of finite groups. Implementation is in Python programming language. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Frank, Michael↗

Distributed state-space generation of discrete-state stochastic models

High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models of ten requires the generation and storage of the entire underlying state space. This imposes practical limitations on the types of systems which can be modeled. Because of the vast amount of memory consumed, we investigate distributed algorithms for the generation of state space graphs. The distributed construction allows us to take advantage of the combined memory readily available on a network of workstations. The key technical problem is to find effective methods for on-the-fly partitioning, so that the state space is evenly distributed among processors. In this paper we report on the implementation of a distributed state-space generator that may be linked to a number of existing system modeling tools. We discuss partitioning strategies in the context of Petri net models, and report on performance observed on a network of workstations, as well as on a distributed memory multi-computer.

Ciardo, Gianfranco↗