Abstract: In this paper, we propose an algorithm for computing an approximate polynomial matrix eigenvalue decomposition (PEVD).

Abstract: We present a simple algorithm to compute the factors of a Unimodular-Upper (UU) polynomial matrix decomposition.

\texttt{decompoly} is a program that takes as input a polynomial in one or several variables with rational coefficients, and ...

The polynomial eigenvalue problem is to find the eigenpair of $(\lambda,x) \in \mathbb{C}\bigcup \{\infty\} \times \mathbb{C} ...

PolarGrad (Polar Gradient methods; Lau et al., 2025) is a class of matrix-gradient optimizers based on the concept of gradient ...