Related papers: Stability of quaternion matrix polynomials

A method for evaluating matrix polynomials have recently been developed that require one fewer matrix product ($1M$) than the Paterson--Stockmeyer (PS) method. Since the computational cost for large-scale matrices is asymptotically…

Consider an $n \times n$ matrix polynomial $P(\lambda)$. A spectral norm distance from $P(\lambda)$ to the set of $n \times n$ matrix polynomials that have a given scalar $\mu\in\mathbb{C}$ as a multiple eigenvalue was introduced and…

We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

Every $n th$ order monic polynomial corresponds $n$-dimensional vector. If the given polynomial is stable that is all its roots lie in the open left half plane it is said to be Hurwitz polynomial and the corresponding vector is called…

We investigate entropy minimization problems for quantum states subject to convex block-separable constraints. Our principal result is a quantitative stability theorem: under a natural confining (fixed-support) hypothesis, if a state has…

Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important role in control theory, linear systems theory, and coding theory. It is a common practice to arrange the vectors of any minimal basis as…

A numerical integrator for $\dot{x}=f(x)$ is called \emph{stable} if, when applied to the 1D Dahlquist test equation $\dot{x}=\lambda x,\lambda\in\mathbb{C}$ with fixed timestep $h>0$, the numerical solution remains bounded as the number of…

Many problems in systems and control theory can be formulated in terms of robust D-stability analysis, which aims at verifying if all the eigenvalues of an uncertain matrix lie in a given region D of the complex plane. Robust D-stability…

Stability of soliton families in one-dimensional nonlinear Schroedinger equations with non-parity-time (PT)-symmetric complex potentials is investigated numerically. It is shown that these solitons can be linearly stable in a wide range of…

In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the $n\times n$ matrix polynomial of arbitrary degree $k$. Given a set of $m$ eigenpairs ($1 \leqslant m \leqslant kn$), this problem…

We present new polynomial-based methods for discrete-time quaternionic systems, highlighting how noncommutative multiplication modifies classical control approaches. Defining quaternionic polynomials via a backward-shift operator, we…

{In 2020, Carney et.al. proved the quaternionic version of the Enestr\"{o}m-Kakeya Theorem, which states that a polynomial $p(q)=\sum_{\nu=0}^n q^\nu a_\nu$ with non-negative and monotonically increasing coefficients $(0<a_0\le a_1\le…

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

In this paper the relationship between the problem of constructing the ground state energy for the quantum quartic oscillator and the problem of computing mean eigenvalue of large positively definite random hermitean matrices is…

This paper provides the spectral decomposition of $(\star,\epsilon)$-palindromic quadratic matrix polynomial $P(\lambda)$ by a standard pair and a parameter matrix. When $J$ is assumed to be a block diagonal matrix, the parameter matrix…

We study the discrete dynamics of standard (or left) polynomials $f(x)$ over division rings $D$. We define their fixed points to be the points $\lambda \in D$ for which $f^{\circ n}(\lambda)=\lambda$ for any $n \in \mathbb{N}$, where…

To each 4x4 matrix of reals another 4x4 matrix is constructed, the so-called associate matrix. This associate matrix is shown to have rank 1 and norm 1 (considered as a 16D vector) if and only if the original matrix is a 4D rotation matrix.…

We extend and improve the existing characterization of the dynamics of general quadratic real polynomial maps with coefficients that depend on a single parameter $\lambda$, and generalize this characterization to cubic real polynomial maps,…

Stability is a key property of both forward models and inverse problems, and depends on the norms considered in the relevant function spaces. For instance, stability estimates for hyperbolic partial differential equations are often based on…