نتایج جستجو برای: compact element
تعداد نتایج: 292439 فیلتر نتایج به سال:
The choice of basis functions for a nite element space has important consequences in the practical implementation of the nite element method. A traditional choice is the nodal or Lagrange basis. Many of the computational advantages of this basis derive from the property of compact support enjoyed by the basis functions. Here we study a second choice, the hierarchical basis, and examine its appl...
Abstract. We study random vectors of the form (Tr(AV ), . . . ,Tr(AV )), where V is a uniformly distributed element of a matrix version of a classical compact symmetric space, and the A are deterministic parameter matrices. We show that for increasing matrix sizes these random vectors converge to a joint Gaussian limit, and compute its covariances. This generalizes previous work of Diaconis et ...
The present note is devoted to study a functional equation on a locally compact Abelian group group which appears in characterization of probability distributions by the optimality of an estimate. Let X be a second countable locally compact Abelian group, Y = X be its character group, (x; y) be the value of a character y 2 Y at an element x 2 X. Denote by M(X) the convolution semigroup of proba...
In the first part of this paper, we prove a minimax inequality for maps satisfying a generalized coercivity type condition. As a consequence, we prove a result on the solvability of complementarity problems. In the second part, a result on the existence of maximal element in non-compact domains is obtained and as application, we prove the existence of equilibrium for an abstract economy (or gen...
In this lecture we will get to know several techniques that can be grouped by the general definition of sketching. When using the sketching technique each element is replaced by a more compact representation of itself. An alternative algorithm is run on the more compact representations. Finally, one has to show that this algorithm gives the same result as the original algorithm with high probab...
The application of conventional reflector-type compact antenna test ranges (CATR’s) becomes increasingly difficult above 100 GHz. The main problems are the tight surface accuracy requirements for the reflectors and, therefore, the high manufacturing costs. These problems can be overcome by the use of a hologram type of compact range in which a planar hologram structure is used as a collimating ...
In this paper, we study the relation between the soft sets and soft Lie algebras with the lattice theory. We introduce the concepts of the lattice of soft sets, full soft sets and soft Lie algebras and next, we verify some properties of them. We prove that the lattice of the soft sets on a fixed parameter set is isomorphic to the power set of a ...
Let A be a C *-algebra. Let A ⊗ A be the minimal C *-tensor product of A with itself and let M (A ⊗ A) be the multiplier algebra of A ⊗ A. A comultiplication on A is a non-degenerate *-homomorphism ∆ : A → M (A ⊗ A) satisfying the coassociativity law (∆ ⊗ ι)∆ = (ι ⊗ ∆)∆ where ι is the identity map and where ∆ ⊗ ι and ι ⊗ ∆ are the unique extensions to M (A ⊗ A) of the obvious maps on A ⊗ A. We ...
A compact, low-profile, broadside radiating, two-element Huygens dipole array is developed for in-band full-duplex (IBFD) applications. Each radiating element a multilayer near-field resonant parasitic (NFRP) design that electrically small with $ka=0.76$ </tex-ma...
Let L be a non empty reflexive relational structure. The functor CompactSublatt(L) yields a strict full relational substructure of L and is defined as follows: (Def. 1) For every element x of L holds x ∈ the carrier of CompactSublatt(L) iff x is compact. Let L be a lower-bounded non empty reflexive antisymmetric relational structure. Observe that CompactSublatt(L) is non empty. Next we state th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید