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 55 records · Page 3

FIRM: federated image reconstruction using multimodal tomographic data

Here, we propose a federated algorithm for reconstructing images using multimodal tomographic data sourced from dispersed locations, addressing the challenges of traditional unimodal approaches that are prone to noise and reduced image quality, as well as the limitations of centralized multimodal approaches that require extensive data transfer, leading to significant communication overhead, storage demands, and potential data privacy concerns. Our approach formulates a joint inverse optimization problem incorporating multimodality constraints and solves it in a federated framework through local gradient computations complemented by lightweight central operations, thereby ensuring data decentralization. Leveraging the connection between our federated algorithm and the quadratic penalty method, we introduce an adaptive step-size rule with guaranteed sublinear convergence. Numerical results demonstrate superior computational efficiency and improved image reconstruction quality compared to existing approaches.

federated algorithm↗

Physics constrained learning for data-driven inverse modeling from sparse observations

Deep neural networks (DNN) have been used to model nonlinear relations between physical quantities. Those DNNs are embedded in physical systems described by partial differential equations (PDE) and trained by minimizing a loss function that measures the discrepancy between predictions and observations in some chosen norm. This loss function often includes the PDE constraints as a penalty term when only sparse observations are available. As a result, the PDE is only satisfied approximately by the solution. However, the penalty term typically slows down the convergence of the optimizer for stiff problems. We present a new approach that trains the embedded DNNs while numerically satisfying the PDE constraints. We develop an algorithm that enables differentiating both explicit and implicit numerical solvers in reverse-mode automatic differentiation. This allows the gradients of the DNNs and the PDE solvers to be computed in a unified framework. We demonstrate that our approach enjoys faster convergence and better stability in relatively stiff problems compared to the penalty method. Furthermore, our approach allows for the potential to solve and accelerate a wide range of data-driven inverse modeling, where the physical constraints are described by PDEs and need to be satisfied accurately.

97 MATHEMATICS AND COMPUTING↗

Space Shuttle Main Engine performance analysis

For a number of years, NASA has relied primarily upon periodically updated versions of Rocketdyne's power balance model (PBM) to provide space shuttle main engine (SSME) steady-state performance prediction. A recent computational study indicated that PBM predictions do not satisfy fundamental energy conservation principles. More recently, SSME test results provided by the Technology Test Bed (TTB) program have indicated significant discrepancies between PBM flow and temperature predictions and TTB observations. Results of these investigations have diminished confidence in the predictions provided by PBM, and motivated the development of new computational tools for supporting SSME performance analysis. A multivariate least squares regression algorithm was developed and implemented during this effort in order to efficiently characterize TTB data. This procedure, called the 'gains model,' was used to approximate the variation of SSME performance parameters such as flow rate, pressure, temperature, speed, and assorted hardware characteristics in terms of six assumed independent influences. These six influences were engine power level, mixture ratio, fuel inlet pressure and temperature, and oxidizer inlet pressure and temperature. A BFGS optimization algorithm provided the base procedure for determining regression coefficients for both linear and full quadratic approximations of parameter variation. Statistical information relative to data deviation from regression derived relations was also computed. A new strategy for integrating test data with theoretical performance prediction was also investigated. The current integration procedure employed by PBM treats test data as pristine and adjusts hardware characteristics in a heuristic manner to achieve engine balance. Within PBM, this integration procedure is called 'data reduction.' By contrast, the new data integration procedure, termed 'reconciliation,' uses mathematical optimization techniques, and requires both measurement and balance uncertainty estimates. The reconciler attempts to select operational parameters that minimize the difference between theoretical prediction and observation. Selected values are further constrained to fall within measurement uncertainty limits and to satisfy fundamental physical relations (mass conservation, energy conservation, pressure drop relations, etc.) within uncertainty estimates for all SSME subsystems. The parameter selection problem described above is a traditional nonlinear programming problem. The reconciler employs a mixed penalty method to determine optimum values of SSME operating parameters associated with this problem formulation.

Santi, L. Michael↗

Sensitivity analysis of frictional contact response of axisymmetric composite structures

A computational procedure is presented for evaluating the sensitivity coefficients of the static frictional contact response of axisymmetric composite structures. The structures are assumed to consist of an arbitrary number of perfectly bonded homogeneous anisotropic layers. The material of each layer is assumed to be hyperelastic, and the effect of geometric nonlinearity is included. The sensitivity coefficients measure the sensitivity of the response variations in different material, lamination and geometric parameters of the structure. A displacement finite element model is used for the discretization. The normal contact conditions are incorporated into the formulation by using a perturbed Lagrangian approach with the fundamental unknowns consisting of nodal displacements, and Lagrange multipliers associated with the contact conditions. The Lagrange multipliers are allowed to be discontinuous at interelement boundaries. Tangential contact conditions are incorporated by using a penalty method in conjunction with the classical Coulomb's friction model. The Newton-Raphson iterative scheme is used for the solution of the resulting nonlinear algebraic equations, and for the determination of the contact region, contact conditions (sliding or sticking), and the contact pressures. The sensitivity coefficients are evaluated by using a direct differentiation approach. Numerical results are presented for the frictional contact of a composite spherical cap pressed against a rigid plate.

Karaoglan, I.↗

Dynamic sensitivity analysis of frictional contact/impact response of axisymmetric composite structures

A computational procedure is presented for evaluating the sensitivity coefficients of the dynamic frictional contact/impact response of axisymmetric composite structures. The structures are assumed to consist of an arbitrary number of perfectly bonded homogeneous anisotropic layers. The material of each layer is assumed to be hyperelastic, and the effect of geometric nonlinearity is included. The sensitivity coefficients measure the sensitivity of the response to variations in different material, lamination and geometric parameters of the structure. A displacement finite element model is used for the discretization. The normal contact conditions are incorporated into the formulation by using a perturbed Lagrangian approach with the fundamental unknowns consisting of the nodal displacements, and the Lagrange multipliers associated with the contact conditions. The Lagrange multipliers are allowed to be discontinuous at interelement boundaries. Tangential contact conditions are incorporated by using a penalty method in conjunction with the classical Coulomb's friction model. Temporal integration is performed by using Newmark method. The Newton-Raphson iterative scheme is used for the solution of the resulting nonlinear algebraic equations, and for the determination of the contact region, contact conditions (sliding or sticking), and the contact pressures. The sensitivity coefficients are evaluated by using a direct differentiation approach. Numerical results are presented from the frictional contact/impact response of a composite spherical cap impacting on a rigid plate.

Karaoglan, Levent↗

An historical survey of computational methods in optimal control.

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Polak, E.↗

Development of a method for optimal maneuver analysis of complex space missions

A system that allows mission planners to find optimal multiple-burn space trajectories easily is described. Previously developed methods with different gravity assumptions perform the optimization function. The power of these programs is extended by a method of costate estimation. A penalty function method of constraining coast arc times to be positive is included. The capability of the method is demonstrated by finding the optimal control for three different space missions. These include a shuttle abort-once-around mission and two- and three-burn geosynchronous satellite-placement missions.

Mcadoo, S. F., Jr.↗

Direct Discontinuous Galerkin methods for the reacting multi-component flow equations

The Direct Discontinuous Galerkin (DDG (Liu and Yan, 2008)) method and a counterpart with Interface Correction (DDGIC (Danis and Yan, 2022)) are extended to compute diffusion terms that arise when solving the compressible multi-component flow equations in thermochemical nonequilibrium. Thermodynamic properties, transport properties, chemical reaction rates, and energy exchange terms are computed using Mutation++ (Scoggins et al., 2020). The DG method is applied on unstructured grids, where the accuracy and convergence rates can be sensitive to the numerical method chosen for parabolic terms. A method for determining the homogeneity tensor of the flow equations required for DDGIC is shown. The convergence properties of the DDG methods are studied and compared to the Interior Penalty (IP) method. A number of numerical experiments are conducted to assess the accuracy and performance of the method. The numerical results and convergence studies indicate that DDG and DDGIC provide accurate solutions and perform well for general flows in thermochemical nonequilibrium.

Diffusion↗

An indirect method for numerical optimization using the Kreisselmeir-Steinhauser function

A technique is described for converting a constrained optimization problem into an unconstrained problem. The technique transforms one of more objective functions into reduced objective functions, which are analogous to goal constraints used in the goal programming method. These reduced objective functions are appended to the set of constraints and an envelope of the entire function set is computed using the Kreisselmeir-Steinhauser function. This envelope function is then searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. Advantages of this approach are the use of unconstrained optimization methods to find a constrained minimum without the draw down factor typical of penalty function methods, and that the technique may be started from the feasible or infeasible design space. In multiobjective applications, the approach has the advantage of locating a compromise minimum design without the need to optimize for each individual objective function separately.

Wrenn, Gregory A.↗

Icing Protection for a Turbojet Transport Airplane: Heating Requirements, Methods of Protection, and Performance Penalties

The problems associated with providing icing protection for the critical components of a typical turbojet transport airplane operating over a range of probable icing conditions are analyzed and discussed. Heating requirements for several thermal methods of protection are evaluated and the airplane performance penalties associated with providing this protection from various energy sources are assessed. The continuous heating requirements for icing protection and the associated airplane performance penalties for the turbojet transport are considerably increased over those associated with lower-speed aircraft. Experimental results show that the heating requirements can be substantially reduced by the deve1opment of a satisfactory cyclic deicing system. The problem of providing protection can be minimized by employing a proper energy source since the airplane performance penalties vary considerably with the source of energy employed. The optimum icing protection system for the turbojet transport or for any other particular aircraft cannot be generally specified; the choice of the optimum system is dependent upon the specific characteristics of the airplane and engine, the flight plan, the probable icing conditions, and the performance requirements of the aircraft.

Gelder, Thomas F.↗

Constrained optimization for image restoration using nonlinear programming

The constrained optimization problem for image restoration, utilizing incomplete information and partial constraints, is formulated using nonlinear proramming techniques. This method restores a distorted image by optimizing a chosen object function subject to available constraints. The penalty function method of nonlinear programming is used. Both linear or nonlinear object function, and linear or nonlinear constraint functions can be incorporated in the formulation. This formulation provides a generalized approach to solve constrained optimization problems for image restoration. Experiments using this scheme have been performed. The results are compared with those obtained from other restoration methods and the comparative study is presented.

Yeh, C.-L.↗

Ephemeral penalty functions for contact-impact dynamics

The use of penalty functions to treat a class of structural contact-impact problems is investigated, with emphasis on ones in which the impact phenomena are primarily nondestructive in nature and in which only the gross characterization of the response is required. The dynamic equations of motion are integrated by the difference method. The penalty is represented as an ephemeral fictitious nonlinear spring that is inserted on anticipation of contact. The magnitude and variation of the penalty force is determined through energy balancing considerations. The 'bell shape' of the penalty force function for positive gap was found to be satisfactory, as it depends on only two parameters that can be directly assigned the physical meaning of force and distance. The determination of force law parameters by energy balance worked well. The incorporation of restitution coefficients by the area balancing method yielded excellent results, and no substantial modifications are anticipated. Extensional penalty springs are obviously sufficient for the simple examples treated.

De La Fuente, Horacio M.↗

Very Large Scale Optimization

The purpose of this research under the NASA Small Business Innovative Research program was to develop algorithms and associated software to solve very large nonlinear, constrained optimization tasks. Key issues included efficiency, reliability, memory, and gradient calculation requirements. This report describes the general optimization problem, ten candidate methods, and detailed evaluations of four candidates. The algorithm chosen for final development is a modern recreation of a 1960s external penalty function method that uses very limited computer memory and computational time. Although of lower efficiency, the new method can solve problems orders of magnitude larger than current methods. The resulting BIGDOT software has been demonstrated on problems with 50,000 variables and about 50,000 active constraints. For unconstrained optimization, it has solved a problem in excess of 135,000 variables. The method includes a technique for solving discrete variable problems that finds a "good" design, although a theoretical optimum cannot be guaranteed. It is very scalable in that the number of function and gradient evaluations does not change significantly with increased problem size. Test cases are provided to demonstrate the efficiency and reliability of the methods and software.

Vanderplaats, Garrett↗

A family of independent Variable Eddington Factor methods with efficient preconditioned iterative solvers

We present a family of discretizations for the Variable Eddington Factor (VEF) equations that have high-order accuracy on curved meshes and efficient preconditioned iterative solvers. The VEF discretizations are combined with the Discontinuous Galerkin transport discretization from to form effective high-order, linear transport methods. The VEF discretizations are derived by extending the unified analysis of Discontinuous Galerkin methods for elliptic problems presented by Arnold et al. to the VEF equations. This framework is used to define analogs of the interior penalty, second method of Bassi and Rebay, minimal dissipation local Discontinuous Galerkin, and continuous finite element methods. The analysis of subspace correction preconditioners, which use a continuous operator to iteratively precondition the discontinuous discretization, is extended to the case of the non-symmetric VEF system. Numerical results demonstrate that the VEF discretizations have arbitrary-order accuracy on curved meshes, preserve the thick diffusion limit, and are effective on a proxy problem from thermal radiative transfer in both outer transport iterations and inner preconditioned linear solver iterations. We demonstrate that the VEF solution converges to the S N transport solution as the mesh is refined on both problems with smooth and non-smooth behavior in angle. Parallel performance studies show that the interior penalty VEF discretization's linear solve weak scales out to 1024 processors and strong scales well on a single node. Particular attention is paid to the parallel performance of the VEF algorithm when used in combination with a parallel block Jacobi transport sweep.

97 MATHEMATICS AND COMPUTING↗

Simulating Space Capsule Water Landing with Explicit Finite Element Method

A study of using an explicit nonlinear dynamic finite element code for simulating the water landing of a space capsule was performed. The finite element model contains Lagrangian shell elements for the space capsule and Eulerian solid elements for the water and air. An Arbitrary Lagrangian Eulerian (ALE) solver and a penalty coupling method were used for predicting the fluid and structure interaction forces. The space capsule was first assumed to be rigid, so the numerical results could be correlated with closed form solutions. The water and air meshes were continuously refined until the solution was converged. The converged maximum deceleration predicted is bounded by the classical von Karman and Wagner solutions and is considered to be an adequate solution. The refined water and air meshes were then used in the models for simulating the water landing of a capsule model that has a flexible bottom. For small pitch angle cases, the maximum deceleration from the flexible capsule model was found to be significantly greater than the maximum deceleration obtained from the corresponding rigid model. For large pitch angle cases, the difference between the maximum deceleration of the flexible model and that of its corresponding rigid model is smaller. Test data of Apollo space capsules with a flexible heat shield qualitatively support the findings presented in this paper.

Wang, John T.↗

Consistent Second Moment Methods with Scalable Linear Solvers for Radiation Transport

Second moment methods (SMMs) are developed that are consistent with the discontinuous Galerkin spatial discretization of the discrete ordinates (or S\(_N\)) transport equations. The low-order (LO) diffusion system of equations is discretized with fully consistent P\(_1\), local discontinuous Galerkin (LDG), and interior penalty (IP) methods. A discrete residual approach is used to derive SMM correction terms that make each of the LO systems consistent with the high-order discretization. We show that the consistent methods are more accurate and have better solution quality than independently discretized LO systems, that they preserve the diffusion limit, and that the LDG and IP consistent SMMs can be scalably solved in parallel on a challenging, multimaterial benchmark problem.

97 MATHEMATICS AND COMPUTING↗

ACCESS 3. Approximation concepts code for efficient structural synthesis: User's guide

A user's guide is presented for ACCESS-3, a research oriented program which combines dual methods and a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and dual algorithms of mathematical programming are applied in the design optimization procedure. This program retains all of the ACCESS-2 capabilities and the data preparation formats are fully compatible. Four distinct optimizer options were added: interior point penalty function method (NEWSUMT); second order primal projection method (PRIMAL2); second order Newton-type dual method (DUAL2); and first order gradient projection-type dual method (DUAL1). A pure discrete and mixed continuous-discrete design variable capability, and zero order approximation of the stress constraints are also included.

Fleury, C.↗

CFD assessment of the carbon monoxide and nitric oxide formation from RD-170 hot-fire testing at MSFC

Computational Fluid Dynamics (CFD) technology has been used to assess the exhaust plume pollutant environment of the RD-170 engine hot-firing on the F1 Test Stand at Marshall Space Flight Center. Researchers know that rocket engine hot-firing has the potential for forming thermal nitric oxides (NOx), as well as producing carbon monoxide (CO) when hydrocarbon fuels are used. Because of the complicated physics involved, however, little attempt has been made to predict the pollutant emissions from ground-based engine testing, except for simplified methods which can grossly underpredict and/or overpredict the pollutant formations in a test environment. The objective of this work, therefore, has been to develop a technology using CFD to describe the underlying pollutant emission physics from ground-based rocket engine testing. This resultant technology is based on a three-dimensional, viscous flow, pressure-based CFD formulation, where wet CO and thermal NOx finite-rate chemistry mechanisms are solved with a Penalty function method.

Wang, Ten-See↗