Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem structuring 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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Transferability of data-driven, many-body models for CO 2 simulations in the vapor and liquid phases

Here, extending on the previous work by Riera et al. [J. Chem. Theory Comput. 16, 2246–2257 (2020)], we introduce a second generation family of data-driven many-body MB-nrg models for CO 2 and systematically assess how the strength and anisotropy of the CO 2 –CO 2 interactions affect the models’ ability to predict vapor, liquid, and vapor–liquid equilibrium properties. Building upon the many-body expansion formalism, we construct a series of MB-nrg models by fitting one-body and two-body reference energies calculated at the coupled cluster level of theory for large monomer and dimer training sets. Advancing from the first generation models, we employ the charge model 5 scheme to determine the atomic charges and systematically scale the two-body energies to obtain more accurate descriptions of vapor, liquid, and vapor–liquid equilibrium properties. Challenges in model construction arise due to the anisotropic nature and small magnitude of the interaction energies in CO 2 , calling for the necessity of highly accurate descriptions of the multidimensional energy landscape of liquid CO 2 . These findings emphasize the key role played by the training set quality in the development of transferable, data-driven models, which, accurately representing high-dimensional many-body effects, can enable predictive computer simulations of molecular fluids across the entire phase diagram.

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

Projection pursuit adaptation on polynomial chaos expansions

Here, the present work addresses the issue of accurate stochastic approximations in high-dimensional parametric space using tools from uncertainty quantification (UQ). The basis adaptation method and its accelerated algorithm in polynomial chaos expansions (PCE) were recently proposed to construct low-dimensional approximations adapted to specific quantities of interest (QoI). The present paper addresses one difficulty with these adaptations, namely their reliance on quadrature point sampling, which limits the reusability of potentially expensive samples. Projection pursuit (PP) is a statistical tool to find the “interesting” projections in high-dimensional data and thus bypass the curse-of-dimensionality. In the present work, we combine the fundamental ideas of basis adaptation and projection pursuit regression (PPR) to propose a novel method to simultaneously learn the optimal low-dimensional spaces and PCE representation from given data. While this projection pursuit adaptation (PPA) can be entirely data-driven, the constructed approximation exhibits mean-square convergence to the solution of an underlying governing equation and thus captures the supports and probability distributions associated with the physics constraints. The proposed approach is demonstrated on a borehole problem and a structural dynamics problem, demonstrating the versatility of the method and its ability to discover low-dimensional manifolds with high accuracy with limited data. In addition, the method can learn surrogate models for different quantities of interest while reusing the same data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Enriched immersed finite element and isogeometric analysis: algorithms and data structures

Immersed finite element methods provide a convenient analysis framework for problems involving geometrically complex domains, such as those found in topology optimization and microstructures for engineered materials. However, their implementation remains a major challenge due to, among other things, the need to apply nontrivial stabilization schemes and generate custom quadrature rules. This article introduces the robust and computationally efficient algorithms and data structures comprising an immersed finite element preprocessing framework. The input to the preprocessor consists of a background mesh and one or more geometries defined on its domain. The output is structured into groups of elements with custom quadrature rules formatted such that common finite element assembly routines may be used without or with only minimal modifications. The key to the preprocessing framework is the construction of material topology information, concurrently with the generation of a quadrature rule, which is then used to perform enrichment and generate stabilization rules. While the algorithmic framework applies to a wide range of immersed finite element methods using different types of meshes, integration, and stabilization schemes, the preprocessor is presented within the context of the extended isogeometric analysis. This method utilizes a structured B-spline mesh, a generalized Heaviside enrichment strategy considering the material layout within individual basis functions’ supports, and face-oriented ghost stabilization. Using a set of examples, the effectiveness of the enrichment and stabilization strategies is demonstrated alongside the preprocessor’s robustness in geometric edge cases. Additionally, the performance and parallel scalability of the implementation are evaluated.

Computer implementation↗
DOE OSTI2022

Inverse Methods - Users Manual 5.6

The inverse methods team provides a set of tools for solving inverse problems in structural dynamics and thermal physics, and also sensor placement optimization via Optimal Experimental Design (OED). These methods are used for designing experiments, model calibration, and verfication/validation analysis of weapons systems. This document provides a user's guide to the input for the three apps that are supported for these methods. Details of input specifications, output options, and optimization parameters are included.

42 ENGINEERING↗
DOE OSTI2022

Inverse Methods - Users Manual 5.8

The inverse methods team provides a set of tools for solving inverse problems in structural dynamics and thermal physics, and also sensor placement optimization via Optimal Experimental Design (OED). These methods are used for designing experiments, model calibration, and verification/validation analysis of weapons systems. This document provides a user’s guide to the input for the three apps that are supported for these methods. Details of input specifications, output options, and optimization parameters are included.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantifying the role of the lattice in metal–insulator phase transitions

Many materials exhibit phase transitions at which both the electronic properties and the crystal structure change. Some authors have argued that the change in electronic order is primary, with the lattice distortion a relatively minor side-effect, and others have argued that the lattice distortions play an essential role in the energetics of the transition. In this paper, we introduce a formalism that resolves this long-standing problem. The methodology works with any electronic structure method that produces solutions of the equation of state determining the electronic order parameter as a function of lattice distortion. We use the formalism to settle the question of the physics of the metal–insulator transitions in the rare-earth perovskite nickelates (RNiO 3 ) and Ruddlesden–Popper calcium ruthenates (Ca 2 RuO 4 ) in bulk, heterostructure, and epitaxially strained thin film forms, finding that electron-lattice coupling is key to stabilizing the insulating state in both classes of materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Bound Constrained Partial DifferentialEquation Inverse Problem Solution by theSemi-Smooth Newton Method

We present the mathematical derivation, software implementation details, and computational results for a semi-smooth Newton method applied to two inverse problems governed by partial differential equations with bound constraints. The two problems share mathematical structural similarities to density-based topology optimization problems. The semi-smooth Newton method provides a mesh independent solution computation for the two test problems. A key step is that the complementarity part of the necessary optimality conditions are reformulated with the use of a complementarity functionφsuch that the complementarity conditions are satisfied if and only if a zero of a nonsmooth function has been obtained. The modular finite element package MFEM is utilized for the software implementation. In addition we constructed a matrix-free Operator to enable the use of efficient Krylov subspace IterativeSolver of MFEM for the solution of our two target problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Applying Bayesian inference and deterministic anisotropy to retrieve the molecular structure ∣Ψ(R)∣2 distribution from gas-phase diffraction experiments

Abstract Currently, our general approach to retrieving molecular structures from ultrafast gas-phase diffraction heavily relies on complex ab initio electronic or vibrational excited state simulations to make conclusive interpretations. Without such simulations, inverting this measurement for the structural probability distribution is typically intractable. This creates a so-called inverse problem. Here we address this inverse problem by developing a broadly applicable method that approximates the molecular frame structure ∣Ψ( R , t )∣ 2 distribution independent of these complex simulations. We retrieve the vibronic ground state ∣Ψ( R )∣ 2 for both simulated stretched NO 2 and measured N 2 O. From measured N 2 O, we observe 40 mÅ coordinate-space resolution from 3.75 Å −1 reciprocal space range and poor signal-to-noise, a 50X improvement over traditional Fourier transform methods. In simulated NO 2 diffraction experiments, typical to high signal-to-noise levels predict 100–1000X resolution improvements, down to 0.1 mÅ. By directly measuring the width of ∣Ψ( R )∣ 2 , we open ultrafast gas-phase diffraction capabilities to measurements beyond current analysis approaches. This method has the potential to effectively turn gas-phase ultrafast diffraction into a discovery-oriented technique to probe systems that are prohibitively difficult to simulate.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

Deep learning of dynamically responsive chemical Hamiltonians with semiempirical quantum mechanics

Conventional machine-learning (ML) models in computational chemistry learn to directly predict molecular properties using quantum chemistry only for reference data. While these heuristic ML methods show quantum-level accuracy with speeds several orders of magnitude faster than traditional quantum chemistry methods, they suffer from poor extensibility and transferability; i.e., their accuracy degrades on large or new chemical systems. Incorporating quantum chemistry frameworks into the ML models directly solves this problem. Here we take the structure of semiempirical quantum mechanics (SEQM) methods to construct dynamically responsive Hamiltonians. SEQM methods use empirical parameters fitted to experimental properties to construct reduced-order Hamiltonians, facilitating much faster calculations than ab initio methods but with compromised accuracy. By replacing these static parameters with machine-learned dynamic values inferred from the local environment, we greatly improve the accuracy of the SEQM methods. Trained on molecular energies and atomic forces, these dynamically generated Hamiltonian parameters show a strong correlation with atomic hybridization and bonding. Trained with only about 60,000 small organic molecular conformers, the resulting model retains interpretability, extensibility, and transferability when testing on much larger chemical systems and predicting various molecular properties. Overall, this work demonstrates the virtues of incorporating physics-based descriptions with ML to develop models that are simultaneously accurate, transferable, and interpretable.

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

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Taweret: a Python package for Bayesian model mixing

Uncertainty quantification using Bayesian methods is a growing area of research. Bayesian model mixing (BMM) is a recent development which combines the predictions from multiple models such that the fidelity of each model is preserved in the final result. Practical tools and analysis suites that facilitate such methods are therefore needed. Taweret introduces BMM to existing Bayesian uncertainty quantification efforts. Currently, Taweret contains three individual Bayesian model mixing techniques, each pertaining to a different type of problem structure; we encourage the future inclusion of user-developed mixing methods. Taweret’s first use case is in nuclear physics, but the package has been structured such that it should be adaptable to any research engaged in model comparison or model mixing.

Ingles, Kevin↗
DOE OSTI2025

Constrained nuclear–electronic orbital method for periodic density functional theory: Application to H 2 chemisorption on Si(001) surfaces

The nuclear–electronic orbital (NEO) method provides a powerful computational framework for incorporating nuclear quantum effects (NQE) in electronic structure calculations beyond the Born–Oppenheimer approximation. By incorporating additional constraints to the position operator on quantum particles like protons, the NEO method enables calculation of effective potential that accounts for NQE. Here, in this work, we present a new constrained NEO (cNEO) formulation for density functional theory (cNEO-DFT) calculations in the context of extended periodic systems. Using the nudged elastic band method, we discuss an application of the cNEO-DFT approach to studying the adsorption of a hydrogen molecule on the Si(001) surfaces. The calculation shows how NQE impacts the reaction energetics. The proton density changes are computed along the reaction pathways. This work demonstrates the capability of the new cNEO-DFT method to study a wide range of chemical processes, such as surface reactions where the quantum nature of light atoms like protons is non-negligible.

Chemical processes↗
DOE OSTI2021

A Scalable Meter Placement Method for Distribution System State Estimation

This paper studies the optimal meter placement problem for distribution system state estimation given limited measurement resources. We formulate the problem as a mixed integer semi-definite programming that minimizes the worst case estimation errors over a set of operating points. To solve the problem, we first relax the problem as a convex optimization problem. Motivated by the lack of scalability of existing solvers, we next leverage the special structure of the cost function and propose an algorithm based on barrier method that solves the problem with significantly better numerical performance. The proposed method has been validated on the IEEE 13-bus, IEEE 123-bus, and IEEE 8,500-bus feeders.

barrier method↗
DOE OSTI2021

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

On the potentially transformative role of auxiliary-field quantum Monte Carlo in quantum chemistry: A highly accurate method for transition metals and beyond

Approximate solutions to the ab initio electronic structure problem have been a focus of theoretical and computational chemistry research for much of the past century, with the goal of predicting relevant energy differences to within “chemical accuracy” (1 kcal/mol). For small organic molecules, or in general, for weakly correlated main group chemistry, a hierarchy of single-reference wave function methods has been rigorously established, spanning perturbation theory and the coupled cluster (CC) formalism. For these systems, CC with singles, doubles, and perturbative triples is known to achieve chemical accuracy, albeit at O(N7) computational cost. In addition, a hierarchy of density functional approximations of increasing formal sophistication, known as Jacob’s ladder, has been shown to systematically reduce average errors over large datasets representing weakly correlated chemistry. However, the accuracy of such computational models is less clear in the increasingly important frontiers of chemical space including transition metals and f-block compounds, in which strong correlation can play an important role in reactivity. A stochastic method, phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC), has been shown to be capable of producing chemically accurate predictions even for challenging molecular systems beyond the main group, with relatively low O(N3 − N4) cost and near-perfect parallel efficiency. Herein, we present our perspectives on the past, present, and future of the ph-AFQMC method. We focus on its potential in transition metal quantum chemistry to be a highly accurate, systematically improvable method that can reliably probe strongly correlated systems in biology and chemical catalysis and provide reference thermochemical values (for future development of density functionals or interatomic potentials) when experiments are either noisy or absent. Finally, we discuss the present limitations of the method and where we expect near-term development to be most fruitful.

Chemistry↗
DOE OSTI2020

Toward a systematic improvement of the fixed-node approximation in diffusion Monte Carlo for solids—A case study in diamond

While Diffusion Monte Carlo (DMC) is in principle an exact stochastic method for ab initio electronic structure calculations, in practice, the fermionic sign problem necessitates the use of the fixed-node approximation and trial wavefunctions with approximate nodes (or zeros). This approximation introduces a variational error in the energy that potentially can be tested and systematically improved. Here, we present a computational method that produces trial wavefunctions with systematically improvable nodes for DMC calculations of periodic solids. These trial wavefunctions are efficiently generated with the configuration interaction using a perturbative selection made iteratively (CIPSI) method. A simple protocol in which both exact and approximate results for finite supercells are used to extrapolate to the thermodynamic limit is introduced. This approach is illustrated in the case of the carbon diamond using Slater–Jastrow trial wavefunctions including up to one million Slater determinants. Fixed-node DMC energies obtained with such large expansions are much improved, and the fixed-node error is found to decrease monotonically and smoothly as a function of the number of determinants in the trial wavefunction, a property opening the way to a better control of this error. The cohesive energy extrapolated to the thermodynamic limit is in close agreement with the estimated experimental value. Interestingly, this is also the case at the single-determinant level, thus, indicating a very good error cancellation in carbon diamond between the bulk and atomic total fixed-node energies when using single-determinant nodes.

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

Exploiting Kronecker structure in exponential integrators: Fast approximation of the action of φ $-$functions of matrices via quadrature

Here, in this article, we propose an algorithm for approximating the action of φ $-$ functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum structure, which arise from problems admitting a tensor product representation. The method is based on quadrature approximations of the integral form of the φ $-$ functions combined with a scaling and modified squaring method. Owing to the Kronecker sum representation, only actions of 1D matrix exponentials are needed at each quadrature node and assembly of the full matrix can be avoided. Additionally, we derive a priori bounds for the quadrature error, which show that, as expected by classical theory, the rate of convergence of our method is supergeometric. Guided by our analysis, we construct a fast and robust method for estimating the optimal scaling factor and number of quadrature nodes that minimizes the total cost for a prescribed error tolerance. We investigate the performance of our algorithm by solving several linear and semilinear time-dependent problems in 2D and 3D. The results show that our method is accurate and orders of magnitude faster than the current state-of-the-art.

97 MATHEMATICS AND COMPUTING↗