Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “LIPSCHITZ CONDITION”

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 19 records

The discrete one-sided Lipschitz condition for convex scalar conservation laws

Physical solutions to convex scalar conservation laws satisfy a one-sided Lipschitz condition (OSLC) that enforces both the entropy condition and their variation boundedness. Consistency with this condition is therefore desirable for a numerical scheme and was proved for both the Godunov and the Lax-Friedrichs scheme--also, in a weakened version, for the Roe scheme, all of them being only first order accurate. A new, fully second order scheme is introduced here, which is consistent with the OSLC. The modified equation is considered and shows interesting features. Another second order scheme is then considered and numerical results are discussed.

Brenier, Yann↗

On Lipschitz structures.

Uniform structure for Lipschitz condition on functions between sets, extensions to nonmetric spaces and fixed point theorem for uniform spaces

LIPSCHITZ CONDITION↗

Robust control of a family of uncertain nonminimum‐phase systems via continuous‐time and sampled‐data output feedback

Summary The problem of global robust stabilization is studied by both continuous‐time and sampled‐data output feedback for a family of nonminimum‐phase nonlinear systems with uncertainty. The uncertain nonlinear system considered in this paper has an interconnect structure consisting of a driving system and a possibly unstable zero dynamics with uncertainty, ie, the uncertain driven system. Under a linear growth condition on the uncertain zero dynamics and a Lipschitz condition on the driving system, we show that it is possible to globally robustly stabilize the family of uncertain nonminimum‐phase systems by a single continuous‐time or a sampled‐data output feedback controller. The sampled‐data output feedback controller is designed by using the emulated versions of a continuous‐time observer and a state feedback controller, ie, by holding the input/output signals constant over each sampling interval. The design of either continuous‐time or sampled‐data output compensator uses only the information of the nominal system of the uncertain controlled plant. In the case of sampled‐data control, global robust stability of the hybrid closed‐loop system with uncertainty is established by means of a feedback domination method together with the robustness of the nominal closed‐loop system if the sampling time is small enough.

Lin, Wei↗

On differentiating the probability of error in multipopular feature selection

A method of linear feature selection for n dimensional observation vectors which belong to one of m populations is presented. Each population has a known apriori probability and is described by a known multivariate normal density function. Specifically we consider the problem of finding a k x n matrix B of rank k (k n) for which the transformed probability of misclassification is minimized. Providing that the transformed a posterior probabilities are distinct theoretical results are obtained which, for the case k = l, give rise to a numerically tractable formula for the derivative of the probability of misclassification. It is shown that for the two population problem this condition is also necessary. The dependence of the minimum probability of error on the a priori probabilities is investigated. The minimum probability of error satisfies a uniform Lipschitz condition with respect to the a priori probabilities.

Peters, B. C.↗

Filtering adaptive output feedback control for multivariable nonlinear systems with mismatched uncertainties and unmodeled dynamics

This article synthesizes a filtering adaptive output feedback controller for multivariable nonlinear systems with mismatched uncertainties and unmodeled dynamics. The multivariable nonlinear systems under consideration have both matched and mismatched uncertainties, which satisfy the semiglobal Lipschitz condition. The unmodeled dynamics are bounded-input bounded-output stable. By adopting an estimation/cancellation strategy, a piecewise constant adaptive law drives the estimation error to zero at every time instant, which yields the adaptive parameters; a disturbance rejection control law is designed to compensate the nonlinear uncertainties within the bandwidth of low-pass filters. The matched uncertainties are cancelled directly by adopting their opposite in the control signal, while a dynamic inversion of the system is required to eliminate the effect of the mismatched uncertainties on the output. A feedforward control law is designed to track a given command. Since the virtual reference system defines the best performance that can be achieved by the closed-loop system, the uniform performance bounds are derived for the states and control signals via comparison. Both numerical and practical examples are provided to illustrate the effectiveness of the proposed filtering adaptive output feedback control architecture, comparisons with the model reference adaptive control demonstrates the superiority of the proposed control method.

filtering adaptive control, mismatched uncertainit↗

The Small-Mass Limit and White-Noise Limit of an Infinite Dimensional Generalized Langevin Equation

We study asymptotic properties of the Generalized Langevin Equation (GLE) in the presence of a wide class of external potential wells with a power-law decay memory kernel. When the memory can be expressed as a sum of exponentials, a class of Markovian systems in infinite-dimensional spaces is used to represent the GLE. The solutions are shown to converge in probability in the small-mass limit and the white-noise limit to appropriate systems under minimal assumptions, of which no global Lipschitz condition is required on the potentials. With further assumptions about space regularity and potentials, we obtain L{sup 1} convergence in the white-noise limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An explicitly solvable energy-conserving algorithm for pitch-angle scattering in magnetized plasmas

In this work, we develop an Explicitly Solvable Energy-Conserving (ESEC) algorithm for the Stochastic Differential Equation (SDE) describing the pitch-angle scattering process in magnetized plasmas. The Cayley transform is used to calculate both the deterministic gyromotion and stochastic scattering, affording the algorithm to be explicitly solvable and exactly energy conserving. An unusual property of the SDE for pitch-angle scattering is that its coefficients diverge at the zero velocity and do not satisfy the global Lipschitz condition. Consequently, when standard numerical methods, such as the Euler-Maruyama (EM), are applied, numerical convergence is difficult to establish. For the proposed ESEC algorithm, its energy-preserving property enables us to overcome this obstacle. We rigorously prove that the ESEC algorithm is order 1/2 strongly convergent. This result is confirmed by detailed numerical studies. For the case of pitch-angle scattering in a magnetized plasma with a constant magnetic field, the numerical solution is benchmarked against the analytical solution, and excellent agreements are found.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Derivatives at the boundary for analytic Lipschitz functions

We consider the behaviour of holomorphic functions on a bounded open subset of the plane, satisfying a Lipschitz condition with exponent α, with 0<α<1, in the vicinity of an exceptional boundary point where all such functions exhibit some kind of smoothness. Specifically, we consider the relation between the abstract idea of a bounded point derivation on the algebra of such functions and the classical complex derivative evaluated as a limit of difference quotients. We show that whenever such a bounded point derivation exists at a boundary point b, it may be evaluated by taking a limit of classical difference quotients, approaching from a set having full area density at b. Bibliography: 13 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method

We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadratic programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).

97 MATHEMATICS AND COMPUTING↗

Underlying one-step methods and nonautonomous stability of general linear methods

We generalize the theory of underlying one-step methods to strictly stable general linear methods (GLMs) solving nonautonomous ordinary differential equations (ODEs) that satisfy a global Lipschitz condition. Here, we combine this theory with the Lyapunov and Sacker-Sell spectral stability theory for one-step methods developed in [34,35,36] to analyze the stability of a strictly stable GLM solving a nonautonomous linear ODE. These results are applied to develop a stability diagnostic for the solution of nonautonomous linear ODEs by strictly stable GLMs.

97 MATHEMATICS AND COMPUTING↗

Application of the comparison principle to analysis of nonlinear systems

A comparison principle based on a Kamke theorem and Lipschitz conditions is presented along with its possible applications and modifications. It is shown that the comparison lemma can be used in the study of such areas as classical stability theory, higher order trajectory derivatives, Liapunov functions, boundary value problems, approximate dynamic systems, linear and nonlinear systems, and bifurcation analysis.

Gunderson, R. W.↗

Application of functional analysis to perturbation theory of differential equations

The deviation of the solution of the differential equation y' = f(t, y), y(O) = y sub O from the solution of the perturbed system z' = f(t, z) + g(t, z), z(O) = z sub O was investigated for the case where f and g are continuous functions on I x R sup n into R sup n, where I = (o, a) or I = (o, infinity). These functions are assumed to satisfy the Lipschitz condition in the variable z. The space Lip(I) of all such functions with suitable norms forms a Banach space. By introducing a suitable norm in the space of continuous functions C(I), introducing the problem can be reduced to an equivalent problem in terminology of operators in such spaces. A theorem on existence and uniqueness of the solution is presented by means of Banach space technique. Norm estimates on the rate of growth of such solutions are found. As a consequence, estimates of deviation of a solution due to perturbation are obtained. Continuity of the solution on the initial data and on the perturbation is established. A nonlinear perturbation of the harmonic oscillator is considered a perturbation of equations of the restricted three body problem linearized at libration point.

Bogdan, V. M.↗

Non-Lipschitzian dynamics for neural net modelling

Failure of the Lipschitz condition in unstable equilibrium points of dynamical systems leads to a multiple-choice response to an initial deterministic input. The evolution of such systems is characterized by a special type of unpredictability measured by unbounded Liapunov exponents. Possible relation of these systems to future neural networks is discussed.

Zak, Michail↗

Terminal attractors in neural networks

A new type of attractor (terminal attractors) for content-addressable memory, associative memory, and pattern recognition in artificial neural networks operating in continuous time is introduced. The idea of a terminal attractor is based upon a violation of the Lipschitz condition at a fixed point. As a result, the fixed point becomes a singular solution which envelopes the family of regular solutions, while each regular solution approaches such an attractor in finite time. It will be shown that terminal attractors can be incorporated into neural networks such that any desired set of these attractors with prescribed basins is provided by an appropriate selection of the synaptic weights. The applications of terminal attractors for content-addressable and associative memories, pattern recognition, self-organization, and for dynamical training are illustrated.

Zak, Michail↗

The convergence rate of approximate solutions for nonlinear scalar conservation laws

The convergence rate is discussed of approximate solutions for the nonlinear scalar conservation law. The linear convergence theory is extended into a weak regime. The extension is based on the usual two ingredients of stability and consistency. On the one hand, the counterexamples show that one must strengthen the linearized L(sup 2)-stability requirement. It is assumed that the approximate solutions are Lip(sup +)-stable in the sense that they satisfy a one-sided Lipschitz condition, in agreement with Oleinik's E-condition for the entropy solution. On the other hand, the lack of smoothness requires to weaken the consistency requirement, which is measured in the Lip'-(semi)norm. It is proved for Lip(sup +)-stable approximate solutions, that their Lip'convergence rate to the entropy solution is of the same order as their Lip'-consistency. The Lip'-convergence rate is then converted into stronger L(sup p) convergence rate estimates.

Nessyahu, Haim↗

Non-Lipschitzian neural dynamics

A novel approach is presented which is motivated by an attempt to remove one of the most fundamental limitations of artificial neural networks: their rigid behavior as compared with even the simplest biological systems. It is demonstrated that non-Lipschitzian dynamics, based on the faliure of the Lipschitz conditions at repellers, displays a new qualitative effect, i.e., a multichoice response to periodic external excitations. This makes it possible to construct unpredictable systems, represented in the form of coupled activation and learning dynamical equations. It is shown that unpredictable systems can be controlled by sign strings which uniquely define the system behavior by specifying the direction of the motions at the critical points. Unpredictable systems driven by sign strings are extremely flexible and can serve as a powerful tool for complex pattern recognition.

Barhen, Jacob↗