Related papers: Matrix equation representation of the convolution …

For solving the continuous Sylvester equation, a class of the multiplicative splitting iteration method is presented. We consider two symmetric positive definite splittings for each coefficient matrix of the continuous Sylvester equations…

In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…

In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…

In [Q. Xu et al., The solutions to some operator equations, Linear Algebra Appl.(2008), doi:10.1016/j.laa.2008.05.034], Xu et al. provided the necessary and sufficient conditions for the existence of a solution to the equation…

We study in this paper solutions to several kinds of linear bimatrix equations arising from pole assignment and stability analysis of complex-valued linear systems, which have several potential applications in control theory, particularly,…

We consider commutativity equations $F_i F_j =F_j F_i$ for a function $F(x^1, \dots, x^N),$ where $F_i$ is a matrix of the third order derivatives $F_{ikl}$. We show that under certain non-degeneracy conditions a solution $F$ satisfies the…

We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…

It is well known that finite-dimensional polyhedral convex sets can be generated by finitely many points and finitely many directions. Representation formulas in this spirit are obtained for convex polyhedra and generalized convex polyhedra…

Let $\mathbb{F}$ be a field of characteristic $p$, and let $UT_n(\mathbb{F})$ be the algebra of $n \times n$ upper triangular matrices over $\mathbb{F}$ with an involution of the first kind. In this paper we describe: the set of all…

A general and fast method is conceived for computing the cyclic convolution of n points, where n is a prime number. This method fully exploits the internal structure of the cyclic matrix, and hence leads to significant reduction of the…

We propose the convex factorization machine (CFM), which is a convex variant of the widely used Factorization Machines (FMs). Specifically, we employ a linear+quadratic model and regularize the linear term with the $\ell_2$-regularizer and…

We focus on the tranformation matrices between the standard Young-Yamanouchi basis of an irreducible representation for the symmetric group S_n and the split basis adapted to the direct product subgroups S_{n_1} \times S_{n-n_1} . We…

A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…

We give a formula for the spectral pairs (after Steenbrink) for composite singularities of several variables. (Note that for two variable case is studyed by Nemethi-Steenbrink.) Here composite singularity is given by the equation f(g_1,…

We present a symbolic-numeric method to refine an approximate isolated singular solution $\hat{\mathbf{x}}=(\hat{x}_{1}, ..., \hat{x}_{n})$ of a polynomial system $F=\{f_1, ..., f_n\}$ when the Jacobian matrix of $F$ evaluated at…

We consider the reconciliation problem, in which the task is to find a mapping of a gene tree into a species tree, so as to maximize the likelihood of such fitting, given the available data. We describe a model for the evolution of the…

A system of nonlinear ordinary differential equations with forcing function is developed to model evolution processes in complex systems. In this system R, C, and P are the resource, consumption, and production functions correspondingly. F…

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…

Matrix functions are utilized to rewrite smooth spectral constrained matrix optimization problems as smooth unconstrained problems over the set of symmetric matrices which are then solved via the cubic-regularized Newton method. A…

We derive a system of fixed-point equations for the equilibrium transfers in a class of one-to-one matching models with linear transferable utility. We then show that, when the degree of substitution between alternatives is bounded from…