Search NASA⌕ Search

SEARCH · Search NASA

Results for “penalty methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

A Higher Harmonic Optimal Controller to Optimise Rotorcraft Aeromechanical Behaviour

Three methods to optimize rotorcraft aeromechanical behavior for those cases where the rotorcraft plant can be adequately represented by a linear model system matrix were identified and implemented in a stand-alone code. These methods determine the optimal control vector which minimizes the vibration metric subject to constraints at discrete time points, and differ from the commonly used non-optimal constraint penalty methods such as those employed by conventional controllers in that the constraints are handled as actual constraints to an optimization problem rather than as just additional terms in the performance index. The first method is to use a Non-linear Programming algorithm to solve the problem directly. The second method is to solve the full set of non-linear equations which define the necessary conditions for optimality. The third method is to solve each of the possible reduced sets of equations defining the necessary conditions for optimality when the constraints are pre-selected to be either active or inactive, and then to simply select the best solution. The effects of maneuvers and aeroelasticity on the systems matrix are modelled by using a pseudo-random pseudo-row-dependency scheme to define the systems matrix. Cases run to date indicate that the first method of solution is reliable, robust, and easiest to use, and that it was superior to the conventional controllers which were considered.

Leyland, Jane Anne↗
NASA NTRS2014

High-Order Implicit-Explicit Multi-Block Time-stepping Method for Hyperbolic PDEs

This work seeks to explore and improve the current time-stepping schemes used in computational fluid dynamics (CFD) in order to reduce overall computational time. A high-order scheme has been developed using a combination of implicit and explicit (IMEX) time-stepping Runge-Kutta (RK) schemes which increases numerical stability with respect to the time step size, resulting in decreased computational time. The IMEX scheme alone does not yield the desired increase in numerical stability, but when used in conjunction with an overlapping partitioned (multi-block) domain significant increase in stability is observed. To show this, the Overlapping-Partition IMEX (OP IMEX) scheme is applied to both one-dimensional (1D) and two-dimensional (2D) problems, the nonlinear viscous Burger's equation and 2D advection equation, respectively. The method uses two different summation by parts (SBP) derivative approximations, second-order and fourth-order accurate. The Dirichlet boundary conditions are imposed using the Simultaneous Approximation Term (SAT) penalty method. The 6-stage additive Runge-Kutta IMEX time integration schemes are fourth-order accurate in time. An increase in numerical stability 65 times greater than the fully explicit scheme is demonstrated to be achievable with the OP IMEX method applied to 1D Burger's equation. Results from the 2D, purely convective, advection equation show stability increases on the order of 10 times the explicit scheme using the OP IMEX method. Also, the domain partitioning method in this work shows potential for breaking the computational domain into manageable sizes such that implicit solutions for full three-dimensional CFD simulations can be computed using direct solving methods rather than the standard iterative methods currently used.

Nielsen, Tanner B.↗
NASA NTRS1993

A multidomain spectral method for viscous compressible flows

We present a new multidomain spectral method for the solution of the compressible Navier-Stokes equations. In the subdomain interiors, Chebyshev spectral collocation is used. At interfaces, the advective terms are upwinded and the viscous terms are treated by a penalty method. The method is applied to the solution of a viscous hypersonic flow over a blunt body.

Kopriva, David A.↗
NASA NTRS1984

A numerical analysis of contact and limit-point behavior in a class of problems of finite elastic deformation

Finite element methods for the analysis of bifurcations, limit-point behavior, and unilateral frictionless contact of elastic bodies undergoing finite deformation are presented. Particular attention is given to the development and application of Riks-type algorithms for the analysis of limit points and exterior penalty methods for handling the unilateral constraints. Applications focus on the problem of finite axisymmetric deformations, snap-through, and inflation of thick rubber spherical shells.

Endo, T.↗
NASA NTRS1993

Reliability based structural optimization - A simplified safety index approach

A probabilistic optimal design methodology for complex structures modelled with finite element methods is presented. The main emphasis is on developing probabilistic analysis tools suitable for optimization. An advanced second-moment method is employed to evaluate the failure probability of the performance function. The safety indices are interpolated using the information at mean and most probable failure point. The minimum weight design with an improved safety index limit is achieved by using the extended interior penalty method of optimization. Numerical examples covering beam and plate structures are presented to illustrate the design approach. The results obtained by using the proposed approach are compared with those obtained by using the existing probabilistic optimization techniques.

Reddy, Mahidhar V.↗
NASA NTRS1994

Spectral solution of the viscous blunt body problem. 2: Multidomain approximation

We present steady solutions of high speed viscous flows over blunt bodies using a multidomain Chebyshev spectral collocation method. The region with the shock layer is divided into subdomains so that internal layers can be well-resolved. In the interiors of the subdomains, the solution is approximated by Chebyshev collocation. At interfaces between subdomains, the advective terms are upwinded and the viscous terms are treated by a penalty method. The method is applied to five flows, the Mach number range 5-25 and Reynolds number range 2,000 - 83,000, based on nose radius. Results are compared to experimental data and to a finite difference result.

Kopriva, David A.↗
NASA NTRS1993

Nonrecursive formulations of multibody dynamics and concurrent multiprocessing

Since the late 1980's, research in recursive formulations of multibody dynamics has flourished. Historically, much of this research can be traced to applications of low dimensionality in mechanism and vehicle dynamics. Indeed, there is little doubt that recursive order N methods are the method of choice for this class of systems. This approach has the advantage that a minimal number of coordinates are utilized, parallelism can be induced for certain system topologies, and the method is of order N computational cost for systems of N rigid bodies. Despite the fact that many authors have dismissed redundant coordinate formulations as being of order N(exp 3), and hence less attractive than recursive formulations, we present recent research that demonstrates that at least three distinct classes of redundant, nonrecursive multibody formulations consistently achieve order N computational cost for systems of rigid and/or flexible bodies. These formulations are as follows: (1) the preconditioned range space formulation; (2) penalty methods; and (3) augmented Lagrangian methods for nonlinear multibody dynamics. The first method can be traced to its foundation in equality constrained quadratic optimization, while the last two methods have been studied extensively in the context of coercive variational boundary value problems in computational mechanics. Until recently, however, they have not been investigated in the context of multibody simulation, and present theoretical questions unique to nonlinear dynamics. All of these nonrecursive methods have additional advantages with respect to recursive order N methods: (1) the formalisms retain the highly desirable order N computational cost; (2) the techniques are amenable to concurrent simulation strategies; (3) the approaches do not depend upon system topology to induce concurrency; and (4) the methods can be derived to balance the computational load automatically on concurrent multiprocessors. In addition to the presentation of the fundamental formulations, this paper presents new theoretical results regarding the rate of convergence of order N constraint stabilization schemes associated with the newly introduced class of methods.

Kurdila, Andrew J.↗
NASA NTRS1992

Stability of generally stiffened anisotropic noncircular cylinders

Continuous filament grid-stiffened structure is a stiffening concept that combines structural efficiency and damage tolerance. However, finite element design of such structures against buckling is expensive due to the complexities of the structure. An analytical model of such a structure is developed using a penalty method (artificial springs) with a first order shear deformation theory (FSDT). The buckling analysis under combined loadings is done using energy method with a penalty/Rayleigh-Ritz technique. The penalty/Rayleigh-Ritz approach is computationally less demanding when compared to the finite element solution and mesh generation. Apart from the published research works on buckling of stiffened plates and shells by finite element and finite strips, research works on buckling of stiffened plates and shells utilize three different approaches; smeared, column, and discrete approaches. The discrete approach considers the discrete effects of the stiffeners in the buckling behavior by modeling stiffeners as line of bending (EI) and torsion (GJ) stiffnesses on panel skin. Some local deformations are lost when stiffeners are modeled as (EI) and (GJ) stiffeners. This approach becomes difficult in the case of plate stiffened in more than two directions. Most of the work done using the discrete approach involved the Classical Plate Theory (CLPT) rather than the FSDT. We report on our formulation of a discrete approach coupled with a penalty formulation and FSDT.

Sobh, Nahil Atef↗
DOE OSTI2026

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↗
NASA NTRS1993

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↗
NASA NTRS1995

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.↗
NASA NTRS1995

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↗
NASA NTRS1973

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.↗
NASA NTRS1975

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.↗
DOE OSTI2025

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↗
NASA NTRS1989

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.↗
NASA NTRS1953

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.↗
NASA NTRS1985

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.↗