Related papers: Generalized companion matrix for approximate GCD
We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…
We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm…
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real or the complex coefficients. For a given pair of polynomials and a degree, our algorithm finds a pair of…
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…
We propose a modification of the GPGCD algorithm, which has been presented in our previous research, for calculating approximate greatest common divisor (GCD) of more than 2 univariate polynomials with real coefficients and a given degree.…
Differential (Ore) type polynomials with approximate polynomial coefficients are introduced. These provide a useful representation of approximate differential operators with a strong algebraic structure, which has been used successfully in…
Differential (Ore) type polynomials with "approximate" polynomial coefficients are introduced. These provide an effective notion of approximate differential operators, with a strong algebraic structure. We introduce the approximate Greatest…
For a pair of polynomials with real or complex coefficients, given in any particular basis, the problem of finding their GCD is known to be ill-posed. An answer is still desired for many applications, however. Hence, looking for a GCD of…
In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…
Given a field $F$, an integer $n\geq 1$, and a matrix $A\in M_n(F)$, are there polynomials $f,g\in F[X]$, with $f$ monic of degree $n$, such that $A$ is similar to $g(C_f)$, where $C_f$ is the companion matrix of $f$? For infinite fields…
We adapt Victor Y. Pan's root-based algorithm for finding approximate GCD to the case where the polynomials are expressed in Bernstein bases. We use the numerically stable companion pencil of Gudbj\"orn F. J\'onsson to compute the roots,…
Let $f$ be an arithmetical function. The matrix $[f(i,j)]_{n\times n}$ given by the value of $f$ in greatest common divisor of $(i,j)$, $f\big((i,j)\big)$ as its $i,\; j$ entry is called the greatest common divisor (GCD) matrix. We consider…
This paper presents a regularization theory for numerical computation of polynomial greatest common divisors and a convergence analysis, along with a detailed description of a blackbox-type algorithm. The root of the ill-posedness in…
The purpose of this paper is to show how Gelfand's formula and balancing can be used to improve the upper and lower bounds of the spectrum of a companion matrix associated with a given real or complex polynomial. Examples and other related…
We study the Smith forms of matrices of the form $f(C_g)$ where $f(t),g(t)\in R[t]$, $C_g$ is the companion matrix of the (monic) polynomial $g(t)$, and $R$ is an elementary divisor domain. Prominent examples of such matrices are circulant…
This manuscript presents a generalization of the structure of the null space of the Bezout matrix in the monomial basis, see [G. Heinig and K. Rost, Algebraic methods for toeplitz-like matrices and operators, 1984], to an arbitrary basis.…
Modular composition is the problem of computing the coefficient vector of the polynomial $f(g(x)) \bmod h(x)$, given as input the coefficient vectors of univariate polynomials $f$, $g$, and $h$ over an underlying field $\mathbb{F}$. While…
Given polynomial maps $f, g \colon \mathbb{R}^n \to \mathbb{R}^n,$ we consider the {\em polynomial complementary problem} of finding a vector $x \in \mathbb{R}^n$ such that \begin{equation*} f(x) \ \ge \ 0, \quad g(x) \ \ge \ 0, \quad…
Let $R$ be a commutative ring and $g(t) \in R[t]$ a monic polynomial. The commutative ring of polynomials $f(C_g)$ in the companion matrix $C_g$ of $g(t)$, where $f(t)\in R[t]$, is called the Companion Ring of $g(t)$. Special instances…
This is an introductory note concerning the distribution vectors in a unitary representation of a Lie group. We discuss the definition of matrix coefficients associated with a pair of distributions and how one can compute them. Most of the…