A root-finding algorithm based on Newton's method (Q5663315): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A stopping criterion for polynomial root finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direkte Verfahren zur Berechnung der Nullstellen von Polynomen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration / 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: Q5627593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Problems Arising in the Solution of Polynomial Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342463 / rank
 
Normal rank

Latest revision as of 12:05, 12 June 2024

scientific article; zbMATH DE number 3395287
Language Label Description Also known as
English
A root-finding algorithm based on Newton's method
scientific article; zbMATH DE number 3395287

    Statements