Add to ORKGIn this thesis we study the computation of the greatest common divisor of two polynomials. Firstly, properties of Sylvester matrices are considered as well as their role in computation. We then note, that this approach can be naturally generalized for several polynomials. In the penultimate section, Bézout matrices are studied as an analogy to the Sylvester ones, providing necessary comparison. Extension for more than polynomials is presented here as well. Algorithms corresponding to the individual approaches are presented as well. Finally, the algorithms are implemented in MATLAB and are compared in numerical experiments. Powered by TCPDF (www.tcpdf.org
The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is express...
We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomi...
summary:The computation of the greatest common divisor (GCD) has many applications in several discip...
In this thesis we study the computation of the greatest common divisor of two polynomials. Firstly, ...
summary:The coefficients of the greatest common divisor of two polynomials $f$ and $g$ (GCD$(f,g)$) ...
This paper revisits the Bézout, Sylvester, and power-basis matrix representations of the greatest co...
In this paper, we examine the problem of computing the greatest common divisor (GCD) of univariate p...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
AbstractThis paper presents a new numerical algorithm for the computation of the greatest common div...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
AbstractBarnett’s method through Bezoutians is a purely linear algebra method allowing to compute th...
AbstractIf a(λ) and b(λ) are two polynomials and A is the companion matrix of a(λ), then the matrix ...
© 2018, Pleiades Publishing, Ltd. In this article we present a new algebraic approach to the greates...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is express...
We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomi...
summary:The computation of the greatest common divisor (GCD) has many applications in several discip...
In this thesis we study the computation of the greatest common divisor of two polynomials. Firstly, ...
summary:The coefficients of the greatest common divisor of two polynomials $f$ and $g$ (GCD$(f,g)$) ...
This paper revisits the Bézout, Sylvester, and power-basis matrix representations of the greatest co...
In this paper, we examine the problem of computing the greatest common divisor (GCD) of univariate p...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c...
AbstractThis paper presents a new numerical algorithm for the computation of the greatest common div...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
AbstractBarnett’s method through Bezoutians is a purely linear algebra method allowing to compute th...
AbstractIf a(λ) and b(λ) are two polynomials and A is the companion matrix of a(λ), then the matrix ...
© 2018, Pleiades Publishing, Ltd. In this article we present a new algebraic approach to the greates...
AbstractThe comrade matrix was introduced recently as the analogue of the companion matrix when a po...
The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is express...
We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomi...
summary:The computation of the greatest common divisor (GCD) has many applications in several discip...