Quadrant Interlocking Factorization (QIF), an alternative to LU factorization, is suitable for factorizing invertible matrix A such that det(A) , 0. The QIF, with its application in parallel computing, the most efficient factorization technique yet underutilized. two forms of QIF among others, which are not only similar algorithm but also computation, WZ and WH differs applications properties. ...

Tensor factorization arises in many machinelearning applications, such knowledge basemodeling and parameter estimation in latentvariable models. However, numerical meth-ods for tensor factorization have not reachedthe level of maturity of matrix factorizationmethods. In this paper, we propose a newmethod for CP tensor factorization that usesrandom projections to ...

The non-negative matrix factorization (NMF) algorithm is a classical matrix factorization and dimension reduction method in machine learning and data mining. However, in real problems, we always have to run the algorithm for several times and use the best matrix factorization result as the final output because of the random initialization of the matrix factorization. In this paper, we proposed ...

QCD factorization for exclusive non-leptonic B-meson decays: General arguments and the case of heavy–light final states Abstract We provide a rigorous basis for factorization for a large class of non-leptonic two-body B-meson decays in the heavy-quark limit. The resulting factorization formula incorporates elements of the naive factorization approach and the hard-scattering approach , but allow...

Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial time an overorder O′ of O and a gcdfree refinement of the input factorization; i.e., a factorization of aO′ into a power product of O′-ideals such that the bases of that power product are all invertible and pairwise copr...

In path factorization, H. Wang [1] gives the necessary and sufficient conditions for the existence of P_k-factorization of a complete bipartite graph for k, an even integer. Further, Beiling Du [2] extended the work of H. Wang, and studied the P_2k-factorization of complete bipartite multigraph. For odd value of k the work on factorization was done by a number of researchers. P_3-factorization ...

BK-factorization of bivariate LPDOs is outlined. As an example, class of factorized hyperbolic operators is constructed as well as general solution in quadratures for operators of this class. Coupling of BK-factorization with Darboux-Laplace transformations is described which provided additional factorization conditions (demand of generalized commutativity) in the case when BK-factorization doe...

The factorization method presented in this paper takes advantage of the special structures and properties of saddle point matrices. A variant of Gaussian elimination equivalent to the Cholesky’s factorization is suggested and implemented for factorizing the saddle point matrices block-wise with small blocks of order 1 and 2. The Gaussian elimination applied to these small blocks on block level ...

We enumerate Hurwitz orbits of shortest reflection factorizations an arbitrary element in the infinite family $G(m, p, n)$ complex groups. As a consequence, we characterize elements for which action is transitive and give simple criterion to tell when two belong same orbit. also quasi-Coxeter (those with factorization that generates whole group) n)$.