نتایج جستجو برای: minimal treesstructure building
تعداد نتایج: 364160 فیلتر نتایج به سال:
dynamic behavior of the wind-excited-benchmark-building using semi-active electromagnetic friction dampers (saemfds), with modulated homogeneous friction algorithm is presented. the performance of the benchmark building is studied under across wind loads by installing the saemfds with smooth boundary layer semi-active friction (sblsaf) algorithm. the governing equations of motion are solved by ...
Building construction challenge, in recent years, is the reduction of social, economical and environmentalimpacts along with economical nature and increasing life quality, as here sustainable construction is important. Pre-fabrication and industrialization are referred as a solution of sustainable construction due to some of its main characteristics consisting of many sustainability aspects. Du...
8 Matrices 16 8.1 Representation of vector spaces and linear transformations . . . . . . . . . . . . . . . 16 8.2 Similarity transformations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 8.3 Direct sums of matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 8.4 The companion matrix of a polynomial . . . . . . . . . . . . . . . . . . . . . . . ....
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...
The resolvent (λI − A)−1 of a matrix A is naturally an analytic function of λ ∈ C, and the eigenvalues are isolated singularities. We compute the Laurent expansion of the resolvent about the eigenvalues of A. Using the Laurent expansion, we prove the Jordan decomposition theorem, prove the Cayley-Hamilton theorem, and determine the minimal polynomial of A. The proofs do not make use of determin...
The notion of a separable extension is an important concept in Galois theory. Traditionally, this concept is introduced using the minimal polynomial and the formal derivative. In this work, we present an alternative approach to this classical concept. Based on our approach, we will give new proofs of some basic results about separable extensions (such as the existence of the separable closure, ...
Let φ : R → R be a continuously differentiable function on an interval J ⊂ R and let α = (α1, α2) be a point with algebraically conjugate coordinates such that the minimal polynomial P of α1, α2 is of degree ≤ n and height ≤ Q. Denote by Mn φ (Q, γ, J) the set of such points α such that |φ(α1)− α2| ≤ c1Q −γ . We show that for a real 0 < γ < 1 and any sufficiently large Q there exist positive va...
With the exception of a nite set of nite diierential Galois groups, if an irreducible linear diierential equation L(y) = 0 of prime order with unimodular diierential Galois group has a Liouvillian solution, then all algebraic solutions of smallest degree of the associated Riccati equation are solutions of a unique minimal polynomial. If the coeecients of L(y) = 0 are in Q()(x) Q(x) this unique ...
Let K be a field of characteristic not p (an odd prime), containing a primitive p-th root of unity ζ, and let L = K[z] with x n − a the minimal polynomial of z over K: thus L|K is a Kummer extension, with cyclic Galois group G = 〈σ〉 acting on L via σ(z) = ζz. T. Kohl, 1998, showed that L|K has pn−1 Hopf Galois structures. In this paper we describe these Hopf Galois structures.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید