Search NASA⌕ Search

SEARCH · Search NASA

Results for “computationally expensive function”

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 55 records · Page 3

Machine-learning accelerated geometry optimization in molecular simulation

Geometry optimization is an important part of both computational materials and surface science because it is the path to finding ground state atomic structures and reaction pathways. These properties are used in the estimation of thermodynamic and kinetic properties of molecular and crystal structures. This process is slow at the quantum level of theory because it involves an iterative calculation of forces using quantum chemical codes such as density functional theory (DFT), which are computationally expensive and which limit the speed of the optimization algorithms. It would be highly advantageous to accelerate this process because then one could do either the same amount of work in less time or more work in the same time. Here, we provide a neural network (NN) ensemble based active learning method to accelerate the local geometry optimization for multiple configurations simultaneously. We illustrate the acceleration on several case studies including bare metal surfaces, surfaces with adsorbates, and nudged elastic band for two reactions. In all cases, the accelerated method requires fewer DFT calculations than the standard method. In addition, we provide an Atomic Simulation Environment (ASE)-optimizer Python package to make the usage of the NN ensemble active learning for geometry optimization easier.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Prediction of Solute Segregation at Metal/Oxide Interfaces Using Machine Learning Approaches

The atomic structure and chemistry at metal/oxide interfaces play a crucial role in determining their properties. However, studying semi-coherent metal/oxide interfaces that include misfit dislocations through density functional theory (DFT) is often computationally expensive due to the large number of atoms involved, ranging from hundreds to thousands. In this study, we explore solute segregation behavior at the Fe/Y 2 O 3 interface—an important model interface for cladding applications in nuclear fission reactors—by combining DFT calculations with a machine learning (ML) approach. ML models are trained using DFT-calculated segregation energies (𝐸 𝑆𝑒𝑔 ) to identify the key chemical and geometric factors influencing solute segregation at metal/oxide interfaces, revealing the competition between these features in determining 𝐸 𝑆𝑒𝑔 . Moreover, the segregation behavior at a specific Fe/Y 2 O 3 interface is predicted with high accuracy using ML models trained on data from this interface. Furthermore, it is found that the ML models could also predict solute segregation at a different Fe/Y 2 O 3 interface with a new orientation relationship (OR), at a computational cost of less than 1/45 of that required for similar DFT calculations.

36 - MATERIALS SCIENCE↗

An Extended Group Additivity Method for Polycyclic Thermochemistry Estimation

Automatic kinetic mechanism generation, virtual high-throughput screening, and automatic transition state search are currently trending applications requiring exploration of a large molecule space. Large-scale search requires fast and accurate estimation of molecules’ properties of interest, such as thermochemistry. Existing approaches are not satisfactory for large polycyclic molecules: considering the number of molecules being screened, quantum chemistry (even cheap density functional theory methods) can be computationally expensive, and group additivity, though fast, is not sufficiently accurate. Here, this paper provides a fast and moderately accurate alternative by proposing a polycyclic thermochemistry estimation method that extends the group additivity method with two additional algorithms: similarity match and bicyclic decomposition. It significantly reduces H f (298 K) estimation error from over 60 kcal/mol (group additivity method) to around 5 kcal/mol, C p (298 K) error from 9 to 1 cal/mol/K,and S(298 K) error from 70 to 7 cal/mol/K. This method also works well for heteroatomic polycyclics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Efficient Parallel-in-Time Method for Optimization with Parabolic PDEs

To solve optimization problems with parabolic PDE constraints, often methods working on the reduced objective functional are used. They are computationally expensive due to the necessity of solving both the state equation and a backward-in-time adjoint equation to evaluate the reduced gradient in each iteration of the optimization method. In this study, we investigate the use of the parallel-in-time method PFASST in the setting of PDE-constrained optimization. In order to develop an efficient fully time-parallel algorithm, we discuss different options for applying PFASST to adjoint gradient computation, including the possibility of doing PFASST iterations on both the state and the adjoint equations simultaneously. Here, we also explore the additional gains in efficiency from reusing information from previous optimization iterations when solving each equation. Numerical results for both a linear and a nonlinear reaction-diffusion optimal control problem demonstrate the parallel speedup and efficiency of different approaches.

97 MATHEMATICS AND COMPUTING↗

Quantum Package 2.0: An Open-Source Determinant-Driven Suite of Programs

Quantum chemistry is a discipline which relies heavily on very expensive numerical computations. The scaling of correlated wave function methods lies, in their standard implementation, between O(N-5) and O(e(N)), where N is proportional to the system size. Therefore, performing accurate calculations on chemically meaningful systems requires (i) approximations that can lower the computational scaling and (ii) efficient implementations that take advantage of modern massively parallel architectures. QUANTUM PACKAGE is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multireference second-order perturbation theory (PT2). The determinant-driven framework allows the programmer to include any arbitrary set of determinants in the reference space, hence providing greater methodological freedom. The sCI method implemented in QUANTUM PACKAGE is based on the CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively) algorithm which complements the variational sCI energy with a PT2 correction. Additional external plugins have been recently added to perform calculations with multireference coupled cluster theory and range-separated density-functional theory. All the programs are developed with the IRPF90 code generator, which simplifies collaborative work and the development of new features. QUANTUM PACKAGE strives to allow easy implementation and experimentation of new methods, while making parallel computation as simple and efficient as possible on modern supercomputer architectures. Currently, the code enables, routinely, to realize runs on roughly 2 000 CPU cores, with tens of millions of determinants in the reference space. Moreover, we have been able to push up to 12 288 cores in order to test its parallel efficiency. In the present manuscript, we also introduce some key new developments: (i) a renormalized second-order perturbative correction for efficient extrapolation to the full CI limit and (ii) a stochastic version of the CIPSI selection performed simultaneously to the PT2 calculation at no extra cost.

Garniron, Yann↗

Toward the Minimal Floating Operation Count Cholesky Decomposition of Electron Repulsion Integrals

As quantum chemistry calculations deal with molecular systems of increasing size, the memory requirement to store electron-repulsion integrals (ERIs) greatly outpaces the physical memory available in computing hardware. Here, the Cholesky decomposition of ERIs provides a convenient yet accurate technique to reduce the storage requirement of integrals. Recent developments of a two-step algorithm have drastically reduced the memory operation (MOP) count, leaving the floating operation (FLOP) count as the last frontier of cost reduction in the Cholesky ERI algorithm. In this report, we introduce a dynamic integral tracking, reusing, and compression/elimination protocol embedded in the two-step Cholesky ERI method. Benchmark studies suggest that this technique becomes particularly advantageous when the basis set consists of many computationally expensive high-angular-momentum basis functions. With this dynamic ERI improvement, the Cholesky ERI approach proves to be a highly efficient algorithm with minimal FLOP and MOP count.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Intrepid MCMC: Metropolis-Hastings with exploration

In engineering examples, one often encounters the need to sample from unnormalized distributions with complex shapes that may also be implicitly defined through a physical or numerical simulation model, making it computationally expensive to evaluate the associated density function. For such cases, MCMC has proven to be an invaluable tool. Random-walk Metropolis Methods (also known as Metropolis-Hastings (MH)), in particular, are highly popular for their simplicity, flexibility, and ease of implementation. However, most MH algorithms suffer from significant limitations when attempting to sample from distributions with multiple modes (particularly disconnected ones). Here, in this paper, we present Intrepid MCMC - a novel MH scheme that utilizes a simple coordinate transformation to significantly improve the mode-finding ability and convergence rate to the target distribution of random-walk Markov chains while retaining most of the simplicity of the vanilla MH paradigm. Through multiple examples, we showcase the improvement in the performance of Intrepid MCMC over vanilla MH for a wide variety of target distribution shapes. We also provide an analysis of the mixing behavior of the Intrepid Markov chain, as well as the efficiency of our algorithm for increasing dimensions. A thorough discussion is presented on the practical implementation of the Intrepid MCMC algorithm. Finally, its utility is highlighted through a Bayesian parameter inference problem for a two-degree-of-freedom oscillator under free vibration.

97 - MATHEMATICS AND COMPUTING↗

Modeling the dynamic response of rock masses with multiple compliant fluid saturated joint sets—Part I: Mesoscale simulations

Recently a mesoscale model was developed that includes thermomechanically consistent constitutive equations with dissipation due to porous compaction, inelastic distortional deformation rate, and slipping on persistent dry joint surfaces. In this Part I of a two-part paper, we describe enhancements of the mesoscale model which include: normal compliance with hysteresis, non-persistent joints with finite area, joint sets with angular deviation, and the weakening effect of fluid pressure in the joints. Examples study the influences of these effects on average strength. These computationally expensive simulations are used to inspire functional forms in a continuum model, described in Part II, which is needed for large scale simulations of real applications.

42 ENGINEERING↗

Accurate molecular structures and infrared spectra of trans-2,3-dideuterooxirane, methyloxirane, and trans-2,3-dimethyloxirane

Oxirane derivatives are the most used benchmarks for chiroptical spectroscopies in view of their small size and relative rigidity. The molecular structure, vibrational harmonic and anharmonic frequencies, and infrared intensities of the ground electronic states are analyzed in this paper. Equilibrium structure and harmonic force fields have been evaluated by means of high-level quantum-chemical calculations at the coupled-cluster level including single and double excitations together with a perturbative treatment of triples (CCSD(T)). Extrapolation to the complete basis-set limit as well as core-correlation effects have also been taken into account. Anharmonic contributions have been computed at the CCSD(T)/cc-pVTZ level for trans-2,3-dideuterooxirane. These data can serve as references to evaluate the accuracy of less expensive computational approaches rooted in the density functional theory (DFT). The latter have been used within hybrid CC/DFT approaches, which have been applied to simulate fully anharmonic infrared (IR) spectra. Finally, the best theoretical estimates of the equilibrium structures and vibrational wavenumbers are compared to the most accurate experimental data and show in all cases very good agreement, i.e., within 0.001 Å, 0.1 deg, 10 cm{sup −1}, and 0.5 km mol{sup −1}, for bond lengths, angles, wavenumbers, and IR intensities, respectively.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A machine learning framework for elastic constants predictions in multi-principal element alloys

On the one hand, multi-principal element alloys (MPEAs) have created a paradigm shift in alloy design due to large compositional space, whereas on the other, they have presented enormous computational challenges for theory-based materials design, especially density functional theory (DFT), which is inherently computationally expensive even for traditional dilute alloys. In this paper, we present a machine learning framework, namely PREDICT (PRedict properties from Existing Database In Complex alloys Territory), that opens a pathway to predict elastic constants in large compositional space with little computational expense. The framework only relies on the DFT database of binary alloys and predicts Voigt–Reuss–Hill Young’s modulus, shear modulus, bulk modulus, elastic constants, and Poisson’s ratio in MPEAs. We show that the key descriptors of elastic constants are the A–B bond length and cohesive energy. The framework can predict elastic constants in hypothetical compositions as long as the constituent elements are present in the database, thereby enabling property exploration in multi-compositional systems. We illustrate predictions in a FCC Ni-Cu-Au-Pd-Pt system.

Linton, Nathan (ORCID:0000000315485613)↗

Understanding Twinning and Deformation in High Entropy Alloys

On the one hand, multi-principal element alloys (MPEAs) have created a paradigm shift in alloy design due to large compositional space, whereas on the other, they have presented enormous computational challenges for theory-based materials design, especially density functional theory (DFT), which is inherently computationally expensive even for traditional dilute alloys. In this project, we developed a machine learning framework, namely PREDICT ( PR edict properties from E xisting D atabase I n C omplex alloys T erritory), that opens a pathway to predict elastic constants in large compositional space with little computational expense. The framework only relies on the DFT database of binary alloys and predicts Voigt–Reuss–Hill Young’s modulus, shear modulus, bulk modulus, elastic constants, and Poisson’s ratio in MPEAs. We show that the key descriptors of elastic constants are the A–B bond length and cohesive energy. The framework can predict elastic constants in hypothetical compositions as long as the constituent elements are present in the database, thereby enabling property exploration in multi-compositional systems. We illustrate predictions in a FCC Ni-Cu-Au-Pd-Pt system.

36 MATERIALS SCIENCE↗

Surrogate Model Guided Optimization of Expensive Black-Box Multi-Objective Problems: A Posteriori Methods

Many engineering applications require the simultaneous optimization of multiple conflicting objective functions. Often, these objective functions are evaluated using highly accurate computer simulations that are computationally too expensive to be evaluated hundreds or thousands of times during optimization. Thus, the goal is to find good approximations of the Pareto front using as few of these expensive simulations as possible. Here, we describe an optimization approach based on surrogate models and diverse sampling strategies to accelerate the search for the Pareto solutions. We use a separate surrogate model for approximating each objective function and then we use the surrogate models to inform where additional expensive simulations should be run. The surrogate models are updated in an active learning framework whenever new information from the expensive simulations becomes available. The sampling strategies aim at balancing local improvements of the approximate Pareto front and global exploration to identify the extrema and fill in large gaps of the approximate Pareto front. We demonstrate on a large set of benchmark problems the effectiveness of the method for finding good approximations of the Pareto front.

MATHEMATICS AND COMPUTING↗

First-Principles Quantum Transport Modeling of Spin-Transfer and Spin-Orbit Torques in Magnetic Multilayers

A unified approach for computing (i) spin-transfer torque in magnetic trilayers like spin valve and magnetic tunnel junction, where injected charge current flows perpendicularly to interfaces, and (ii) spin-orbit torque in magnetic bilayers of the type ferromagnet/spin-orbit-coupled material, where injected charge current flows parallel to the interface, was reviewed. The experimentally explored and technologically relevant spin-orbit-coupled materials include 5d heavy metals, topological insulators, Weyl semimetals, and transition metal dichalcogenides. This approach requires to construct the torque operator for a given Hamiltonian of the device and the steady-state nonequilibrium density matrix, where the latter is expressed in terms of the nonequilibrium Green’s functions and split into three contributions. Tracing these contributions with the torque operator automatically yields field-like and damping-like components of spin-transfer torque or spin-orbit torque vector, which is particularly advantageous for spin-orbit torque where the direction of these components depends on the unknown-in-advance orientation of the current-driven nonequilibrium spin density in the presence of spin-orbit coupling. Illustrative examples are provided by computing spin-transfer torque in a one-dimensional toy model of a magnetic tunnel junction and realistic Co/Cu/Co spin valve, both of which are described by first-principles Hamiltonians obtained from noncollinear density functional theory calculations, as well as by computing spin-orbit torque in a ferromagnetic layer described by a tight-binding Hamiltonian which includes spin-orbit proximity effect within ferromagnetic monolayers assumed to be generated by the adjacent monolayer transition metal dichalcogenide. In addition, it is shown here how spin-orbit proximity effect, quantified by computing (via first-principles retarded Green’s function) spectral functions and spin textures on monolayers of realistic ferromagnetic material like Co in contact with heavy metal or monolayer transition metal dichalcogenide, can be tailored to enhance the magnitude of spin-orbit torque. Furthermore, errors made in the calculation of spin-transfer torque are quantified when using Hamiltonian from collinear density functional theory, with rigidly rotated magnetic moments to create noncollinear magnetization configurations, instead of proper (but computationally more expensive) self-consistent Hamiltonian obtained from noncollinear density functional theory.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Surrogate-Based Robust Design for a Non-Smooth Radiation Source Detection Problem

In this paper, we develop and numerically illustrate a robust sensor network design to optimally detect a radiation source in an urban environment. This problem exhibits several challenges: penalty functionals are non-smooth due to the presence of buildings, radiation transport models are often computationally expensive, sensor locations are not limited to a discrete number of points, and source intensity and location responses, based on a fixed number of sensors, are not unique. We consider a radiation source located in a prototypical 250 m × 180 m urban setting. To address the non-smooth properties of the model and computationally expensive simulation codes, we employ a verified surrogate model based on radial basis functions. Using this surrogate, we formulate and solve a robust design problem that is optimal in an average sense for detecting source location and intensity with minimized uncertainty.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Localized Radial Basis Functions for Radiation Transport in Slab Geometry

Meshing the spatial domain for the neutron transport equation can be computationally expensive and labor-intensive. Mesh-free methods, such as radial basis function (RBF) approximations, may alleviate these concerns by using a pointwise solution of the transport equation instead of the standard volume-integrated solution using cells or elements. This allows for the use of any geometric description that can provide the material at solution points and the boundary normal directions for boundary points. RBFs give spectral convergence when used to solve differential equations, but only if they are infinitely smooth. This occurs when the RBFs are effectively flat, creating an ill-conditioned, dense system of equations. One simple way to alleviate this issue is to use localized RBFs. Global RBFs have been applied previously to the monoenergetic radiative transport equation in X-Y geometry using source iteration. In this summary, localized RBFs are applied to the multigroup neutron transport equation in slab geometry using Krylov iteration. The results show agreement with benchmark solutions, provided the coefficients for the RBF basis are properly chosen. (authors)

97 MATHEMATICS AND COMPUTING↗

Predicting Melt Curves of Energetic Materials Using Molecular Models

Here, in this work, the solid–liquid coexistence curves of classical fully flexible atomistic models of α-RDX and β-HMX were calculated using thermodynamically rigorous methodologies that identify where the free energy difference between the phases is zero. The free energy difference between each phase at a given state point was computed using the pseudosupercritical path (PSCP) method, and Gibbs–Helmholtz integration was used to evaluate the solid–liquid free energy difference as a function of temperature. This procedure was repeated for several pressures to determine points along the coexistence curve, which were then fit to the Simon–Glatzel functional form. While effective, this method is computationally expensive. An alternative approach is to compute the melting point at a single pressure via the PSCP method, and then use the Gibbs–Duhem integration technique to trace out the coexistence curve in a more computationally economical manner. Both approaches were used to determine the coexistence curve of α-RDX. The Gibbs–Duhem integration method was shown to generate a melt curve that is in good agreement with the PSCP-derived melt curve, while only costing ~10 % of the computational resources used for the PSCP method. For α-RDX, the predicted melting temperature increases significantly more for a given increase in pressure when compared to available experimental data.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Trajectory analysis via a geometric feature space approach

This study aimed to organize a body of trajectories in order to identify, search for and classify both common and uncommon behaviors among objects such as aircraft and ships. Existing comparison functions such as the Fréchet distance are computationally expensive and yield counterintuitive results in some cases. We propose an approach using feature vectors whose components represent succinctly the salient information in trajectories. These features incorporate basic information such as the total distance traveled and the distance between start/stop points as well as geometric features related to the properties of the convex hull, trajectory curvature and general distance geometry. Additionally, these features can generally be mapped easily to behaviors of interest to humans who are searching large databases. Most of these geometric features are invariant under rigid transformation. Furthermore, we demonstrate the use of different subsets of these features to identify trajectories similar to an exemplar, cluster a database of several hundred thousand trajectories and identify outliers.

97 MATHEMATICS AND COMPUTING↗

Curiosity driven exploration to optimize structure–property learning in microscopy

Rapidly determining structure–property correlations in materials is an important challenge in better understanding fundamental mechanisms and greatly assists in materials design. In microscopy, imaging data provides a direct measurement of the local structure, while spectroscopic measurements provide relevant functional property information. Deep kernel active learning approaches have been utilized to rapidly map local structure to functional properties in microscopy experiments, but are computationally expensive for multi-dimensional and correlated output spaces. Here, we present an alternative lightweight curiosity algorithm which actively samples regions with unexplored structure–property relations, utilizing a deep-learning based surrogate model for error prediction. We show that the algorithm outperforms random sampling for predicting properties from structures, and provides a convenient tool for efficient mapping of structure–property relationships in materials science.

36 MATERIALS SCIENCE↗