Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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,063 records · Page 59

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

nu-TRLan User Guide Version 1.0: A High-Performance Software Package for Large-Scale Harmitian Eigenvalue Problems

The original software package TRLan, [TRLan User Guide], page 24, implements the thick restart Lanczos method, [Wu and Simon 2001], page 24, for computing eigenvalues {lambda} and their corresponding eigenvectors v of a symmetric matrix A: Av = {lambda}v. Its effectiveness in computing the exterior eigenvalues of a large matrix has been demonstrated, [LBNL-42982], page 24. However, its performance strongly depends on the user-specified dimension of a projection subspace. If the dimension is too small, TRLan suffers from slow convergence. If it is too large, the computational and memory costs become expensive. Therefore, to balance the solution convergence and costs, users must select an appropriate subspace dimension for each eigenvalue problem at hand. To free users from this difficult task, nu-TRLan, [LNBL-1059E], page 23, adjusts the subspace dimension at every restart such that optimal performance in solving the eigenvalue problem is automatically obtained. This document provides a user guide to the nu-TRLan software package. The original TRLan software package was implemented in Fortran 90 to solve symmetric eigenvalue problems using static projection subspace dimensions. nu-TRLan was developed in C and extended to solve Hermitian eigenvalue problems. It can be invoked using either a static or an adaptive subspace dimension. In order to simplify its use for TRLan users, nu-TRLan has interfaces and features similar to those of TRLan: (1) Solver parameters are stored in a single data structure called trl-info, Chapter 4 [trl-info structure], page 7. (2) Most of the numerical computations are performed by BLAS, [BLAS], page 23, and LAPACK, [LAPACK], page 23, subroutines, which allow nu-TRLan to achieve optimized performance across a wide range of platforms. (3) To solve eigenvalue problems on distributed memory systems, the message passing interface (MPI), [MPI forum], page 23, is used. The rest of this document is organized as follows. In Chapter 2 [Installation], page 2, we provide an installation guide of the nu-TRLan software package. In Chapter 3 [Example], page 3, we present a simple nu-TRLan example program. In Chapter 4 [trl-info structure], page 7, and Chapter 5 [trlan subroutine], page 14, we describe the solver parameters and interfaces in detail. In Chapter 6 [Solver parameters], page 21, we discuss the selection of the user-specified parameters. In Chapter 7 [Contact information], page 22, we give the acknowledgements and contact information of the authors. In Chapter 8 [References], page 23, we list reference to related works.

97 MATHEMATICS AND COMPUTING↗

Practical CO2—WAG Field Operational Designs Using Hybrid Numerical-Machine-Learning Approaches

Machine-learning technologies have exhibited robust competences in solving many petroleum engineering problems. The accurate predictivity and fast computational speed enable a large volume of time-consuming engineering processes such as history-matching and field development optimization. The Southwest Regional Partnership on Carbon Sequestration (SWP) project desires rigorous history-matching and multi-objective optimization processes, which fits the superiorities of the machine-learning approaches. Although the machine-learning proxy models are trained and validated before imposing to solve practical problems, the error margin would essentially introduce uncertainties to the results. In this paper, a hybrid numerical machine-learning workflow solving various optimization problems is presented. By coupling the expert machine-learning proxies with a global optimizer, the workflow successfully solves the history-matching and CO2 water alternative gas (WAG) design problem with low computational overheads. The history-matching work considers the heterogeneities of multiphase relative characteristics, and the CO2-WAG injection design takes multiple techno-economic objective functions into accounts. This work trained an expert response surface, a support vector machine, and a multi-layer neural network as proxy models to effectively learn the high-dimensional nonlinear data structure. The proposed workflow suggests revisiting the high-fidelity numerical simulator for validation purposes. The experience gained from this work would provide valuable guiding insights to similar CO2 enhanced oil recovery (EOR) projects.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Optimal Power Dispatch of DGs in Radial and Mesh AC Grids: A Hybrid Solution Methodology between the Salps Swarm Algorithm and Successive Approximation Power Flow Method

In this paper, we address the problem of the optimal power dispatch of Distributed Generators (DGs) in Alternating Current (AC) networks, better known as the Optimal Power Flow (OPF) problem. We used, as the objective function, the minimization of power losses (P loss ) associated with energy transport, which are subject to the set of constraints that compose AC networks in an environment of distributed generation. To validate the effectiveness of the proposed methodology in solving the OPF problem in any network topology, we employed one 10-node mesh test system and three radial text systems: 10, 33, and 69 nodes. In each test system, DGs were allowed to inject 20%, 40%, and 60% of the power supplied by the slack generator in the base case. To solve the OPF problem, we used a master–slave methodology that integrates the optimization method Salps Swarm Algorithm (SSA) and the load flow technique based on the Successive Approximation (SA) method. Moreover, for comparison purposes, we employed some of the algorithms reported in the specialized literature to solve the OPF problem (the continuous genetic algorithm, the particle swarm optimization algorithm, the black hole algorithm, the antlion optimization algorithm, and the Multi-Verse Optimizer algorithm), which were selected because of their excellent results in solving such problems. The results obtained by the proposed solution methodology demonstrate its superiority and convergence capacity in terms of minimization of P loss in both radial and mesh systems. It provided the best reduction in minimum P loss in short processing times and showed excellent repeatability in each test system and scenario under analysis.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

An Optimization-Based Law of Mass Action Precipitation/Dissolution Model

Rare earth elements (REE) and many other critical minerals are necessary for the manufacturing of modern everyday technologies, including microchips, batteries and electric motors. Recovery of these materials typically involves aqueous systems which can be modeled as chemical equilibrium problems. One common method for solving these problems is the law of mass action approach (LMA), where a system of non-linear equations involving the equilibrium constants is solved. However, despite being theoretically simple, these problems are in practice very difficult to solve. Currently, the use of iterative heuristics based on saturation indices to decide on which species and reactions to include in the calculations is the state of the art to arrive at a solution. Here, we present an optimization-based alternative to solve chemical equilibria problems involving precipitation/dissolution reactions without the need for such heuristics. Our approach is first validated against the LMA software MINTEQ and PHREEQC for a number of case studies, and then applied to a novel REE recovery process reported in the literature. Overall, our approach was found to have close agreement with MINTEQ and PHREEQC, and we were able to successfully replicate the reported yield and purity for the published REE process.

42 ENGINEERING↗

Improvements of biomass deconstruction enzymes

Sandia National Laboratories and DSM Innovation, Inc. collaborated on the investigation of the structure and function of cellulases from thermophilic fungi. Sandia's role was to use its expertise in protein structure determination and X-ray crystallography to solve the structure of these enzymes in their native state and in their substrate and product bound states. Sandia was also tasked to work with DSM to use the newly solved structure to, using computational approaches, analyze enzyme interactions with both bound substrate and bound product; the goal being to develop approaches for rationally designing improved cellulases for biomass deconstruction. We solved the structures of five cellulases from thermophilic fungi. Several of these were also solved with bound substrate/product, which allowed us to predict mutations that might enhance activity and stability.

09 BIOMASS FUELS↗

THERMO-HYDRO-MECHANICAL MODELING OF WORKING FLUID INJECTION AND THERMAL ENERGY EXTRACTION IN EGS FRACTURES AND ROCK MATRIX

Development of enhanced geothermal systems (EGS) will require creation of a reservoir of sufficient volume to enable commercial-scale heat transfer from the reservoir rocks to the working fluid. A key assumption associated with reservoir creation/stimulation is that sufficient rock volumes can be hydraulically fractured via both tensile and shear failure, and more importantly by reactivation of naturally existing fractures (by shearing), to create the reservoir. The advancement of EGS greatly depends on our understanding of the dynamics of the intimately coupled rock-fracture-fluid-heat system and our ability to reliably predict how reservoirs behave under stimulation and production. Reliable performance predictions of EGS reservoirs require accurate and robust modeling for strongly coupled thermal-hydrological-mechanical (THM) processes. Conventionally, these types of problems have been solved using operator-splitting methods, usually by coupling a subsurface flow and heat transport simulators with a solid mechanics simulator via input files. An alternative approach is to solve the system of nonlinear partial differential equations that govern multiphase fluid flow, heat transport, and rock mechanics simultaneously, using a fully coupled, fully implicit solution procedure, in which all solution variables (pressure, enthalpy, and rock displacement fields) are solved simultaneously. This paper describes numerical simulations used to investigate the poro- and thermal- elastic effects of working fluid injection and thermal energy extraction on the properties of the fractures and rock matrix of a hypothetical EGS reservoir, using a novel simulation software FALCON (Podgorney et al., 2011), a finite element based simulator solving fully coupled multiphase fluid flow, heat transport, rock deformation, and fracturing using a global implicit approach. Investigations are also conducted on how these poro- and thermal-elastic effects are related to fracture permeability evolution.

15 GEOTHERMAL ENERGY↗

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow: Preprint

We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.

machine learning↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources: Preprint

Integration of a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problem requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs) including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperformed other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Novel Solver Algorithms for Nearly Singular Linear Systems Arising in Combustion Modelling

Direct Numerical Simulations of realistic combustion devices are extremely challenging due to the wide separation of scales in the simulation, for example an internal combustion (IC) engine chamber, and the flame thickness of a high-pressure flame. The PeleLMeX solver uses adaptive mesh refinement (AMR) to evolve multi-species reacting flows in the low Mach number limit at the Exascale and relies on an embedded boundary (EB) approach to represent complex geometries. In that framework, the EB geometries often give rise to very small cut-cells along the boundary, which translate into extreme ill-conditioning of the pressure-projection, with eigenvalues that span 15-16 orders of magnitude. In this talk, we focus on the case of a typical IC piston bowl geometry for which we present on a novel approach towards solving these nearly singular linear systems with ILU-based, C-AMG smoothers on massively parallel architectures. In particular, we use scaling and equilibration algorithms to handle the non-normality of the upper triangular factors. This enables us to approximate the highly sequential triangular solve algorithm, embedded in the AMG smoothing-solve phase, with Jacobi iterations. This approximation can be written as a convergent Neumann series whose terms are composed of highly parallel sparse matrix vector multiplications. The result is an algorithm that substantially decreases setup and solve time, compared to state-of-the-art, for these challenging linear systems.

combustion modelling↗

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Technologies for a quantum/classical hybrid approach to solving optimization problems is disclosed. In the illustrative embodiment, an optimization problem is decomposed into two sub-problems. The first sub-problem is solved on a classical computer, and a result from the first sub-problem is provided to a quantum computer. The quantum computer then solves the second sub-problem based on the result of the first sub-problem from the classical computer. The quantum computer can then provide a result to the classical computer to re-solve the first problem. The iterative calculation is continued until an end condition is met.

You, Fengqi↗

Modified Closures in Monte Carlo Algorithms for Diffusive Binary Stochastic Media Transport Problems

In a stochastic medium, the material properties at a given spatial location are known only statistically. The most common approach to solving particle transport problems involving binary stochastic media (BSM) is to use the atomic mix approximation in which the transport problem is solved using homogenized (volume-averaged) material properties. A common deterministic model developed for solving BSM particle transport problems is the Levermore-Pomraning (LP) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the LP equations and another Monte Carlo algorithm (Algorithm B) that locally preserves the sampled material realization; we refer to these Monte Carlo algorithms as the LP and LPLRP (LP local realization preserving) algorithms, respectively. One-dimensional (1D) planar geometry benchmark studies have shown that the LPLRP algorithm is often significantly more accurate than the LP algorithm for problems with an incident angular flux as well as for problems with an interior source. The LPLRP algorithm implementation in these benchmark comparisons made explicit use of the one-dimensional nature of the problem. The LP model is derived by assuming an 'upwind' closure in the coupling term relating the two materials in a binary stochastic medium. Su and Pomraning developed a modified form of this closure by considering the small correlation length limit and requiring the modified closure to produce the correct exponential decay for a source-free half-line albedo problem in rod geometry. They concluded that the modified closure is generally not inferior to the LP closure and in some cases is significantly better. Brantley investigated the use of the Su-Pomraning (SP) closure in the Monte Carlo LP algorithm (LP-SP) for the suite of benchmark problems and concluded that 1) the LP-SP algorithm was somewhat more accurate overall than the LP algorithm and somewhat less accurate overall than the LPLRP algorithm for an incident angular flux benchmark suite, and 2) the LP-SP algorithm was generally the least accurate of the algorithms for an interior source benchmark suite. Larsen et al. performed an asymptotic analysis of the transport equation in 1D planar geometry for the situation in which the physical system is 1) a random binary stochastic medium with material macroscopic total cross sections and mean slab width values of O(1) or smaller and 2) optically thick with weak absorption and sources at each spatial point and therefore globally diffusive. The asymptotic analysis demonstrates that, under these assumptions, the transport equation limits to the conventional diffusion equation with atomically-mixed (volume-averaged) material properties. Larsen et al. also demonstrate that, under these same assumptions, the LP equations asymptotically limit to an atomically-mixed diffusion equation with a diffusion coefficient that is too large, leading to an unphysical flattening of the ensemble-averaged scalar flux distribution. Vasques and Yadav recently performed an asymptotic analysis of an adjusted Levermore-Pomraning closure in which the Markovian transition functions are rescaled such that the equations asymptotically limit to the correct atomically-mixed diffusion equation; we refer to this model as LP-VY. In this paper, we demonstrate that the adjusted LP closure proposed by Vasques and Yadav is a special case of the SP closure obtained by assuming that the absorption cross sections in the two materials are equal. We further demonstrate that the Su-Pomraning closure has the correct asymptotic limit for the diffusive physical system and is therefore an appropriate closure for these problems. We also describe how to incorporate these various closures into the Monte Carlo LP and LPLRP particle transport algorithms, and we present numerical results comparing the accuracy of the Monte Carlo LP, LP-VY, LP-SP, LPLRP, and LPLRP-SP algorithms for the set of diffusive benchmark problems. We demonstrated that the SP closure has the correct asymptotic limit for the diffusive physical system under investigation in this paper and that the VY closure is a special case of the SP closure obtained by assuming equal absorption in the two materials. Both of these closures are readily implemented in the Monte Carlo LP and LPLRP algorithms for particle transport in BSM. Through numerical comparisons to a diffusive benchmark suite, we confirmed that 1) the LP and LPLRP algorithms do not limit to the appropriate diffusion solution and 2) the LP-VY, LP-SP, and LPLRP-SP algorithms limit to the appropriate diffusion solution and are of comparable accuracy. The LPLRP algorithm has been shown to be generally more accurate than the LP algorithm for non-diffusive problems. However, the numerical results in this paper indicate that the LPLRP algorithm does not limit to the correct diffusion equation for the asymptotic limit under consideration. The work in this paper demonstrates that the SP algorithm does limit to the correct diffusion equation for the asymptotic limit considered. Future work will investigate the possibility of whether the LPLRP-SP algorithm is accurate for both diffusive and non-diffusive problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Application of NEM-based Pin-by-Pin HCMFD Algorithm to 3-D Core Analysis

A pin-wise reactor analysis is expected to provide a more accurate solution than the conventional nodal methods. However, a pin-wise approach is still computationally very costly though the computational performances have been enormously improved for decades. To overcome such limitation of a pin-by-pin core analysis, the HCMFD (Hybrid Course-Mesh Finite Difference) algorithm has been recently introduced. By adopting the HCMFD algorithm, a parallel computing can be applied very effectively. In the HCMFD algorithm, an iterative local-global strategy is adopted with a combination of two CMFD acceleration methods for the pin-wise core analysis. The global eigenvalue problem is solved by one-node CMFD, while the local fixed-source problems are solved by two-node CMFD based on the NEM (nodal expansion method). In the HCMFD computational scheme, a parallel computing can effectively be applied since most of the computational efforts are consumed to solve the local problems, and they can be solved in parallel. Previously, only a 2-D HCMFD algorithm was developed and its numerical efficiency was evaluated. In this paper, a 3D HCMFD scheme is introduced and some 3-D problems were analyzed to verify its applicability to 3D pin-wise core analysis. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Error Convergence Characterization for Stochastic Transport Methods

There has been increased interest in reliably and efficiently solving engineering systems involving uncertainty in recent years. Characterization of the convergence of errors within the problem, including statistical and bias errors, increases confidence that chosen solution methods are appropriate for a particular problem and quantity of interest (QoI), that implementation errors have not been made, and can aid users or algorithms in solving problems within a tolerance efficiently. We demonstrate a method for characterizing error convergence in a simple stochastic transport problem. Though the approach is applicable to problems with more complicated physics, our simple problem enables analytic QoI solutions so that error convergence behavior and the identification of limiting errors can be presented with high precision. A one-dimensional, two-material, neutral-particle, and absorption-only transport problem involving uniformly distributed uncertain total cross sections is presented. Random sampling (RS) and stochastic collocation (SC) are used as stochastic solvers which sample from the uncertain space and Monte Carlo (MC) transport is employed to solve transport results on the resulting realizations. Probability density functions (PDFs) are created using either RS solutions or samples taken from a polynomial chaos expansion (PCE) constructed with SC solutions. The convergence of each solver is characterized with respect to the QoI against analytic solutions, convergence behavior is used to efficiently solve a QoI within a tolerance, and convergence plots are used to identify dominant solution errors.

42 ENGINEERING↗

Large-scale inverse model analyses employing fast randomized data reduction: INVERSE MODELING WITH DATA REDUCTION

When the number of observations is large, it is computationally challenging to apply classical inverse modeling techniques. We have developed a new computationally efficient technique for solving inverse problems with a large number of observations (e.g., on the order of 10 7 or greater). Our method, which we call the randomized geostatistical approach (RGA), is built upon the principal component geostatistical approach (PCGA). We employ a data reduction technique combined with the PCGA to improve the computational efficiency and reduce the memory usage. Specifically, we employ a randomized numerical linear algebra technique based on a so-called “sketching” matrix to effectively reduce the dimension of the observations without losing the information content needed for the inverse analysis. In this way, the computational and memory costs for RGA scale with the information content rather than the size of the calibration data. Our algorithm is coded in Julia and implemented in the MADS open-source high-performance computational framework (http://mads.lanl.gov). We apply our new inverse modeling method to invert for a synthetic transmissivity field. Compared to a standard geostatistical approach (GA), our method is more efficient when the number of observations is large. Moreover, our method is capable of solving larger inverse problems than the standard GA and PCGA approaches. Thus, our new model inversion method is a powerful tool for solving large-scale inverse problems. The method can be applied in any field and is not limited to hydrogeological applications such as the characterization of aquifer heterogeneity.

54 ENVIRONMENTAL SCIENCES↗

Number of sites-based solver for determining coverages from steady-state mean-field micro-kinetic models

Kinetic models parameterized by ab-initio calculations have led to significant improvements in understanding chemical reactions in heterogeneous catalysis. These studies have been facilitated by implementations which determine steady-state coverages and rates of mean-field micro-kinetic models. As implemented in the open-source kinetic modeling program, CatMAP, the conventional solution strategy is to use a root-finding algorithm to determine the coverage of all intermediates through the steady-state expressions, constraining all coverages to be non-negative and to properly sum to unity. Though intuitive, this root-finding strategy causes issues with convergence to solution due to these imposed constraints. In this work, we avoid explicitly imposing these constraints, solving the mean-field steady-state micro-kinetic model in the space of number of sites instead of solving it in the space of coverages. Here, we transform the constrained root-finding problem to an unconstrained least-squares minimization problem, leading to significantly improved convergence in solving micro-kinetic models and thus enabling the efficient study of more complex catalytic reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗