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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

Investigation of Thermal Stress Convection in Nonisothermal Gases under Microgravity Conditions

The project has sought to ascertain the veracity of the Burnett relations, as applied to slow moving, highly nonisothermal gases, by comparison of convection and stress predictions with those generated by the DSMC method. The Burnett equations were found to provide reasonable descriptions of the pressure distribution and normal stress in stationary gases with a 1-D temperature gradient. Continuum/Burnett predictions of thermal stress convection in 2-D heated enclosures, however, are not quantitatively supported by DSMC results. For such situations, it appears that thermal creep flows, generated at the boundaries of the enclosure, will be significantly larger than the flows resulting from thermal stress in the gas.

Mackowski, Daniel W.↗
NASA NTRS2004

Investigation of Navier-Stokes Code Verification and Design Optimization

With rapid progress made in employing computational techniques for various complex Navier-Stokes fluid flow problems, design optimization problems traditionally based on empirical formulations and experiments are now being addressed with the aid of computational fluid dynamics (CFD). To be able to carry out an effective CFD-based optimization study, it is essential that the uncertainty and appropriate confidence limits of the CFD solutions be quantified over the chosen design space. The present dissertation investigates the issues related to code verification, surrogate model-based optimization and sensitivity evaluation. For Navier-Stokes (NS) CFD code verification a least square extrapolation (LSE) method is assessed. This method projects numerically computed NS solutions from multiple, coarser base grids onto a freer grid and improves solution accuracy by minimizing the residual of the discretized NS equations over the projected grid. In this dissertation, the finite volume (FV) formulation is focused on. The interplay between the xi concepts and the outcome of LSE, and the effects of solution gradients and singularities, nonlinear physics, and coupling of flow variables on the effectiveness of LSE are investigated. A CFD-based design optimization of a single element liquid rocket injector is conducted with surrogate models developed using response surface methodology (RSM) based on CFD solutions. The computational model consists of the NS equations, finite rate chemistry, and the k-6 turbulence closure. With the aid of these surrogate models, sensitivity and trade-off analyses are carried out for the injector design whose geometry (hydrogen flow angle, hydrogen and oxygen flow areas and oxygen post tip thickness) is optimized to attain desirable goals in performance (combustion length) and life/survivability (the maximum temperatures on the oxidizer post tip and injector face and a combustion chamber wall temperature). A preliminary multi-objective optimization study is carried out using a geometric mean approach. Following this, sensitivity analyses with the aid of variance-based non-parametric approach and partial correlation coefficients are conducted using data available from surrogate models of the objectives and the multi-objective optima to identify the contribution of the design variables to the objective variability and to analyze the variability of the design variables and the objectives. In summary the present dissertation offers insight into an improved coarse to fine grid extrapolation technique for Navier-Stokes computations and also suggests tools for a designer to conduct design optimization study and related sensitivity analyses for a given design problem.

Vaidyanathan, Rajkumar↗
NASA NTRSDate not supplied

Using Digital Image Correlation for Material Testing at Cryogenic Temperatures

Recent efforts were made to parametrize an aluminum alloy at cryogenic temperatures to calibrate finite element models simulating material deformation. Digital image correlation (DIC) was used to measure material properties using front/back strains of specimens during tensile tests. Data acquired from DIC was compared to physical extensometer measurements. Two camera pairs (front and back) were mounted via aluminum extrusion to the exterior of an environmental chamber of a hydraulic test stand. Images were taken through single-pane optical glass windows of the environment chamber. Positive pressure bags encased the cameras, attaching to the perimeter of the glass to keep out moisture and prevent windows from frosting. Figure 1 shows the environmental setup and the camera setup during cryogenic testing. Some of the challenges during testing at cryogenic temperatures include the gaseous flow of liquid nitrogen in the optical path of the mounted cameras, frost buildup on the windows as seen in Figure 1b, and frost on the test coupon. The temperature gradient present during the introduction of liquid nitrogen into the chamber can increase the projection error of images captured of the specimen. Figure 2 shows the estimated projection error from DIC as a function of temperature during the cool down process. This presentation addresses some of the concerns and observations when using DIC for testing at cryogenic temperatures using methods of isolated camera system and techniques for maintaining the glass panel clear from frost.

Joseph Cochran↗
DOE OSTI2026

Microstructure prediction for Ti-22Al-25Nb in laser powder bed fusion

This work presents a physics-informed framework for predicting solidification morphology and defect susceptibility in additively manufactured Ti–22Al–25Nb across a broad processing space. The framework integrates solidification microstructure selection (SMS) analysis with a single-track defect-based printability map to establish a unified methodology linking processing parameters to both interfacial morphology and manufacturability. Thermal gradients G and solidification rates R are first computed using the Thermo-Calc Additive Manufacturing (TC-AM) module, a finite-interface-dissipation (FID) phase-field (PF) model coupled with CALPHAD method is then employed to systematically distinguish planar and dendritic regimes as functions of $G$ and $R$. By superimposing the printability map onto the morphology projections, a comprehensive process–structure framework is obtained. Across most processing conditions, the predicted microstructure is predominantly dendritic, while planar growth emerges only under selected laser power $P$ and scan speed $v$ combinations. In addition to morphology classification, the framework quantifies the dendritic area fraction and introduces a width-based morphology descriptor to characterize the spatial extent of planar/dendritic regions within the melt pool. It provides mechanistic insight into the interplay between solidification physics and defect formation, offering practical guidance for parameter selection and microstructural control in Ti–22Al–25Nb additive manufacturing (AM).

36 MATERIALS SCIENCE↗
DOE OSTI2017

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even when gradient information can be computed efficiently. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this paper, we propose a novel Bayesian stochastic inversion methodology, which is characterized by a tight coupling between the gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated parameter space. In addition, non-Gaussian posterior distributions are estimated via an efficient LMCMC method on the projected low-dimensional feature space. We will demonstrate this computational framework by integrating and adapting our recent data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to a linear elasticity model.

42 ENGINEERING↗
NASA NTRS1988

Design of a lunar transportation system

The establishment of lunar bases is the next logical step in the exploration of space. Permanent lunar bases will support scientific investigation, the industrialization of space, and the development of self-sufficiency on the Moon. Scientific investigation and research and development would lead to applications utilizing lunar material resources. By utilizing these resources, the industrialization of space can become a reality. The above two factors coupled with the development of key and enabling technologies would lead to achievement of self-sufficiency of the lunar base. Attention was focused on specific design(s) to be pursued during subsequent stages in advanced courses. Some of the objectives in the project included: (1) minimizing the transportation of construction material and fuel from earth, or maximizing the use of the lunar material; (2) use of novel materials and light weight structures; (3) use of new manufacturing methods and technology such as magnetically levitated, or superconducting materials; and (4) innovative concepts of effectively utilizing the exotic lunar conditions, i.e. high thermal gradients, lack of atmosphere, zero wind forces, and lower gravity, etc.

Source record↗
NASA NTRS1976

Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs

Two existing function-space quasi-Newton algorithms, the Davidon algorithm and the projected gradient algorithm, are modified so that they may handle directly control-variable inequality constraints. A third quasi-Newton-type algorithm, developed by Broyden, is extended to optimal control problems. The Broyden algorithm is further modified so that it may handle directly control-variable inequality constraints. From a computational viewpoint, dyadic operator implementation of quasi-Newton methods is shown to be superior to the integral kernel representation. The quasi-Newton methods, along with the steepest descent method and two conjugate gradient algorithms, are simulated on three relatively simple (yet representative) bounded control problems, two of which possess singular subarcs. Overall, the Broyden algorithm was found to be superior. The most notable result of the simulations was the clear superiority of the Broyden and Davidon algorithms in producing a sharp singular control subarc.

Edge, E. R.↗
DOE OSTI2023

A convection-permitting dynamically downscaled dataset over the Midwestern United States

Climate change is expected to have far-reaching effects at both the global and regional scale, but local effects are difficult to determine from coarse-resolution climate studies. Dynamical downscaling can provide insight into future climate projections on local scales. Here, we present a new dynamically downscaled dataset for Indiana and the surrounding regions. Output from the Community Earth System Model (CESM) version 1 is downscaled using the Weather Research and Forecasting model (WRF). Simulations are run with a 24-hr reinitialization strategy and a 12-hr spin-up window. WRF output is bias corrected to the National Centers for Environmental Protection/National Center for Atmospheric Research 40-year Reanalysis project (NCEP) using a modified quantile mapping method. Bias-corrected 2-m air temperature and accumulated precipitation are the initial focus, with additional variables planned for future releases. Regional climate change signals agree well with larger global studies, and local fine-scaled features are visible in the resulting dataset, such as urban heat islands, frontal passages, and orographic temperature gradients. This high-resolution climate dataset could be used for down-stream applications focused on impacts across the domain, such as urban planning, energy usage, water resources, agriculture and public health.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Scalable and accurate multi-GPU-based image reconstruction of large-scale ptychography data

Abstract While the advances in synchrotron light sources, together with the development of focusing optics and detectors, allow nanoscale ptychographic imaging of materials and biological specimens, the corresponding experiments can yield terabyte-scale volumes of data that can impose a heavy burden on the computing platform. Although graphics processing units (GPUs) provide high performance for such large-scale ptychography datasets, a single GPU is typically insufficient for analysis and reconstruction. Several works have considered leveraging multiple GPUs to accelerate the ptychographic reconstruction. However, most of these works utilize only the Message Passing Interface to handle the communications between GPUs. This approach poses inefficiency for a hardware configuration that has multiple GPUs in a single node, especially while reconstructing a single large projection, since it provides no optimizations to handle the heterogeneous GPU interconnections containing both low-speed (e.g., PCIe) and high-speed links (e.g., NVLink). In this paper, we provide an optimized intranode multi-GPU implementation that can efficiently solve large-scale ptychographic reconstruction problems. We focus on the maximum likelihood reconstruction problem using a conjugate gradient (CG) method for the solution and propose a novel hybrid parallelization model to address the performance bottlenecks in the CG solver. Accordingly, we have developed a tool, called PtyGer ( Pty chographic G PU(multipl e )-based r econstruction), implementing our hybrid parallelization model design. A comprehensive evaluation verifies that PtyGer can fully preserve the original algorithm’s accuracy while achieving outstanding intranode GPU scalability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Sparsity-based acoustic inversion in cross-sectional multiscale optoacoustic imaging

Purpose: With recent advancement in hardware of optoacoustic imaging systems, highly detailed cross-sectional images may be acquired at a single laser shot, thus eliminating motion artifacts. Nonetheless, other sources of artifacts remain due to signal distortion or out-of-plane signals. The purpose of image reconstruction algorithms is to obtain the most accurate images from noisy, distorted projection data. Methods: In this paper, the authors use the model-based approach for acoustic inversion, combined with a sparsity-based inversion procedure. Specifically, a cost function is used that includes the L1 norm of the image in sparse representation and a total variation (TV) term. The optimization problem is solved by a numerically efficient implementation of a nonlinear gradient descent algorithm. TV–L1 model-based inversion is tested in the cross section geometry for numerically generated data as well as for in vivo experimental data from an adult mouse. Results: In all cases, model-based TV–L1 inversion showed a better performance over the conventional Tikhonov regularization, TV inversion, and L1 inversion. In the numerical examples, the images reconstructed with TV–L1 inversion were quantitatively more similar to the originating images. In the experimental examples, TV–L1 inversion yielded sharper images and weaker streak artifact. Conclusions: The results herein show that TV–L1 inversion is capable of improving the quality of highly detailed, multiscale optoacoustic images obtained in vivo using cross-sectional imaging systems. As a result of its high fidelity, model-based TV–L1 inversion may be considered as the new standard for image reconstruction in cross-sectional imaging.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Methods in PES-Learn: Direct-Fit Machine Learning of Born–Oppenheimer Potential Energy Surfaces

The release of PES-L EARN version 1.0 as an open-source software package for the automatic construction of machine learning models of semi-global molecular potential energy surfaces (PESs) is presented. Improvements to PES-L EARN ’s interoperability are stressed with new Python API that simplifies workflows for PES construction via interaction with QCSchema input and output infrastructure. In addition, a new machine learning method is introduced to PES-L EARN : kernel ridge regression (KRR). The capabilities of KRR are emphasized with examination of select semi-global PESs. All machine learning methods available in PES-L EARN are benchmarked with benzene and ethanol datasets from the rMD17 database to illustrate PES-L EARN ’s performance ability. Fitting performance and timings are assessed for both systems. Finally, the ability to predict gradients with neural network models is presented and benchmarked with ethanol and benzene. PES-L EARN is an active project and welcomes community suggestions and contributions.

kernel ridge regression↗
NASA NTRS1992

Electromagnetic characterization of conformal antennas

The ultimate objective of this project is to develop a new technique which permits an accurate simulation of microstrip patch antennas or arrays with various feed, superstrate and/or substrate configurations residing in a recessed cavity whose aperture is planar, cylindrical or otherwise conformed to the substructure. The technique combines the finite element and boundary integral methods to formulate a system suitable for solution via the conjugate gradient method in conjunction with the fast Fourier transform. The final code is intended to compute both scattering and radiation patterns of the structure with an affordable memory demand. With upgraded capabilities, the four included papers examined the radar cross section (RCS), input impedance, gain, and resonant frequency of several rectangular configurations using different loading and substrate/superstrate configurations.

Volakis, John L.↗
NASA NTRS1998

Parallel Implicit Algorithms for CFD

The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.

Keyes, David E.↗
NASA NTRS2018

An Active Subspace Method for Accelerating Convergence in Delaunay-Based Optimization via Dimension Reduction

Delaunay-based derivative-free optimization, ∆DOGS, is an efficient and provably-convergent global optimization method for the problems which has computationally expensive objection function and the analytical expression for the objective function is not available. ∆-DOGS is a novel optimization scheme in the family of response surface methods (RSMs); however, it suffers from the curse of dimensionality since the computational cost increases dramatically as the number of design parameters increases. As a result, the number of design parameters in ∆-DOGS algorithm is relatively low (n.10). To avoid such problems, this paper proposes a combination of derivative-free optimization, seeking the global minimizer of an expensive and nonconvex objective function f(x) and active subspace method, detecting the directions of the most variability using evaluations of the gradient. The contribution of other directions to the objective function is bounded by a sufficiently small constant. This new algorithm iteratively applied Delaunay-based derivative-free optimization to seek the minimizer on the d-dimensional active subspace that has most function variation. Inverse mapping is needed to project data from active subspace to full-model for evaluating function values. This task is overcome by solving an inequality constrained problem that curves the response surface of the objective function. The test results show that this strategy is effective on a handful of optimization problems.

Bewley, Thomas R.↗
NASA NTRSDate not supplied

Advancement of the General Aviation Synthesis Program Using Python to Enable Optimization-Based Hybrid-Propulsion Aircraft Design

In support of the Electrified Powertrain Flight Demonstrator and Advanced Air Transport Technologies projects at NASA, a new tool has been developed at NASA’s Ames and Glenn Research Centers to enable coupled engine and airframe optimization and analysis. The new tool combines the engineering-level analysis methods and empirical models of the FORTRAN General Aviation Synthesis Program (GASP) with the Python-based OpenMDAO framework to provide a modular framework for efficient gradient-based optimization with the aim of incorporating new subsystem models for unconventional configurations. The tool has been verified against GASP analyses of several aircraft models and mission formulations. Preliminary efforts have been made to integrate pyCycle, a thermodynamic cycle analysis tool, to enable simultaneous optimization of hybrid propulsion system and vehicle parameters while taking full mission performance and constraints into account. This will improve current capabilities to assess impacts of electrified powertrain technologies on future aircraft designs.

Kenneth R. Lyons↗
NASA NTRSDate not supplied

Advancement of the General Aviation Synthesis Program Using Python to Enable Optimization-Based Hybrid-Propulsion Aircraft Design

In support of the Electrified Powertrain Flight Demonstrator and Advanced Air Transport Technologies projects at NASA, a new tool has been developed at NASA's Ames and Glenn Research Centers to enable coupled engine and airframe optimization and analysis. The new tool combines the engineering-level analysis methods and empirical models of the FORTRAN General Aviation Synthesis Program (GASP) with the Python-based OpenMDAO framework to provide a modular framework for efficient gradient-based optimization with the aim of incorporating new subsystem models for unconventional configurations. The tool has been verified against GASP analyses of several aircraft models and mission formulations. Preliminary efforts have been made to integrate pyCycle, a thermodynamic cycle analysis tool, to enable simultaneous optimization of hybrid propulsion system and vehicle parameters while taking full mission performance and constraints into account. This will improve current capabilities to assess impacts of electrified powertrain technologies on future aircraft designs.

Kenneth R Lyons↗
DOE OSTI2023

Verifying the Computational Integrity of Power Grid Controls with Zero-Knowledge Proof

The control of future power grids is migrating from a centralized to a distributed/decentralized scheme to enable a massive penetration of distributed energy resources with rising dependence on communication infrastructure. A common assumption made for most existing distributed/decentralized controllers is that local controllers would faithfully follow the designated controller dynamics based on the data received from communication channels. However, with increased probability of cyberattacks on Operational Technology infrastructure, such an assumption could be risky because proper execution of the controller dynamics is then built on trust in secure communication and computation. In this work, we leverage a cryptography technology known as zero-knowledge scalable transparent arguments of knowledge (zk-STARK) to verify the computational integrity of power grid control algorithms, with projected linear dynamics-based control schemes as the initial proof-of-concept test case. The method presented here converts the cybersecurity challenge of data integrity for grid control into a subset of computational integrity.

computational integrity↗
DOE OSTI2018

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗