نتایج جستجو برای: almost multipliers
تعداد نتایج: 207619 فیلتر نتایج به سال:
The paper analyzes dynamic problems of stochastic optimization in discrete time. The problems under consideration are concerned with maximizing concave functionals on convex sets of feasible strategies (programs). Feasibility is defined in terms of linear inequality constraints in L∞ holding almost surely. The focus of the work is the existence of dual variables – stochastic Lagrange multiplier...
Recently, the multipliers with subquadratic space complexity for trinomials and some specific pentanomials have been proposed. For such kind of multipliers, alternatively, we use double basis multiplication which combines the polynomial basis and the modified polynomial basis to develop a new efficient digit-serial systolic multiplier. The proposed multiplier depends on trinomials and almost eq...
In this paper, a new approach to the variational iteration method is introduced to solve systems of first-order differential equations. Since higher-order differential equations can almost always be converted into a first-order system of equations, the proposed method is still applicable to a wide range of differential equations. This generalised approach, unlike the classical method, uses rest...
We study several functional properties of isometric and almost isometric unconditionality and state them as a property of families of multipliers. The most general such notion is that of “metric unconditional approximation property”. We characterize this “(umap)” by a simple property of “block unconditionality” for spaces with nontrivial cotype. We focus on subspaces of Banach spaces of functio...
In this paper, we first show that the tensor product of a finite number of standard g-frames (resp. fusion frames, frames) is a standard g-frame (resp. fusion frame, frame) for the tensor product of Hilbert $C^ast-$ modules and vice versa, then we consider tensor products of g-Bessel multipliers, Bessel multipliers and Bessel fusion multipliers in Hilbert $C^ast-$modules. Moreover, we obtain so...
In this paper we shall study the multipliers on Banach algebras and We prove some results concerning Arens regularity and amenability of the Banach algebra M(A) of all multipliers on a given Banach algebra A. We also show that, under special hypotheses, each Jordan multiplier on a Banach algebra without order is a multiplier. Finally, we present some applications of m...
in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...
A new GF(2) redundant representation is presented. Squaring in the representation is almost cost-free. Based on the representation, two multipliers are proposed. The XOR gate complexity of the first multiplier is lower than a recently proposed normal basis multiplier when CN (the complexity of the basis) is larger than 3n-1. Index Terms Finite field, normal basis, redundant set, Massey-Omura mu...
Let G be a finite p-group. We prove that whenever the commuting probability of G is greater than (2p2 + p− 2)/p5, the unramified Brauer group of the field of G-invariant functions is trivial. Equivalently, all relations between commutators in G are consequences of some universal ones. The bound is best possible, and gives a global lower bound of 1/4 for all finite groups. The result is attained...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید