Related papers: Twists of two or multiple idempotent matrices
This article discusses a more general and numerically stable Rybicki Press algorithm, which enables inverting and computing determinants of covariance matrices, whose elements are sums of exponentials. The algorithm is true in exact…
We study a general class of recurrence relations that appear in the application of a matrix diagonalization procedure. We find general closed formula and determine analytical properties of the solutions. We finally apply these findings in…
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured $n\times n$ matrix it can be computed in $\mathcal{O}(n^3)$ operations. An interesting problem arises if the input…
In this paper, a matrix is said to be prime if the row and column of this matrix are both prime numbers. We establish various necessary and sufficient conditions for developing matrices into the sum of tensor products of prime matrices. For…
The paper introduces a method of partial fractions with matrix coefficients and its applications to finding chains of generalized eigenvectors, to evaluation of matrix exponentials, and to solution of linear systems of ordinary differential…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
We show that the use of generalized multivariable forms of Hermite polynomials provide an useful tool for the evaluation of families of elliptic type integrals often encountered in electrostatic and electrodynamics
A finite expansion of the exponential map for a $N\times N$ matrix is presented. The method uses the Cayley-Hamilton theorem for writing the higher matrix powers in terms of the first N-1 ones. The resulting sums over the corresponding…
Applications of the theory and computations of boolean matrices are of fundamental importance to study a variety of discrete structural models. But the increasing ability of data collection systems to store huge volumes of multidimensional…
A brief introduction into Idempotent Mathematics and an idempotent version of Interval Analysis are presented. Some applications are discussed.
We consider the problem of estimating a rank-one nonsymmetric matrix under additive white Gaussian noise. The matrix to estimate can be written as the outer product of two vectors and we look at the special case in which both vectors are…
The generalized complex numbers can be realized in terms of $2\times2$ or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of…
A partial matrix is a matrix where only some of the entries are given. We determine the maximum rank of the symmetric completions of a symmetric partial matrix where only the diagonal blocks are given and the minimum rank and the maximum…
We investigate the Wall form of unipotent elements of index two in the orthogonal group and obtain a decomposition for these elements. Also, in characteristic two, the relation between the Wall form and some invariants of the induced…
In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit…
It is well known that a square complex matrix is called EP if it commutes with its Moore-Penrose inverse. In this paper, new classes of matrices which extend this concept are characterized. For that, we consider commutative equalities given…
We study some classes of semi-linear differential equations including both well-posed and ill-posed cases that can generate cocycles (or cocycle correspondences with generating cocycles). Under exponential dichotomy condition with other…
Many types of pairwise interaction take the form of a fixed set of nodes with edges that appear and disappear over time. In the case of discrete-time evolution, the resulting evolving network may be represented by a time-ordered sequence of…
In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…
This note describes a technique for generating large non-singular matrices with blocks of full rank. Our motivation to construct such matrices arises in the white-box implementation of cryptographic algorithms with S-boxes.