In this paper, a constructive general matrix factorization scheme is developed for extracting a nontrivial factor from a given nD (n > 2) polynomial matrix whose maximal order minors satisfy certain conditions. It is shown that three classes of nD polynomial matrices admit this kind of general matrix factorization. It turns out that minor prime factorization and determinantal factorization are ...

Tensor factorization with hard and/or soft constraints has played an important role in signal processing and data analysis. However, existing algorithms for constrained tensor factorization have two drawbacks: (i) they require matrixinversion; and (ii) they cannot (or at least is very difficult to) handle structured regularizations. We propose a new tensor factorization algorithm that circumven...

The following approaches to key frame extraction have been reviewed: boundarybased, motion-based, visual feature-based, based on clustering, matrix factorization and curve simplification. Methods that belong to each group of the approaches (or several groups simultaneously) have been also analyzed. Drawbacks and benefits of each group and method have been highlighted. As a result, a new techniq...

We give a matrix factorization for the solution of the linear system Ax = f , when coefficient matrix A is a dense symmetric positive definite matrix. We call this factorization as "WW T factorization". The algorithm for this factorization is given. Existence and backward error analysis of the method are given. The WDWT factorization is also presented. When the coefficient matrix is a symmetric...

A metabelian group G of order 1440 is constructed which provides a counterexample to a conjecture of Zassenhaus on automorphisms of integral group rings. The group is constructed in the spirit of [8]. An augmented automorphism of ZG which has no Zassenhaus factorization is given explicitly (this was already done in [7] for a group of order 6720), but this time only a few distinguished group rin...