Related papers: An algorithm for the computation of the decomposit…
LU-factorization of matrices is one of the fundamental algorithms of linear algebra. The widespread use of supercomputers with distributed memory requires a review of traditional algorithms, which were based on the common memory of a…
We present an algorithm to compute $\mathrm{LCLM}$-decompositions for linear differentials operators with coefficients in the rational function field of characteristic $p$, $\mathbb{F}_{p^n}(t)$. We show that for an operator $L$ of order…
We give a long exact sequence for the homology of a graded atomic lattice equipped with a sheaf of modules, in terms of the deleted and restricted lattices. This is then used to compute the homology of the arrangement lattice of a…
In this note, we compute the homology with trivial coefficients of Lie algebras of generalized Jacobi matrices of type $B, C$ and $D$ over an associative unital $k$-algebra with $k$ being a field of characteristic $0$.
We relate the classes of unitary and calibrated representations of cyclotomic Hecke algebras and, in particular, we show that for the most important deformation parameters these two classes coincide. We classify these representations in…
Generalized matrix Lotka-Volterra lattice equations are obtained in a systematic way from a "master equation" possessing a bicomplex formulation.
In this paper we propose an idea of constructing a macro--scale matrix system given a micro--scale matrix linear system. Then the macro--scale system is solved at cheaper computing costs. The method uses the idea of the generalized…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
Locally affine Lie algebras are generalizations of affine Kac--Moody algebras with Cartan subalgebras of infinite rank whose root system is locally affine. In this note we study a class of representations of locally affine algebras…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
We first propose a concise singular value decomposition of dual matrices. Then, the randomized version of the decomposition is presented. It can significantly reduce the computational cost while maintaining the similar accuracy. We analyze…
For any field $K$ and for a completely arbitrary graph $E$, we characterize the Leavitt path algebras $L_K(E)$ that are indecomposable (as a direct sum of two-sided ideals) in terms of the underlying graph. When the algebra decomposes, it…
We discuss the Iwasawa-decomposition of a general matrix in SL($n$, $\mathbb{Q}_p$) and SL($n$, $\mathbb{R}$). For SL($n$, $\mathbb{Q}_p$) we define an algorithm for computing a complete Iwasawa-decomposition and give a formula…
We analyze an algorithm for computing a skew-Hermitian logarithm of a unitary matrix. This algorithm is very easy to implement using standard software and it works well even for unitary matrices with no spectral conditions assumed. Certain…
We describe an algorithm for the computation of generalized (or weighted) Ehrhart series based on Stanley decompositions as implemented in the offspring NmzIntegrate of Normaliz. The algorithmic approach includes elementary proofs of the…
In this paper we propose an approach to approximate a truncated singular value decomposition of a large structured matrix. By first decomposing the matrix into a sum of Kronecker products, our approach can be used to approximate a large…
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
We first present a filtration on the ring L of Laurent polynomials such that the direct sum decomposition of its associated graded ring gr L agrees with the direct sum decomposition of gr L, as a module over the complex general linear Lie…
Two methods to decompose block matrices analogous to Singular Matrix Decomposition are proposed, one yielding the so called economy decomposition, and other yielding the full decomposition. This method is devised to avoid handling matrices…