Related papers: Regularizing algorithm for mixed matrix pencils
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…
The change of the Kronecker structure of a matrix pencil perturbed by another pencil of rank one has been characterized in terms of the homogeneous invariant factors and the chains of column and row minimal indices of the initial and the…
In this article, we propose an algorithm for approximating the action of $\varphi-$functions of matrices against vectors, which is a key operation in exponential time integrators. In particular, we consider matrices with Kronecker sum…
We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…
Docovic and Szechtman, [Proc. Amer. Math. Soc. 133 (2005) 2853-2863] considered a vector space V endowed with a bilinear form. They proved that all isometries of V over a field F of characteristic not 2 have determinant 1 if and only if V…
Computer algebra is widely used in various fields of mathematics, physics and other sciences. The simplification of tensor expressions is an important special case of computer algebra. In this paper, we consider the reduction of tensor…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…
The spectral density of random matrices is studied through a quaternionic generalisation of the Green's function, which precisely describes the mean spectral density of a given matrix under a particular type of random perturbation. Exact…
Kasteleyn counted the number of domino tilings of a rectangle by considering a mutation of the adjacency matrix: a Kasteleyn matrix K. In this paper we present a generalization of Kasteleyn matrices and a combinatorial interpretation for…
A unified approach to parametrization of the mixing matrix for $N$ generations is developed. This approach not only has a clear geometrical underpinning but also has the advantage of being economical and recursive and leads in a natural way…
V.I. Arnold [Russian Math. Surveys 26 (2) (1971) 29-43] constructed a miniversal deformation of matrices under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it can be reduced…
The class of strictly sign regular (SSR) matrices has been extensively studied by many authors over the past century, notably by Schoenberg, Motzkin, Gantmacher, and Krein. A classical result of Gantmacher-Krein assures the existence of SSR…
V.I. Arnold [Russian Math. Surveys 26(2) (1971) 29-43] constructed a miniversal deformation of a square complex matrix under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it…
We decide completely the cycle structure of pure summing register (PSR) and complementary summing register (CSR). Based on the state diagram of CSR, we derive an algorithm to generate de Bruijn cycles from CSR inspired by Tuvi Etzion's…
This paper provides a general solution for the Kronecker product decomposition (KPD) of vectors, matrices, and hypermatrices. First, an algorithm, namely, monic decomposition algorithm (MDA), is reviewed. It consists of a set of projections…
Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system $Vc=b$ where the rows of a square matrix $V$ are constructed by progression of the power polynomials. It has many applications in…
Efficiently processing basic linear algebra subroutines is of great importance for a wide range of computational problems. In this paper, we consider techniques to implement matrix functions on a quantum computer, which are composed of…
The integral monodromy on the Milnor lattice of an isolated quasihomogeneous singularity is subject of an almost untouched conjecture of Orlik from 1972. We prove this conjecture for all iterated Thom-Sebastiani sums of chain type…
In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This note presents a geometric relationship between Strassen and…