Related papers: Structured Multi-Matrix Variate, Matrix Polynomial…
The invariants of solvable Lie algebras with nilradicals isomorphic to the algebra of strongly upper triangular matrices and diagonal nilindependent elements are studied exhaustively. Bases of the invariant sets of all such algebras are…
Automorphisms of structural matrix algebras in block upper triangular form has been studied recently in \cite{Akkurt E-M Barker 2}, and this work is a follow-up paper of that study. The aim of this paper is to explain the topic in a much…
The main goal of the paper is the discussion of a deeper interaction between matrix theory over polynomial rings over a field and typical methods of commutative algebra and related algebraic geometry. This is intended in the sense of…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
Multivalued projections are applied to the study of weighted least squares solutions of linear relations equations (or inclusions) and some of its applications. To this end a matrix representation of multivalued projections with respect to…
The eigenvalues of a matrix polynomial can be determined classically by solving a generalized eigenproblem for a linearized matrix pencil, for instance by writing the matrix polynomial in companion form. We introduce a general scaling…
In this paper we present an algorithmic procedure that transforms, if possible, a given system of ordinary or partial differential equations with radical dependencies in the unknown function and its derivatives into a system with polynomial…
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
In (relativistic) electronic structure methods, the quaternion matrix eigenvalue problem and the linear response (Bethe-Salpeter) eigenvalue problem for excitation energies are two frequently encountered structured eigenvalue problems.…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We introduce a unified method for study of 2-dimensional invariant subspaces of matrices and their corresponding super-eigenvalues. As a novel application to non-commutative algebra, we present a connection between the eigenvalues of…
We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of…
We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…
We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several…
We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…
We present the first systematic extension of the classical Hermite-Laguerre quadratic correspondence to the matrix-valued setting. Starting from a Hermite-type weight matrix W(x) = exp(-x^2) Z(x) with W(x) = W(-x), the change of variables y…
The expressions of solutions for general $n\times m$ matrix-valued inhomogeneous linear stochastic differential equations are derived. This generalizes a result of Jaschke (2003) for scalar inhomogeneous linear stochastic differential…
Polynomial matrix inequalities can be solved using hierarchies of convex relaxations, pioneered by Henrion and Lassere. In some cases, this might not be practical, and one may need to resort to methods with local convergence guarantees,…