نتایج جستجو برای: bilinear operator
تعداد نتایج: 101916 فیلتر نتایج به سال:
We consider saddle-point problems that typically arise from the mixed finite element discretization of second order elliptic problems. By proper equivalent algebraic operations the considered saddle-point problem is transformed to another saddle-point problem. The resulting problem can then be efficiently preconditioned by a block-diagonal matrix or by a factored block-matrix (the blocks corres...
We consider the integral domain restriction operator TΩ for certain bilinear operator T . We obtain that if (s, p1, p2) satisfies 1 p1 + 1 p2 ≥ 2 min{1,s} and ‖T‖Lp1×Lp2→Ls < ∞, then ‖TΩ‖Lp1×Lp2→Ls < ∞. For some special domain Ω, this property holds for triplets (s, p1, p2) satisfying 1 p1 + 1 p2 > 1 min{1,s} . 2010 Mathematics Subject Classification: 42B25.
Laplace–Beltrami operator and its discretization play a central role in the fields of image processing, computer graphics, computer aided geometric design and so on. In this paper, a discrete scheme for Laplace–Beltrami operator over quadrilateral meshes is constructed based on a bilinear interpolation of the quadrilateral. Convergence results for the proposed discrete scheme are established un...
Results analogous to those proved by Rubio de Francia [28] are obtained for a class of maximal functions formed dilations bilinear multiplier operators limited decay. We focus our attention on L2 × → L1 estimates. discuss two applications: the boundedness Bochner-Riesz operator and spherical operator. For latter we improve known results in [1] reducing dimension restriction from n ≥ 8 4.
A necessary and sufficient condition for a central simple algebra with involution over a field of characteristic two to be decomposable as a tensor product of quaternion algebras with involution, in terms of its Frobenius subalgebras, is given. It is also proved that a bilinear Pfister form, recently introduced by A. Dolphin, can classify totally decomposable central simple algebras of orthogon...
We study the regularity of the bilinear maximal operator when applied to Sobolev functions, proving that it maps W (R) × W (R) → W (R) with 1 < p, q < ∞ and r ≥ 1, boundedly and continuously. The same result holds on R when r > 1. We also investigate the almost everywhere and weak convergence under the action of the classical Hardy-Littlewood maximal operator, both in its global and local versi...
The optimal robust disturbance rejection problem plays an important role in feedback control theory. Here its time-varying version is solved explicitly in terms of duality and operator theory. In particular, the optimum is shown to satisfy a time-varying allpass property. Moreover, optimal performance is given in terms of the norm of a bilinear form. The latter depends on a lower triangular pro...
In this paper the smoothness properties of Green’s operator-function an exponentially dichotomous bilinear matrix system and the smoothness properties the invariant torus of nonhomogeneus matrix system of equations have been considered. It hHave been proved that if some conditions, concerning the properties of coefficient of the system hold this operator-function has smoothness index which depe...
Every compact symmetric bilinear form B on a complex Hilbert space produces, via an antilinear representing operator, a real spectrum consisting of a sequence decreasing to zero. We show that the most natural analog of Courant’s minimax principle for B detects only the evenly indexed eigenvalues in this spectrum. We explain this phenomenon, analyze the extremal objects, and apply this general f...
A relativistic quantum mechanics is formulated in which all of the interactions are in the four-momentum operator and Lorentz transformations are kinematic. Interactions are introduced through vertices, which are bilinear in fermion and antifermion creation and annihilation operators, and linear in boson creation and annihilation operators. The fermionantifermion operators generate a unitary Li...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید