Concepts from algebraic geometry such as cones and fans are related to toric varieties and can be applied to determine the convex polytopes and homogeneous coordinate rings of multivariate polynomial systems. The homogeneous coordinates of a system in its projective vector space can be associated with the entries of the resultant matrix of the system under consideration. This paper presents some conditions for the homogeneous coordinates of a certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant matrix formulation. This basis of the implementation of the Bèzout block applies a combinatorial approach on a set of linear inequalities, named 5-rule. The inequalities involved the set of exponent vectors of the monomials of the system and the entries of the matrix are determined from the coefficients of facets variable known as brackets. The approach can determine the homogeneous coordinates of the given system and the entries of the Bèzout block. Conditions for determining the homogeneous coordinates are also given and proven.
This paper revisits the comrade matrix approach in finding the greatest com-
mon divisor (GCD) of two orthogonal polynomials. The present work investigates on the
applications of the QR decomposition with iterative refinement (QRIR) to solve certain
systems of linear equations which is generated from the comrade matrix. Besides iterative
refinement, an alternative approach of improving the conditioning behavior of the coeffi-
cient matrix by normalizing its columns is also considered. As expected the results reveal
that QRIR is able to improve the solutions given by QR decomposition while the nor-
malization of the matrix entries do improves the conditioning behavior of the coefficient
matrix leading to a good approximate solutions of the GCD.