Displaying similar documents to “Sturm Sequences and Modified Subresultant Polynomial Remainder Sequences”

On a Theorem by Van Vleck Regarding Sturm Sequences

Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2013)

Serdica Journal of Computing

Similarity:

In 1900 E. B. Van Vleck proposed a very efficient method to compute the Sturm sequence of a polynomial p (x) ∈ Z[x] by triangularizing one of Sylvester’s matrices of p (x) and its derivative p′(x). That method works fine only for the case of complete sequences provided no pivots take place. In 1917, A. J. Pell and R. L. Gordon pointed out this “weakness” in Van Vleck’s theorem, rectified it but did not extend his method, so that it also works in the cases of: (a) complete Sturm sequences...

On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials

Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2015)

Serdica Journal of Computing

Similarity:

In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little known and hardly ever used matrix of 1853, to compute(2) the coefficients of a Sturmian remainder — obtained in applying in Q[x], Sturm’s algorithm on two polynomials f, g ∈ Z[x] of degree n — in terms of the determinants (3) of the corresponding submatrices of sylvester2. Thus, they solved a problem that had eluded both J. J. Sylvester, in 1853, and E. B. Van Vleck, in 1900. (4) In this paper we extend the work by Pell...

Van der Corput sequences towards general (0,1)–sequences in base b

Henri Faure (2007)

Journal de Théorie des Nombres de Bordeaux

Similarity:

As a result of recent studies on unidimensional low discrepancy sequences, we can assert that the original van der Corput sequences are the worst distributed with respect to various measures of irregularities of distribution among two large families of ( 0 , 1 ) –sequences, and even among all ( 0 , 1 ) –sequences for the star discrepancy D * . We show in the present paper that it is not the case for the extreme discrepancy D by producing two kinds of sequences which are the worst distributed among all ( 0 , 1 ) –sequences,...

Polynomial sequences generated by infinite Hessenberg matrices

Luis Verde-Star (2017)

Special Matrices

Similarity:

We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study properties of the polynomial sequences and their corresponding matrices which are related to recurrence relations, companion matrices, matrix similarity, construction algorithms, and generating functions. When the Hessenberg matrix is...

Invertibility of Matrices of Field Elements

Yatsuka Nakamura, Kunio Oniumi, Wenpai Chang (2008)

Formalized Mathematics

Similarity:

In this paper the theory of invertibility of matrices of field elements (see e.g. [5], [6]) is developed. The main purpose of this article is to prove that the left invertibility and the right invertibility are equivalent for a matrix of field elements. To prove this, we introduced a special transformation of matrix to some canonical forms. Other concepts as zero vector and base vectors of field elements are also introduced as a preparation.MML identifier: MATRIX14, version: 7.9.01 4.101.1015 ...

D0L sequence equivalence is in P for fixed alphabets

Keijo Ruohonen (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

A new algorithm is presented for the D0L sequence equivalence problem which, when the alphabets are fixed, works in time polynomial in the rest of the input data. The algorithm uses a polynomial encoding of words and certain well-known properties of -rational sequences.