Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate computing”

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 667 records · Page 37
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Weighted greedy-optimal design of computer experiments for kernel-based and Gaussian process model emulation and calibration

This article is concerned with the approximation of high-dimensional functions by kernel-based methods. Motivated by uncertainty quantification, which often necessitates the construction of approximations that are accurate with respect to a probability density function of random variables, we aim at minimizing the approximation error with respect to a weighted $L^p$-norm. We present a greedy procedure for designing computer experiments based upon a weighted modification of the pivoted Cholesky factorization. The method successively generates nested samples with the goal of minimizing error in regions of high probability. Numerical experiments validate that this new importance sampling strategy is superior to other sampling approaches, especially when used with non-product probability density functions. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Data-driven modeling and control of dynamical systems using Koopman and Perron-Frobenius operators

This dissertation studies the data-driven modeling and control problem of nonlinear systems by exploiting the linear operator theoretic framework involving Koopman and Perro-Frobenius operator. A systematic linear-operator based controller design procedure has been established, which can be used to solve a variety of nonlinear control problems, including feedback stabilization using control Lyapunov functions, optimal quadratic regulation using Koopman eigenfunctions and convex optimization formulation of optimal control problem using P-F and Koopman operator approximation. As the core of data-driven modeling, we first propose a new algorithm for the finite-dimensional approximation of the linear transfer Koopman and Perron-Frobenius operator from time-series data. We argue that the existing approach for the finite-dimensional approximation of these transfer operators such as Dynamic Mode Decomposition (DMD) and Extended Dynamic Mode Decomposition (EDMD) do not capture two important properties of these operators, namely positivity and Markov property. The algorithm we propose preserves these two properties. We call the proposed algorithm as naturally structured DMD (NSDMD) since it retains the inherent properties of these operators. Naturally structured DMD algorithm leads to a better approximation of the steady-state dynamics of the system regarding computing Koopman and Perron- Frobenius operator eigenfunctions and eigenvalues. However, preserving positivity property is critical for capturing the real transient dynamics of the system. This positivity property of the transfer operators and it's finite-dimensional approximation play an important role for controller and estimator design of nonlinear systems. To solve the feedback stabilization problem for nonlinear control systems, we tried to take advantage of the Koopman operator framework. The Koopman operator approach provides a linear representation for a nonlinear dynamical system and a bilinear representation for a nonlinear control system. The problem of feedback stabilization of a nonlinear control system is then transformed to the stabilization of a bilinear control system. We propose a control Lyapunov function (CLF)-based approach for the design of stabilizing feedback controllers for the bilinear system. The search for finding a CLF for the bilinear control system is formulated as a convex optimization problem. This leads to a schematic procedure for designing CLF-based stabilizing feedback controllers for the bilinear system and hence the original nonlinear system. Another advantage of the proposed controller design approach outlined in this dissertation is that it does not require explicit knowledge of system dynamics. In particular, the bilinear representation of a nonlinear control system in the Koopman eigenfunction space can be obtained from time-series data. Next, we study the optimal quadratic regulation problem for nonlinear systems. The linear operator theoretic framework involving the Koopman operator is used to lift the dynamics of nonlinear control system to an infinite-dimensional bilinear system. The optimal quadratic regulation problem for nonlinear system is formulated in terms of the finite-dimensional approximation of the bilinear system. A convex optimization-based approach is proposed for solving the quadratic regulator problem for bilinear system. We applied a variety of examples and compared the simulation results between our framework and conventional LQR control using linearized model. For more general optimal control problems, we provide a density-function based convex formulation for the optimal control problem of the nonlinear system. The convex formulation relies on the duality result in the stability theory of a dynamical system involving density function and Perron-Frobenius operator. The optimal control problem is formulated as an infinite-dimensional convex optimization program. The finite-dimensional approximation of the optimization problem relies on the recent advances made in the data-driven computation of the Koopman operator, which is dual to the Perron-Frobenius operator. Simulation results are presented to demonstrate the application of the developed framework.

Huang, Bowen↗
DOE OSTI2022

Dancoff-based Wigner-Seitz approximation for the subgroup resonance self-shielding in the VERA neutronic simulator MPACT

The MPACT neutronics module of the Virtual Environment for Reactor Analysis (VERA) has used the subgroup method for resonance self-shielding calculation, for which two-dimensional (2D) fixed-source transport calculations are performed using the method of characteristics for resonance energy groups. When considering thermal feedbacks, the subgroup calculation must be performed at each outer iteration. Therefore, the computing time for cross section processing is a significant burden for computational efficiency. The Dancoff-based Wigner-Seitz approximation (DWA) capability has been implemented into MPACT in conjunction with the subgroup method, which has been used in SCALE/XSProc since SCALE version 6.0 and has recently been called an equivalent Dancoff-factor cell (EDC) method. The issue of relatively large reactivity bias in DWA for the gadolinia rods was resolved by introducing multiple Dancoff factors. Benchmark results for the VERA pressurized and boiling water reactor benchmark suites show that the DWA capability would significantly enhance computational efficiency with comparable accuracy. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Adaptive resource allocation for surrogate modeling of systems comprised of multiple disciplines with varying fidelity

We present an adaptive algorithm for constructing surrogate models for integrated systems composed of a set of coupled components. With this goal we introduce ‘coupling’ variables with a priori unknown distributions that allow approximations of each component to be built independently. Once built, the surrogates of the components are combined and used to predict system-level quantities of interest (QoI) at a fraction of the cost of interrogating the full system model. We use a greedy experimental design procedure, based upon a modification of Multi-Index Stochastic Collocation (MISC), to minimize the error of the combined surrogate. This is achieved by refining each component surrogate in accordance with its relative contribution to error in the approximation of the system-level QoI. Our adaptation of MISC is a multi-fidelity procedure that can leverage ensembles of models of varying cost and accuracy, for one or more components, to produce estimates of system-level QoI. Several numerical examples demonstrate the efficacy of the proposed approach on systems involving feed-forward and feedback coupling. For a fixed computational budget, the proposed algorithm is able to produce approximations that are orders of magnitude more accurate than approximations that treat the integrated system as a black-box.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗
DOE OSTI2020

Capabilities of multivariate Bayesian inference toward seismic hazard assessment

Multivariate Bayesian analysis can bring significant benefits to seismic hazard analysis: Its multivariate feature enables computing scalar and vector hazard without making any approximations; Correlations between intensity measures are implicitly modeled, permitting direct simulation of ground motion selection tools such as the conditional mean spectrum and the generalized conditioning intensity measure; and Its updating feature enables a seamless integration of new ground motion data into the hazard results. Here, we first develop a multivariate Bayesian ground motion model through the NGA-West2 database. The model functional form considers fault-type, magnitude, and distance dependencies, and also the linear and the rock intensity dependent site response. We use a hybrid Markov Chain Monte Carlo sampling to perform Bayesian inference consisting of Gibbs step and a multilevel Metropolis-Hastings step. We then perform several checks on the model and note that its performance is satisfactory. Finally, we illustrate the merits of this multivariate Bayesian analysis, which include: ground motion model updating with ground motion data recorded in the last four years not part of the NGA-West2 database; computation of scalar and vector seismic hazard using the un-updated and updated ground motion models for Los Angeles, CA; and simulation of the conditional mean spectrum under scalar and vector IM conditioning while accounting for different sources of aleatoric and epistemic uncertainties.

58 GEOSCIENCES↗
DOE OSTI2021

Wormholes and black hole microstates in AdS/CFT

It has long been known that the coarse-grained approximation to the black hole density of states can be computed using classical Euclidean gravity. In this work we argue for another entry in the dictionary between Euclidean gravity and black hole physics, namely that Euclidean wormholes describe a coarse-grained approximation to the energy level statistics of black hole microstates. To do so we use the method of constrained instantons to obtain an integral representation of wormhole amplitudes in Einstein gravity and in full-fledged AdS/CFT. These amplitudes are non-perturbative corrections to the two-boundary problem in AdS quantum gravity. The full amplitude is likely UV sensitive, dominated by small wormholes, but we show it admits an integral transformation with a macroscopic, weakly curved saddle-point approximation. The saddle is the “double cone” geometry of Saad, Shenker, and Stanford, with fixed moduli. In the boundary description this saddle appears to dominate a smeared version of the connected two-point function of the black hole density of states, and suggests level repulsion in the microstate spectrum. Using these methods we further study Euclidean wormholes in pure Einstein gravity and in IIB supergravity on Euclidean AdS 5 × S 5 . We address the perturbative stability of these backgrounds and study brane nucleation instabilities in 10d supergravity. In particular, brane nucleation instabilities of the Euclidean wormholes are lifted by the analytic continuation required to obtain the Lorentzian spectral form factor from gravity. Our results indicate a factorization paradox in AdS/CFT.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Nonunitary Variational Quantum Eigensolver with the Localized Active Space Method and Cost Mitigation

Accurately describing strongly correlated systems with affordable quantum resources remains a central challenge for quantum chemistry applications on near and intermediate term quantum computers. The localized active space self-consistent field (LASSCF) approximates the complete active space self-consistent field (CASSCF) by generating active space-based wave functions within specific fragments while treating interfragment correlation with mean-field approach, hence is computationally less expensive. Hardware-efficient ansatzes (HEA) offer affordable and shallower circuits, yet they often fail to capture the necessary correlation. Previously, Jastrow-factor-inspired nonunitary qubit operators were proposed to use with HEA for variational quantum eigensolver (VQE) calculations (so-called nuVQE), as they do not increase circuit depths and recover correlation beyond the mean-field level for Hartree–Fock initial states. Here, in this study, we explore running nuVQE with LASSCF as the initial state. The method, named LAS-nuVQE, is shown to recover interfragment correlations, reach chemical accuracy with a small number of gates (<70) in both H 4 and square cyclobutadiene (C 4 H 4 ), and produces more accurate energetics than its HEA counterparts at all circuit depths. To further address the inherent symmetry-breaking in HEA, we implemented spin-constrained LAS-nuVQE to extend the capabilities of HEA further and show spin-pure results for square cyclobutadiene. We also mitigate the increased measurement overhead of nuVQE via Pauli grouping and shot-frugal sampling, reducing measurement costs by up to 2 orders of magnitude compared to ungrouped operator, and show that one can achieve better accuracy with a small number of shots (10 3–4 ) per one expectation value calculation compared to noiseless simulations with one or two orders of magnitude more shots. Finally, wall clock time estimates show that, with our measurement mitigation protocols, nuVQE becomes a cheaper and more accurate alternative than vanilla VQE with HEA. Taken together, these developments illustrate a practical pathway toward performing multireference chemical simulations with accuracy and affordable resources on today’s quantum hardware, achieving both accuracy and affordability in challenging correlated systems.

Wang, Qiaohong [Univ. of Chicago, IL (United State↗
DOE OSTI2021

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗
DOE OSTI2025

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Applications to Materials for Catalysis and Electrochemistry

Modeling complex materials using high-fidelity, ab initio methods at low cost is a fundamental goal for quantum chemical software packages. The GW approximation and random phase approximation (RPA) provide a unified description of both electronic structure and total energies using the same physics in a many-body perturbative approach that can be more accurate than generalized-gradient density functional theory (DFT) methods. However, GW/RPA implementations have historically been limited to either specific materials classes or application toward small chemical systems. Here, the static subspace approximation allows for reduced cost full-frequency GW/RPA calculations and has previously been benchmarked thoroughly for GW calculations. Here, we describe our approach to including partial occupations of electronic orbitals in full-frequency GW and RPA calculations for the study of electrocatalysts. We benchmarked RPA total energy calculations using the subspace approximation across a diverse test suite of materials for a variety of computational parameters. The benchmarking quantifies the impact of different extrapolation procedures for representing the static polarizability at infinite screened cutoff, and shows that using screened cutoffs above 20-25 Ryd result in diminishing accuracy returns for predicting RPA total energies. Additionally, for moderately sized electrocatalytic models, 2-3 times fewer computational resources are used to compute RPA total energies by representing the static polarizability with 20-30% of the static subspace basis, with an error of approximately 0.01 eV or better in RPA adsorption energy calculations. Finally, we show that for these electrochemical models RPA can shift DFT adsorption energy shifts by up to 0.5 eV and that GW can frequently shift DFT eigenvalues of surface and adsorbate states by approximately 0.5-1 eV.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

SolarPILOT: A power tower solar field layout and characterization tool

This paper develops and demonstrates a new SolarPower tower Integrated Layout and Optimization Tool (SolarPILOT). The tool uses the analytical flux image Hermite series approximation originally implemented in the DELSOL3 software developed by Sandia National Laboratory in the early 1980s. By applying the analytical model to individual heliostat images rather than large groups or zones of heliostats, SolarPILOT can characterize a wide variety of heliostat field layouts. The individual heliostat modeling approach increases computational expense in comparison with DELSOL3, so SolarPILOT implements a number of improvements to the analytical approximation method to improve model accuracy and computational efficiency. This paper discusses several of these methods, including dynamic heliostat grouping to reduce the expense of intercept factor evaluation, approximation of annual productivity with a subset of time steps throughout the year, polygon clipping to accurately calculate inter-heliostat shadowing and blocking, receiver and tower geometry optimization, and a trigonometric image transformation technique that ensures model accuracy for small heliostats. SolarPILOT also integrates a Monte-Carlo ray tracing engine (SolTrace), providing improved receiver optical modeling capability, a user-friendly front end for geometry definition, and side-by-side validation of the analytical algorithms.

14 SOLAR ENERGY↗
DOE OSTI2025

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Tissue scale agent-based simulation of premalignant progressions in Barrett’s esophagus

Barrett’s esophagus (BE) is a benign condition of the distal esophagus that initiates a multistage pathway to esophageal adenocarcinoma (EAC). Short of frequent intrusive (and costly) surveillance, effective screening for neoplasia in BE populations is yet to be established since progressors are rare and virtually undetectable without routine biopsies, which often sample only a small portion of the BE tissue. As a result, reliable estimation of the true prevalence of dysplasia in a BE population and evidence-based optimization of screening for at-risk individuals is challenging. Data-driven microsimulations, i.e., model-generated instances of disease history in a predefined virtual population, have found utility in the EAC screening literature as low-overhead alternatives to real-world hypothesis testing of optimal interventions for dysplasia. Despite the successes, computational limitations, paucity of knowledge and data on Barrett’s dysplasia, and the complexities of disease progression as a multiscale multiphysics process have hindered the treatment of disease progression in BE as a spatial process. Agent-based modeling of nucleation and proliferation processes in dysplasia warrants exploration in this context as an approximation that operates at a trade-off between computational tractability and precise representation of the composition and physics of the substrate (tissue). In this study, we describe spatially resolved simulations of premalignant progression toward EAC in a coarse-grained model of Barrett’s tissue that resolves the metaplastic tissue at a length scale of 0.42 mm (~3300 crypts/mm 2 ). Finally, the model is calibrated to reproduce historical high-grade dysplasia prevalence when model-generated patients are screened using the Seattle protocol.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

CAS without SCF—Why to use CASCI and where to get the orbitals

The complete active space self-consistent field (CASSCF) method has seen broad adoption due to its ability to describe the electronic structure of both the ground and excited states of molecules over a broader swath of the potential energy surface than is possible with the simpler Hartree–Fock approximation. However, it also has a reputation for being unwieldy, computationally costly, and un-black-box. Here, we discuss a class of alternatives, complete active space configuration interaction (CASCI) methods, paying particular attention to their application to electronic excited states. The goal of this Perspective is fourfold. First, we argue that CASCI is not merely an approximation to CASSCF, in that it can be designed to have important qualitative advantages over CASSCF. Second, we present several insights drawn from our experience experimenting with different schemes for computing orbitals to be employed in CASCI. Third, we argue that CASCI is well suited for application to nanomaterials. Lastly, we reason that, with the rise in new low-scaling approaches for describing multireference systems, there is a greater need than ever to develop new methods for defining orbitals that provide an efficient and accurate description of both static correlation and electronic excitations in a limited active space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Simplified Approximations of Direct Cumulus Entrainment and Detrainment

Abstract In recent years, direct calculations of simulated cumulus entrainment and detrainment have facilitated new physical insights into these highly elusive but critically important processes. However, these calculations require substantial computational resources that may limit their widespread usage. To facilitate such calculations, two simplified approximations of direct cumulus entrainment and detrainment are examined herein. The first approximation, termed the “semidirect” method, follows a standard bulk approach but makes more realistic assumptions about the sources of entrained and detrained air near the cloud edges. In contrast, the second approximation (the “projection” method) uses the governing equations of motion to project whether grid points near the cloud edge will entrain or detrain as the mean cloud ascends by one grid point. Verification exercises using large-eddy simulations reveal that both methods generally agree better with corresponding direct entrainment/detrainment estimates than the traditional bulk formulation, with the projection method outperforming the semidirect method. The two methods can be used in a synergistic fashion, with the semidirect method helping to optimize the projection method, to suit a wide range of applications. Because the latter incorporates the essential dynamics of entrainment and detrainment at the local scale, it can be used to gain physical insight into the causal mechanisms regulating these complex processes.

Meteorology & Atmospheric Sciences↗
DOE OSTI2023

G 0 W 0 Ionization Potentials of First-Row Transition Metal Aqua Ions

Here, we report computations of the vertical ionization potentials within the GW approximation of the near-complete series of first-row transition metal (V–Cu) aqua ions in their most common oxidation states, i.e., V 3+ , Cr 3+ , Cr 2+ , Mn 2+ , Fe 3+ , Fe 2+ , Co 2+ , Ni 2+ , and Cu 2+ . The d-orbital occupancy of these systems spans a broad range from d 2 to d 9 . All of the structures were first optimized at the density functional theory level using a large cluster of explicit water molecules that are embedded in a continuum solvation model. Vertical ionization potentials were computed with the one-shot G 0 W 0 approach on a range of transition metal ion clusters (6, 18, 40, and 60 explicit water molecules), wherein the convergence with respect to the basis set size was evaluated using the systems with 40 water molecules. We assess the results using three different density functional approximations as starting points for the vertical ionization potential calculations, namely, G 0 W 0 @PBE, G 0 W 0 @PBE0, and G 0 W 0 @r 2 SCAN. While the predicted ground-state structures are similar to all three exchange-correlation functionals, the vertical ionization potentials were in closer agreement with experiment when using the G 0 W 0 @PBE0 and G 0 W 0 @r 2 SCAN approaches, with the r 2 SCAN-based calculations being significantly less expensive. Computed bond distances and vertical ionization potentials for all structures are in good agreement with available experimental data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗