نتایج جستجو برای: convex power condensing map
تعداد نتایج: 724455 فیلتر نتایج به سال:
Let A be a Hermitian matrix, let be a normalized positive linear map and let f be a continuous real valued function. Real constants and such that (f(A)) f(((A)) (f(A)) are determined. If f is matrix convex then can be taken to be 1. A uniied approach is proposed so that the problem of determining and is reduced to solving a single variable convex minimization problem. As an illustration, the re...
Several solutions have been proposed in the literature to maximise harvested ocean energy, but only a few consider overall efficiency of power take-off system. The fundamental problem incorporating system is that it leads nonlinear and non-convex optimal control problem. main disadvantage available none solve real-time. This paper presents model predictive (NMPC) approach based on real-time ite...
Three alternative condensing mode power and combined heat and power (CHP) waste-to-energy concepts were compared in terms of their impacts on the greenhouse gas (GHG) emissions from a heat and power generation system. The concepts included (i) grate, (ii) bubbling fluidised bed (BFB) and (iii) circulating fluidised bed (CFB) combustion of waste. The BFB and CFB take advantage of advanced combus...
In this paper, we present a new class of cyclic (noncyclic) α-ψ and β-ψ condensing operators survey the existence best proximity points (pairs) as well coupled in setting reflexive Busemann convex spaces. Then an application main result to study optimal solution for system differential equations is demonstrated.
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
in this paper, downlink resource allocation for a sparse code multiple access (scma) based heterogeneous cellular networks (hcn) is investigated. the main aim of this paper is to obtain joint power allocation and codebook assignment to achieve the least total system transmit power. in this regard, the proposed objective function is formulated as total transmit power subject to users minimum ra...
The following result of convex analysis is well–known [2]: If the function f : X → [−∞, +∞] is convex and some x0 ∈ core (dom f) satisfies f(x0) > −∞, then f never takes the value −∞. From a corresponding theorem for convex functions with values in semi–linear spaces a variety of results is deduced, among them the mentioned theorem, a theorem of Deutsch and Singer on the single–valuedness of co...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید