نتایج جستجو برای: strictly positive
تعداد نتایج: 686207 فیلتر نتایج به سال:
This paper presents a new approach to robust adaptive control, using fractional order systems as parallel feedforward in the adaptation loop. The problem is that adaptive control systems may diverge when confronted with finite sensor and actuator dynamics, or with parasitic disturbances. One of the classical robust adaptive control solutions to these problems makes use of parallel feedforward a...
We motivate the study of a certain class of random Fibonacci sequences which we call continuous random Fibonacci sequences by demonstrating that their exponential growth rate can be used to establish capacity and power scaling laws for multihop cooperative amplify-and-forward (AF) relay networks. With these laws, we show that it is possible to construct multihop cooperative AF networks that sim...
let r be a ring, m a right r-module and (s,≤) a strictly ordered monoid. in this paper we will show that if (s,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ s, then the module [[ms,≤]] of generalized power series is a uniserial right [[rs,≤]] ]]-module if and only if m is a simple right r-module and s is a chain monoid.
Let R be a ring, M a right R-module and (S,≤) a strictly ordered monoid. In this paper we will show that if (S,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ S, then the module [[MS,≤]] of generalized power series is a uniserial right [[RS,≤]] ]]-module if and only if M is a simple right R-module and S is a chain monoid.
In system identification and adaptive control, the problem of designing strictly positive real (SPR) transfer functions in the presence of uncertain adaptation parameters is essential for stability and convergence in a group of parameter adaptation algorithms. This paper proposes a convex optimization approach to address the robust SPR problem. Besides achieving the robust SPR condition, the pr...
a full nesterov-todd (nt) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using euclidean jordan algebra. two types of full nt-steps are used, feasibility steps and centering steps. the algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
This paper contains the following results for ecohomies with infinite dimensional commodity spaces. (i) We establish a core-Walras equivalence theorem for economies with an atomless measure space of agents and with an ordered separable Banach commodity space whose positive cone has a non-empty norm interior. This result includes as a special case the Aumann (1964) and Schmeidler-Hildenbrand [Hi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید