Generalizations of an algorithm of Sebastião e Silva
For a given polynomial \(f(z)\), the algorithm of Sebastião e Silva provides sequences of polynomials whose limits are polynomials whose zeros are zeros of \(f(z)\) of equal modulus. The algorithm begins by forming successive remainders \(g_{\nu+1}(z)\) after dividing \(zg_\nu(z)\) by \(f(z)\), and proceeds to form sequences of polynomials of lower degrees by successive elimination of leading terms. It is shown that multiplication by an almost arbitrary polynomial \(g(z)\) instead of by \(z\) can be used in forming the initial sequence, and that the sequences of lower degrees can be formed in either of two distinct ways.
- Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme
- scientific article; zbMATH DE number 3113800 (Why is no real title available?)
- scientific article; zbMATH DE number 3128650 (Why is no real title available?)
- scientific article; zbMATH DE number 3153475 (Why is no real title available?)
- Some iterations for factoring polynomials
- An algorithm for the zeros of transcendental functions
- Generalization and acceleration of an algorithm of Sebastiao e Silva and its duals
- Verfahren für die Bestimmung von Eigenwerten und Eigenvektoren von symmetrisch nicht-hermiteschen Matrizen
- An iterative method to compute the dominant zero of a quaternionic unilateral polynomial
- On a generalization of the -algorithm
- Simultaneous factorization of a polynomial by rational approximation
- The amended DSeSC power method for polynomial root-finding
- Postscript to: Generalizations of an algorithm of Sebastião e Silva
- scientific article; zbMATH DE number 3860296 (Why is no real title available?)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- Numerical computation of polynomial zeros by means of Aberth's method
- On a general -algorithm
This page was built for publication: Generalizations of an algorithm of Sebastião e Silva
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540163)
