Search NASA⌕ Search

SEARCH · Search NASA

Results for “Convex optimization”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

TU-C-17A-05: Dose Domain Optimization of MLC Leaf Patterns for Highly Complicated 4Ï€ IMRT Plans

Purpose: Highly conformal non-coplanar 4π radiotherapy plans typically require more than 20 intensity-modulated fields to deliver. A novel method to calculate multileaf collimator (MLC) leaf patterns is introduced to maximize delivery efficiency, accuracy and plan quality. Methods: 4 GBM patients, with a prescription dose of 59.4 Gy or 60 Gy, were evaluated using the 4π algorithm using 20 beams. The MLC calculation utilized a least square minimization of the dose distribution, with an anisotropic total variation regularization term to encourage piecewise continuity in the fluence maps. Transforming the fluence to the dose domain required multiplying the fluence with a sparse matrix. Exploiting this property made it feasible to solve the problem using CVX, a MATLAB-based convex modeling framework. The fluence was stratified into even step sizes, and the MLC segments, limited to 300, were calculated. The patients studied were replanned using Eclipse with the same beam angles. Results: Compared to the original 4π plan, the stratified 4π plan increased the maximum/mean dose for, in Gy, by 1.0/0.0 (brainstem), 0.5/0.2 (chiasm), 0.0/0.0 (spinal cord), 1.9/0.3 (L eye), 0.7/0.2 (R eye), 0.4/0.4 (L lens), 0.3/0.3 (R lens), 1.0/0.8 (L Optical Nerve), 0.5/0.3 (R Optical Nerve), 0.3/0.2 (L Cochlea), 0.1/0.1 (R Cochlea), 4.6/0.2 (brain), 2.4/0.1 (brain-PTV), 5.1/0.9 (PTV). Compared to Eclipse, which generated an average of 607 segments, the stratified plan reduced (−) or increased (+) the maximum/mean dose, in Gy, by −10.2/−4.1 (brainstem), −10.5/−8.9 (chiasm), +0.0/−0.1 (spinal cord), −4.9/−3.4 (L eye), −4.1/−2.5 (R eye), −2.8/−2.7 (L lens), −2.1/−1.9 (R lens), −7.6/−6.5 (L Optical Nerve), −8.9/−6.1 (R Optical Nerve), −1.3/−1.9 (L Cochlea), −1.8/−1.8 (R Cochlea), +1.7/−2.1 (brain), +3.2/−2.6 (brain-PTV), +1.8/+0.3 Gy (PTV. The stratified plan was also more homogeneous in the PTV. Conclusion: This novel solver can transform complicated fluence maps into significantly fewer deliverable MLC segments than the commercial system while achieving superior dosimetry. Funding support partially contributed by Varian.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Novel Geometric Operations for Linear Programming

This report summarizes the work performed under the project "Linear Programming in Strongly Polynomial Time." Linear programming (LP) is a classic combinatorial optimization problem heavily used directly and as an enabling subroutine in integer programming (IP). Specifically IP is the same as LP except that some solution variables must take integer values (e.g. to represent yes/no decisions). Together LP and IP have many applications in resource allocation including general logistics, and infrastructure design and vulnerability analysis. The project was motivated by the PI's recent success developing methods to efficiently sample Voronoi vertices (essentially finding nearest neighbors in high-dimensional point sets) in arbitrary dimension. His method seems applicable to exploring the high-dimensional convex feasible space of an LP problem. Although the project did not provably find a strongly-polynomial algorithm, it explored multiple algorithm classes. The new medial simplex algorithms may still lead to solvers with improved provable complexity. We describe medial simplex algorithms and some relevant structural/complexity results. We also designed a novel parallel LP algorithm based on our geometric insights and implemented it in the Spoke-LP code. A major part of the computational step is many independent vector dot products. Our parallel algorithm distributes the problem constraints across processors. Current commercial and high-quality free LP solvers require all problem details to fit onto a single processor or multicore. Our new algorithm might enable the solution of problems too large for any current LP solvers. We describe our new algorithm, give preliminary proof-of-concept experiments, and describe a new generator for arbitrarily large LP instances.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An asymptotically compatible approach for Neumann-type boundary condition on nonlocal problems

In this paper we consider 2D nonlocal diffusion models with a finite nonlocal horizon parameter δ characterizing the range of nonlocal interactions, and consider the treatment of Neumann-like boundary conditions that have proven challenging for discretizations of nonlocal models. We propose a new generalization of classical local Neumann conditions by converting the local flux to a correction term in the nonlocal model, which provides an estimate for the nonlocal interactions of each point with points outside the domain. While existing 2D nonlocal flux boundary conditions have been shown to exhibit at most first order convergence to the local counter part as δ → 0, the proposed Neumann-type boundary formulation recovers the local case as O(δ 2 ) in the L∞(Ω) norm, which is optimal considering the O(δ 2 ) convergence of the nonlocal equation to its local limit away from the boundary. We analyze the application of this new boundary treatment to the nonlocal diffusion problem, and present conditions under which the solution of the nonlocal boundary value problem converges to the solution of the corresponding local Neumann problem as the horizon is reduced. To demonstrate the applicability of this nonlocal flux boundary condition to more complicated scenarios, we extend the approach to less regular domains, numerically verifying that we preserve second-order convergence for non-convex domains with corners. Finally, based on the new formulation for nonlocal boundary condition, we develop an asymptotically compatible meshfree discretization, obtaining a solution to the nonlocal diffusion equation with mixed boundary conditions that converges with O(δ 2 ) convergence.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Structural optimization of an alternate design for the space shuttle solid rocket booster field joint

A structural optimization procedure is used to determine the shape of an alternate design for the shuttle solid rocket booster field joint. In contrast to the tang and clevis design of the existing joint, this alternate design consists of two flanges bolted together. Configurations with 150 studs of 1 1/8 in. diameter and 135 studs of 1 3/16 in. diameter are considered. Using a nonlinear programming procedure, the joint weight is minimized under constraints on either von Mises or maximum normal stresses, joint opening and geometry. The procedure solves the design problem by replacing it by a sequence of approximate (convex) subproblems; the pattern of contact between the joint halves is determined every few cycles by a nonliner displacement analysis. The minimum weight design has 135 studs of 1 3/16 in. diameter and is designed under constraints on normal stresses. It weighs 1144 lb per joint more than the current tang and clevis design.

Barthelemy, J.-F. M.↗
NASA NTRS1987

Structural optimization of an alternate design for the Space Shuttle solid rocket booster field joint

A structural optimization procedure is used to determine the shape of an alternate design for the Shuttle's solid rocket booster field joint. In contrast to the tang and clevis design of the existing joint, this alternate design consists of two flanges bolted together. Configurations with 150 studs of 1 1/8 in diameter and 135 studs of 1 3/16 in diameter are considered. Using a nonlinear programming procedure, the joint weight is minimized under constraints on either von Mises or maximum normal stresses, joint opening and geometry. The procedure solves the design problem by replacing it by a sequence of approximate (convex) subproblems; the pattern of contact between the joint halves is determined every few cycles by a nonlinear displacement analysis. The minimum weight design has 135 studs of 1 3/16 in diameter and is designed under constraints on normal stresses. It weighs 1144 lb per joint more than the current tang and clevis design.

Barthelemy, Jean-Francois M.↗
DOE OSTI2016

Experimental evaluation of neural probe’s insertion induced injury based on digital image correlation method

Purpose: The application of neural probes in clinic has been challenged by probes’ short lifetime when implanted into brain tissue. The primary goal is to develop an evaluation system for testing brain tissue injury induced by neural probe’s insertion using microscope based digital image correlation method. Methods: A brain tissue phantom made of silicone rubber with speckle pattern on its surface was fabricated. To obtain the optimal speckle pattern, mean intensity gradient parameter was used for quality assessment. The designed testing system consists of three modules: (a) load module for simulating neural electrode implantation process; (b) data acquisition module to capture micrographs of speckle pattern and to obtain reactive forces during the insertion of the probe; (c) postprocessing module for extracting tissue deformation information from the captured speckle patterns. On the basis of the evaluation system, the effects of probe wedge angle, insertion speed, and probe streamline on insertion induced tissue injury were investigated. Results: The optimal quality speckle pattern can be attained by the following fabrication parameters: spin coating rate—1000 r/min, silicone rubber component A: silicone rubber component B: softener: graphite = 5 ml: 5 ml: 2 ml: 0.6 g. The probe wedge angle has a significant effect on tissue injury. Compared to wedge angle 40° and 20°, maximum principal strain of 60° wedge angle was increased by 40.3% and 87.5%, respectively; compared with a relatively higher speed (500 μm/s), the maximum principle strain within the tissue induced by slow insertion speed (100 μm/s) was increased by 14.3%; insertion force required by probe with convex streamline was smaller than the force of traditional probe. Based on the experimental results, a novel neural probe that has a rounded tip covered by a biodegradable silk protein coating with convex streamline was proposed, which has both lower insertion and micromotion induced tissue injury. Conclusions: The established evaluation system has provided a simulation environment for testing brain tissue injury produced by various insertion conditions. At the same time, it eliminates the adverse effect of biological factors on tissue deformation during the experiment, improving the repeatability of measurement results. As a result, the evaluation system will provide support on novel neural probe design that can reduce the acute tissue injury during the implantation of the probe.

61 RADIATION PROTECTION AND DOSIMETRY↗
NASA NTRS1993

Two generalizations of Kohonen clustering

The relationship between the sequential hard c-means (SHCM), learning vector quantization (LVQ), and fuzzy c-means (FCM) clustering algorithms is discussed. LVQ and SHCM suffer from several major problems. For example, they depend heavily on initialization. If the initial values of the cluster centers are outside the convex hull of the input data, such algorithms, even if they terminate, may not produce meaningful results in terms of prototypes for cluster representation. This is due in part to the fact that they update only the winning prototype for every input vector. The impact and interaction of these two families with Kohonen's self-organizing feature mapping (SOFM), which is not a clustering method, but which often leads ideas to clustering algorithms is discussed. Then two generalizations of LVQ that are explicitly designed as clustering algorithms are presented; these algorithms are referred to as generalized LVQ = GLVQ; and fuzzy LVQ = FLVQ. Learning rules are derived to optimize an objective function whose goal is to produce 'good clusters'. GLVQ/FLVQ (may) update every node in the clustering net for each input vector. Neither GLVQ nor FLVQ depends upon a choice for the update neighborhood or learning rate distribution - these are taken care of automatically. Segmentation of a gray tone image is used as a typical application of these algorithms to illustrate the performance of GLVQ/FLVQ.

Bezdek, James C.↗
DOE OSTI2022

Open-source Tools for Solving Grid Optimization Problems: ARPA-e Benchmark Algorithm Overview [Slides]

This document contains the official formulation that will be used for evaluation in Challenge 2 of the Grid Optimization (GO) Competition. Minor changes may occur within the formulation. Entrants will be notified when a new version is released. Changes are not expected to be of a significance that would cause a change in approach for the Entrants. This formulation builds upon the Challenge 1 formulation published in ARPA-E DE-FOA-0001952. Entrants will be judged based on the current official Challenge 2 formulation posted on the GO Competition website (this document, which is subject to change), not the formulation posted in DE-FOA-0001952. Entrants are permitted and encouraged to use any alternative problem formulation and modeling convention within their own software (such as convex relaxation, decoupled power flow formulations, current-voltage formulations, etc.) in an attempt to produce an exact or approximate solution to this particular mathematical program. However, the judging of all submitted approaches must conform to the official formulation presented here.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRSDate not supplied

Next Generation Exercise Device (NGED): Advancing Exercise Capabilities for Future Space Missions Through Biomechanical Modeling

BACKGROUND As space exploration extends to long-duration missions on the Moon and Mars, maintaining astronaut health and fitness becomes increasingly critical. The Next Generation Exercise Device (NGED), developed and tested by the HumanWorks Lab in NASA Johnson Space Center's (JSC) Software, Robotics, and Simulation Division, aims to address this challenge through innovative approaches. This study presents the development and evaluation of an NGED system, focusing on its adaptability to various mission scenarios, including prospective use in a Lunar Pressurized Rover (LPR). Central to this project is the application of biomechanical modeling to optimize exercise efficacy and safety in microgravity and partial gravity environments. The project is a collaborative effort with the Human Health and Performance group at Johnson Space Center, ensuring a comprehensive approach to astronaut well-being that integrates biomechanical principles with practical exercise solutions. The NGED represents the next generation of exercise capabilities for missions in space, on the Moon and Mars, with a specific focus on applications such as the LPR. METHODS AND RESULTS Data collection for NGED development was conducted with two motor-driven Beyond Power Voltra I [1] systems and a custom test structure to allow placement of the cable-based devices on the ground, at shoulder height, and overhead. The collection was performed in JSC’s Prototype Immersive Technology (PIT) Lab, utilizing an OptiTrack motion capture system and AMTI force platform, to enable detailed biomechanical analysis via OpenSim [2,3]. Motion capture data were collected for three subjects representing different body types and statures. The marker set used was an enhanced version of the full-body Plug-in Gait marker set [4], with additional markers strategically placed for the primary objective of informing exercise volume requirements. Subjects performed a series of 17 exercises, carefully selected to engage various muscle groups, including novel spaceflight exercises such as skiing (ergometer style), lateral pulldowns, wood chops, triceps extensions, and flies, with load variations ranging from 10 to 90 pounds to maintain kinematic form. This comprehensive approach allowed for a thorough evaluation of the NGED's performance across a wide range of motions and loads. The biomechanical modeling and analysis were conducted using a modified OpenSim Full Body Rajagopal Model [4,5] and also scaled to the maximum and minimum anthropometry provided in NASA-STD-3001 [6]. Volumetric convex hulls were generated based on model marker trajectories and aggregated into geometric assemblies. These can be placed in models of vehicle designs to assess fit to protect for exercise as well as to adapt NGED exercise to fit available space. Preliminary findings from the collection indicate that the NGED prototype demonstrates significant adaptability across varying user anthropometrics and exercise types. The device showed consistent performance in load-bearing exercises, with subjects able to perform exercises effectively while maintaining proper biomechanical form. CONCLUSION NGED represents a forward-looking advancement in exercise capabilities for future space missions. In the future, this system can be used to capture valuable metrics (e.g., isometric mid-thigh pull for force output measurements, assessments of postural muscle strength, overall isometric strength). Its versatility in accommodating various exercises and user physiques, coupled with the ability to provide targeted biomechanical loading, makes it a promising approach for maintaining astronaut health during long-duration missions to the Moon and Mars. Future work will focus on refining the NGED based on initial biomechanical findings, leveraging the detailed insights provided by motion capture and analysis techniques. Particular emphasis will be placed on optimizing its use within the confined spaces of a LPR and other space habitats. This work contributes significantly to NASA's goals of supporting human health and performance in deep space exploration, paving the way for sustainable long-term presence beyond Low Earth Orbit through advanced, biomechanically-informed exercise solutions.

C Wang↗
DOE OSTI2020

Metric Type in the Target-matrix Mesh Optimization Paradigm

The Target Matrix Optimization Paradigm (TMOP) is a method for improving the accuracy, efficiency, and robustness of numerical solutions to partial differential equations by improving the geometric quality of the computational mesh, primarily through node movement. TMOP has been successfully applied to a number applications even though the paradigm was not fully understood at the time. With this work, TMOP can be seen to be a tightly woven fabric of interconnecting ideas and concepts that provides a powerful approach to mesh optimization. The central unifying concepts in TMOP are the concept of a Target Matrix and the concept of Metric Type. Target matrices are motivated by the desire to make mesh quality improvement application-specific and, when needed, solution-adaptive. Metric type plays an essential role because it provides, through the use of typed metrics, the bridge between application-specific quality and target construction. It is shown that there are eight theoretical metric types, including the shape and shape+size types used informally in the past. It is shown further that there exist well-posed metrics corresponding to six of the eight metric types. A well-posed metric is a metric that is typed and convex, polyconvex, or invex, and further, it is a metric that simplifies target construction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Computational modeling and neutron imaging to understand interface shape and solute segregation during the vertical gradient freeze growth of BaBrCl:Eu

In this work we apply continuum models to analyze phase change, heat transfer, fluid flow, solute transport, and segregation in order to understand prior neutron imaging observations of the vertical gradient freeze growth of Eu-doped BaBrCl. The models provide a rigorous framework in which to understand the mechanisms that are responsible for the complicated evolution of interface shape and dopant distribution in the growth experiment. We explain how a transition in the solid/liquid interface shape from concave to convex is driven by changes in radial heat transfer caused by furnace design. We also provide a mechanistic explanation of how dynamic growth conditions and changes of the flow structure in the melt result in complicated segregation patterns in this system. A growth pause caused by controller lock-up is shown to result in a band of solute depletion in accordance with classical theory. However, changing flow patterns during growth result in a non-monotonic axial distribution of solute that cannot be explained by simple application of classical segregation models. We assert that the approach presented here, namely the use of rigorous models in conjunction advanced diagnostics, such as neutron imaging, provides an exciting path forward for process optimization and control, accelerating the incremental advances that have, in the past, typically relied on empiricism, experience, and intuition.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Adaptive Power Flow Approximations With Second-Order Sensitivity Insights

The power flow equations are fundamental to power system planning, analysis, and control. However, the inherent non-linearity and non-convexity of these equations present formidable obstacles in problem-solving processes. To mitigate these challenges, recent research has proposed adaptive power flow linearizations that aim to achieve accuracy over wide operating ranges. The accuracy of these approximations inherently depends on the curvature of the power flow equations within these ranges, which necessitates considering second-order sensitivities. In this paper, we leverage second-order sensitivities to both analyze and improve power flow approximations. We evaluate the curvature across broad operational ranges and subsequently utilize this information to inform the computation of various sample-based power flow approximation techniques. Additionally, we leverage second-order sensitivities to guide the development of rational approximations that yield linear constraints in optimization problems. In conclusion, this approach is extended to enhance accuracy beyond the limitations of linear functions across varied operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Two datasets are better than one: method of double moments for 3D reconstruction in cryo-EM

Cryo-electron microscopy is a powerful imaging technique for reconstructing three-dimensional molecular structures from noisy tomographic projection images of randomly oriented particles. We introduce a new data fusion framework, termed the method of double moments, which reconstructs molecular structures from two instances of the second-order moment of projection images obtained under distinct orientation distributions: one uniform, the other non-uniform and unknown. We prove that these moments generically uniquely determine the underlying structure, up to a global rotation and reflection, and we develop a convex-relaxation-based algorithm that achieves accurate recovery using only second-order statistics. Our results demonstrate the advantage of collecting and modeling multiple datasets under different experimental conditions, illustrating that leveraging dataset diversity can substantially enhance reconstruction quality in computational imaging tasks.

Kam’s method↗
DOE OSTI2019

Distribution System State Estimation in the Presence of High Solar Penetration

In recent years, the low-to-medium voltage distribution networks are experiencing rising levels of distributed energy resources, including renewable generation, along with improved sensing, communication and automation infrastructure. As such, state estimation methods for distribution systems are becoming increasingly relevant as a means to enable better control strategies that can both leverage the benefits and mitigate the risks associated with high penetration of variable and uncertain distributed generation resources. Primary challenges of this problem include modeling complexities (nonlinear non-convex power-flow equations), limited availability of sensor measurements, and high penetration of uncertain renewable generation. This paper formulates the distribution system state estimation as a nonlinear weighted least squares problem, based on sensor measurements as well as forecasts data (both load and generation). We investigate the sensitivity of state estimator accuracy to (load/generation) forecast uncertainties, sensor accuracy, and sensor coverage levels.

Distribution system state estimation, nonlinear op↗
NASA NTRS2024

A Convexification-Based Outer-Approximation Method for Convex and Nonconvex MINLP

The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer-Approximation method. We propose a refined convexification-based Outer-Approximation method alongside a Branch-and-Bound method for both convex and nonconvex Mixed-Integer Nonlinear Programming problems. These methods have been developed and incorporated into the open-source Mixed-Integer Nonlinear Decomposition Toolbox for Pyomo-MindtPy. Comprehensive benchmark tests were conducted, validating the effectiveness and reliability of our proposed algorithms. These tests highlight the improvements achieved by incorporating convexification and domain reduction techniques into the Outer-Approximation and Branch-and-Bound methods.

Optimization↗
NASA NTRS2009

Hybrid NN/SVM Computational System for Optimizing Designs

A computational method and system based on a hybrid of an artificial neural network (NN) and a support vector machine (SVM) (see figure) has been conceived as a means of maximizing or minimizing an objective function, optionally subject to one or more constraints. Such maximization or minimization could be performed, for example, to optimize solve a data-regression or data-classification problem or to optimize a design associated with a response function. A response function can be considered as a subset of a response surface, which is a surface in a vector space of design and performance parameters. A typical example of a design problem that the method and system can be used to solve is that of an airfoil, for which a response function could be the spatial distribution of pressure over the airfoil. In this example, the response surface would describe the pressure distribution as a function of the operating conditions and the geometric parameters of the airfoil. The use of NNs to analyze physical objects in order to optimize their responses under specified physical conditions is well known. NN analysis is suitable for multidimensional interpolation of data that lack structure and enables the representation and optimization of a succession of numerical solutions of increasing complexity or increasing fidelity to the real world. NN analysis is especially useful in helping to satisfy multiple design objectives. Feedforward NNs can be used to make estimates based on nonlinear mathematical models. One difficulty associated with use of a feedforward NN arises from the need for nonlinear optimization to determine connection weights among input, intermediate, and output variables. It can be very expensive to train an NN in cases in which it is necessary to model large amounts of information. Less widely known (in comparison with NNs) are support vector machines (SVMs), which were originally applied in statistical learning theory. In terms that are necessarily oversimplified to fit the scope of this article, an SVM can be characterized as an algorithm that (1) effects a nonlinear mapping of input vectors into a higher-dimensional feature space and (2) involves a dual formulation of governing equations and constraints. One advantageous feature of the SVM approach is that an objective function (which one seeks to minimize to obtain coefficients that define an SVM mathematical model) is convex, so that unlike in the cases of many NN models, any local minimum of an SVM model is also a global minimum.

Rai, Man Mohan↗
DOE OSTI2015

Microstructure of vapor deposited coatings on curved substrates

Thermal barrier coating systems consisting of a metallic bond coat and ceramic over layer are widely used to extend the life of gas turbine engine components. They are applied using either high-vacuum physical vapor deposition techniques in which vapor atoms rarely experience scattering collisions during propagation to a substrate, or by gas jet assisted (low-vacuum) vapor deposition techniques that utilize scattering from streamlines to enable non-line-of-sight deposition. Both approaches require substrate motion to coat a substrate of complex shape. Here, direct simulation Monte Carlo and kinetic Monte Carlo simulation methods are combined to simulate the deposition of a nickel coating over the concave and convex surfaces of a model airfoil, and the simulation results are compared with those from experimental depositions. The simulation method successfully predicted variations in coating thickness, columnar growth angle, and porosity during both stationary and substrate rotated deposition. It was then used to investigate a wide range of vapor deposition conditions spanning high-vacuum physical vapor deposition to low-vacuum gas jet assisted vapor deposition. The average coating thickness was found to increase initially with gas pressure reaching a maximum at a chamber pressure of 8–10 Pa, but the best coating thickness uniformity was achieved under high vacuum deposition conditions. However, high vacuum conditions increased the variation in the coatings pore volume fraction over the surface of the airfoil. The simulation approach was combined with an optimization algorithm and used to investigate novel deposition concepts to tailor the local coating thickness.

42 ENGINEERING↗
DOE OSTI2020

Crystal Structure Prediction of Binary Alloys via Deep Potential

Predicting crystal structure has been a challenging problem in physics and materials science for a long time. A reliable energy calculation engine combined with an efficient global search algorithm, such as particle swarm optimization algorithm or genetic algorithm, is needed to conduct crystal structure prediction. In recent years, machine learning-based interatomic potential energy surface models have been proposed, potentially allowing us to perform crystal structure prediction for systems with the accuracy of density functional theory (DFT) and the speed of empirical force fields. In this paper, we employ a previously developed Deep Potential model to predict the intermetallic compound of the aluminum–magnesium system, and find six meta-stable phases with negative or nearly zero formation energy. In particular, Mg 12 Al 8 shows excellent ductility and Mg 5 Al 27 has a high Young's modulus. Based on our benchmark results, we propose a relatively robust structure screening criterion that selects potentially stable structures from the Deep Potential-based convex hull and performs DFT refinement. By using this criterion, the computational cost needed to construct the convex hull with ab initio accuracy can be dramatically reduced.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗