An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros (Q1917920): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A family of root finding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4067388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles for Testing Polynomial Zerofinding Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bibliography on roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laguerre method for finding the zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4438142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability theory by Liapunov's direct method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590219 / rank
 
Normal rank

Latest revision as of 13:22, 24 May 2024

scientific article
Language Label Description Also known as
English
An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros
scientific article

    Statements

    An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros (English)
    0 references
    0 references
    21 April 1997
    0 references
    The author proposes an improved quadratically convergent version of Šiljak's algorithm for solving polynomial equations with multiple roots. It is shown how to extract the information about the multiplicity of polynomial zeros during the iteration process.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic convergence
    0 references
    Šiljak's algorithm
    0 references
    polynomial equations
    0 references
    multiple roots
    0 references
    0 references