Search NASA⌕ Search

SEARCH · Search NASA

Results for “Block 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 37 records · Page 2

A high accuracy/resolution spectral element/Fourier–Galerkin method for the simulation of shoaling non-linear internal waves and turbulence in long domains with variable bathymetry

A high-order hybrid continuous-Galerkin numerical method, designed for the simulation of non-linear, non -hydrostatic internal waves and turbulence in long computational domains with complex bathymetry, is presented. The spatial discretization in the non-periodic wave-propagating directions, utilizes the nodal spectral element method. Such a high-order element-based discretization allows the highly accurate representation of complex domain geometry along with the flexibility of concentrating resolution in areas of interest. Under the assumption of the normal-to-isobath propagation of non-linear internal waves, a third periodic direction is incorporated via a Fourier-Galerkin discretization. The distinct non-hydrostatic nature of non-linear internal waves and, any instabilities and turbulence therein, necessitates the numerically challenging solution of the pressure Poisson problem. A defining feature of this work is the application of a domain decomposition approach, combined with block-Jacobi/deflation-based preconditioning to the pressure Poisson problem. Such a combined approach is particularly suitable for the long high aspect-ratio complex domains of interest and enables the efficient high-accuracy reproduction of the non-hydrostatic dynamics of non-linear internal waves. Implementation details are also described in the context of the stability of the solver and its parallelization strategy. A series of benchmarks of increasing complexity demonstrate the robustness of the flow solver. The benchmarks culminate with the three-dimensional simulation of a convectively breaking mode-one non-linear internal wave over a realistic South-China-Sea bathymetric transect and background current/stratification profiles.

Deflation↗

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗

When Do Extended Physics-Informed Neural Networks (XPINNs) Improve Generalization?

Physics-informed neural networks (PINNs) have become a popular choice for solving high-dimensional partial differential equations (PDEs) due to their excellent approximation power and generalization ability. Recently, extended PINNs (XPINNs) based on domain decomposition methods have attracted considerable attention due to their effectiveness in modeling multiscale and multiphysics problems and their parallelization. However, theoretical understanding of their convergence and generalization properties remains unexplored. In this study, we take an initial step towards understanding how and when XPINNs outperform PINNs. Specifically, for general multilayer PINNs and XPINNs, we first provide a prior generalization bound via the complexity of the target functions in the PDE problem and a posterior generalization bound via the posterior matrix norms of the networks after optimization. Moreover, based on our bounds, we analyze the conditions under which XPINNs improve generalization. Concretely, our theory shows that the key building block of XPINN, namely, the domain decomposition, introduces a tradeoff for generalization. On the one hand, XPINNs decompose the complex PDE solution into several simple parts, which decreases the complexity needed to learn each part and boosts generalization. On the other hand, decomposition leads to less training data being available in each subdomain, and hence such a model is typically prone to overfitting and may become less generalizable. Empirically, we choose five PDEs to show when XPINNs perform better than, similar to, or worse than PINNs, hence demonstrating and justifying our new theory.

97 MATHEMATICS AND COMPUTING↗

Linear and Nonlinear Solvers for Simulating Multiphase Flow within Large-Scale Engineered Subsurface Systems

Simulation of multiphase flow in the subsurface is well-known to be computationally challenging. While there have been many studies that have explored approaches to overcoming these challenges, they often utilize relatively simple case studies. In this paper, we focus on the unique numerical challenges posed by modeling large-scale engineered subsurface systems, characterized by discrete features embedded in a heterogeneous natural subsurface setting. The man-made features such as shafts, tunnels, and barriers often cause multiple challenges in modeling the domain for multiphase porous media flow. This flow scenario can have a wide range of applications such as nuclear waste repositories, enhanced recovery of a petroleum reservoir, geothermal engineering, and carbon sequestration. An example of these severe numerical challenges is the case of performance assessment (PA) for Waste Isolation Pilot Plant (WIPP), the only operating deep geological repository in the US, which simulates extreme material properties of bedded salt rock formation and extreme contrast due to open excavation next to the formation. The models have extremes not only of permeability and porosity but also of the constitutive models needed for multiphase flow; additionally, they have process models like salt creep closure reducing porosity over time, fracturing in clay and anhydrite interbeds of the bedded salt, gas generation from the waste materials, and unintentional human borehole intrusions in some scenarios. Numerical simulations require the solution of coupled systems of nonlinear PDEs; in our work, we use the open-source simulator PFLOTRAN which is based on Finite Volume discretization. The solution of the nonlinear equations requires use of the Newton-Raphson iteration at each time step, which entails the solution of the linearized Jacobian system at each iteration. The effects of all the processes (i.e., large number of unknowns, highly nonlinear constitutive relations, large contrasts in material properties in short distances) lead to an ill-conditioned Jacobian matrix that severely challenges traditional linear solver, i.e., stabilized biconjugate gradient with block Jacobi incomplete LU preconditioner (BCGS-ILU) leading to non-convergence for traditional Newton-Raphson nonlinear solver causing unacceptably long computation time for each model. This paper presents linear solvers such as constrained pressure residual (CPR) two-stage preconditioner with alternate-block-factorization (ABF) and quasi- implicit pressure and explicit saturation (QIMPES) decouplers and flexible generalized residual solver (FGMRES). The new general-purpose nonlinear solver, Newton trust-region dogleg Cauchy (NTRDC), is also introduced to resolve extreme nonlinearities in the models. We demonstrate the effectiveness of each method relative to the default BCGS-Newton solver. The two best cases had nearly 50 times speed-up and achieved completion of a simulation in 14 hours that never completed due to non-convergence with the default solver. We also investigate the strong scalability of each method and discuss some of the deficiencies found for Block Jacobi preconditioner using parallel domain decomposition, and node packing effects of modern processor architecture.

Preconditioner, Nonlinear, Porous media, Multiphas↗

Fully Recyclable Polycarbonates from Simple, Bio-Derived Building Blocks

Plastic buildup and accumulation in the environment are an increasingly large problem facing civilization. Petroleum-based plastics can exist for hundreds to thousands of years in the environment, destroying habitats and polluting water. Environmentally conscious replacements for plastics are urgently needed. In this publication, we present a biobased alternative to petroleum-based polycarbonates. Using a diol monomer derived from glycerol and glycerol products, we have synthesized aliphatic polycarbonates with comparable physical properties to petroleum-based incumbents. The polymer can be quantitatively depolymerized using warm methanol to recover the monomer which can be repolymerized multiple times, or alternatively, the monomer, which is inherently nontoxic, can slowly break apart to the original components. This provides two end-of-life options for this material recycle or decomposition under environmental conditions to benign building blocks, thus providing a potential pathway to avoid environmental and bioaccumulation of plastics. We also demonstrate the ability to selectively recover the monomer from a simulated mixed-plastic waste environment; the monomer recovered this way functions identically to the virgin monomer after purification. This work represents an important step in the progress toward environmentally conscious polymer design with multiple end-of-life options.

36 MATERIALS SCIENCE↗

Scaling Resolution of Gigapixel Whole Slide Images Using Spatial Decomposition on Convolutional Neural Networks

Gigapixel images are prevalent in scientific domains ranging from remote sensing, and satellite imagery to microscopy, etc. However, training a deep learning model at the natural resolution of those images has been a challenge in terms of both, overcoming the resource limit (e.g. HBM memory constraints), as well as scaling up to a large number of GPUs. In this paper, we trained Residual neural Networks (ResNet) on 22,528 x 22,528-pixel size images using a distributed spatial decomposition method on 2,304 GPUs on the Summit Supercomputer. We applied our method on a Whole Slide Imaging (WSI) dataset from The Cancer Genome Atlas (TCGA) database. WSI images can be in the size of 100,000 x 100,000 pixels or even larger, and in this work we studied the effect of image resolution on a classification task, while achieving state-of-the-art AUC scores. Moreover, our approach doesn't need pixel-level labels, since we're avoiding patching from the WSI images completely, while adding the capability of training arbitrary large-size images. This is achieved through a distributed spatial decomposition method, by leveraging the non-block fat-tree interconnect network of the Summit architecture, which enabled GPU-to-GPU direct communication. Finally, detailed performance analysis results are shown, as well as a comparison with a data-parallel approach when possible.

Tsaris, Aristeidis (aris)↗

QuadSync: Quadrifocal tensor synchronization via Tucker decomposition

In structure from motion, quadrifocal tensors capture more information than their pairwise counterparts (essential matrices), yet they have often been thought of as impractical and only of theoretical interest. In this work, we challenge such beliefs by providing a new framework to recover n cameras from the corresponding collection of quadrifocal tensors. We form the block quadrifocal tensor and show that it admits a Tucker decomposition whose factor matrices are the stacked camera matrices, and which thus has a multilinear rank of (4,4,4,4) independent of n. We develop the first synchronization algorithm for quadrifocal tensors, using Tucker decomposition, alternating direction method of multipliers, and iteratively reweighted least squares. We further establish relationships between the block quadrifocal, trifocal, and bifocal tensors, and introduce an algorithm that jointly synchronizes these three entities. Numerical experiments demonstrate the effectiveness of our methods on modern datasets, indicating the potential and importance of using higher-order information in synchronization.

Miao, Daniel [University of Minnesota]↗

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗

Space–time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems

A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Polymer-Assisted Spinodal Decomposition Strategy toward Interconnected Porous Sodium Super Ionic Conductor-Structured Polyanion-Type Materials and Their Application as a High-Power Sodium-Ion Battery Cathode

A general polymer-assisted spinodal decomposition strategy is used to prepare hierarchically porous sodium super ionic conductor (NASICON)-structured polyanion-type materials (e.g., Na 3 V 2 (PO 4 ) 3 , Li 3 V 2 (PO 4 ) 3 , K 3 V 2 (PO 4 ) 3 , Na 4 MnV(PO 4 ) 3 , and Na 2 TiV(PO 4 ) 3 ) in a tetrahydrofuran/ethanol/H 2 O synthesis system. Depending on the boiling point of solvents, the selective evaporation of the solvents induces both macrophase separation via spinodal decomposition and mesophase separation via self-assembly of inorganic precursors and amphiphilic block copolymers, leading to the formation of hierarchically porous structures. We find that the resulting hierarchically porous Na 3 V 2 (PO 4 ) 3 possessing large specific surface area (≈77 m 2 g -1 ) and pore volume (≈0.272 cm 3 g -1 ) shows a high specific capacity of 117.6 mAh g -1 at 0.1 C achieving the theoretical value and a long cycling life with 77% capacity retention over 1000 cycles at 5 C. This method presented here can open a facile avenue to synthesize other hierarchically porous polyanion-type materials.

36 MATERIALS SCIENCE↗

Wood Decomposition: Understanding Processes Regulating Carbon Transfer to Soil Carbon Pools Using FACE Wood at Multiple Scales

Dead wood comprises approximately 20% of forest biomass. While it is widely recognized for its role in ecosystem functions relative to habitat and nutrient cycling, there are considerable uncertainties associated with its role in the forest carbon (C) cycle. The principal uncertainty is whether dead wood contributes to the soil C pool. With little supporting evidence, the presumption is that C in wood is respired back to the atmosphere through decomposition processes. The inability to attribute forest soil C to its source components has been a barrier to addressing this important forest carbon cycle question. The U.S. Dept. of Energy’s Free Air CO 2 Enrichment (FACE) experiment produced wood that has a distinct δ 13 C signature that can be used to trace its fate through organic matter decomposition processes. Using two hardwood species (aspen, birch) from the Rhinelander FACE site and pine from the Duke FACE site, the FACE Wood Decomposition Experiment (FWDE) was established in 2011 to provide the foundation for addressing wood decomposition and its associated processes at the continental scale. Plots were installed on nine experimental forests representing a range in bioclimatic forest conditions within the continental U.S. Each identical plot has logs of the three species incubating on the soil surface and pine logs suspended in the air, representing standing dead wood. Abiotic conditions are monitored continuously, and soil and forest conditions characterized. Logs on the sites have been measured every two years to assess decay. This project was initiated in 2016 with specific objectives to: (a) determine whether dead wood C contributes to the soil C pool, (b) assess the fungal community composition mediating the decay, (c) assess the interactions of termites with microbial decay, and (d) develop a mechanistic model to simulate wood decomposition. The principal field sampling was conducted in 2017; correspondingly, the results reported here represent six years of decomposition. Wood decomposition varied from 13 to 75 % loss across the bioclimatic gradient. Sites in the southeastern U.S. coastal plain and piedmont had fastest decomposition rates for each of the species. In contrast sites in the Rocky Mountains had the slowest decay rates, which were associated with cold temperatures. Standing deadwood decomposes at a much slower rate than logs on the soil surface; a response due to differences in wood moisture content. Wood carbon was measured in the mineral soil across each of the sites; accordingly, this is the first study to affirm that a portion of the wood C does become part of the soil C pool. Averaged across the FWDE sites, approximately 1.4% of the soil C in the upper 10 cm of the mineral soil directly beneath the log was derived from the deadwood; within 50 cm of the log, wood C accounted for an average of 2.1%. These results demonstrate that the contribution of deadwood to the soil C pool is a soil volume surrounding the log; and it’s likely a larger volume than what we sampled. We also hypothesized that there would be more wood C in the mineral soil when termites were present. However, that hypothesis wasn’t supported by measurements on the Santee Experimental Forest termite exclusion (SEF-TX) plots under FACE logs that incubated for 6 years. Across all the sites, the majority of the wood C was transferred to the atmosphere. Approximately 7,000 fungal species were sequenced. The fungal communities were different among each of the sites suggesting local colonization; interestingly, within sites the three species also exhibited differences in fungal community composition. White rot was the dominant fungal form in pine and hardwood, which yields less lignin in the wood residue. Brown rot occurred in approximately 20% of the pine and aspen logs, and it did not occur in birch logs. The occurrence of brown rot was only weakly correlated to site factors. We conducted two additional experiments to assess the effects of termites on wood decomposition and the associated interactions with the fungal community. Pine and birch logs were incubated on the Santee Experimental Forest termite exclusion plots in upland and riparian settings. There was no difference in decay between areas where termites were able colonize and plots where they had been excluded. Highly variable foraging by termites was a primary contributor the result. Correspondingly, fungal communities did not vary on logs incubated among the two treatments, but they did reflect site and species differences. The second experiment was conducted on each of the nine FWDE sites where pine and birch wood blocks were incubated for two years with and without a wrapping designed to exclude termites and other arthropods. The effects of termites on wood decomposition could be confirmed on two of the four sites known to have subterranean termites. On the two southeastern sites, termites contributed approximately 8% to mass loss in pine blocks over two years. A major factor clouding the role of termites in wood decomposition is the inability to assess the time, duration, and intensity of the foraging with the logs. Another uncertainty is related to whether a piece of wood will be foraged. A process-based wood decomposition model was developed representing biological processes mediated by fungi, bacteria, termites, beetles, as well as physical and chemical processes. The Coarse Wood Decomposition Model (CWDM) was parameterized based on a thorough review of the literature and it was validated using data from the FWDE. In the initial setup, the model considers softwoods and hardwoods groups, as opposed to individual species. Sensitivity analyses incorporating climate data from 89 locations in North America demonstrated that CWDM was stable from the tropics to the boreal zone. Model calibration and validation showed it to perform very well. The CWDM is poised for additional testing with subsequent FWDE data as well as other data sets, and it is available for incorporation into forest biogeochemical models or DOEs Earth System Modeling framework.

54 ENVIRONMENTAL SCIENCES↗

Qudit Gate Decomposition Dependence for Lattice Gauge Theories

In this work, we investigate the effect of decomposition basis on primitive qudit gates on superconducting radio-frequency cavity-based quantum computers with applications to lattice gauge theory. Three approaches are tested: SNAP & Displacement gates, ECD & single-qubit rotations $R(\theta,\phi)$, and optimal pulse control. For all three decompositions, implementing the necessary sequence of rotations concurrently rather then sequentially can reduce the primitive gate run time. The number of blocks required for the faster ECD &$R_p(\theta)$ is found to scale $\mathcal{O}(d^2)$, while slower SNAP & Displacement set scales at worst $\mathcal{O}(d)$. For qudits with $d<10$, the resulting gate times for the decompositions is similar, but strongly-dependent on experimental design choices. Optimal control can outperforms both decompositions for small $d$ by a factor of 2-12 at the cost of higher classical resources. Lastly, we find that SNAP & Displacement are slightly more robust to a simplified noise model.

Kürkçüoglu, Doga Murat↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

Build Optimization Software Tools (BOOST) v2.0.0

Build Optimization Software Tools (BOOST) accelerate the design of DNA, RNA and protein sequences for their synthesis and assembly in an automated and scalable fashion. The BOOST Juggler automates the following two design tasks: - Reverse-Translation of protein sequences into DNA sequences - Codon Juggling of DNA sequences The BOOST Polisher provides the following design tasks: - The Verification of DNA sequences against DNA synthesis constraints - The Modification of DNA sequences in case they violate any DNA synthesis constraint In addition, the BOOST Polisher can be instructed to verify and modify DNA sequences against sequence patterns, such as restriction sites. The BOOST Partitioner supports both Gibson/chewback and Yeast assembly (also known as Transformation-Associated Recombination, or TAR) methods when performing the decomposition of large sequences that exceed the maximum length of DNA synthesis into synthesizable building blocks. The Partitioner can be instructed to find building blocks with appropriate overlap sequences, making their assembly into the complete construct more efficient. BOOST Workflows enable, in a customized fashion, the execution of the Juggler, Polisher, and Partitioner tools on a batch of sequences.

Sharkey, Michael↗

Bio‐Inspired In Situ Tuning of the Hydrophobic Environment Around Catalytically Active Organic Ligand‐Stabilized Ruthenium Nanoparticles

Abstract The organic ligand environment surrounding enzymatic and homogeneous catalytic active sites often determines catalytic activity. Ruthenium nanoparticles, ≤1 nm in diameter, are synthesized using monodentate thiol, monodentate phosphine, and bidentate bisphosphine ligands. Even though some of the ruthenium surface is blocked by the ligands, catalytic activity is still observed for CO oxidation and H 2 O 2 decomposition. All three ligand‐stabilized ruthenium nanoparticles have similar CO oxidation rates; however, the bisphosphine‐stabilized Ru nanoparticles are approximately 2.5 times less active than the monothiol‐stabilized and monophosphine‐stabilized ruthenium nanoparticles for H 2 O 2 decomposition. It is observed that the organic ligand environment is modulated in situ during nanoparticle synthesis via partial oxidation of the bisphosphine as confirmed by 31 P NMR measurements. We hypothesize that bisphosphine‐bound Ru nanoparticles consist of a Ru core with some of the ligands bound in a monodentate manner where the other P atom is oxidized and not bound to the Ru surface leading to a thicker hydrophobic layer around the Ru nanoparticles. The increase in hydrophobicity is confirmed via contact angle and zeta potential measurements. H 2 O 2 decomposition rates are known to decrease with increasing hydrophobicity, and this work illustrates a pathway for increasing hydrophobicity in situ using ligand‐bound metallic nanoparticles.

Sufyan, Sayed Abu [Department of Chemical Engineer↗

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗

WavPool: A New Block for Deep Neural Networks

Modern deep neural networks comprise many operational layers, such as dense or convolutional layers, which are often collected into blocks. In this work, we introduce a new, wavelet-transform-based network architecture that we call the multi-resolution perceptron: by adding a pooling layer, we create a new network block, the WavPool. The first step of the multi-resolution perceptron is transforming the data into its multi-resolution decomposition form by convolving the input data with filters of fixed coefficients but increasing size. Following image processing techniques, we are able to make scale and spatial information simultaneously accessible to the network without increasing the size of the data vector. WavPool outperforms a similar multilayer perceptron while using fewer parameters, and outperforms a comparable convolutional neural network by ~ 10% on relative accuracy on CIFAR-10.

McDermott, Samuel D.↗

Low temperature water-gas shift: Optimization of K loading on Pt/m-ZrO 2 for enhancing CO conversion

Previous work showed that alkali doping of Pt/ZrO 2 significantly improved the LT-WGS rate. This improvement was caused by an acceleration in the rate of formate decomposition, the rate limiting step of an associative mechanism, through electronically weakening the CH bond. In this study, the effects that potassium loading on Pt/ZrO 2 have on the rate of LT-WGS and the strength of the CH bond in intermediate formate species are explored. Catalysts were investigated using in-situ DRIFTS, TPR-MS, TPD, EXAFS, and catalyst testing. Here, loadings of 1.7 wt.% potassium or higher shifted the formate ν(CH) band to significantly lower wavenumbers, indicating weakening of the bond. For the optimal loading, 2.6 wt.% K, the formate CH bond was significantly weakened, and the surface of Pt nanoparticles remained largely uncovered. However, loadings of 3.4 wt. % and above blocked the surface of the platinum nanoparticles. This, in addition to an increasing average Pt0 cluster size, hindered platinum from assisting in dehydrogenation of formate during steam promoted formate decomposition occurring in LT-WGS.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗