A matrix pencil based numerical method for the computation of the GCD of polynomials
N Karcanias, M Mitrouli - IEEE Transactions on Automatic …, 2002 - ieeexplore.ieee.org
The paper presents a new numerical method for the computation of the greatest common
divisor (GCD) of an m-set of polynomials of R [s], P/sub m, d/, of maximal degree d. It is …
divisor (GCD) of an m-set of polynomials of R [s], P/sub m, d/, of maximal degree d. It is …
Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
N Karcanias, S Fatouros, M Mitrouli… - Computers & Mathematics …, 2006 - Elsevier
The computation of the greatest common divisor (GCD) of many polynomials is a nongeneric
problem. Techniques defining “approximate GCD” solutions have been defined, but the …
problem. Techniques defining “approximate GCD” solutions have been defined, but the …
Computation of the GCD of polynomials using Gaussian transformations and shifting
M MITROULI, N KARCANIAS - International Journal of Control, 1993 - Taylor & Francis
A new numerical method for the computation of the greatest common divisor (GCD) of an m-
set of polynomials of R [s], Pm, d of maximal degree d, is presented. This method is based …
set of polynomials of R [s], Pm, d of maximal degree d, is presented. This method is based …
Matrix pencil approach to geometric system theory
N Karcanias - Proceedings of the institution of electrical engineers, 1979 - IET
A number of relationships between the geometric and the algebraic linear system theory are
briefly surveyed, which may be discussed in terms of the classical theory of matrix pencils …
briefly surveyed, which may be discussed in terms of the classical theory of matrix pencils …
Computing greatest common divisor of several parametric univariate polynomials via generalized subresultant polynomials
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 …
polynomials with parametric coefficients. It amounts to partitioning the parameter space …
An ODE-based method for computing the approximate greatest common divisor of polynomials
A Fazzi, N Guglielmi, I Markovsky - Numerical algorithms, 2019 - Springer
Computing the greatest common divisor of a set of polynomials is a problem which plays an
important role in different fields, such as linear system, control, and network theory. In …
important role in different fields, such as linear system, control, and network theory. In …
Equi-affine minimal-degree moving frames for polynomial curves
We develop a theory and an algorithm for constructing minimal-degree polynomial moving
frames for polynomial curves in an affine space. The algorithm is equivariant under volume …
frames for polynomial curves in an affine space. The algorithm is equivariant under volume …
Search-free decentralized direction-of-arrival estimation using common roots for non-coherent partly calibrated arrays
W Suleiman, P Parvazi - 2014 IEEE International Conference …, 2014 - ieeexplore.ieee.org
We consider decentralized direction-of-arrival (DoA) estimation for large partly calibrated
arrays composed of multiple fully calibrated uniform linear subarrays. Due to the difficulty of …
arrays composed of multiple fully calibrated uniform linear subarrays. Due to the difficulty of …
Greatest common divisors from generalized Sylvester resultant matrices
S Barnett - Linear and Multilinear Algebra, 1980 - Taylor & Francis
Sylvester's classical resultant matrix for determining the degree of the greatest common
divisor of two polynomials has recently been generalized to deal with m+ 1 polynomials m> …
divisor of two polynomials has recently been generalized to deal with m+ 1 polynomials m> …
Subresultant of several univariate polynomials
Subresultant of two univariate polynomials is a fundamental object in computational algebra
and geometry with many applications (for instance, parametric GCD and parametric …
and geometry with many applications (for instance, parametric GCD and parametric …