Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Variational projection methods for gradient crystal plasticity using Lie algebras

Summary A computational method is developed for evaluating the plastic strain gradient hardening term within a crystal plasticity formulation. While such gradient terms reproduce the size effects exhibited in experiments, incorporating derivatives of the plastic strain yields a nonlocal constitutive model. Rather than applying mixed methods, we propose an alternative method whereby the plastic deformation gradient is variationally projected from the elemental integration points onto a smoothed nodal field. Crucially, the projection utilizes the mapping between Lie groups and algebras in order to preserve essential physical properties, such as orthogonality of the plastic rotation tensor. Following the projection, the plastic strain field is directly differentiated to yield the Nye tensor. Additionally, an augmentation scheme is introduced within the global Newton iteration loop such that the computed Nye tensor field is fed back into the stress update procedure. Effectively, this method results in a fully implicit evolution of the constitutive model within a traditional displacement‐based formulation. An elemental projection method with explicit time integration of the plastic rotation tensor is compared as a reference. A series of numerical tests are performed for several element types in order to assess the robustness of the method, with emphasis placed upon polycrystalline domains and multi‐axis loading. Copyright © 2016 John Wiley & Sons, Ltd.

Truster, Timothy J.↗
DOE OSTI2025

Enhancing ACPF Analysis: Integrating Newton-Raphson Method with Gradient Descent and Computational Graphs

This paper presents a new method for enhancing Alternating Current Power Flow (ACPF) analysis. The method integrates the Newton-Raphson (NR) method with Enhanced-Gradient Descent (GD) and computational graphs. The integration of renewable energy sources in power systems introduces variability and unpredictability, and this method addresses these challenges. It leverages the robustness of NR for accurate approximations and the flexibility of GD for handling variable conditions, all without requiring Jacobian matrix inversion. Furthermore, computational graphs provide a structured and visual framework that simplifies and systematizes the application of these methods. The goal of this fusion is to overcome the limitations of traditional ACPF methods and improve the resilience, adaptability, and efficiency of modern power grid analyses. We validate the effectiveness of our advanced algorithm through comprehensive testing on established IEEE benchmark systems. Furthermore, our findings demonstrate that our approach not only speeds up the convergence process but also ensures consistent performance across diverse system states, representing a significant advancement in power flow computation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1988

Optimization with artificial neural network systems - A mapping principle and a comparison to gradient based methods

General formulae for mapping optimization problems into systems of ordinary differential equations associated with artificial neural networks are presented. A comparison is made to optimization using gradient-search methods. The performance measure is the settling time from an initial state to a target state. A simple analytical example illustrates a situation where dynamical systems representing artificial neural network methods would settle faster than those representing gradient-search. Settling time was investigated for a more complicated optimization problem using computer simulations. The problem was a simplified version of a problem in medical imaging: determining loci of cerebral activity from electromagnetic measurements at the scalp. The simulations showed that gradient based systems typically settled 50 to 100 times faster than systems based on current neural network optimization methods.

Leong, Harrison Monfook↗
DOE OSTI2022

The Gutzwiller conjugate gradient minimization method for correlated electron systems

In this report we review our recent work on the Gutzwiller conjugate gradient minimization method, an ab initio approach developed for correlated electron systems. The complete formalism has been outlined that allows for a systematic understanding of the method, followed by a discussion of benchmark studies of dimers, one- and two-dimensional single-band Hubbard models. In the end, we present some preliminary results of multi-band Hubbard models and large-basis calculations of F 2 to illustrate our efforts to further reduce the computational complexity.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

The molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory: The DEC-RI-MP2 gradient

We report an implementation of the molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory (DEC-RI-MP2). The new DEC-RI-MP2 gradient method combines the precision control as well as the linear-scaling and massively parallel features of the DEC scheme with efficient evaluations of the gradient contributions using the RI approximation. We further demonstrate that the DEC-RI-MP2 gradient method is capable of calculating molecular gradients for very large molecular systems. A test set of supramolecular complexes containing up to 158 atoms and 1960 contracted basis functions has been employed to demonstrate the general applicability of the DEC-RI-MP2 method and to analyze the errors of the DEC approximation. Moreover, the test set contains molecules of complicated electronic structures and is thus deliberately chosen to stress test the DEC-RI-MP2 gradient implementation. Additionally, as a showcase example the full molecular gradient for insulin (787 atoms and 7604 contracted basis functions) has been evaluated.

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

Discontinuous Skeletal Gradient Discretisation methods on polytopal meshes

Here, in this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomials on the mesh skeleton. The key ingredient is a high-order gradient reconstruction composed of two terms: (i) a consistent contribution obtained mimicking an integration by parts formula inside each element and (ii) a stabilising term for which sufficient design conditions are provided. An example of stabilisation that satisfies the design conditions is proposed based on a local lifting of high-order residuals on a Raviart–Thomas–Nédélec subspace. We prove that the novel DSGDs satisfy coercivity, consistency, limit-conformity, and compactness requirements that ensure convergence for a variety of elliptic and parabolic problems. Lastly, links with Hybrid High-Order, non-conforming Mimetic Finite Difference and non-conforming Virtual Element methods are also studied. Numerical examples complete the exposition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A Nonlocal-Gradient Descent Method for Inverse Design in Nanophotonics

Local-gradient-based optimization approaches lack nonlocal exploration abilityrequired for escaping from local minima when searching non-convex landscapes.A directional Gaussian smoothing (DGS) approach was recently proposed in [29]and used to define a truly nonlocal gradient, referred to as the DGS gradient, inorder to enable nonlocal exploration in high-dimensional black-box optimization.Promising results show that replacing the traditional local gradient with the nonlocalDGS gradient can significantly improve the performance of gradient-based methodsin optimizing highly multi-modal loss functions. However, the current DGS methodis designed for unbounded and uncontrained optimization problems, making itinapplicable to real-world engineering optimization problems where the tuningparameters are often bounded and the loss function is usually constrained byphysical processes. In this work, we propose to extend to the DGS approachto the constrained inverse design framework in order to find better optima ofmulti-modal loss functions. A series of adaptive strategies for smoothing radiusand learning rate updating are developed to improve the computational efficiencyand robustness. Our methodology is demonstrated by an example of designing ananoscale wavelength demultiplexer, and shows superior performance compared tothe state-of-the-art approaches. By incorporating volume constraints, the optimizeddesign achieves an equivalently high performance but significantly reduces theamount of material usage.

Bi, Sirui↗
DOE OSTI2014

Computerized detection of noncalcified plaques in coronary CT angiography: Evaluation of topological soft gradient prescreening method and luminal analysis

Purpose: The buildup of noncalcified plaques (NCPs) that are vulnerable to rupture in coronary arteries is a risk for myocardial infarction. Interpretation of coronary CT angiography (cCTA) to search for NCP is a challenging task for radiologists due to the low CT number of NCP, the large number of coronary arteries, and multiple phase CT acquisition. The authors conducted a preliminary study to develop machine learning method for automated detection of NCPs in cCTA. Methods: With IRB approval, a data set of 83 ECG-gated contrast enhanced cCTA scans with 120 NCPs was collected retrospectively from patient files. A multiscale coronary artery response and rolling balloon region growing (MSCAR-RBG) method was applied to each cCTA volume to extract the coronary arterial trees. Each extracted vessel was reformatted to a straightened volume composed of cCTA slices perpendicular to the vessel centerline. A topological soft-gradient (TSG) detection method was developed to prescreen for NCP candidates by analyzing the 2D topological features of the radial gradient field surface along the vessel wall. The NCP candidates were then characterized by a luminal analysis that used 3D geometric features to quantify the shape information and gray-level features to evaluate the density of the NCP candidates. With machine learning techniques, useful features were identified and combined into an NCP score to differentiate true NCPs from false positives (FPs). To evaluate the effectiveness of the image analysis methods, the authors performed tenfold cross-validation with the available data set. Receiver operating characteristic (ROC) analysis was used to assess the classification performance of individual features and the NCP score. The overall detection performance was estimated by free response ROC (FROC) analysis. Results: With our TSG prescreening method, a prescreening sensitivity of 92.5% (111/120) was achieved with a total of 1181 FPs (14.2 FPs/scan). On average, six features were selected during the tenfold cross-validation training. The average area under the ROC curve (AUC) value for training was 0.87 ± 0.01 and the AUC value for validation was 0.85 ± 0.01. Using the NCP score, FROC analysis of the validation set showed that the FP rates were reduced to 3.16, 1.90, and 1.39 FPs/scan at sensitivities of 90%, 80%, and 70%, respectively. Conclusions: The topological soft-gradient prescreening method in combination with the luminal analysis for FP reduction was effective for detection of NCPs in cCTA, including NCPs causing positive or negative vessel remodeling. The accuracy of vessel segmentation, tracking, and centerline identification has a strong impact on NCP detection. Studies are underway to further improve these techniques and reduce the FPs of the CADe system.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2010

Discontinuous Galerkin finite element methods for gradient plasticity.

In this report we apply discontinuous Galerkin finite element methods to the equations of an incompatibility based formulation of gradient plasticity. The presentation is motivated with a brief overview of the description of dislocations within a crystal lattice. A tensor representing a measure of the incompatibility with the lattice is used in the formulation of a gradient plasticity model. This model is cast in a variational formulation, and discontinuous Galerkin machinery is employed to implement the formulation into a finite element code. Finally numerical examples of the model are shown.

36 MATERIALS SCIENCE↗
DOE OSTI2013

Evaluation of the cone beam CT for internal target volume localization in lung stereotactic radiotherapy in comparison with 4D MIP images

Purpose: To investigate whether the three-dimensional cone-beam CT (CBCT) is clinically equivalent to the four-dimensional computed tomography (4DCT) maximum intensity projection (MIP) reconstructed images for internal target volume (ITV) localization in image-guided lung stereotactic radiotherapy.Methods: A ball-shaped polystyrene phantom with built-in cube, sphere, and cone of known volumes was attached to a motor-driven platform, which simulates a sinusoidal movement with changeable motion amplitude and frequency. Target motion was simulated in the patient in a superior-inferior (S-I) direction with three motion periods and 2 cm peak-to-peak amplitudes. The Varian onboard Exact-Arms kV CBCT system and the GE LightSpeed four-slice CT integrated with the respiratory-position-management 4DCT scanner were used to scan the moving phantom. MIP images were generated from the 4DCT images. The clinical equivalence of the two sets of images was evaluated by comparing the extreme locations of the moving objects along the motion direction, the centroid position of the ITV, and the ITV volumes that were contoured automatically by Velocity or calculated with an imaging gradient method. The authors compared the ITV volumes determined by the above methods with those theoretically predicted by taking into account the physical object dimensions and the motion amplitudes. The extreme locations were determined by the gradient method along the S-I axis through the center of the object. The centroid positions were determined by autocenter functions. The effect of motion period on the volume sizes was also studied.Results: It was found that the extreme locations of the objects determined from the two image modalities agreed with each other satisfactorily. They were not affected by the motion period. The average difference between the two modalities in the extreme locations was 0.68% for the cube, 1.35% for the sphere, and 0.5% for the cone, respectively. The maximum difference in the centroid position of the cylinder, sphere, and cone was less than 1.4 mm between the two modalities for all motion periods studied. For the ITV volume evaluation, the authors found that both MIP-based and CBCT-based ITVs increased with increases of motion period. Furthermore, the MIP-based ITV volumes were generally larger than those determined from the CBCT images, with the difference in autocontoured volumes being 2.57%, 1.66%, and 1.82% for the sphere, cylinder, and cone, respectively, while these differences increased to 9.57%, 3.52%, 8.71% for the above objects when the gradient method was used. The authors found that the autocontour method was accurate enough to predict the actual ITV values with the absolute differences less than 2.4% comparing to the theoretically predicted values.Conclusions: The extreme location and the centroid position of the objects agree with each other between the two image modalities when the breathing motion is sinusoidal. Although the ITV volumes delineated from both image modalities changed with the motion period, the differences in ITV between the two modalities were minimal when an optimized window level was used. The authors’ results suggest that CBCT and MIP images are equivalent in determining an ITV's position in the conditions studied. The CBCT is adequate in providing imaging-guidance for lung cancer treatment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2021

Solid Phase Gradient Alloying Method via ShAPE

Alloying has been used to confer desirable properties to various metallic systems since the bronze age. For example, Ni, Mn, and Cr are alloyed into an Fe matrix to make steel, which has improved strength and corrosion resistance (as displayed in Fig. 1). In addition to the type of alloying elements, the amount of alloying elements added into a matrix is also very critical for a material’s mechanical property, physical property, machinability, and cost. Conventionally, new alloys are discovered by combining alloy precursors and elemental constituents into a mixture and melting them together. The solidified product or ingot represents a usually non-homogeneous combination of the chemistry with a microstructure dictated by the physics of solidification. It is time and energy intensive to optimize the alloying amounts via the casting process and hence, economically not conducive to rapid alloy discovery. In addition, the cast microstructure seen in the as-cast ingot is often not the ideal, nor even desired structure for optimized performance. Cast materials often need further processing such as homogenization, annealing, and deformation work put in through rolling, forging, extruding, etc. to have favorable microstructures and properties. A faster method to discover new alloy combinations and evaluate them in their worked or processed form is needed. Recently, Laser Engineered Net Shaping was applied to fabricate gradient compositional material for alloy designing. However, the mechanical properties of this gradient alloy were poor due to the existence of impurities, oxidation and cracks that are inherent in the melt-solidification process. Because of these limitations, we propose to use a solid-phase process (ShAPE) to create bulk materials (extrudates) that vary in composition from one end of the extruded solid to the other. Various manufacturing methods for alloy design including conventional casting method, laser based combinatorial method and current solid phase gradient alloying method are displayed and compared in Fig. 2. ShAPE machine and a schematic of ShAPE process are displayed in Fig. 3. Starting material is processed by a rotating and plunging die to form an extrudate. We are proposing through this methodology to invent a new, bulk-scale combinatorial technique. With this novel technique, alloying element can be dissolved into the matrix with a continued gradient without bulk melting. Formation of inter-metallics and defects originating from melt processing can be avoided. In addition, the ShAPE process creates the mixed alloy chemistry, and meanwhile subjects the material to severe plastic strain, which induces the favorable “worked” microstructure. Products from the ShAPE process can be tested in hardness directly providing a path to rapid evaluation of mechanical properties. The ability to create graded structures using friction stir processing (FSP) has been demonstrated, however using the ShAPE process we believe will lead to much faster and higher fidelity results. When combined with high throughput screening methods of physical, mechanical and microstructural property characterization, efficiency and accuracy of alloy design can be significantly improved.

36 MATERIALS SCIENCE↗
NASA NTRS1983

A robust Feasible Directions algorithm for design synthesis

A nonlinear optimization algorithm is developed which combines the best features of the Method of Feasible Directions and the Generalized Reduced Gradient Method. This algorithm utilizes the direction-finding sub-problem from the Method of Feasible Directions to find a search direction which is equivalent to that of the Generalized Reduced Gradient Method, but does not require the addition of a large number of slack variables associated with inequality constraints. This method provides a core-efficient algorithm for the solution of optimization problems with a large number of inequality constraints. Further optimization efficiency is derived by introducing the concept of infrequent gradient calculations. In addition, it is found that the sensitivity of the optimum design to changes in the problem parameters can be obtained using this method without the need for second derivatives or Lagrange multipliers. A numerical example is given in order to demonstrate the efficiency of the algorithm and the sensitivity analysis.

Vanderplaats, G. N.↗
NASA NTRS1991

Applications of the conjugate gradient FFT method in scattering and radiation including simulations with impedance boundary conditions

The theoretical and computational aspects related to the application of the Conjugate Gradient FFT (CGFFT) method in computational electromagnetics are examined. The advantages of applying the CGFFT method to a class of large scale scattering and radiation problems are outlined. The main advantages of the method stem from its iterative nature which eliminates a need to form the system matrix (thus reducing the computer memory allocation requirements) and guarantees convergence to the true solution in a finite number of steps. Results are presented for various radiators and scatterers including thin cylindrical dipole antennas, thin conductive and resistive strips and plates, as well as dielectric cylinders. Solutions of integral equations derived on the basis of generalized impedance boundary conditions (GIBC) are also examined. The boundary conditions can be used to replace the profile of a material coating by an impedance sheet or insert, thus, eliminating the need to introduce unknown polarization currents within the volume of the layer. A general full wave analysis of 2-D and 3-D rectangular grooves and cavities is presented which will also serve as a reference for future work.

Barkeshli, Kasra↗
NASA NTRS1999

A Single-Lap Joint Adhesive Bonding Optimization Method Using Gradient and Genetic Algorithms

A natural process for any engineer, scientist, educator, etc. is to seek the most efficient method for accomplishing a given task. In the case of structural design, an area that has a significant impact on the structural efficiency is joint design. Unless the structure is machined from a solid block of material, the individual components which compose the overall structure must be joined together. The method for joining a structure varies depending on the applied loads, material, assembly and disassembly requirements, service life, environment, etc. Using both metallic and fiber reinforced plastic materials limits the user to two methods or a combination of these methods for joining the components into one structure. The first is mechanical fastening and the second is adhesive bonding. Mechanical fastening is by far the most popular joining technique; however, in terms of structural efficiency, adhesive bonding provides a superior joint since the load is distributed uniformly across the joint. The purpose of this paper is to develop a method for optimizing single-lap joint adhesive bonded structures using both gradient and genetic algorithms and comparing the solution process for each method. The goal of the single-lap joint optimization is to find the most efficient structure that meets the imposed requirements while still remaining as lightweight, economical, and reliable as possible. For the single-lap joint, an optimum joint is determined by minimizing the weight of the overall joint based on constraints from adhesive strengths as well as empirically derived rules. The analytical solution of the sin-le-lap joint is determined using the classical Goland-Reissner technique for case 2 type adhesive joints. Joint weight minimization is achieved using a commercially available routine, Design Optimization Tool (DOT), for the gradient solution while an author developed method is used for the genetic algorithm solution. Results illustrate the critical design variables as a function of adhesive properties and convergences of different joints based on the two optimization methods.

Smeltzer, Stanley S., III↗
DOE OSTI2020

A benchmark of Gutzwiller conjugate gradient minimization method in ground state energy calculations of dimers

Herein we present numerical results of ground-state energies of 9 molecules in the well-established G2 molecule set given by the Gutzwiller conjugate gradient minimization (GCGM) method. The method, beyond the commonly used Gutzwiller approximation, was recently developed based on Gutzwiller variational wave functions. We find that compared to benchmark data given by full configuration interaction, GCGM total energies are reasonably well reproduced with the minimum basis set. To include the dynamical correlation beyond the minimal basis calculations, we adopt the local density approximation for the dynamical correlation energy $E_c$. By comparing the results with benchmark data given by experiments and large-basis configuration interaction, the GCGM total energies with $E_c$ are in general better reproduced, but discrepancies are still observed for some dimers.

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

SU-E-T-295: Simultaneous Beam Sampling and Aperture Shape Optimization for Station Parameter Optimized Radiation Therapy (SPORT)

Purpose: Station Parameter Optimized Radiation Therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital LINACs, in which the station parameters of a delivery system, (such as aperture shape and weight, couch position/angle, gantry/collimator angle) are optimized altogether. SPORT promises to deliver unprecedented radiation dose distributions efficiently, yet there does not exist any optimization algorithm to implement it. The purpose of this work is to propose an optimization algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: We build a mathematical model whose variables are beam angles (including non-coplanar and/or even nonisocentric beams) and aperture shapes. To solve the resulting large scale optimization problem, we devise an exact, convergent and fast optimization algorithm by integrating three advanced optimization techniques named column generation, gradient method, and pattern search. Column generation is used to find a good set of aperture shapes as an initial solution by adding apertures sequentially. Then we apply the gradient method to iteratively improve the current solution by reshaping the aperture shapes and updating the beam angles toward the gradient. Algorithm continues by pattern search method to explore the part of the search space that cannot be reached by the gradient method. Results: The proposed technique is applied to a series of patient cases and significantly improves the plan quality. In a head-and-neck case, for example, the left parotid gland mean-dose, brainstem max-dose, spinal cord max-dose, and mandible mean-dose are reduced by 10%, 7%, 24% and 12% respectively, compared to the conventional VMAT plan while maintaining the same PTV coverage. Conclusion: Combined use of column generation, gradient search and pattern search algorithms provide an effective way to optimize simultaneously the large collection of station parameters and significantly improves quality of resultant treatment plans as compared with conventional VMAT or IMRT treatments.

07 ISOTOPE AND RADIATION SOURCES↗
NASA NTRS1987

Experience in grid optimization

Two optimization methods for solving a variational problem in grid generation are described and evaluated. The smoothness, cell volumes, and orthogonality of the variational integrals are examined. The Jacobi-Newton iterative method is compared to the Fletcher-Reeves conjugate gradient method. It is observed that a combination of the Jacobi-Newton iteration and the direct solution of the variational problem produces an algorithm which is easy to program and requires less storage and computer time/iteration than the conjugate gradient method.

Mastin, C. W.↗