Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computing 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 1,549 records · Page 86

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

Security-constrained unit commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via mixed-integer linear programming (MIP), sometimes multiple times per day, with only minor changes in input data. In this work, we propose a number of machine learning techniques to effectively extract information from previously solved instances in order to significantly improve the computational performance of MIP solvers when solving similar instances in the future. Based on statistical data, we predict redundant constraints in the formulation, good initial feasible solutions, and affine subspaces where the optimal solution is likely to lie, leading to a significant reduction in problem size. Computational results on a diverse set of realistic and large-scale instances show that using the proposed techniques, SCUC can be solved on average 4.3 times faster with optimality guarantees and 10.2 times faster without optimality guarantees, with no observed reduction in solution quality. Out-of-distribution experiments provide evidence that the method is somewhat robust against data-set shift. Summary of Contribution. The paper describes a novel computational method, based on a combination of mixed-integer linear programming (MILP) and machine learning (ML), to solve a challenging and fundamental optimization problem in the energy sector. The method advances the state-of-the-art, not only for this particular problem, but also, more generally, in solving discrete optimization problems via ML. We expect that the techniques presented can be readily used by practitioners in the energy sector and adapted, by researchers in other fields, to other challenging operations research problems that are solved routinely.

Machine Learning↗

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Furthermore, our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than 10000 with errors below 10 -12 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

New method for fitting coefficients in standard model effective theory

We present an alternative method for carrying out a principal-component analysis of Wilson coefficients in standard model effective field theory (SMEFT). The method is based on singular-value decomposition (SVD). The SVD method provides information about the sensitivity of experimental observables to physics beyond the standard model that is not accessible in the Fisher-information method. In principle, the SVD method can also have computational advantages over diagonalization of the Fisher information matrix. We demonstrate the SVD method by applying it to the dimension-6 coefficients for the process of top-quark decay to a b quark and a W boson and use this example to illustrate some pitfalls in widely used fitting procedures. We also outline an iterative procedure for applying the SVD method to dimension-8 SMEFT coefficients.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Editorial: Edge computation and digital distribution networks

The development of digital technologies is penetrating all areas of energy revolution. Based on the in-depth integration of advanced digital technologies, distribution networks are gradually transforming into digital distribution networks (DDNs) with tremendous changes from the structure to the operation mode. DDNs is the digitalized appearance of the physical distribution network, in which ubiquitous connections and massive data are the basic characteristics (Huo et al., 2022). It is an important task to utilize the massive data and propose novel operation modes to construct more efficient and intelligent distribution networks (Jian et al., 2022). Among the advanced digital technologies in DDNs, edge computing has received wide attention (Zhao et al., 2022). It has superior performance in local sensing and intelligent computation, which can effectively relieve huge communication pressure. However, the limited computing resources and the complex computing tasks at the edge side significantly challenge the collaboration of distribution network regulation and advanced digital technologies (Hu et al., 2022). It is necessary to find out proper methods to utilize advanced digital technology to construct DDNs. This Research Topic is organized to introduce the recent progress in the construction, operation and advanced computational methods for DDNs. Finally, seven papers have been accepted, which can be sorted into the following three categories: 1) Evolution and technical features of DDNs, 2) Intelligent operation control of DDNs, 3) Advanced simulation for large-scale DDNs. The three sections below respectively introduce the major research and contributions of the papers covered in each category.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Fluid-Kinetic Coupling: Advanced Discretizations for Simulations on Emerging Heterogeneous Architectures (LDRD FY20-0643)

Plasma physics simulations are vital for a host of Sandia mission concerns, for fundamental science, and for clean energy in the form of fusion power. Sandia's most mature plasma physics simulation capabilities come in the form of particle-in-cell (PIC) models and magnetohydrodynamics (MHD) models. MHD models for a plasma work well in denser plasma regimes when there is enough material that the plasma approximates a fluid. PIC models, on the other hand, work well in lower-density regimes, in which there is not too much to simulate; error in PIC scales as the square root of the number of particles, making high-accuracy simulations expensive. Real-world applications, however, almost always involve a transition region between the high-density regimes where MHD is appropriate, and the low-density regimes for PIC. In such a transition region, a direct discretization of Vlasov is appropriate. Such discretizations come with their own computational costs, however; the phase-space mesh for Vlasov can involve up to six dimensions (seven if time is included), and to apply appropriate homogeneous boundary conditions in velocity space requires meshing a substantial padding region to ensure that the distribution remains sufficiently close to zero at the velocity boundaries. Moreover, for collisional plasmas, the right-hand side of the Vlasov equation is a collision operator, which is non-local in velocity space, and which may dominate the cost of the Vlasov solver. The present LDRD project endeavors to develop modern, foundational tools for the development of continuum-kinetic Vlasov solvers, using the discontinuous Petrov-Galerkin (DPG) methodology, for discretization of Vlasov, and machine-learning (ML) models to enable efficient evaluation of collision operators. DPG affords several key advantages. First, it has a built-in, robust error indicator, allowing us to adapt the mesh in a very natural way, enabling a coarse velocity-space mesh near the homogeneous boundaries, and a fine mesh where the solution has fine features. Second, it is an inherently high-order, high-intensity method, requiring extra local computations to determine so-called optimal test functions, which makes it particularly suited to modern hardware in which floating-point throughput is increasing at a faster rate than memory bandwidth. Finally, DPG is a residual-minimizing method, which enables high-accuracy computation: in typical cases, the method delivers something very close to the $L^2$ projection of the exact solution. Meanwhile, the ML-based collision model we adopt affords a cost structure that scales as the square root of a standard direct evaluation. Moreover, we design our model to conserve mass, momentum, and energy by construction, and our approach to training is highly flexible, in that it can incorporate not only synthetic data from direct-simulation Monte Carlo (DSMC) codes, but also experimental data. We have developed two DPG formulations for Vlasov-Poisson: a time-marching, backward-Euler discretization and a space-time discretization. We have conducted a number of numerical experiments to verify the approach in a 1D1V setting. In this report, we detail these formulations and experiments. We also summarize some new theoretical results developed as part of this project (published as papers previously): some new analysis of DPG for the convection-reaction problem (of which the Vlasov equation is an instance), a new exponential integrator for DPG, and some numerical exploration of various DPG-based time-marching approaches to the heat equation. As part of this work, we have contributed extensively to the Camellia open-source library; we also describe the new capabilities and their usage. We have also developed a well-documented methodology for single-species collision operators, which we applied to argon and demonstrated with numerical experiments. We summarize those results here, as well as describing at a high level a design extending the methodology to multi-species operators. We have released a new open-source library, MLC, under a BSD license; we include a summary of its capabilities as well.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Deformation accommodating periodic computational domain for a uniform velocity gradient

Many multiscale methods for granular materials use periodic computational domains to consider particle scale interactions and then calculate the stress to drive the continuum scale calculations. For problems involving large material deformations, the computation domain often needs to be reinitialized because of the distortion, causing the loss of the history information of the system. This work introduces an algorithm to accommodate a large deformation of the material while maintaining the computational domain cuboid to avoid the domain reinitialization during the computation. The algorithm uses a rotating frame of reference, in which the velocity gradient can be represented by an upper triangular matrix. The deformation caused by the upper triangular matrix is treated by the image system implied in the periodicity to maintain the computational domain cuboid. The effect from the rotation of the reference frame is considered using the inertial forces. Finally, simulations of simple and pure shear motions are carried out to illustrate the algorithm.

42 ENGINEERING↗

Physics-Informed Gaussian Process Regression for States Estimation and Forecasting in Power Grids

Real-time state estimation and forecasting are critical for the efficient operation of power grids. In this paper, a physics-informed Gaussian process regression (PhI-GPR) method is presented and used for forecasting and estimating the phase angle, angular speed, and wind mechanical power of a three-generator power grid system using sparse measurements. In standard data-driven Gaussian process regression (GPR), parameterized models for the prior statistics are fit by maximizing the marginal likelihood of observed data. In the PhI-GPR method, we propose to compute the prior statistics offline by solving stochastic differential equations (SDEs) governing the power grid dynamics. The short-term forecast of a power grid system dominated by wind generation is complicated by the stochastic nature of the wind and the resulting uncertainty in wind mechanical power. Here, we assume that the power grid dynamics are governed by swing equations, with the wind mechanical power fluctuating randomly in time. We solve these equations for the mean and covariances of the power grid states using the Monte Carlo simulation method. We demonstrate that the proposed PhI-GPR method can accurately forecast and estimate observed and unobserved states. For the considered problem, PhI-GPR has computational advantages over the ensemble Kalman filter (EnKF) method: In PhI-GPR, ensembles are computed offline and independently of the data acquisition process, whereas for EnFK, ensembles are computed online with data acquisition, rendering real-time forecast more challenging. We also demonstrate that the PhI-GPR forecast is more accurate than the EnKF forecast when the random mechanical wind power is non-Markovian. In contrast, the two methods produce similar forecasts for the Markovian mechanical wind power. For observed states, we show that PhI-GPR provides a forecast comparable to the standard data-driven GPR; both forecasts are significantly more accurate than the autoregressive integrated moving average (ARIMA) forecast. We also show that the ARIMA forecast is more sensitive to observation frequency and measurement errors than the PhI-GPR forecast.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Assessing parallel path cooling tower performance via artificial neural networks

Real-time monitoring of a research nuclear reactor, a system in which all generated power is dissipated to the environment, can be performed via analysis of the heat rejection from the cooling system. Given an inlet water temperature and flow rate, the reactor power can be well-approximated from the outlet water temperature; however, the instrumentation to measure outlet conditions may not be robust or accurate. If we know how a cooling tower performs from historical data, but cannot measure the outlet temperature, a mathematical representation of the system can be inverted to obtain the outlet water temperature that describes the cooling capacity. Unfortunately, model inversion processes are computationally expensive. To address this, an artificial neural network (ANN) is implemented to assess the performance of a multi-cell cooling tower for a nuclear reactor. This approach leverages the Merkel model to obtain an extensive data set describing performance of the cooling tower cells throughout a wide array of potential operating conditions. The Merkel model is expressed as a function of four parameters: the inlet and outlet water temperatures, inlet air wet bulb temperature, and ratio of liquid-to-gas mass flow rates (L/G), which together provide a non-dimensional number indicative of cooling tower performance, called the Merkel integral. Computing a 4-dimensional data structure that describes finite combinations of the Merkel integral, an inverse model is then generated using an ANN to determine the cell outlet water temperature from the other three model parameters along with the computed Merkel integral. Compared to traditional model inversion methods, the ANN reduces the computational time by approximately 4 orders of magnitude, with effectively no sacrifice to solution accuracy, and could be applied for different cooling towers in the event the performance curve is known. Finally, three use cases of the ANN are then reviewed: (1) determining the cell outlet water temperatures when gas flow at rated conditions (GFRC) is known, (2) performing the prior case without knowledge of the GRFC, and (3) assessing performance differences between the individual tower cells.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A numerical-homogenization based phase-field fracture modeling of linear elastic heterogeneous porous media

Most porous media, such as geomaterials and biomaterials are highly heterogeneous in nature, and they contain large variations of microscopic pore structures, such as pore sizes, pore distribution, and pore shapes. The oscillation of microscopic structures is a substantial challenge in theoretical characterization and is usually ignored in continuous modeling. However, mechanical behavior of porous media such as deformation and failure, are essentially impacted by the microscopic heterogeneity which needs to be considered in modeling a porous media. Here, this research proposes a numerical modeling framework with a capability to investigate the effect of microscopic heterogeneity on the macroscopic fracture behavior in porous media by using a numerical homogenization technique, combined with the phase-field fracture modeling method. This numerical modeling strategy computes a homogenized elasticity tensor based on microscopic heterogeneous pore structures heterogenous porous domain by solving boundary value problems at microscopic domain. The strain energy and subsequent propagation of macroscopic fractures will be updated using homogenized stiffness information. Using this numerical scheme, the microscopic pore structure’s impact on the fracture behavior through the homogenized elastic tensor will be taken into account. This multiscale technique is benchmarked against classical problems. Finally, the results highlight the importance of the underlying pore structure and reveal that both fracture strength and propagation path can be influenced by the microscopic heterogeneity.

36 MATERIALS SCIENCE↗

Computing with a Chemical Reservoir

Contemporary computation is expensive, with large language models and artificial intelligence becoming more common in daily life. However, high-performance computing is reaching the limits in speed and energy expenditure, and domain science requires ever-increasing computational capacity, with simulations and data analysis pipelines ever-growing in complexity. As we progress towards post-exascale computation, with the associated high energy costs, new methods of energy-conscious computation are required. Novel analog and hybrid digital-analog systems can overcome these challenges, and chemical reactions offer a promising avenue. Computers based on chemistry can provide compact desktop devices with immense computational power. These devices are readily scalable by considering greater reaction systems or vessels, meeting the high-performance requirements for scientific workflows. In this article, we present ChemComp, a compilation pipeline for the conversion of ordinary differential equations into implementable chemical reactions. We then demonstrate the solving capabilities of ChemComp by emulating a potential chemical reservoir device. We leverage the multi-layer intermediate representation (MLIR) compiler framework to implement an expressive chemical reaction abstraction and propose a path for chemical reaction networks (CRNs) to represent mathematical problems effectively. Combined, we demonstrate a potential workflow that can harness chemistry’s computing power to create energy-efficient, high-performance computation systems for contemporary computing needs.

artificial intelligence↗

SCALE 6.3 Validation: Radiation Shielding

Safe and reliable use of scientific and engineering computer codes requires validation for the types of applications in which they will be used. An example in the nuclear reactor engineering and licensing field is radiation transport employed in shielding analyses. The validity of computer codes for shielding applications is demonstrated in this report for SCALE version 6.3.0. Representative benchmarks corresponding to shielding analyses are selected for the validation study. Typical measurement results analyzed from these benchmarks include neutron fluxes, detector count rates, detector energy response functions, neutron and gamma dose rates, neutron activation rates and activities, neutron leakage fluxes, and skyshine dose rates. Thousands of points of comparison between measurement and calculation are presented in this work. Other than rare outliers typically explained by either a lack of information or large uncertainties in the experiment conditions, material, or dimensions, the Monaco with Automated Variance Reduction using Importance Calculations (MAVRIC) radiation transport computer code with built-in variance reduction methods distributed with the SCALE computer code system agrees well with the measurement results. In selected benchmarks, MAVRIC is also compared to Monte Carlo N- Particle® (MCNP® ) 1 calculations. Both computer codes generally agree well within the estimated uncertainties. With the release of SCALE 6.3.0, Shift was integrated as an alternative transport solver in MAVRIC, denoted MAVRIC-Shift. Although the traditional MAVRIC using Monaco was used primarily in this validation study, many results have also been generated using MAVRIC-Shift. Agreement between MAVRIC-Monaco and MAVRIC-Shift is generally very good. The benchmarks presented in this report were obtained from reliable sources such as the International Criticality Safety Benchmark Evaluation Project Handbook, the Shielding Integral Benchmark Archive & Database, and other shielding validation work found in the literature. Additional datapoints and benchmarks will be added to future versions of this report to expand the shielding validation suite.

61 RADIATION PROTECTION AND DOSIMETRY↗

Multilevel Parareal Algorithm with Averaging for Oscillatory Problems

The present study is an extension of the work done by Peddle, Haut, and Wingate and Haut and Wingate, where a two-level Parareal method with mapping and averaging is examined. The method proposed in this paper is a multilevel Parareal method with arbitrarily many levels, which is not restricted to the two-level case. We give an asymptotic error estimate which reduces to the two-level estimate for the case when only two levels are considered. Introducing more than two levels has important consequences for the averaging procedure, as we choose separate averaging windows for each of the different levels, which is an additional new feature of the present study. The different averaging windows make the proposed method especially appropriate for nonlinear multiscale problems, because we can introduce a level for each intrinsic scale of the problem and adapt the averaging procedure such that we reproduce the behavior of the model on the particular scale resolved by the level. The method is applied to nonlinear differential equations. The nonlinearities can generate a range of frequencies in the problem. The computational cost of the new method is investigated and studied on several examples.

97 MATHEMATICS AND COMPUTING↗

HYDRODYNAMIC ANALYSIS OF MACROALGAE LOCAL MODEL USING COMPUTATIONAL FLUID DYNAMICS

In this article, a local scale, fully nonlinear coupled fluid-structural interaction (FSI) sugar kelp model has been developed using a computational fluid dynamics (CFD) method. In this model, to be consistent with available experimental data, the sugar kelp is approximated as elongated rectangles with smoothed isosceles triangles at the ends and a single kelp model with one end fixed in a channel with constant current model is developed. Several different current speeds are simulated, and the resulting drag forces and calculated drag coefficients are validated by comparison with experimental data from the literature. In a previous study, a global scale model was developed using a computational structural dynamics (CSD) method to simulate macroalgae farming system and guide the system configuration design. In the global scale model, the hydrodynamic forces are calculated using Morison’s equation and the kinematics and dynamics of the sugar kelp are simplified and the group of kelps attached to the long line is modeled as a slender structure with the same length and an effective diameter such that the volumes are consistent with the real physical system. This simplified model matches the weight and buoyancy but adjusting the hydrodynamic properties when the general hydrodynamic coefficients are employed. Therefore, optimal hydrodynamic coefficients used in global scale model were determined to obtain the hydrodynamic force more accurately. The validated local scale model is then be applied to determine the hydrodynamic coefficients of the simplified sugar kelp model for global dynamic analysis.

hydrodynamic modeling, macroalgae, CFD model↗

Computer-aided process intensification of natural gas to methanol process

The recent revolution in shale gas has presented opportunities for distributed manufacturing of key commodity chemicals, such as methanol, from methane. However, the conventional methane-to-methanol process is energy intensive which negatively affects the profitability and sustainability. Here an intensified process configuration that is both economically attractive and environmentally sustainable. This flowsheet is systematically discovered using the building block-based representation and optimization methodology. The new process configuration utilizes membrane-assisted reactive separations and can have as much as 190% higher total annual profit compared to a conventional configuration. Additionally, it has 57% less CO 2 -equivalent greenhouse gas emission. Such drastic improvement highlights the advantages of building block-based computer-aided process intensification method.

42 ENGINEERING↗

Evaluating the Importance of Conformers for Understanding the Vacuum-Ultraviolet Spectra of Oxiranes: Experiment and Theory

Vacuum-ultraviolet (VUV) absorption spectroscopy enables electronic transitions that offer the unambiguous identification of molecules. As target molecules become more complex, multifunctional species present a great challenge to both experimental and computational spectroscopy. This research reports both experimental and theoretical studies of oxiranes. Computationally, the nuclear ensemble approach has been used to accurately predict experimental spectra for a variety of molecules. However, this approach incurs great computational cost, as ensembles generally consist of thousands of geometries. The present study aims to drastically reduce the ensemble by evaluating the significance of the conformers to the predicted spectra. This approach was applied to 11 substituted oxiranes using the Conformer Rotamer Ensemble Sampling Tool (CREST) of Grimme to generate an ensemble of unique conformers determined by their Boltzmann populations. Five TD-DFT functionals (BMK, CAM-B3LYP, M06-2X, MN15, ωB97X-D) and EOM-CCSD were used to simulate the spectrum of each substituted oxirane ensemble. Computed spectra were then compared to the experiment using both qualitative and quantitative metrics. Based on these metrics, it was observed that certain conformers may not be necessary to characterize this set of oxiranes despite the temperature (323 K) of the experiment. A single conformer can then be used with TD-DFT and EOM-CCSD to replicate the experimental spectra of these medium-sized combustion species.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advancing density functional tight-binding method for large organic molecules through equivariant neural networks

Semi-empirical quantum-mechanical (QM) methods have become valuable tools for studying complex (bio)molecular systems due to their balance between computational efficiency and accuracy. A key aspect of these methods is their parameterization, which not only governs the reliability of the results but also provides an opportunity to enhance their overall performance. In our previous work [J. Phys. Chem. Lett., 2021, 11, 16], we advanced the third-order semi-empirical density functional tight-binding (DFTB3) method for computing multiple properties of small molecules by developing the machine learning (ML) potential NN rep to bridge the gap between DFTB3 electronic components and those of the hybrid DFT-PBE0 functional. To overcome the limitations of NN rep , we introduce the EquiDTB framework, which leverages physics-inspired equivariant neural networks (NN) to parameterize scalable and transferable many-body Δ TB potentials, replacing the standard pairwise DFTB repulsive potential. This advancement extends the applicability of our ML-corrected DFTB approach to larger molecules and non-covalent systems (including only C, N, O, and H atoms), going beyond the chemical space represented in the training QM datasets. The enhanced performance of EquiDTB over the standard TB methods is demonstrated by the accurate computation of the atomic forces of S66x8 molecular dimers, as well as their interaction energies. Moreover, EquiDTB can be effectively employed to explore the potential energy surfaces of large and flexible drug-like molecules—for example, to determine the minimum energy path between isomers, analyze structural transitions during dynamical simulations, compute vibrational modes, and investigate energetic rankings. The performance for single molecules slightly decreases when the DFTB electronic energy is reduced to first-order but remains superior to standard TB methods. Our work thus demonstrates that an optimal integration of an equivariant NN with QM datasets can advance the DFTB method while maintaining high efficiency, paving the way for reliable (bio)molecular simulations.

Medrano Sandonas, Leonardo [Technische Universität↗

Local time stepping for the shallow water equations in MPAS

In this work we assess the performance of a set of local time-stepping (LTS) schemes for the shallow water equations implemented in the Model for Prediction Across Scales (MPAS). The goal of LTS is to speed up the simulation by allowing different time-steps on different regions of the computational grid. The LTS schemes considered here were originally introduced by Hoang et al. (2019) [26], who laid out the mathematical foundation of the methods. Here, the authors take on the task of presenting a fast, efficient and scalable parallel implementation of these LTS methods on high performance computing machines, with the aim to provide a recipe for other climate modeling groups that may be interested in employing LTS algorithms in their codes. As a matter of fact, even if MPAS is our framework of choice, our approach is general enough and could be of interest to other groups beyond the MPAS community. Due to their nature, LTS methods possess an inherent load imbalance that needs to be carefully addressed in order to obtain efficient scalability. Even more important is the far from trivial task of computing the right-hand side terms only on specific LTS regions during the time-stepping procedure. An inefficient handling of this task causes a drastic decay of the CPU time performance, making the LTS algorithms practically of no use. The emphasis of the present work is therefore on the computational and parallel aspects of the LTS methods, whose proper treatment is crucial to make the methods run faster against existing strategies, such as for instance high-order explicit global time-stepping schemes. This is in fact the ultimate goal of using an LTS procedure and it is the one to which we direct all our optimization efforts.

97 MATHEMATICS AND COMPUTING↗

Computational quantum chemistry of metal–organic frameworks

Metal–organic frameworks (MOFs) have premium exceptional properties for a variety of functions, such as gas separation and storage and catalysis. The large variety of possible inorganometallic nodes and organic linkers provide an almost unlimited number of combinations for assembling MOFs, which makes the experimental characterization and examination of all potentially useful combinations practically impossible. Furthermore, experimental studies of MOFs typically fall short in uncovering crucial details regarding their mechanisms of action or the molecular details responsible for their functional properties, such as the nature of adsorbate binding or the structures of transition states. Computational modeling has, therefore, become an efficient and important tool for strategizing the functionalization of MOFs and explicating the mechanisms of their functions. Furthermore, we review the computational methodologies used for computational studies of MOFs, especially Kohn–Sham density functional theory and combined quantum mechanical and molecular mechanical methods for calculating their structural, electronic, and magnetic properties, as well as for understanding the mechanisms of MOFs' applications to magetic devices, thermal conduction, gas adsorption, separation, storage, and sensing, thermal catalysis, photocatalysis, and electrocatalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗