An algorithm for the total, or partial, factorization of a polynomial (Q4151651): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q5674306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Bairstow Method for Multiple Zeros of a Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous inclusion of the zeros of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A posteriori error bounds for the zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lehmer's Method for Finding the Zeros of a Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über Simultanverfahren zur Bestimmung reeller Polynomwurzeln / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the Newton process to multiple solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots / 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: On the numerical solution of the generalized eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of equations by functional iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for solving polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular arithmetic and the determination of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Newton method for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution of the Generalized Eigenvalue Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine Method for Solving Polynomial Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen / 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 family of root finding methods / rank
 
Normal rank

Latest revision as of 23:07, 12 June 2024

scientific article; zbMATH DE number 3583194
Language Label Description Also known as
English
An algorithm for the total, or partial, factorization of a polynomial
scientific article; zbMATH DE number 3583194

    Statements

    An algorithm for the total, or partial, factorization of a polynomial (English)
    0 references
    1977
    0 references
    0 references
    0 references
    0 references