Simple polynomials
Miloš Kössler (1951)
Czechoslovak Mathematical Journal
Similarity:
Miloš Kössler (1951)
Czechoslovak Mathematical Journal
Similarity:
I. R. Shafarevich (2001)
The Teaching of Mathematics
Similarity:
Bernard Beauzamy (2000)
Revista Matemática Complutense
Similarity:
We show how an old principle, due to Walsh (1922), can be used in order to construct an algorithm which finds the roots of polynomials with complex coefficients. This algorithm uses a linear command. From the very first step, the zero is located inside a disk, so several zeros can be searched at the same time.
Nikos E. Mastorakis (1996)
Kybernetika
Similarity:
Miloslav Nekvinda (1989)
Aplikace matematiky
Similarity:
The article is a survey on problem of the theorem of Hurwitz. The starting point of explanations is Schur's decomposition theorem for polynomials. It is showed how to obtain the well-known criteria on the distribution of roots of polynomials. The theorem on uniqueness of constants in Schur's decomposition seems to be new.
I. R. Shafarevich (1999)
The Teaching of Mathematics
Similarity:
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...
J. L. Walsh (1926)
Mathematische Zeitschrift
Similarity: