Related papers: Matrix equation representation of the convolution …
We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…
In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of the signals is known and calculated in…
I compare the matrix representation of the basic statements of Special Relativity with the conventional vector space representation. It is shown, that the matrix form reproduces all equations in a very concise and elegant form, namely:…
Let $M_{1,2}(F)$ be the algebra of $3 \times 3$ matrices with orthosymplectic superinvolution $*$ over a field $F$ of characteristic zero. We study the $*$-identities of this algebra through the representation theory of the group…
The elliptic Korteweg-de Vries (KdV) system is a multi-component generalization of the lattice potential KdV equation, whose soliton solutions are associated with an elliptic Cauchy kernel (i.e., a Cauchy kernel on the torus). In this paper…
This is the first in a series of papers which deal with the development of novel methods for solving a system of linear algebraic equations with a time complexity lower than existing algorithms. The NxN system of linear equations, Ax = b,…
The large variety of Fourier transforms in geometric algebras inspired the straight forward definition of ``A General Geometric Fourier Transform`` in Bujack et al., Proc. of ICCA9, covering most versions in the literature. We showed which…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
For all natural numbers $n$, we discuss the evaluation of the convolution sum, $\underset{\substack{{(l,m) \in \mathbb{N}_0^2} \\ {\alpha\,l+\beta\,m=n} } }{\sum}\sigma(l)\sigma(m)$, where $\alpha\beta=14,22,26$. We generalize the…
Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…
With the recent success of representation learning methods, which includes deep learning as a special case, there has been considerable interest in developing representation learning techniques that can incorporate known physical…
In this paper, we study the complexity of solving generic over-determined bilinear systems over a finite field $\mathbb{F}$. Given a generic bilinear sequence $B \in \mathbb{F}[\mathbf{x},\mathbf{y}]$, with respect to a partition of…
In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…
Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…
Theoretical and computational properties of a vector equation $Ax-\|x\|_1x=b$ are investigated, where $A$ is an invertible $M$-matrix and $b$ is a nonnegative vector. Existence and uniqueness of a nonnegative solution is proved. Fixed-point…
We prove a general result on presentations of finitely-generated algebras and apply it to obtain nice presentations for some noncommutative algebras arising in the matrix bispectral problem. By "nice presentation" we mean a presentation…
The aim of this work is to present, in self-contained form, results concerning fundamental and the most important questions related to linear stochastic Volterra equations of convolution type. The paper is devoted to study the existence and…
The numbers $f_\lambda$ of standard tableaux of shape $\lambda\vdash n$ satisfy 2 fundamental recursions: $f_\lambda = \sum f_{\lambda^-}$ and $(n + 1)f_\lambda=\sum f_{\lambda^+}$, where $\lambda^-$ and $\lambda^+$ run over all shapes…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
This paper establishes several new facts on generalized polyhedral convex sets and shows how they can be used in vector optimization. Among other things, a scalarization formula for the efficient solution sets of generalized vector…