Related papers: Matrix equation representation of the convolution …
The exponential of an NxN matrix can always be expressed as a matrix polynomial of order N-1. In particular, a general group element for the fundamental representation of SU(N) can be expressed as a matrix polynomial of order N-1 in a…
Component-wise accurate algorithms for computing the principal square root of an M-matrix are designed in terms of triplet representations. A triplet representation of an M-matrix $A$ is the triple $(P, {\bf u},{\bf v})$, where the matrix…
Phylogenetic tree shapes capture fundamental signatures of evolution. We consider ``ranked'' tree shapes, which are equipped with a total order on the internal nodes compatible with the tree graph. Recent work has established an elegant…
For any three $\,n\times n\,$ matrices $\,A,B,X\,$ over a commutative ring $\,S$, we prove that $\,{\rm det}\,(A+B-AXB)={\rm det}\,(A+B-BXA) \in S$. This apparently new formula may be regarded as a ``ternary generalization'' of Sylvester's…
In a seminal paper, Valiant (2006) introduced a computational model for evolution to address the question of complexity that can arise through Darwinian mechanisms. Valiant views evolution as a restricted form of computational learning,…
Motivated by the recent work of William Y.C. Chen, in which he presents a way to solve cubic equations by considering the identity of Sylvester, we investigate the solutions obtained in this way. It leads us to a unified expression of the…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
The convolution potential arises in a wide variety of application areas, and its efficient and accurate evaluation encounters three challenges: singularity, nonlocality and anisotropy. We introduce a fast algorithm based on a far-field…
This paper provides an overview of the necessary and sufficient conditions for guaranteeing the unique solvability of absolute value equations. In addition to discussing the basic form of these equations, we also address several…
In this paper, we discussed the unique solvability of the two absolute value matrix equations. The unique solvability condition $\rho (\vert A^{-1} B \vert)<1$ is provided for the generalized absolute value matrix equation (GAVME) $AX + B…
We consider the general problem of learning about a matrix through vector-matrix-vector queries. These queries provide the value of $\boldsymbol{u}^{\mathrm{T}}\boldsymbol{M}\boldsymbol{v}$ over a fixed field $\mathbb{F}$ for a specified…
A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…
W.E. Roth (1952) proved that the matrix equation $AX-XB=C$ has a solution if and only if the matrices $\left[\begin{matrix}A&C\\0&B\end{matrix}\right]$ and $\left[\begin{matrix}A&0\\0&B\end{matrix}\right]$ are similar. A. Dmytryshyn and B.…
Recent work (Cohen & Welling, 2016) has shown that generalizations of convolutions, based on group theory, provide powerful inductive biases for learning. In these generalizations, filters are not only translated but can also be rotated,…
We derive necessary and sufficient conditions for the existence of the exact solution to the Sylvester-type quaternion tensor system $ \mathcal{A}_i\ast_{N}\mathcal{X}_i+ \mathcal{Y}_i\ast_{M}\mathcal{B}_i+\mathcal{C}_i\ast_{N}…
In this paper, an iterative algorithm is presented for solving Sylvester tensor equation $\mathscr{A}*_M\mathscr{X}+\mathscr{X}*_N\mathscr{C}=\mathscr{D}$, where $\mathscr{A}$, $\mathscr{C}$ and $\mathscr{D}$ are given tensors with…
Nonlinear non-Abelian Korteweg-de Vries (KdV) and modified Korteweg-de Vries (mKdV) equations and their links via Baecklund transformations are considered. The focus is on the construction of soliton solutions admitted by matrix modified…
An element of the algebra $M_n(\mathbb{F})$ of $n \times n$ matrices over a field $\mathbb{F}$ is called an involution if its square equals the identity matrix. Gustafson, Halmos, and Radjavi proved that any product of involutions in…
We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…
We study the problem of finding elements in the intersection of an arbitrary conic variety in $\mathbb{F}^n$ with a given linear subspace (where $\mathbb{F}$ can be the real or complex field). This problem captures a rich family of…