Related papers: On constructing orthogonal generalized doubly stoc…
In this paper we investigate the algebraic geometric nature of a solution of the Yang-Baxter equation based on the quantum deformation of the centrally extended $sl(2|2)$ superalgebra proposed by Beisert and Koroteev \cite{BEKO}. We derive…
We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets. More specifically, we show that…
This paper deals with linear algebraic equations where the global coefficient matrix and constant vector are given respectively, by the summation of the coefficient matrices and constant vectors of the individual agents. Our approach is…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
We present a Bayesian scheme for the approximate diagonalisation of several square matrices which are not necessarily symmetric. A Gibbs sampler is derived to simulate samples of the common eigenvectors and the eigenvalues for these…
We provide a new and simple characterization of the multivariate generalized Laplace distribution. In particular, this result implies that the product of a Gaussian matrix with independent and identically distributed columns by an…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
We prove the existence of the unique solution of a general Backward Stochastic Differential Equation with quadratic growth driven by martingales. Some kind of comparison theorem is also proved.
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
The standard theorem for regular stochastic matrices is generalized to matrices with no sign restriction on the entries. The condition that column sums be equal to 1 is kept, but the regularity condition is replaced by a condition on the…
Studying the algebraic structure of the double ${\cal D}Y(g)$ of the yangian $Y(g)$ we present the triangular decomposition of ${\cal D}Y(g)$ and a factorization for the canonical pairing of the yangian with its dual inside ${\cal D}Y(g)$.…
We find a new $4\times4$ solution to the $osp_q(1|2)$-invariant Yang-Baxter equation with simple dependence on the spectral parameter and propose $2\times 2$ matrix expressions for the corresponding Lax operator. The general inhomogeneous…
Partitioning sparse matrices and graphs is a common and important problem in many scientific and graph analytics applications. In this work, we are concerned with a spatial partitioning called rectilinear partitioning (also known as…
Four results are given that address the existence, ambiguities and construction of a classical R-matrix given a Lax pair. They enable the uniform construction of R-matrices in terms of any generalized inverse of $ad L$. For generic $L$ a…
The Golub-Welsch algorithm [ Math. Comp., 23: 221-230 (1969)] has long been assumed symmetric for estimating quadratic forms. Recent research indicates that asymmetric quadrature nodes may be more often and the existence of a practical…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
In this paper, we give algorithms and methods of construction of self-dual codes over finite fields using orthogonal matrices. Randomization in the orthogonal group, and code extension are the main tools. Some optimal, almost MDS, and MDS…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
This article looks at the eigenvalues of magic squares generated by the MATLAB's magic($n$) function. The magic($n$) function constructs doubly even ($n = 4k$) magic squares, singly even ($n = 4k+2$) magic squares and odd ($n = 2k+1$) magic…
In recent years, structured matrix recovery problems have gained considerable attention for its real world applications, such as recommender systems and computer vision. Much of the existing work has focused on matrices with low-rank…