Factorization of Excessive Kernels
نویسنده
چکیده
We show that exactly the excessive kernels with the Motoo-Mokobodzki property are factorized by every suitable excessive kernel. Mathematics Subject Classifications (2000): 60J35, 60J45
منابع مشابه
B?J/?(?,K) Decays within QCD Factorization Approach
We used QCD factorization for the hadronic matrix elements to show that the existing data, in particular the branching ratios BR ( ?J/?K) and BR ( ?J/??), can be accounted for this approach. We analyzed the decay within the framework of QCD factorization. We have complete calculation of the relevant hard-scattering kernels for twist-2 and twist-3. We calculated this decays in a special scale ...
متن کاملFactorization and Inversion of a Million Matrices using GPUs: Challenges and Countermeasures
This paper presents new algorithmic approaches and optimization techniques for LU factorization and matrix inversion of millions of very small matrices using GPUs. These problems appear in many scientific applications including astrophysics and generation of block-Jacobi preconditioners. We show that, for very small problem sizes, design and optimization of GPU kernels require a mindset differe...
متن کاملExcessive factorizations of bipartite multigraphs
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2, . . . , Fr} of 1-factors of G whose union is E(G) and, subject to this condition, r is minimum. The integer r is called the excessive index of G and denoted by χ′e(G). Analogously, let m be a positive integer. We say...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کامل$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کامل