Search NASA⌕ Search

SEARCH · Search NASA

Results for “projected gradient method”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

DEVELOPMENT AND APPLICATION OF RISK ANALYSIS TOOLKIT FOR PLANT RESOURCE OPTIMIZATION

This paper presents the development of methods and tools that are being designed to optimize plant operations (e.g., maintenance/replacement schedules and optimal maintenance postures for plant components) in a manner that is more cost effective than current approaches and makes better use of available component health and cost data. These methods include both data- and model-based optimization methods. Model-based optimization methods directly include reliability and cost models to determine an optimal plant operational strategy. We consider gradient-based and evolutionary (based on genetic algorithms) optimization methods. The second class of methods target more specific use cases (e.g., project schedule optimization) and are not based on reliability models directly, but they require specific component reliability and cost data. This class of methods is based on variants of the knapsack problem with an aim to determine an optimal project schedule that maximizes the overall NPV. This paper also presents multi-objective methods designed to identify an optimal maintenance posture based on a Pareto frontier analysis. Rather than dictating the “right” tradeoff (i.e., identify the absolute best posture), we show how it is possible to perform a trade space exploration approach (i.e., identify value and costs of several postures and let the analysis account for desired value and cost metrics). This is performed by identifying maintenance postures that maximize value (e.g., system availability) and minimize operational costs, i.e., the Pareto frontier in a value-cost trade space. For all these methods we present detailed applicative examples that show their validity from a decision-making perspective.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Sensitivity of magnetic islands in permanent magnet stellarators using the gradient and Hessian methods

Stellarator plasmas are known to be very sensitive to perturbations in the magnetic field. The permanent magnet stellarator was in part developed as a solution to high machining tolerances placed on the shape properties of electromagnetic coils in traditional stellarators. However, as a consequence of this high sensitivity to the field structure, sensitivities of permanent magnet stellarator plasmas to perturbations of permanent magnet properties must necessarily be well-understood. The gradient and Hessian matrix methods have been previously demonstrated to be useful sensitivity analysis methods for modular coils. We apply these two methods to the study of island width sensitivities in both the MUSE and PM4STELL permanent magnet stellarator projects. These sensitivity methods were used to determine the relative impacts of permanent magnet parameter perturbations on island widths in the vacuum field approximation of both stellarator equilibria. The square of resonant magnetic field perturbation is used here as a proxy for island width. In particular, gradients of magnetizations of individual magnets were examined in MUSE, as well as gradients of magnet group displacements informed by device design. Three different forms of permanent magnet magnetization perturbations are investigated for MUSE, and the flux surface response to perturbations is demonstrated. The Hessian matrix method is applied to PM4STELL, illustrating the sensitivity of dominant island widths to displacements of toroidal wedge structures. These methods allow for selective direction of experimental resources toward regions of heightened sensitivity, while constraints on less impactful permanent magnet parameters can be relaxed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2015

Bayesian 3D X-ray computed tomography image reconstruction with a scaled Gaussian mixture prior model

In order to improve quality of 3D X-ray tomography reconstruction for Non Destructive Testing (NDT), we investigate in this paper hierarchical Bayesian methods. In NDT, useful prior information on the volume like the limited number of materials or the presence of homogeneous area can be included in the iterative reconstruction algorithms. In hierarchical Bayesian methods, not only the volume is estimated thanks to the prior model of the volume but also the hyper parameters of this prior. This additional complexity in the reconstruction methods when applied to large volumes (from 512{sup 3} to 8192{sup 3} voxels) results in an increasing computational cost. To reduce it, the hierarchical Bayesian methods investigated in this paper lead to an algorithm acceleration by Variational Bayesian Approximation (VBA) [1] and hardware acceleration thanks to projection and back-projection operators paralleled on many core processors like GPU [2]. In this paper, we will consider a Student-t prior on the gradient of the image implemented in a hierarchical way [3, 4, 1]. Operators H (forward or projection) and H{sup t} (adjoint or back-projection) implanted in multi-GPU [2] have been used in this study. Different methods will be evalued on synthetic volume 'Shepp and Logan' in terms of quality and time of reconstruction. We used several simple regularizations of order 1 and order 2. Other prior models also exists [5]. Sometimes for a discrete image, we can do the segmentation and reconstruction at the same time, then the reconstruction can be done with less projections.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Density functional based methods for light harvesting molecules

The goal of the proposal was to computationally study the photoinduced charge transfer excited states of organic molecules. The systems of interest are the large organic supramolecules that have potential for photovoltaic applications. The simulation of the charge transfer excited states in large supramolecular assemblies require quantum mechanical methods that can be applied to systems with hundreds of atoms. Through this project we have implemented a perturbative delta-self-consistent field method that can easily describe the charge transfer excited states with regular density functionals without range separation. The cost of the calculations of an excited state is similar to that of the ground state. The method also allows for calculation of the energy gradients of the excited state. The developed method was applied to study a number of different supramolecular systems containing hundreds of atoms with excellent agreement with experiment. The absorption characteristics and the influence of density functional approximations were also examined. These led to several studies on the variety of organic electron donor and acceptor molecules. Apart from these developments through this project we also improved the code capabilities by implementing new meta-GGA functionals. This was a major step since the code is purely density functional and earlier the functional capabilities were limited only to generalized gradient approximations. A total of 23 peer-reviewed publications in top chemical physics journals resulted from this grant.

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

WE-FG-207B-03: Multi-Energy CT Reconstruction with Spatial Spectral Nonlocal Means Regularization

Purpose: Multi-energy computed tomography (MECT) is an emerging application in medical imaging due to its ability of material differentiation and potential for molecular imaging. In MECT, image correlations at different spatial and channels exist. It is desirable to incorporate these correlations in reconstruction to improve image quality. For this purpose, this study proposes a MECT reconstruction technique that employes spatial spectral non-local means (ssNLM) regularization. Methods: We consider a kVp-switching scanning method in which source energy is rapidly switched during data acquisition. For each energy channel, this yields projection data acquired at a number of angles, whereas projection angles among channels are different. We formulate the reconstruction task as an optimziation problem. A least square term enfores data fidelity. A ssNLM term is used as regularization to encourage similarities among image patches at different spatial locations and channels. When comparing image patches at different channels, intensity difference were corrected by a transformation estimated via histogram equalization during the reconstruction process. Results: We tested our method in a simulation study with a NCAT phantom and an experimental study with a Gammex phantom. For comparison purpose, we also performed reconstructions using conjugate-gradient least square (CGLS) method and conventional NLM method that only considers spatial correlation in an image. ssNLM is able to better suppress streak artifacts. The streaks are along different projection directions in images at different channels. ssNLM discourages this dissimilarity and hence removes them. True image structures are preserved in this process. Measurements in regions of interests yield 1.1 to 3.2 and 1.5 to 1.8 times higher contrast to noise ratio than the NLM approach. Improvements over CGLS is even more profound due to lack of regularization in the CGLS method and hence amplified noise. Conclusion: The proposed ssNLM method for kVp-switching MECT reconstruction can achieve high quality MECT images.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Distributed-Memory Parallel JointNMF

Joint Nonnegative Matrix Factorization (JointNMF) is a hybrid method for mining information from datasets that contain both feature and connection information. We propose distributed-memory parallelizations of three algorithms for solving the JointNMF problem based on Alternating Nonnegative Least Squares, Projected Gradient Descent, and Projected Gauss-Newton. We extend well-known communication-avoiding algorithms using a single processor grid case to our coupled case on two processor grids. We demonstrate the scalability of the algorithms on up to 960 cores (40 nodes) with 60% parallel efficiency. The more sophisticated Alternating Nonnegative Least Squares (ANLS) and Gauss-Newton variants outperform the first-order gradient descent method in reducing the objective on large-scale problems. We perform a topic modelling task on a large corpus of academic papers that consists of over 37 million paper abstracts and nearly a billion citation relationships, demonstrating the utility and scalability of the methods.

Eswar, Srinivas↗
DOE OSTI2019

An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids

We present a new approach to efficiently solve optimization problems constrained by partial differential equations (PDEs) with uncertain coefficients. The method leverages two sources of inexactness that trade accuracy for speed: (1) stochastic collocation based on dimension-adaptive sparse grids (SGs), which approximates the stochastic objective function with a limited number of quadrature nodes, and (2) projection-based reduced-order models (ROMs), which generate efficient approximations to PDE solutions. These two sources of inexactness lead to inexact objective function and gradient evaluations, which are managed by a trust-region method that guarantees global convergence by adaptively refining the SG and ROM until a proposed error indicator drops below a tolerance specified by trust-region convergence theory. A key feature of the proposed method is that the error indicator---which accounts for errors incurred by both the SG and ROM---must be only an asymptotic error bound, i.e., a bound that holds up to an arbitrary constant that need not be computed. This allows the approach to be applicable to a wide range of problems, including those where sharp, computable error bounds are not available; this distinguishes the proposed method from previous works. Numerical experiments performed on a model problem from optimal flow control under uncertainty verify global convergence of the method and demonstrate the method's ability to outperform previously proposed alternatives.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Preliminary Theoretical Analysis of Mixed Precision Krylov Subspace Methods (Q3 Report)

The third quarter of the project was spent performing theoretical finite precision analysis of Krylov subspace method variants that use mixed precision. Our focus here is on the Conjugate Gradient (CG) method and the Lanczos method. We have performed an analysis of maximum attainable accuracy for the classical CG method in which 3 precisions are used: a working precision ε, a precision ε IP for the inner product computations, and a precision ε MV for the matrix-vector products. Our results show that performing inner product computations in lower precision does not affect the attainable accuracy. Further, we have performed a complete error analysis of the s-step Lanczos algorithm. In this case, we show that the numerical behavior of the algorithm can be significantly improved by using extra precision in a small part of the computation. We summarize the main theorems in the remainder of the document. Other activities include attending biweekly xSDK meetings. The subsequent quarter will be spent finalizing these results into technical reports and/or manuscripts for submission to journals, as well as identifying opportunities for future work.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

NASA-UVA light aerospace alloy and structures technology program

The objective of the Light Aerospace Alloy and Structures Technology Program is to conduct interdisciplinary graduate student research on the performance of next generation, light weight aerospace alloys, composites, and associated thermal gradient structures. Individual technical objectives are established for each project. Efforts aim to produce basic understanding of material behavior, monolithic and composite alloys, processing methods, solid and mechanics analyses, measurement advances, and a pool of educated graduate students. Progress is reported for 11 areas of study.

Gangloff, Richard P.↗
DOE OSTI2016

Comparative Performance Analysis of Coarse Solvers for Algebraic Multigrid on Multicore and Manycore Architectures

In this paper, we study the performance of a two-level algebraic-multigrid algorithm, with a focus on the impact of the coarse-grid solver on performance. We consider two algorithms for solving the coarse-space systems: the preconditioned conjugate gradient method and a new robust HSS-embedded low-rank sparse-factorization algorithm. Our test data comes from the SPE Comparative Solution Project for oil-reservoir simulations. We contrast the performance of our code on one 12-core socket of a Cray XC30 machine with performance on a 60-core Intel Xeon Phi coprocessor. To obtain top performance, we optimized the code to take full advantage of fine-grained parallelism and made it thread-friendly for high thread count. We also developed a bounds-and-bottlenecks performance model of the solver which we used to guide us through the optimization effort, and also carried out performance tuning in the solver’s large parameter space. Finally, as a result, significant speedups were obtained on both machines.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Conjugate gradient based projection - A new explicit methodology for frictional contact

With special attention towards the applicability to parallel computation or vectorization, a new and effective explicit approach for linear complementary formulations involving a conjugate gradient based projection methodology is proposed in this study for contact problems with Coulomb friction. The overall objectives are focussed towards providing an explicit methodology of computation for the complete contact problem with friction. In this regard, the primary idea for solving the linear complementary formulations stems from an established search direction which is projected to a feasible region determined by the non-negative constraint condition; this direction is then applied to the Fletcher-Reeves conjugate gradient method resulting in a powerful explicit methodology which possesses high accuracy, excellent convergence characteristics, fast computational speed and is relatively simple to implement for contact problems involving Coulomb friction.

Tamma, Kumar K.↗
DOE OSTI2020

On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems

The sparse inverse covariance matrix is used to model conditional dependencies between variables in a graphical model to fit a multivariate Gaussian distribution. Estimating the matrix from data are well known to be computationally expensive for large-scale problems. Sparsity is employed to handle noise in the data and to promote interpretability of a learning model. Although the use of a convex ℓ 1 regularizer to encourage sparsity is common practice, the combinatorial ℓ 0 penalty often has more favorable statistical properties. In this paper, we directly constrain sparsity by specifying a maximally allowable number of nonzeros, in other words, by imposing an ℓ 0 constraint. Here, we introduce an efficient approximate Newton algorithm using warm starts for solving the nonconvex ℓ 0 -constrained inverse covariance learning problem. Numerical experiments on standard data sets show that the performance of the proposed algorithm is competitive with state-of-the-art methods.

$\ell_0$-Constrained↗
DOE OSTI2026

Improved energies and local energies with weighted variational Monte Carlo

Neural network parametrizations have increasingly been used to represent the ground and excited states in variational Monte Carlo (VMC) with promising results. However, traditional VMC methods only optimize the wave function in regions of peak probability. The wave function is uncontrolled in the tails of the probability distribution, which can limit the accuracy of the trained wave function. To improve the approximation accuracy in the probability tails, this paper interprets VMC as a gradient flow in the space of wave functions, followed by a projection step. From this perspective, arbitrary probability distributions can be used in the projection step, allowing the user to prioritize accuracy in different regions of state space. Motivated by this theoretical perspective, the paper tests a weighted VMC method on the antiferromagnetic Heisenberg model for a periodic spin chain. Compared to traditional VMC, weighted VMC reduces the error in the ground state energy by a factor of 2, and it reduces the errors in the local energies away from the mode by large factors of 10 2 –10 4 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1999

Method of Conjugate Radii for Solving Linear and Nonlinear Systems

This paper describes a method to solve a system of N linear equations in N steps. A quadratic form is developed involving the sum of the squares of the residuals of the equations. Equating the quadratic form to a constant yields a surface which is an ellipsoid. For different constants, a family of similar ellipsoids can be generated. Starting at an arbitrary point an orthogonal basis is constructed and the center of the family of similar ellipsoids is found in this basis by a sequence of projections. The coordinates of the center in this basis are the solution of linear system of equations. A quadratic form in N variables requires N projections. That is, the current method is an exact method. It is shown that the sequence of projections is equivalent to a special case of the Gram-Schmidt orthogonalization process. The current method enjoys an advantage not shared by the classic Method of Conjugate Gradients. The current method can be extended to nonlinear systems without modification. For nonlinear equations the Method of Conjugate Gradients has to be augmented with a line-search procedure. Results for linear and nonlinear problems are presented.

Nachtsheim, Philip R.↗
DOE OSTI2017

Higher climatological temperature sensitivity of soil carbon in cold than warm climates

The projected loss of soil carbon to the atmosphere resulting from climate change is a potentially large but highly uncertain feedback to warming. The magnitude of this feedback is poorly constrained by observations and theory, and is disparately represented in Earth system models (ESMs). In this study, to assess the climatological temperature sensitivity of soil carbon, we calculate apparent soil carbon turnover times that reflect long-term and broad-scale rates of decomposition. We show that the climatological temperature control on carbon turnover in the top metre of global soils is more sensitive in cold climates than in warm climates and argue that it is critical to capture this emergent ecosystem property in global-scale models. We present a simplified model that explains the observed high cold-climate sensitivity using only the physical scaling of soil freeze-thaw state across climate gradients. Current ESMs fail to capture this pattern, except in an ESM that explicitly resolves vertical gradients in soil climate and carbon turnover. An observed weak tropical temperature sensitivity emerges in a different model that explicitly resolves mineralogical control on decomposition. Lastly, these results support projections of strong carbon-climate feedbacks from northern soils and demonstrate a method for ESMs to capture this emergent behaviour.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

A More La Niña–Like Response to Radiative Forcing after Flux Adjustment in CESM2

Abstract In response to greenhouse gas forcing, most coupled global climate models project the tropical Pacific SST trend toward an “El Niño–like” state, with a reduced zonal SST gradient and a weakened Walker circulation. However, observations over the last five decades reveal a trend toward a more “La Niña–like” state with a strengthening zonal SST gradient. Recent research indicates that the identified trend differences are unlikely to be entirely due to internal variability and probably result, at least in part, from systematic model biases. In this study, Community Earth System Model, version 2 (CESM2), is used to explore how mean-state biases within the model may influence its forced response to radiative forcing in the tropical Pacific. The results show that using flux adjustment to reduce the mean-state bias in CESM2 over the tropical regions results in a more La Niña–like trend pattern in the tropical Pacific, with a strengthening of the tropical Pacific zonal SST gradient and a relatively enhanced Walker circulation, as hypothesized to occur if the ocean thermostat mechanism is stronger than the atmospheric mechanisms which by themselves would weaken the Walker circulation. We also find that the historical strengthening of the tropical Pacific zonal gradient is transient but persists into the near term in a high-emissions future warming scenario. These results suggest the potential of flux adjustment as a method for developing alternative projections that represent a wider range of possible future tropical Pacific warming scenarios, especially for a better understanding of regional patterns of climate risk in the near term.

Zhuo, Jing-Yi [Lamont-Doherty Earth Observatory, C↗
NASA NTRSDate not supplied

Towards a Third-Order Accurate, Second-Derivative-Free, Shock-Capturing Finite-Volume Method for Hypersonic Flows on Tetrahedral Grids

In this paper, we report progress in the development of a third-order accurate, second-derivative-free, shock-capturing finite-volume solver for three-dimensional unstructured grids. The method is economical in the sense that the computation and storage of second derivatives are not required for third-order accuracy. It is based on point-valued numerical solutions stored at cells, gradients computed and stored at nodes, and an efficient projected-derivative formula that eliminates the need for second derivatives in a quadratic solution interpolation. The projected-derivative formula is also used to eliminate second derivatives from a high-order flux quadrature formula, so that it can be implemented conveniently in the form of a numerical flux at a face center plus a correction term. Similarly, a high-order source quadrature formula can also be implemented in the form of a cell-center point evaluation plus a similar correction term. These features make it relatively straightforward to extend an existing second-order finite-volume code to third-order. This paper reports progress of implementing the method in the NASA VULCAN-CFD code and discusses the implementation of a high-order accurate limiter for shock capturing.

Weighted Least-Squares↗
DOE OSTI2022

Leveraging gradient weighted class activation mapping to improve classification effectiveness: Case study in transportation infrastructure characterization

Roadway “corners†are common for pedestrian use, whether designated with markings or not. Different types of markings have been deployed, ranging from simple parallel lines to more complex designs. Understanding the impact of different types of crosswalks is important for public safety. In this work we explore methods to improve the logging of marked crosswalk types. We used the Roadway Information Database from the Second Strategic Highway Research Project and used active learning methods with transfer learning to identify the crosswalk types (marked or unmarked). Upon completion we found our classifiers were unable to perform above roughly 94% correct classifications. To improve their efficacy, we separated the crosswalks into their “fine grained†types and used Gradient-Weighted Class Activation Mapping to isolate and study the features that classified the crosswalks. We compared this with sampled manually marked crosswalks and present findings. We believe this use case can represent a process to improve the active learning method for some visual machine learning applications.

Karnowski, Thomas↗