The validity of mode-coupling theory (MCT) is restricted by an uncontrolled factorization approximation of density correlations. The factorization can be delayed and ultimately avoided, however, by explicitly including higher order correlations. We explore this approach within a microscopically motivated schematic model. Analytic tractability allows us to discuss in great detail the impact of f...

Since its introduction in 2012, the factorization theory for rational motions quickly evolved and found applications in theoretical and applied mechanism science. We provide an accessible introduction to motion factorization with many examples, summarize recent developments and hint at some new applications. In particular, we provide pseudo-code for the generic factorization algorithm, demonstr...

The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the matrix and its adjoint are available or the entries of the matrix can be sampled individually. For an N ×N matrix, the resulting factorization is a product of O...

The factorization of soft and ultrasoft gluons from collinear particles is shown at the level of operators in an effective field theory. Exclusive hadronic factorization and inclusive partonic factorization follow as special cases. The leading order Lagrangian is derived using power counting and gauge invariance in the effective theory. Several species of gluons are required, and softer gluons ...

These notes provide a pedagogical introduction to the theory of non-leptonic heavymeson decays recently proposed by Beneke, Buchalla, Sachrajda and myself. 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-scat...

We describe a novel technique for computing a sparse incomplete factorization of a general symmetric positive de nite matrix A. The factorization is not based on the Cholesky algorithm (or Gaussian elimination), but on A-orthogonalization. Thus, the incomplete factorization always exists and can be computed without any diagonal modi cation. When used in conjunction with the conjugate gradient a...

Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P syste...

Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of the tensor factorization has been empirically observed in many cases, but there was no systematic way to control it. In this work, we show that a sparsity measure recently proposed for non-negative matrix factorization...

Matrix factorization or factor analysis is an important task helpful in the analysis of high dimensional real world data. There are several well known methods and algorithms for factorization of real data but many application areas including information retrieval, pattern recognition and data mining often require processing of binary rather than real data. Unfortunately, the methods used for re...

We propose a new inertia-revealing factorization for sparse matrices. The factorization scheme and the method for extracting the inertia from it were proposed in the 1960s for dense, banded, or tridiagonal matrices, but they have been abandoned in favor of faster methods. We show that this scheme can be applied to any sparse matrix and that the fill in the factorization is bounded by the fill i...