نتایج جستجو برای: pi polynomial
تعداد نتایج: 141034 فیلتر نتایج به سال:
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
G. Bonvicini, D. Cinabro, M. Dubrovin, A. Lincoln, D. M. Asner, K. W. Edwards, P. Naik, R. A. Briere, T. Ferguson, G. Tatishvili, H. Vogel, M. E. Watkins, J. L. Rosner, N. E. Adam, J. P. Alexander, D. G. Cassel, J. E. Duboscq, R. Ehrlich, L. Fields, R. S. Galik, L. Gibbons, R. Gray, S. W. Gray, D. L. Hartill, B. K. Heltsley, D. Hertz, C. D. Jones, J. Kandaswamy, D. L. Kreinick, V. E. Kuznetsov,...
For any l > 0, we present an algorithm which takes as input a semi-algebraic set, S, defined by P1 ≤ 0, . . . , Ps ≤ 0, where each Pi ∈ R[X1, . . . ,Xk ] has degree ≤ 2, and computes the top l Betti numbers of S, bk−1(S), . . . , bk−l(S), in polynomial time. The complexity of the algorithm, stated more precisely, is ∑l+2 i=0 ( s i ) k2 O(min(l,s)) . For fixed l, the complexity of the algorithm ...
This paper proposes a hybrid proportional-integral (PI-sliding) mode controller to improve and adjust the point-to-point path planning of three-link robotic arm with three degrees freedom. The main objectives proposed control unit are tracking process reach desired handle outgoing vibrations, dampen them in links during its movement ensure accuracy completing work. Seventh-degree polynomial pat...
let $d$ be a digraph with skew-adjacency matrix $s(d)$. then the skew energyof $d$ is defined to be the sum of the norms of all eigenvalues of $s(d)$. denote by$mathcal{o}_n$ the class of digraphs on order $n$ with no even cycles, and by$mathcal{o}_{n,m}$ the class of digraphs in $mathcal{o}_n$ with $m$ arcs.in this paper, we first give the minimal skew energy digraphs in$mathcal{o}_n$ and $mat...
Proof. Without loss of generality, we assume that pu > 0, qd > 0, pi 6= 0 for i = 1, · · · ,m, and qj 6= 0 for j = 1, · · · , n. First of all, it is easily seen that G(x) − α has the same roots as (G(x)−α) mi=1(x−ηi) ∏n j=1(x+ θj), which is a polynomial with order m+n+2. This implies that for any α ∈ R, the function G(x) = α has at most (m + n + 2) real roots. From now on we shall show that for...
let g = (v, e) be a simple graph. hosoya polynomial of g isd(u,v)h(g, x) = {u,v}v(g)x , where, d(u ,v) denotes the distance between vertices uand v. as is the case with other graph polynomials, such as chromatic, independence anddomination polynomial, it is natural to study the roots of hosoya polynomial of a graph. inthis paper we study the roots of hosoya polynomials of some specific graphs.
مدلسازی پیلهایسوختی شده است. اما بسیاری از این روشها به طور عملی و آزمایشگاهی بررسی نشده است و هنوز کمبود مطالعات موشکافانه روی پارامترها و روابط مربوط به متغیرهای عملکرد مشاهده می شود. از سوی دیگر، تنها مدلها و روشهای کمی به طور مخصوص به طراحی کنترلکننده پرداختهاست. مدلی که در این جا استفاده شدهاست، یک مدل به منظور تسهیل شبیهسازی سیستم قدرت همراه با پیلسوختی است و تنها نیاز به چند متغیر ا...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید