Finding roots of a real polynomial simultaneously by means of Bairstow's method (Q1914869): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the roots of a polynomial on an MIMD multicomputer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of a polynomial into quadratic factors by Newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating polynomial zeros on a local memory parallel computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the Latent Roots of a Hessenberg Matrix by Bairstow's Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding zeros of a polynomial by the Q-D algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Dvorcuk's root-finding method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to numerical data on Q-D algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734980 / rank
 
Normal rank

Latest revision as of 11:30, 24 May 2024

scientific article
Language Label Description Also known as
English
Finding roots of a real polynomial simultaneously by means of Bairstow's method
scientific article

    Statements

    Finding roots of a real polynomial simultaneously by means of Bairstow's method (English)
    0 references
    0 references
    0 references
    16 March 1997
    0 references
    The author gives a parallel method (PAID = Parallel Anticipatory Implicit Deflation) for finding the roots of a real polynomial. The idea is similar to the one of \textit{S. Zheng} [J. Comput. Math. 4, 146-153 (1986; Zbl 0599.65029)], but the resulting method is simpler here. The details are given in \S 2. The PAID method is described in \S 3. Numerical results are presented in \S 5.
    0 references
    parallel computation
    0 references
    numerical examples
    0 references
    parallel anticipatory implicit deflation
    0 references
    roots of a real polynomial
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references