相关论文: Matrix Factorizations via the Inverse Function The…

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

We define Adams operations on matrix factorizations, and we show these operations enjoy analogues of several key properties of the Adams operations on perfect complexes with support developed by Gillet-Soul\'e in their paper "Intersection…

We give an algebraic (non-analytic) proof of the deformed boson-fermion Fock space construction of Molev's double supersymmetric Schur functions, among other results, from our previous paper. In other words, we make no assumptions on the…

In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…

The Cholesky decomposition is a fundamental tool for solving linear systems with symmetric and positive definite matrices which are ubiquitous in linear algebra, optimization, and machine learning. Its numerical stability can be improved by…

In this paper we prove a version of curved Koszul duality for Z/2Z-graded curved coalgebras and their coBar differential graded algebras. A curved version of the homological perturbation lemma is also obtained as a useful technical tool for…

A convergent algorithm for nonnegative matrix factorization with orthogonality constraints imposed on both factors is proposed in this paper. This factorization concept was first introduced by Ding et al. with intent to further improve…

Nonnegative matrix factorization (NMF) has an established reputation as a useful data analysis technique in numerous applications. However, its usage in practical situations is undergoing challenges in recent years. The fundamental factor…

In this paper, we prove that if the matrix of the linear system is symetric, the Cholesky decomposition can be obtained from the Gauss elimination method without pivoting, without proving that the matrix of the system is positive definite.

Nonnegative matrix factorization (NMF) is a relatively new unsupervised learning algorithm that decomposes a nonnegative data matrix into a parts-based, lower dimensional, linear representation of the data. NMF has applications in image…

We introduce matrix-valued weight functions of arbitrary size, which are analogues of the weight function for the Gegenbauer or ultraspherical polynomials for the parameter $\nu>0$. The LDU-decomposition of the weight is explicitly given in…

Matrix decomposition is ubiquitous and has applications in various fields like speech processing, data mining and image processing to name a few. Under matrix decomposition, nonnegative matrix factorization is used to decompose a…

We prove a family of factorization formulas for the combinatorial Donaldson--Thomas invariant for an acyclic quiver. A quantum dilogarithm identity due to Reineke, later interpreted by Rimanyi by counting codimensions of quiver loci, gives…

We obtain closed-form solutions of several inhomogeneous Lienard equations by the factorization method. The two factorization conditions involved in the method are turned into a system of first-order differential equations containing the…

Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

Let $R=K[x_{1},x_{2},\cdots, x_{m}]$ and $S=$ $K[y_{1},y_{2},\cdots, y_{m}]$ where $K$ is a field. %commutative ring with unity. In this paper, we propose a method showing how to obtain $3$-matrix factors for a given polynomial using either…

We study matrix identities involving multiplication and unary operations such as transposition or Moore-Penrose inversion. We prove that in many cases such identities admit no finite basis.

Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…

Biquaternionic Vekua-type equations arising from the factorization of linear second order elliptic operators are studied. Some concepts from classical pseudoanalytic function theory are generalized onto the considered spatial case. The…