The Similarity Structure Function Lagrangian CFD and the Finite Scale Theory
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗
SEARCH · Search NASA
Results for “Lagrangian function”
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.
Research on an augmented Lagrangian penalty function algorithm for nonlinear programming
The augmented Lagrangian (ALAG) Penalty Function Algorithm for optimizing nonlinear mathematical models is discussed. The mathematical models of interest are deterministic in nature and finite dimensional optimization is assumed. A detailed review of penalty function techniques in general and the ALAG technique in particular is presented. Numerical experiments are conducted utilizing a number of nonlinear optimization problems to identify an efficient ALAG Penalty Function Technique for computer implementation.
Frair, L.↗
Application of Lagrangian blending functions for grid generation around airplane geometries
A simple procedure was developed and applied for the grid generation around an airplane geometry. This approach is based on a transfinite interpolation with Lagrangian interpolation for the blending functions. A monotonic rational quadratic spline interpolation was employed for the grid distributions.
Abolhassani, Jamshid S.↗
Applications of Lagrangian blending functions for grid generation around airplane geometries
A simple procedure has been developed and applied for the grid generation around an airplane geometry. This approach is based on a transfinite interpolation with Lagrangian interpolation for the blending functions. A monotonic rational quadratic spline interpolation has been employed for the grid distributions.
Abolhassani, Jamshid S.↗
Lagrangian methods in plasma dynamics. II - Construction of Lagrangians for plasmas
Consideration of the construction of suitable Lagrangian functions for the dynamics of a cold plasma in such a way as to retain the relativistically covariant formalism. In one method, this is achieved by the introduction of a set of three variables which label the world lines of the particles. A second method results in a Clebsch-type representation. Sturrock's relativistic Lagrangian and Low's hot plasma Lagrangian are also briefly discussed in the context of the present work. The behavior of the canonical stress tensor is considered. The applicability of many of the general results in part I (Dougherty, 1970) is ensured by establishing the existence of the Lagrangian function.
Dougherty, J. P.↗
Application of Lagrangian blending functions for grid generation around airplane geometries
Explore the source record for details and available documents.
Samareh-Abolhassani, Jamshid↗
Distributed Constrained Optimization with Semicoordinate Transformations
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used to solve constrained optimization problems. This is done by translating the problem into an iterated game, where each agent controls a different variable of the problem, so that the joint probability distribution across the agents moves gives an expected value of the objective function. The dynamics of the agents is designed to minimize a Lagrangian function of that joint distribution. Here we illustrate how the updating of the Lagrange parameters in the Lagrangian is a form of automated annealing, which focuses the joint distribution more and more tightly about the joint moves that optimize the objective function. We then investigate the use of "semicoordinate" variable transformations. These separate the joint state of the agents from the variables of the optimization problem, with the two connected by an onto mapping. We present experiments illustrating the ability of such transformations to facilitate optimization. We focus on the special kind of transformation in which the statistically independent states of the agents induces a mixture distribution over the optimization variables. Computer experiment illustrate this for &sat constraint satisfaction problems and for unconstrained minimization of NK functions.
Macready, William↗
Efficient approximation concepts using second order information
The application of second derivative information for solving structural optimization problems is considered. In the present method, rather than building approximate nonlinear forms for the objective function and constraints, only linear approximations are used. A separable quadratic approximation of the Lagrangian function is included in the subproblem statement. The method has been successfully used for simple problems that can be solved in closed form, in addition to the sizing optimization of trusses, and it is shown to converge faster than the convex linearization method or the method of moving asymptotes.
Fleury, Claude↗
Admitting the Inadmissible: Adjoint Formulation for Incomplete Cost Functionals in Aerodynamic Optimization
We derive the adjoint equations for problems in aerodynamic optimization which are improperly considered as "inadmissible." For example, a cost functional which depends on the density, rather than on the pressure, is considered "inadmissible" for an optimization problem governed by the Euler equations. We show that for such problems additional terms should be included in the Lagrangian functional when deriving the adjoint equations. These terms are obtained from the restriction of the interior PDE to the control surface. Demonstrations of the explicit derivation of the adjoint equations for "inadmissible" cost functionals are given for the potential, Euler, and Navier-Stokes equations.
Arian, Eyal↗
Three-dimensional relativistic field-electron interaction in a multicavity high-power klystron. 1: Basic theory
A theoretical investigation of three dimensional relativistic klystron action is described. The relativistic axisymmetric equations of motion are derived from the time-dependent Lagrangian function for a charged particle in electromagnetic fields. An analytical expression of the fringing RF electric and magnetic fields within and in the vicinity of the interaction gap and the space-charge forces between axially and radially elastic deformable rings of charges are both included in the formulation. This makes an accurate computation of electron motion through the tunnel of the cavities and the drift tube spaces possible. Method of analysis is based on Lagrangian formulation. Bunching is computed using a disk model of electron stream in which the electron stream is divided into axisymmetric disks of equal charge and each disk is assumed to consist of a number of concentric rings of equal charges. The Individual representative groups of electrons are followed through the interaction gaps and drift tube spaces. Induced currents and voltages in interacting cavities are calculated by invoking the Shockley-Ramo theorem.
Kosmahl, H. G.↗
Spatially homogeneous rotating world models.
The mathematical problem encountered when looking for the simplest expanding and rotating model of the universe without the compactness condition for the space sections is formulated. The Lagrangian function is derived for four different rotating universes simultaneously. These models correspond in a certain sense to Godel's (1950) ?symmetric case.'
Ozsvath, I.↗
Conservation of wave action
It is pointed out that two basic principles appear in the theory of wave propagation, including the existence of a phase variable and a law governing the intensity, in terms of a conservation law. The concepts underlying such a conservation law are explored. The waves treated are conservative in the sense that they obey equations derivable from a variational principle applied to a Lagrangian functional. A discrete oscillating system is considered. The approach employed also permits in a natural way the definition of a local action density and flux in problems in which the waves are modal or general.
Hayes, W. D.↗
Optimality criteria solution strategies in multiple constraint design optimization
Procedures and solution strategies are described to solve the conventional structural optimization problem using the Lagrange multiplier technique. The multipliers, obtained through solution of an auxiliary nonlinear optimization problem, lead to optimality criteria to determine the design variables. It is shown that this procedure is essentially equivalent to an alternative formulation using a dual method Lagrangian function objective. Although mathematical formulations are straight-forward, successful applications and computational efficiency depend upon execution procedure strategies. Strategies examined, with application examples, include selection of active constraints, move limits, line search procedures, and side constraint boundaries.
Levy, R.↗
The augmented Lagrangian method for parameter estimation in elliptic systems
In this paper a new technique for the estimation of parameters in elliptic partial differential equations is developed. It is a hybrid method combining the output-least-squares and the equation error method. The new method is realized by an augmented Lagrangian formulation, and convergence as well as rate of convergence proofs are provided. Technically the critical step is the verification of a coercivity estimate of an appropriately defined Lagrangian functional. To obtain this coercivity estimate a seminorm regularization technique is used.
Ito, Kazufumi↗
A superlinear interior points algorithm for engineering design optimization
We present a quasi-Newton interior points algorithm for nonlinear constrained optimization. It is based on a general approach consisting of the iterative solution in the primal and dual spaces of the equalities in Karush-Kuhn-Tucker optimality conditions. This is done in such a way to have primal and dual feasibility at each iteration, which ensures satisfaction of those optimality conditions at the limit points. This approach is very strong and efficient, since at each iteration it only requires the solution of two linear systems with the same matrix, instead of quadratic programming subproblems. It is also particularly appropriate for engineering design optimization inasmuch at each iteration a feasible design is obtained. The present algorithm uses a quasi-Newton approximation of the second derivative of the Lagrangian function in order to have superlinear asymptotic convergence. We discuss theoretical aspects of the algorithm and its computer implementation.
Herskovits, J.↗
Lorentz-covariant dissipative Lagrangian systems
The concept of dissipative Hamiltonian system is converted to Lorentz-covariant form, with evolution generated jointly by two scalar functionals, the Lagrangian action and the global entropy. A bracket formulation yields the local covariant laws of energy-momentum conservation and of entropy production. The formalism is illustrated by a derivation of the covariant Landau kinetic equation.
Kaufman, A. N.↗
Ergodic Lagrangian dynamics in a superhero universe
We present a fictional scenario that, while undeniably whimsical, provides the foundation for a unique exercise in extended problem solving, physics analysis, and quantitative model development. Starting with the foundational premise of the Wild Cards shared-world superhero universe, we demonstrate how a variety of concepts appropriate to the advanced undergraduate level—ergodicity, functional analysis, Lagrangian mechanics, and the ever-important simplifying approximation—can be combined into a rich, coherent mathematical model. The goal of this case study is to develop a useful pedagogical exercise in exploring an open-ended research question that presents, at first glance, no clear path forward. Being both eclectic and lengthy, this exercise offers a unique way for students to apply their core physics and mathematics education. It is perhaps best used within a senior honors seminar or within a brief (e.g., January term) elective class.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management
Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.
24 POWER TRANSMISSION AND DISTRIBUTION↗