Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “DECOMPOSITION”

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 1,009 records · Page 56

Thermo-Chemical Decomposition Study of Polyurethane Elastomer Through Glycerolysis Route with Using Crude and Refined Glycerine as a Transesterification Agent

Due to the increasing amount of polyurethane waste, chemical recycling of these materials is a topic of growing interest for many researchers. The primary purpose of polyurethane feedstock recycling is to recover the starting polyol. In this study glycerolysis using glycerine from two sources and two purity grades is proposed as a method of chemical recycling. The main effort of this paper focuses on the employment of commercial glycerine of analytical grade and waste glycerine without purification derived from the biodiesel production, as a decomposing agent for polyurethane recycling. In this study, the influence of polyurethane to glycerine mass ratio (PU/GL) and the type of decomposing agent on the chemical structure by FTIR, {sup 1}H NMR and GPC was examined. FTIR analysis of the glycerolysates showed absorption peaks similar to the virgin polyol. Those results are in compliance with GPC chromatograms, which showed for all samples, well-defined peak at ca. 13 min of retention time. The molecular weight of glycerolysates was ranging from 800 to 1300 g mol{sup −1} depending on PU/GL mass ratio. The novel decomposition agent, namely waste glycerine derived from biodiesel production was successfully used in glycerolysis process.

36 MATERIALS SCIENCE↗

Adaptive Wavelet Decomposition of Matrix Flows

Adaptive algorithms for constructing spline-wavelet decompositions of matrix flows from a linear space of matrices over a normed field are presented. The algorithms suggested provides for an a priori prescribed estimate of the deviation of the basic flow from the initial one. Comparative bounds of the volumes of data in the basic flow for various irregularity characteristics of the initial flow are obtained in the cases of pseudo-equidistant and adaptive grids. Limit characteristics of the above-mentioned volumes are given in the cases where the initial flow is generated by differentiable functions.

97 MATHEMATICS AND COMPUTING↗

On Two Algorithms of Wavelet Decomposition for Spaces of Linear Splines

The purpose of this paper is to construct new types of wavelets for minimal splines on an irregular grid. The approach applied to construct spline-wavelet decompositions uses approximation relations as an initial structure for constructing the spaces of minimal splines. The advantages of this approach are the possibilities of using irregular grids and sufficiently arbitrary nonpolynomial spline-wavelets.

97 MATHEMATICS AND COMPUTING↗

Security enrichment of optical image cryptosystem based on superposition technique using fractional Hartley and gyrator transform domains deploying equal modulus decomposition

In this paper, a symmetric cryptosystem has been suggested to increase security of double random phase encoding using superposition technique in fractional Hartley transform (FrHT) and gyrator transform (GT) domains. It uses structured phase mask (SPM) and hybrid mask (HM) deploying equal modulus decomposition (EMD). Related to original phase truncated Fourier transform (PTFT) based cryptosystem, the security of encoding and decoding is upgraded by using the superposition technique. With the usage of SPM we can increase the key space while encoding and can also overcome the axis alignment difficulty. Decoding is just the reversal of the encoding method. The proposed scheme has robustness against common attacks like: noise and occlusion attacks. With the help of numerical simulation results we also show that our cryptosystem is vulnerable to various attacks. Performance of the suggested method is calculated in terms of Mean Square Error (MSE) between original and decoded image and also the sensitivity of the SPM parameters and rotational angles of GT is investigated. The competence of the suggested method includes analysis on EMD, histogram and correlation coefficient. The suggested cryptosystem is also open to the occlusion attack and noise attack to analyze its performance and evenness.

42 ENGINEERING↗

Scalable branching on dual decomposition of stochastic mixed-integer programming problems

In this work, we present a scalable branching method for the dual decomposition of stochastic mixed-integer programming. Our new branching method is based on the branching method proposed by Caroe and Schultz that creates branching disjunctions on first-stage variables only. We propose improvements to the process for creating branching disjunctions, including (1) branching on the optimal solutions of the Dantzig-Wolfe reformulation of the restricted master problem and (2) using a more comprehensive (yet simple) measure for the dispersions associated with subproblem solution infeasibility. We prove that the proposed branching process leads to an algorithm that terminates finitely, and we provide conditions under which globally optimal solutions can be identified after termination. We have implemented our new branching method, as well as the Caroe-Schultz method and a branch-and-price method, in the open-source software package DSP. Using SIPLIB test instances, we present extensive numerical results to demonstrate that the proposed branching method significantly reduces the number of node subproblems and solution times.

97 MATHEMATICS AND COMPUTING↗

Earthworms significantly enhance the temperature sensitivity of soil organic matter decomposition: Insights into future soil carbon budgeting

How and what soil fauna influence the soil organic matter (SOM) decomposition rate (Rs) and its temperature sensitivity (Q 10 ) have been largely ignored, although this is a crucial matter, especially under the scenario of global change. Further, in this study, a novel approach was adopted with a continuous changing-temperature incubation (daytime, from 7 °C to 22 °C; nighttime, from 22 °C to 7 °C) with rapid and continuous measurement, to examine the effect of soil macrofauna (specifically, earthworms) on Rs and Q 10 with three densities (no addition, low density, and high density). According to the results, the earthworms accelerated Rs. Furthermore, Rs with earthworm addition had a symmetrical pattern during daytime and nighttime cycles, which is contrary to traditional soil incubation, with only soil microbe as asymmetrical. More importantly, earthworm addition increased Q 10 markedly, ranging from 48% to 67%. Overall, the findings highlight the pivotal role of earthworms as soil macrofauna that regulating soil carbon release, and their effects should be integrated into process-based ecological models in future.

60 APPLIED LIFE SCIENCES↗

Singular value decomposition of adjoint flux distributions for Monte Carlo variance reduction

Monte Carlo (MC) shielding calculations often use weight windows (WWs) and biased sources formed from a deterministic estimate of the adjoint flux to improve the convergence rate of tallies. This requires a significant amount of computer memory, which can limit the memory available for high-resolution tally output. A new method is proposed for reducing these memory requirements by using singular value decomposition (SVD) in linear or logarithmic space to approximate the adjoint flux. This method’s performance is evaluated using the Shift and Denovo codes for streaming and diffusion base case problems, followed by problems using the Westinghouse AP1000 and the Joint European Torus. The log SVD reduced WW memory requirements by an order of magnitude in all cases without a significant performance penalty. Additionally, the linear SVD reduced biased source memory requirements by an order of magnitude, but further investigation is needed to account for observed limitations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Domain decomposition in the GPU-accelerated Shift Monte Carlo code

The GPU solver within the Shift continuous-energy Monte Carlo neutron transport code has been extended to provide domain decomposition in addition to domain replication to enable the solution of problems with memory requirements exceeding the capacity of a single GPU. The strategy follows the Multiple Set, Overlapping Domain (MSOD) approach that is used in Shift’s CPU solver and integrates into the event-based algorithm used for Shift’s GPU solver. Furthermore, the ability to assign processors to spatial domains non-uniformly has been maintained. In this work, two different approaches for communicating particle data between domains are considered, and multiple criteria for load balancing problems have been investigated. Numerical results are presented for both fresh and depleted small modular nuclear reactor (SMR) cores. A parallel efficiency of approximately 80% was achieved with up to 16 spatial domains measured relative to full domain replication. A scaling study on the Summit supercomputer demonstrates a weak scaling parallel efficiency of over 90% on over 24000 GPUs.

97 MATHEMATICS AND COMPUTING↗

The Kronecker product in terms of Hubbard operators and the Clebsch–Gordan decomposition of SU(2)×SU(2)

We review the properties of the Kronecker (direct, or tensor) product of square matrices A⊗B⊗C⋯ in terms of Hubbard operators. In its simplest form, a Hubbard operator X{sub n}{sup i,j} can be expressed as the n-square matrix which has entry 1 in position (i,j) and zero in all other entries. The algebra and group properties of the observables that define a multipartite quantum system are notably straightforward in such a framework. In particular, we use the Kronecker product in Hubbard notation to get the Clebsch–Gordan decomposition of the product group SU(2)×SU(2). Finally, the n-dimensional irreducible representations so obtained are used to derive closed forms of the Clebsch–Gordan coefficients that rule the addition of angular momenta. Our results can be further developed in many different directions. -- Highlights: •The Kronecker product is studied in terms of Hubbard operators. •Complicated calculations involving large matrices are reduced to simple relations of subscripts. •The algebraic properties of the quantum observables of multipartite systems are studied. •The Clebsch–Gordan coefficients are given in terms of hypergeometric {sub 3}F{sub 2} functions. •The results can be further developed in many different directions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Structure sensitivity and its effect on methane turnover and carbon co-product selectivity in thermocatalytic decomposition of methane over supported Ni catalysts

We explore how thermocatalytic decomposition of methane (TCD) is a promising approach for producing CO 2 -free hydrogen and solid carbon co-product. In this study, a series of Al 2 O 3 - and MgAl 2 O 4 -based Ni catalysts, prepared with varying synthesis and pretreatment methods, were evaluated for methane TCD performance at 650°C and characterized before and after reaction to elucidate activity-structure relationships. We found that methane TCD turnover increases with Ni particle size. Further, large Ni particle sizes (i.e., >20 nm) are selective toward the formation of carbon nanotubes (CNTs), while small Ni particle sizes (i.e., <10 nm) are selective toward the formation of graphitic carbon layers. The formation of graphitic carbon layers block access to Ni active sites, thus rendering the catalyst inactive more quickly than when CNTs are produced. Additionally, the catalyst deactivation observed with time-on-stream is due to the fragmentation of Ni particles into smaller Ni particles followed by their encapsulation with graphitic carbon layers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

In-situ X-ray observations of ultrasound-induced explosive decomposition

High-strain mechanical loading of polymer-bonded explosives can produce significant stress concentrations due to microstructural heterogeneities, resulting in localized thermal “hot spots”. Ultrasound produces similar effects and has been proposed as a tool to study the thermomechanical interactions related to explosive initiation. Detailed observations of the processes governing the generation of heat in these materials are severely lacking, yet they are vital for identifying salient physics, improving the modeling tools used to predict mechanical response, improving explosives safety, and providing insight into the initiation mechanisms of explosion. Here we discuss high-speed, high-resolution in-situ observations, obtained via synchrotron X-ray phase contrast imaging and diffraction, of the heating and decomposition of an explosive material under ultrasonic excitation. We demonstrate that interfacial friction is a dominant heating mechanism and can yield violent reaction of explosive particles. Moreover, sub-surface particle temperatures are estimated via diffraction.

36 MATERIALS SCIENCE↗

A scalable domain decomposition method for FEM discretizations of nonlocal equations of integrable and fractional type

Nonlocal models allow for the description of phenomena which cannot be captured by classical partial differential equations. The availability of efficient solvers is one of the main concerns for the use of nonlocal models in real world engineering applications. Here, we present a domain decomposition solver that is inspired by substructuring methods for classical local equations. In numerical experiments involving finite element discretizations of scalar and vectorial nonlocal equations of integrable and fractional type, we observe improvements in solution time of up to 14.6x compared to commonly used solver strategies.

97 MATHEMATICS AND COMPUTING↗

A biomimetic approach to fast selection of optimal controlled variables using multiagent algorithms and a decomposition approach

Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. This study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed.

42 ENGINEERING↗

An overlapping Domain Decomposition preconditioning method for monolithic solution of shear bands

Metals subjected to high strain rate impact often exhibit a sudden and profound drop in the material’s load bearing capability, a ductile failure phenomenon known as shear banding. Shear bands, characterized as material instabilities, are driven by shear heating and described as narrow regions that have sustained intense plastic deformation and high temperature rise. This coupled thermo-mechanical localization problem can be formulated as a nonlinear system with two balance equations, momentum and energy, and two constitutive laws for elasticity and plasticity. Here in our formulation, mixed finite elements are used to discretize the equations in space and an implicit finite difference scheme is used to advance the system in time, where at every time step, a Newton type method is used to solve the system monolithically. To that end, a block Jacobian matrix is formed analytically using Gâteaux derivatives. The resulting Jacobian is sparse, nonsymmetric and its sparsity pattern and eigenvalue content vary with the different stages of shear bands formation, consequently posing a significant challenge to iterative solvers. To address this issue, an overlapping Domain Decomposition preconditioner that takes into account the physics of shear bands and the domain in which it forms, is proposed. The key idea is to resolve the shear band domain accurately while only solving the remaining domain approximately, with selective updates when necessary. The preconditioner is formed on the basis of an additive Schwartz method that is applied to a Schur complement partition of the system. The proposed preconditioner is implemented in parallel and tested on three different benchmark problems as compared against off-the-shelf solvers. We study the effect of h- and k-refinement that are obtained from Isogeometric discretizations of the system, the overlapping strategy and its parallel performance. Excellent performance is demonstrated in serial and parallel on all benchmark examples.

42 ENGINEERING↗

Constrained reduced-order models based on proper orthogonal decomposition

A novel approach is presented to constrain reduced-order models (ROM) based on proper orthogonal decomposition (POD). The Karush–Kuhn–Tucker (KKT) conditions were applied to the traditional reduced-order model to constrain the solution to user-defined bounds. The constrained reduced-order model (C-ROM) was applied and validated against the analytical solution to the first-order wave equation. C-ROM was also applied to the analysis of fluidized beds. Lastly, it was shown that the ROM and C-ROM produced accurate results and that C-ROM was less sensitive to error propagation through time than the ROM.

42 ENGINEERING↗

hp -VPINNs: Variational physics-informed neural networks with domain decomposition

We formulate a general framework for hp-variational physics-informed neural networks (hp-VPINNs) based on the nonlinear approximation of shallow and deep neural networks and hp-refinement via domain decomposition and projection onto the space of high-order polynomials. The trial space is the space of neural network, which is defined globally over the entire computational domain, while the test space contains piecewise polynomials. Specifically in this study, the hp-refinement corresponds to a global approximation with a local learning algorithm that can efficiently localize the network parameter optimization. Here, we demonstrate the advantages of hp-VPINNs in both accuracy and training cost for several numerical examples of function approximation and in solving differential equations.

42 ENGINEERING↗

A FETI approach to domain decomposition for meshfree discretizations of nonlocal problems

We propose a domain decomposition method for the efficient simulation of nonlocal problems. Our approach is based on a multi-domain formulation of a nonlocal diffusion problem where the subdomains share “nonlocal” interfaces of the size of the nonlocal horizon. This system of nonlocal equations is first rewritten in terms of minimization of a nonlocal energy, then discretized with a meshfree approximation and finally solved via a Lagrange multiplier approach in a way that resembles the finite element tearing and interconnect method. Specifically, we propose a distributed projected gradient algorithm for the solution of the Lagrange multiplier system, whose unknowns determine the nonlocal interface conditions between subdomains. Several two-dimensional numerical tests on problems as large as 191 million unknowns illustrate the strong and the weak scalability of our algorithm, which outperforms the standard approach to the distributed numerical solution of the problem. Finally, this work is the first rigorous numerical study in a two-dimensional multi-domain setting for nonlocal operators with finite horizon and, as such, it is a fundamental step towards increasing the use of nonlocal models in large scale simulations.

42 ENGINEERING↗