SEARCH · Engineering Papers

Results for “Lagrange multipliers”

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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Application of Newton modified barrier method (NMBM) to structural optimization

This paper presents the application of the NMBM to obtain a minimum weight structure with constraints on displacements and minimum sizes. The solution to the problem is obtained via minimizing the Modified Barrier Function (MBF) at each step by using the Newton Method and updating Lagrange multipliers. The Lagrange multipliers are updated by using the value of the constraints at the minimum of the MBF. Three truss problems with a different number of design variables are solved. The convergence to the minimum weight design was found to be monotonic and the algorithm is potentially robust for solving problems with a large number of design variables.

Khot, N. S.↗

NASA NTRS1996

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

DOE OSTI2024

Comparison of Real-Time Pressure Rail Selection Algorithms for the Hybrid Hydraulic Electric Architecture: Case Study on a Track Loader

Abstract The hybrid hydraulic electric architecture (HHEA) seeks to combine the high power/torque/force density of hydraulics with the efficiency of electric machines. A set of common pressure rails is used to provide a majority of the power and this power is modulated by small electric machines to provide precise control for the operator. The HHEA has been studied in previous work using off-line dynamic programming optimization to determine energy efficient pressure rail selections, but this approach requires drive cycle information apriori. A Lagrange multiplier method has also been investigated where a set of gains (Lagrange multipliers) are optimized off-line with the idea the these gains, once determined, could be used for real-time operation. In this work, three new real-time pressure rail selection algorithms that do not require future drive cycle information are investigated; greedy, torque minimizing, and thresholding. The greedy control is found to only use 1% more energy than the globally optimal dynamic programming solution; but a model of energy loss is required.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1995

Modified Interior Distance Functions (Theory and Methods)

In this paper we introduced and developed the theory of Modified Interior Distance Functions (MIDF's). The MIDF is a Classical Lagrangian (CL) for a constrained optimization problem which is equivalent to the initial one and can be obtained from the latter by monotone transformation both the objective function and constraints. In contrast to the Interior Distance Functions (IDF's), which played a fundamental role in Interior Point Methods (IPM's), the MIDF's are defined on an extended feasible set and along with center, have two extra tools, which control the computational process: the barrier parameter and the vector of Lagrange multipliers. The extra tools allow to attach to the MEDF's very important properties of Augmented Lagrangeans. One can consider the MIDFs as Interior Augmented Lagrangeans. It makes MIDF's similar in spirit to Modified Barrier Functions (MBF's), although there is a fundamental difference between them both in theory and methods. Based on MIDF's theory, Modified Center Methods (MCM's) have been developed and analyzed. The MCM's find an unconstrained minimizer in primal space and update the Lagrange multipliers, while both the center and the barrier parameter can be fixed or updated at each step. The MCM's convergence was investigated, and their rate of convergence was estimated. The extension of the feasible set and the special role of the Lagrange multipliers allow to develop MCM's, which produce, in case of nondegenerate constrained optimization, a primal and dual sequences that converge to the primal-dual solutions with linear rate, even when both the center and the barrier parameter are fixed. Moreover, every Lagrange multipliers update shrinks the distance to the primal dual solution by a factor 0 less than gamma less than 1 which can be made as small as one wants by choosing a fixed interior point as a 'center' and a fixed but large enough barrier parameter. The numericai realization of MCM leads to the Newton MCM (NMCM). The approximation for the primal minimizer one finds by Newton Method followed by the Lagrange multipliers update. Due to the MCM convergence, when both the center and the barrier parameter are fixed, the condition of the MDF Hessism and the neighborhood of the primal ninimizer where Newton method is 'well' defined remains stable. It contributes to both the complexity and the numerical stability of the NMCM.

Polyak, Roman A.↗

NASA NTRS1980

Finite element analysis of hyperelastic structures

The use of the penalty function, to account for near incompressibility is discussed and compared to that of Lagrange multiplier. A scheme to use Lagrange multiplier, without having to treat it as unknown, is also presented.

Tabaddor, F.↗

DOE OSTI2022

Scalable preconditioning for the stabilized contact mechanics problem

We present a family of preconditioning strategies for the contact problem in fractured and faulted porous media. We combine low-order continuous finite elements to simulate the bulk deformation with piecewise constant Lagrange multipliers to impose the frictional contact constraints. This formulation is not uniformly inf-sup stable and requires stabilization. We improve previous work by Franceschini et al. (2020) by introducing a novel jump stabilization technique that requires only local geometrical and mechanical properties. We then design scalable preconditioning strategies that take advantage of the block structure of the Jacobian matrix using a physics-based partitioning of the unknowns by field type, namely displacement and Lagrange multipliers. The key to the success of the proposed preconditioners is a pseudo-Schur complement obtained by eliminating the Lagrange multiplier degrees of freedom, which can then be efficiently solved using an optimal multigrid method. Numerical results, including complex real-world problems, are presented to illustrate theoretical properties, scalability and robustness of the preconditioner. A comparison with other approaches available in the literature is also provided.

58 GEOSCIENCES↗

NASA NTRS2004

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↗

NASA NTRS1996

Computational Methods for Frictional Contact With Applications to the Space Shuttle Orbiter Nose-Gear Tire

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

NASA NTRS1996

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

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↗

DOE OSTI2022

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗

NASA NTRS1994

Eliminating Computational Instability In Multibody Simulations

TWOBODY implements improved version of Lagrange multiplier method. Program ultilizes programming technique eliminating computational instability in multibody simulations in which Lagrange multipliers used. In technique, one uses constraint equations, instead of integration, to determine coordinates that are not independent. To illustrate technique, it includes simple mathematical model of solid rocket booster and parachute connected by frictionless swivel. Written in FORTRAN 77.

Watts, Gaines L.↗

DOE OSTI2021

Optimal Control of the Energy-Saving Hybrid Hydraulic-Electric Architecture (HHEA) for Off-Highway Mobile Machines

Most off-highway constructions and agriculture equipment use hydraulics, which has unmatched power density, for power transmission and throttling as a means for control. A novel hybrid hydraulic-electric architecture (HHEA) has recently been proposed to improve efficiency for high-power machines that would have been cost-prohibitive to electrify directly. HHEA uses a set of common pressure rails (CPRs) to transmit the majority of power hydraulically and small electric motor drives to modulate that power and to achieve precise control. This article proposes a computationally efficient Lagrange multiplier method (LMM) for computing the optimal sequence of pressure rail selections to minimize energy use. This is needed to evaluate HHEA's energy-saving potential and for iterative architecture design and sizing. An interesting complication is that the cost function is not fully defined until the candidate control sequence is fully specified. This issue is dealt with by decomposing the original problem into a set of sub-problems with additional constraints that can be solved efficiently. Computational effort can be further reduced if actuators are optimized individually instead of together. However, additional steps are required to prevent the constraint functions from becoming discontinuous with respect to the Lagrange multipliers, which is necessary for meeting the constraints. Lastly, a case study of a construction machine demonstrates the efficacy of the method and shows that the HHEA reduces energy consumption by 68%-73% compared to the baseline load-sensing architecture.

Lagrange multiplier↗

NASA NTRS1972

An optimum settling problem for time lag systems.

A solution is presented to an optimization problem for time lag systems by the classical method of Lagrange multipliers in a Banach space. Following terminology and assumption definitions, the regularity and controllability of the Lagrange multipliers problem is discussed, and a set of necessary conditions for an optimal control is derived. In conclusion, the solution existence, uniqueness, and sufficiency are established.

Jacobs, M. Q.↗

NASA NTRS1998

A Posteriori Bounds for Linear-Functional Outputs of Crouzeix-Raviart Finite Element Discretizations of the Incompressible Stokes Problem

We present a finite element technique for the efficient generation of lower and upper bounds to outputs which are linear functionals of the solutions to the incompressible Stokes equations in two space dimensions; the finite element discretization is effected by Crouzeix-Raviart elements, the discontinuous pressure approximation of which is central to our approach. The bounds are based upon the construction of an augmented Lagrangian: the objective is a quadratic "energy" reformulation of the desired output; the constraints are the finite element equilibrium equations (including the incompressibility constraint), and the intersubdomain continuity conditions on velocity. Appeal to the dual max-min problem for appropriately chosen candidate Lagrange multipliers then yields inexpensive bounds for the output associated with a fine-mesh discretization; the Lagrange multipliers are generated by exploiting an associated coarse-mesh approximation. In addition to the requisite coarse-mesh calculations, the bound technique requires solution only of local subdomain Stokes problems on the fine-mesh. The method is illustrated for the Stokes equations, in which the outputs of interest are the flowrate past, and the lift force on, a body immersed in a channel.

Patera, Anthony T.↗

NASA NTRS1988

Tracing structural optima as a function of available resources by a homotopy method

Optimization problems are typically solved by starting with an initial estimate and proceeding iteratively to improve it until the optimum is found. The design points along the path from the initial estimate to the optimum are usually of no value. The present work proposes a strategy for tracing a path of optimum solutions parameterized by the amount of available resources. The paper specifically treats the optimum design of a structure to maximize its buckling load. Equations for the optimum path are obtained using Lagrange multipliers, and solved by a homotopy method. The solution path has several transitions from unimodal to bimodal solutions. The Lagrange multipliers and second-order optimality conditions are used to detect branching points and to switch to the optimum solution path. The procedure is applied to the design of a foundation which supports a column for maximum buckling load. Using the total available foundation stiffness as a homotopy parameter, a set of optimum foundation designs is obtained.

Haftka, Raphael T.↗

DOE OSTI2021

A priori error analysis of high-order LL* (FOSLL*) finite element methods

A number of non-standard finite element methods have been proposed in recent years, each of which derives from a specific class of PDE-constrained norm minimization problems. The most notable examples are LL* methods. In this work, we argue that all high-order methods in this class should be expected to deliver substandard uniform h-refinement convergence rates. In fact, one may not even see rates proportional to the polynomial order p > 1 when the exact solution is a constant function. Here, we show that the convergence rate is limited by the regularity of an extraneous Lagrange multiplier variable which naturally appears via a saddle-point analysis. In turn, limited convergence rates appear because the regularity of this Lagrange multiplier is determined, in part, by the geometry of the domain. Numerical experiments support our conclusions.

97 MATHEMATICS AND COMPUTING↗