Search NASA⌕ Search

SEARCH · Search NASA

Results for “Penalty 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 163 records · Page 9

Data-Driven PMU Noise Emulation Framework using Gradient-Penalty-Based Wasserstein GAN

Availability of phasor measurement unit (PMUs) data has led to research on data-driven algorithms for event monitoring, control and ensuring stability of the grid. Unavailability of infrequent critical event field PMU data with component failures is driving the need to generate realistic synthetic PMU data for research. The synthetic data from power system simulation software often neglect noise profiles of received phasors, thus creating some discrepancies between real PMU data and synthetic ones. To address this issue, this work presents an initial study on the noise characteristics of PMUs, as well as presenting models for recreating their unique noise signatures. The proposed method, utilizing the Wasserstein generative adversarial network with gradient penalty (WGAN-GP) architecture, provides an excellent benchmark for matching the noise distribution. One can use a well-learned GAN model to draw noise signatures from a distribution that seemingly mirrors the real PMU noise distribution, while also being able to be detached from the PMU data once the training is done. Based on the observed results and employed data-driven methodology, it is expected that the proposed methods can be adapted to replicate the behavior of other sensors, providing research and other applications with a tool for data synthesis and sensor characterization.

PMU↗

Aircraft wing weight build-up methodology with modification for materials and construction techniques

An aircraft wing weight estimating method based on a component buildup technique is described. A simplified analytically derived beam model, modified by a regression analysis, is used to estimate the wing box weight, utilizing a data base of 50 actual airplane wing weights. Factors representing materials and methods of construction were derived and incorporated into the basic wing box equations. Weight penalties to the wing box for fuel, engines, landing gear, stores and fold or pivot are also included. Methods for estimating the weight of additional items (secondary structure, control surfaces) have the option of using details available at the design stage (i.e., wing box area, flap area) or default values based on actual aircraft from the data base.

York, P.↗

Overcoming the Entropy Penalty of Direct Air Capture for Efficient Gigatonne Removal of Carbon Dioxide

Atmospheric carbon poses an existential threat to civilization via global climate change. Hundreds of gigatonnes of carbon dioxide must be removed from earth’s atmosphere in the next three decades, necessitating a low-cost, energy-efficient process to extract low concentrations of carbon dioxide for conversion to a stable material permanently stored for thousands of years. In this work, the challenge of removing gigatonnes of CO 2 is described via the scale of effort and the thermodynamics of collecting and reducing this diffuse chemical, the accumulation of which imparts a substantial entropy penalty on any atmospheric carbon capture process. The methods of CO 2 reduction combined with upstream direct air capture (DAC) including absorption, membrane separation, and adsorption are compared with biomass torrefaction and permanent burial (BTB). A Monte Carlo model assesses the mass, energy, and economics of the full process of biomass torrefaction from biomass collection and transport to stable carbon burial to determine that 95% of scenarios could remove carbon for less than $200 per CO 2 -tonne-equivalent. Torrefied carbon is further discussed for its long-term stability and availability at the scale required to substantially mitigate the threat of climate change.

biomass↗

Single-channel and single-energy partial-wave analysis with continuity improved through minimal phase constraints

Single-energy partial-wave analysis has often been applied as a way to fit data with minimal model dependence. However, remaining unconstrained, partial waves at neighboring energies will vary discontinuously because the overall amplitude phase cannot be determined through single-channel measurements. This problem can be mitigated through the use of a constraining penalty function based on an associated energy-dependent fit. However, the weight given to this constraint results in a biased fit to the data. In this paper, for the first time, we explore a constraining function which does not influence the fit to data. The constraint comes from the overall phase found in multichannel fits which, in the present study, are the Bonn-Gatchina and Jülich-Bonn multichannel analyses. The data are well reproduced and weighting of the penalty function does not influence the result. The method is applied to K⁢Λ photoproduction data and all observables can be maximally well reproduced. While the employed multichannel analyses display very different multipole amplitudes, we show that the major difference between two sets of multipoles can be related to the different overall phases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hybridized Methods for Quantum Simulation in the Interaction Picture

Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic advantages for some Hamiltonians, but incurs prohibitive constant factors and is incompatible with methods like qubitization. We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations over known algorithms. These approaches show asymptotic improvements over the individual methods that comprise them and further make interaction picture simulation methods practical in the near term. Physical applications of these hybridized methods yield a gate complexity scaling as log 2 ⁡ Λ in the electric cutoff Λ for the Schwinger Model and independent of the electron density for collective neutrino oscillations, outperforming the scaling for all current algorithms with these parameters. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter λ used to impose an energy cost on time-evolution into an unphysical subspace.

97 MATHEMATICS AND COMPUTING↗

Numerical method for design of minimum-drag supersonic wing camber with constraints on pitching moment and surface deformation

A numerical method, based on linearized theory, for designing minimum-drag supersonic wing camber surfaces of arbitrary planform for a given lift, with options for constraining the pitching moment and/or the surface deformation at the trailing edge of the root chord and for selecting any desired combination of eight specified wing-loading distributions to be employed in the optimization procedure is presented. Two examples are given to illustrate applications of the method. The results indicate that relatively small drag penalties are incurred in designing wings to be self-trimming and to have a reasonable camber surface.

Sorrells, R. B.↗

Low-Order Preconditioning for the High-Order Finite Element de Rham Complex

Here, we present a unified framework for constructing spectrally equivalent low-order-refined discretizations for the high-order finite element de Rham complex. This theory covers diffusion problems in H 1 , H(curl), and H(div) and is based on combining a low-order discretization posed on a refined mesh with a high-order basis for Nédélec and Raviart–Thomas elements that makes use of the concept of polynomial histopolation (polynomial fitting using prescribed mean values over certain regions). This spectral equivalence, coupled with algebraic multigrid methods constructed using the low-order discretization, results in highly scalable matrix-free preconditioners for high-order finite element problems in the full de Rham complex. Additionally, a new lowest-order (piecewise constant) preconditioner is developed for high-order interior penalty discontinuous Galerkin (DG) discretizations, for which spectral equivalence results and convergence proofs for algebraic multigrid methods are provided. In all cases, the spectral equivalence results are independent of polynomial degree and mesh size; for DG methods, they are also independent of the penalty parameter. These new solvers are flexible and easy to use; any “black-box” preconditioner for low-order problems can be used to create an effective and efficient preconditioner for the corresponding high-order problem. A number of numerical experiments are presented, based on an implementation in the finite element library MFEM. A range of challenging three-dimensional problems are used to corroborate the theoretical properties and demonstrate the flexibility and scalability of the method.

97 MATHEMATICS AND COMPUTING↗

Estimating Sparse Direct Effects in Multivariate Regression With the Spike-and-Slab LASSO

The multivariate regression interpretation of the Gaussian chain graph model simultaneously parametrizes (i) the direct effects of p predictors on q outcomes and (ii) the residual partial covariances between pairs of outcomes. We introduce a new method for fitting sparse versions of these models with spike-and-slab LASSO (SSL) priors. We develop an Expectation Conditional Maximization algorithm to obtain sparse estimates of the p × q matrix of direct effects and the q × q residual precision matrix. Our algorithm iteratively solves a sequence of penalized maximum likelihood problems with self-adaptive penalties that gradually filter out negligible regression coefficients and partial covariances. Because it adaptively penalizes individual model parameters, our method is seen to outperform fixed-penalty competitors on simulated data. We establish the posterior contraction rate for our model, buttressing our method’s excellent empirical performance with strong theoretical guarantees. Using our method, we estimated the direct effects of diet and residence type on the composition of the gut microbiome of elderly adults.

EM algorithm↗

Adjoint Techniques for Topology Optimization of Structures Under Damage Conditions

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation (Haftka and Gurdal, 1992) in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers (Akgun et al., 1998a and 1999). It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages (Haftka et al., 1983). A common method for topology optimization is that of compliance minimization (Bendsoe, 1995) which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system.. Shennan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this (Akgun et al., 1998b). SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗

A two-level controller design approach for large space structures

A controller design approach is proposed for large space structures (LSS) using an Annular Momentum Control Device (AMCD). The controller consists of a primary attitude controller and a secondary or modal damping enhancement controller. It is proved that the LSS/AMCD system using the proposed damping enhancement controller is stable in the sense of Lyapunov regardless of the number of modes in the model and without the necessity of precise knowledge of the modal frequencies and mode shapes. Numerical results obtained for the secondary controller design for a large thin flat plate indicate that the proposed method can yield satisfactory damping enhancement with small weight penalty.

Joshi, S. M.↗

Resolving local ordering and structure in Mn x Ge 1- x Te alloys through thermodynamic ensembles of pair distribution functions

Characterizing local bonding environments in complex materials is essential for understanding and optimizing their properties. Equally as important is the ability to predict local motifs as a function of synthesis conditions, enhancing chemists’ ability to design properties into materials. In this study, we present an approach to leverage statistical mechanics to generate temperature- and energy-informed ensemble averaged pair distribution functions (PDFs). This method, which we have named Thermodynamic Ensemble Averages of PDFs for Ordering and Transformations (TEAPOT), utilizes density functional theory (DFT) to relax supercells while incorporating energetic penalties for local order, enabling accurate and computationally efficient analysis of local structure. We apply this method to the neutron PDF measurements of the pseudobinary MnTe–GeTe (MGT) alloy, demonstrating its capability to resolve complex local distortions and chemical ordering. Our results reveal detailed insights into phase transformations and local distortions driven by Mn substitution. For compositions that globally present as rock salt, our analysis reveals that Ge coordination geometry is heavily impacted by synthesis temperature. We propose that high temperature synthesis conditions promote a lowered Ge polyhedra distortion, promoting high charge carrier mobility due to the alignment of local and global structure. Incorporating statistical mechanics and computation into experimental analysis thus guides synthesis of tailored local structure.

36 MATERIALS SCIENCE↗

Real-time optimal guidance for orbital maneuvering.

A new formulation for soft-constraint trajectory optimization is presented as a real-time optimal feedback guidance method for multiburn orbital maneuvers. Control is always chosen to minimize burn time plus a quadratic penalty for end condition errors, weighted so that early in the mission (when controllability is greatest) terminal errors are held negligible. Eventually, as controllability diminishes, the method partially relaxes but effectively still compensates perturbations in whatever subspace remains controllable. Although the soft-constraint concept is well-known in optimal control, the present formulation is novel in addressing the loss of controllability inherent in multiple burn orbital maneuvers. Moreover the necessary conditions usually obtained from a Bolza formulation are modified in this case so that the fully hard constraint formulation is a numerically well behaved subcase. As a result convergence properties have been greatly improved.

Cohen, A. O.↗

Regression Based Approach for Robust Finite Element Analysis on Arbitrary Grids. LDRD Final Report

This report summarizes the work performed under a one-year LDRD project aiming to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. In this project, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality. At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5x improvement in accuracy and allows for taking an 8x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method. The report concludes with a brief summary of ongoing projects and collaborations that utilize or extend the products of this work.

97 MATHEMATICS AND COMPUTING↗

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗

Deep discharge reconditioning: Pros and cons

Deep-discharge reconditioning (DDR) can be of great benefit to battery performance, especially in geosynchronous orbit, if performed properly and regularly, and can be essential to operation of batteries at the high depths of discharge (DOD) required to minimize weight. The procedure should be tailored to fit the nature of the degradation occuring during regular cycling. DDR is not without its drawbacks, however, and these differ depending on the normal DOD to be sustained and/or whether the discharge is done at the battery or the cell level. Battery-level discharge carries the minimum weight penalty but raises questions of the effects of low-rate cell reversal that as yet have no firm answers. Cell level discharge avoids cell reversal but carries significant penalties of weight and complexity. Thus no universal procedure or method of implementation of deep-discharge reconditioning is now available and thus the various approaches must be evaluated for each application.

Scott, W. R.↗

Water management requirements for animal and plant maintenance on the Space Station

Long-duration Space Station experiments that use animals and plants as test specimens will require increased automation and advanced technologies for water management in order to free scientist-astronauts from routine but time-consuming housekeeping tasks. The three areas that have been identified as requiring water management and that are discusseed are: (1) drinking water and humidity condensate of the animals, (2) nutrient solution and transpired water of the plants, and (3) habitat cleaning methods. Automation potential, technology assessment, crew time savings, and resupply penalties are also discussed.

Johnson, C. C.↗

Multiplier-continuation algorthms for constrained optimization

Several path following algorithms based on the combination of three smooth penalty functions, the quadratic penalty for equality constraints and the quadratic loss and log barrier for inequality constraints, their modern counterparts, augmented Lagrangian or multiplier methods, sequential quadratic programming, and predictor-corrector continuation are described. In the first phase of this methodology, one minimizes the unconstrained or linearly constrained penalty function or augmented Lagrangian. A homotopy path generated from the functions is then followed to optimality using efficient predictor-corrector continuation methods. The continuation steps are asymptotic to those taken by sequential quadratic programming which can be used in the final steps. Numerical test results show the method to be efficient, robust, and a competitive alternative to sequential quadratic programming.

Lundberg, Bruce N.↗