Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Lagrange functions”

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 73 records · Page 4

Computational methods for frictional contact with applications to the Space Shuttle orbiter nose-gear tire: Comparisons of experimental measurements and analytical predictions

A computational procedure is presented for the solution of frictional contact problems for aircraft tires. A Space Shuttle nose-gear tire is modeled using a two-dimensional laminated anisotropic shell theory which includes the effects of variations in material and geometric parameters, transverse-shear deformation, and geometric nonlinearities. Contact conditions are incorporated into the formulation by using a perturbed Lagrangian approach with the fundamental unknowns consisting of the stress resultants, the generalized displacements, and the Lagrange multipliers associated with both contact and friction conditions. The contact-friction algorithm is based on a modified Coulomb friction law. A modified two-field, mixed-variational principle is used to obtain elemental arrays. This modification consists of augmenting the functional of that principle by two terms: the Lagrange multiplier vector associated with normal and tangential node contact-load intensities and a regularization term that is quadratic in the Lagrange multiplier vector. These capabilities and computational features are incorporated into an in-house computer code. Experimental measurements were taken to define the response of the Space Shuttle nose-gear tire to inflation-pressure loads and to inflation-pressure loads combined with normal static loads against a rigid flat plate. These experimental results describe the meridional growth of the tire cross section caused by inflation loading, the static load-deflection characteristics of the tire, the geometry of the tire footprint under static loading conditions, and the normal and tangential load-intensity distributions in the tire footprint for the various static vertical-loading conditions. Numerical results were obtained for the Space Shuttle nose-gear tire subjected to inflation pressure loads and combined inflation pressure and contact loads against a rigid flat plate. The experimental measurements and the numerical results are compared.

Tanner, John A.↗

Airfoil Design and Optimization by the One-Shot Method

An efficient numerical approach for the design of optimal aerodynamic shapes is presented in this paper. The objective of any optimization problem is to find the optimum of a cost function subject to a certain state equation (governing equation of the flow field) and certain side constraints. As in classical optimal control methods, the present approach introduces a costate variable (Lagrange multiplier) to evaluate the gradient of the cost function. High efficiency in reaching the optimum solution is achieved by using a multigrid technique and updating the shape in a hierarchical manner such that smooth (low-frequency) changes are done separately from high-frequency changes. Thus, the design variables are changed on a grid where their changes produce nonsmooth (high-frequency) perturbations that can be damped efficiently by the multigrid. The cost of solving the optimization problem is approximately two to three times the cost of the equivalent analysis problem.

Kuruvila, G.↗

Bit threads in higher-curvature gravity

We generalize holographic bit threads to bulk theories with a gravitational action containing higher-curvature terms. Bit threads are a reformulation of holographic entanglement entropy, where the entropy is given by the maximum number of threads emanating from a boundary region into the bulk. We show that the addition of higher-curvature terms adds corrections to the bit thread thickness that depend on the local geometry and thread orientation. Two different methods are given: determination of the density bound by requiring the maximum number of threads through a given surface to reproduce the entanglement entropy functional on that surface, and application of Lagrange dualization. The results of the two methods are applied to Gauss-Bonnet gravity as the simplest non-trivial example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The effects of intrinsic noise on the behaviour of bistable cell regulatory systems under quasi-steady state conditions

We analyse the effect of intrinsic fluctuations on the properties of bistable stochastic systems with time scale separation operating under quasi-steady state conditions. We first formulate a stochastic generalisation of the quasi-steady state approximation based on the semi-classical approximation of the partial differential equation for the generating function associated with the chemical master equation. Such approximation proceeds by optimising an action functional whose associated set of Euler-Lagrange (Hamilton) equations provides the most likely fluctuation path. We show that, under appropriate conditions granting time scale separation, the Hamiltonian can be re-scaled so that the set of Hamilton equations splits up into slow and fast variables, whereby the quasi-steady state approximation can be applied. We analyse two particular examples of systems whose mean-field limit has been shown to exhibit bi-stability: an enzyme-catalysed system of two mutually inhibitory proteins and a gene regulatory circuit with self-activation. Our theory establishes that the number of molecules of the conserved species is order parameters whose variation regulates bistable behaviour in the associated systems beyond the predictions of the mean-field theory. This prediction is fully confirmed by direct numerical simulations using the stochastic simulation algorithm. This result allows us to propose strategies whereby, by varying the number of molecules of the three conserved chemical species, cell properties associated to bistable behaviour (phenotype, cell-cycle status, etc.) can be controlled.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Differential geometry-based solvation and electrolyte transport models for biomolecular modeling: a review

This chapter reviews the differential geometry-based solvation and electrolyte transport for biomolecular solvation that have been developed over the past decade. A key component of these methods is the differential geometry of surfaces theory, as applied to the solvent-solute boundary. In these approaches, the solvent-solute boundary is determined by a variational principle that determines the major physical observables of interest, for example, biomolecular surface area, enclosed volume, electrostatic potential, ion density, electron density, etc. Recently, differential geometry theory has been used to define the surfaces that separate the microscopic (solute) domains for biomolecules from the macroscopic (solvent) domains. In these approaches, the microscopic domains are modeled with atomistic or quantum mechanical descriptions, while continuum mechanics models (including fluid mechanics, elastic mechanics, and continuum electrostatics) are applied to the macroscopic domains. This multiphysics description is integrated through an energy functional formalism and the resulting Euler-Lagrange equation is employed to derive a variety of governing partial differential equations for different solvation and transport processes; e.g., the Laplace-Beltrami equation for the solvent-solute interface, Poisson or Poisson-Boltzmann equations for electrostatic potentials, the Nernst-Planck equation for ion densities, and the Kohn-Sham equation for solute electron density. Extensive validation of these models has been carried out over hundreds of molecules, including proteins and ion channels, and the experimental data have been compared in terms of solvation energies, voltage-current curves, and density distributions. We also propose a new quantum model for electrolyte transport.

chemistry↗

Energy-state formulation of lumped volume dynamic equations with application to a simplified free piston Stirling engine

Lumped volume dynamic equations are derived using an energy state formulation. This technique requires that kinetic and potential energy state functions be written for the physical system being investigated. To account for losses in the system, a Rayleigh dissipation function is formed. Using these functions, a Lagrangian is formed and using Lagrange's equation, the equations of motion for the system are derived. The results of the application of this technique to a lumped volume are used to derive a model for the free piston Stirling engine. The model was simplified and programmed on an analog computer. Results are given comparing the model response with experimental data.

Daniele, C. J.↗

Energy-state formulation of lumped volume dynamic equations with application to a simplified free piston Stirling engine

Lumped volume dynamic equations are derived using an energy-state formulation. This technique requires that kinetic and potential energy state functions be written for the physical system being investigated. To account for losses in the system, a Rayleigh dissipation function is also formed. Using these functions, a Lagrangian is formed and using Lagrange's equation, the equations of motion for the system are derived. The results of the application of this technique to a lumped volume are used to derive a model for the free-piston Stirling engine. The model was simplified and programmed on an analog computer. Results are given comparing the model response with experimental data.

Daniele, C. J.↗

A meshless Galerkin method for non-local diffusion using localized kernel bases

Here, we introduce a meshless method for solving both continuous and discrete variational formulations of a volume constrained, nonlocal diffusion problem. We use the discrete solution to approximate the continuous solution. Our method is nonconforming and uses a localized Lagrange basis that is constructed out of radial basis functions. By verifying that certain inf-sup conditions hold, we demonstrate that both the continuous and discrete problems are well-posed, and also present numerical and theoretical results for the convergence behavior of the method. The stiffness matrix is assembled by a special quadrature routine unique to the localized basis. Combining the quadrature method with the localized basis produces a well-conditioned, symmetric matrix. This then is used to find the discretized solution.

97 MATHEMATICS AND COMPUTING↗

Taylor-Lagrange renormalization scheme: Application to light-front dynamics

The recently proposed renormalization scheme based on the definition of field operators as operator valued distributions acting on specific test functions is shown to be very convenient in explicit calculations of physical observables within the framework of light-front dynamics. We first recall the main properties of this procedure based on identities relating the test functions to their Taylor remainder of any order expressed in terms of Lagrange's formulas, hence the name given to this scheme. We thus show how it naturally applies to the calculation of state vectors of physical systems in the covariant formulation of light-front dynamics. As an example, we consider the case of the Yukawa model in the simple two-body Fock state truncation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Discrete Lagrangian Algorithm for Optimal Routing Problems

The ideas of discrete Lagrangian methods for conservative systems are exploited for the construction of algorithms applicable in optimal ship routing problems. The algorithm presented here is based on the discretisation of Hamilton's principle of stationary action Lagrangian and specifically on the direct discretization of the Lagrange-Hamilton principle for a conservative system. Since, in contrast to the differential equations, the discrete Euler-Lagrange equations serve as constrains for the optimization of a given cost functional, in the present work we utilize this feature in order to minimize the cost function for optimal ship routing.

97 MATHEMATICS AND COMPUTING↗

Design of an essentially non-oscillatory reconstruction procedure in finite-element type meshes

An essentially non oscillatory reconstruction for functions defined on finite element type meshes is designed. Two related problems are studied: the interpolation of possibly unsmooth multivariate functions on arbitary meshes and the reconstruction of a function from its averages in the control volumes surrounding the nodes of the mesh. Concerning the first problem, the behavior of the highest coefficients of two polynomial interpolations of a function that may admit discontinuities of locally regular curves is studied: the Lagrange interpolation and an approximation such that the mean of the polynomial on any control volume is equal to that of the function to be approximated. This enables the best stencil for the approximation to be chosen. The choice of the smallest possible number of stencils is addressed. Concerning the reconstruction problem, two methods were studied: one based on an adaptation of the so called reconstruction via deconvolution method to irregular meshes and one that lies on the approximation on the mean as defined above. The first method is conservative up to a quadrature formula and the second one is exactly conservative. The two methods have the expected order of accuracy, but the second one is much less expensive than the first one. Some numerical examples are given which demonstrate the efficiency of the reconstruction.

Abgrall, Remi↗

Higher order sensitivity of solutions to convex programming problems without strict complementarity

Consideration is given to a family of convex programming problems which depend on a vector parameter. It is shown that the solutions of the problems and the associated Lagrange multipliers are arbitrarily many times directionally differentiable functions of the parameter, provided that the data of the problems are sufficiently regular. The characterizations of the respective derivatives are given.

Malanowski, Kazimierz↗

The Newton Modified Barrier Method for QP Problems

The Modified Barrier Functions (MBF) have elements of both Classical Lagrangians (CL) and Classical Barrier Functions (CBF). The MBF methods find an unconstrained minimizer of some smooth barrier function in primal space and then update the Lagrange multipliers, while the barrier parameter either remains fixed or can be updated at each step. The numerical realization of the MBF method leads to the Newton MBF method, where the primal minimizer is found by using Newton's method. This minimizer is then used to update the Lagrange multipliers. In this paper, we examine the Newton MBF method for the Quadratic Programming (QP) problem. It will be shown that under standard second-order optimality conditions, there is a ball around the primal solution and a cut cone in the dual space such that for a set of Lagrange multipliers in this cut cone, the method converges quadratically to the primal minimizer from any point in the aforementioned ball, and continues to do so after each Lagrange multiplier update. The Lagrange multipliers remain within the cut cone and converge linearly to their optimal values. Any point in this ball will be called a "hot start". Starting at such a "hot start", at most Omicron(1n 1n epsilon(exp -1)) Newton steps are sufficient to perform the primal minimization which is necessary for the Lagrange multiplier update. Here, epsilon > 0 is the desired accuracy. Because of the linear convergence of the Lagrange multipliers, this means that only Omicron(1n epsilon(exp -1))omicron(ln 1n epsilon(exp-1)) Newton steps are required to reach an epsilon-approximation to the solution from any "hot start". In order to reach the "hot start", one has to perform Omicron(square root(m) 1n C) Newton steps, where m characterizes the size of the problem and C > 0 is the condition number of the QP problem. This condition number will be characterized explicitly in terms of key parameters of the QP problem, which in turn depend on the input data and the size of the problem.

Melman, A.↗

Simulation and Correction of Triana-Viewed Earth Radiation Budget with ERBE/ISCCP Data

This paper describes the simulation of the earth radiation budget (ERB) as viewed by Triana and the development of correction models for converting Trianaviewed radiances into a complete ERB. A full range of Triana views and global radiation fields are simulated using a combination of datasets from ERBE (Earth Radiation Budget Experiment) and ISCCP (International Satellite Cloud Climatology Project) and analyzed with a set of empirical correction factors specific to the Triana views. The results show that the accuracy of global correction factors to estimate ERB from Triana radiances is a function of the Triana position relative to the Lagrange-1 (L1) or the Sun location. Spectral analysis of the global correction factor indicates that both shortwave (SW; 0.2 - 5.0 microns) and longwave (LW; 5 -50 microns) parameters undergo seasonal and diurnal cycles that dominate the periodic fluctuations. The diurnal cycle, especially its amplitude, is also strongly dependent on the seasonal cycle. Based on these results, models are developed to correct the radiances for unviewed areas and anisotropic emission and reflection. A preliminary assessment indicates that these correction models can be applied to Triana radiances to produce the most accurate global ERB to date.

Huang, Jian-Ping↗

Using Redundancy To Reduce Errors in Magnetometer Readings

A method of reducing errors in noisy magnetic-field measurements involves exploitation of redundancy in the readings of multiple magnetometers in a cluster. By "redundancy"is meant that the readings are not entirely independent of each other because the relationships among the magnetic-field components that one seeks to measure are governed by the fundamental laws of electromagnetism as expressed by Maxwell's equations. Assuming that the magnetometers are located outside a magnetic material, that the magnetic field is steady or quasi-steady, and that there are no electric currents flowing in or near the magnetometers, the applicable Maxwell 's equations are delta x B = 0 and delta(raised dot) B = 0, where B is the magnetic-flux-density vector. By suitable algebraic manipulation, these equations can be shown to impose three independent constraints on the values of the components of B at the various magnetometer positions. In general, the problem of reducing the errors in noisy measurements is one of finding a set of corrected values that minimize an error function. In the present method, the error function is formulated as (1) the sum of squares of the differences between the corrected and noisy measurement values plus (2) a sum of three terms, each comprising the product of a Lagrange multiplier and one of the three constraints. The partial derivatives of the error function with respect to the corrected magnetic-field component values and the Lagrange multipliers are set equal to zero, leading to a set of equations that can be put into matrix.vector form. The matrix can be inverted to solve for a vector that comprises the corrected magnetic-field component values and the Lagrange multipliers.

Kulikov, Igor↗

Derivation of new 3D discrete ordinate equations

The Sn equations have been the workhorse of deterministic radiation transport calculations for many years. Here we derive two new angular discretizations of the 3D transport equation. The first set of equations, derived using Lagrange interpolation and collocation, retains the classical Sn structure, with the main difference being how the scattering source is calculated. Because of the formal similarity with the classical S n equations, it should be possible to modify existing computer codes to take advantage of the new formulation. In addition, the new S n-like equations correctly capture delta function scattering. The second set of equations, derived using a Galerkin technique, does not retain the classical Sn structure because the streaming term is not diagonal. However, these equations can be cast into a form similar to existing methods developed to reduce ray effects. Numerical investigation of both sets of equations is under way. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization

When a classical barrier method is applied to the solution of a nonlinear programming problem with inequality constraints, the Hessian matrix of the barrier function becomes increasingly ill-conditioned as the solution is approached. As a result, it may be desirable to consider alternative numerical algorithms. We compare the performance of two methods motivated by barrier functions. The first is a stabilized form of the classical barrier method, where a numerically stable approximation to the Newton direction is used when the barrier parameter is small. The second is a modified barrier method where a barrier function is applied to a shifted form of the problem, and the resulting barrier terms are scaled by estimates of the optimal Lagrange multipliers. The condition number of the Hessian matrix of the resulting modified barrier function remains bounded as the solution to the constrained optimization problem is approached. Both of these techniques can be used in the context of a truncated-Newton method, and hence can be applied to large problems, as well as on parallel computers. In this paper, both techniques are applied to problems with bound constraints and we compare their practical behavior.

Nash, Stephen G.↗

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↗