On a class of higher order methods for simultaneous rootfinding of generalized polynomials (Q1326426): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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: On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to method for the simultaneous computation of all zeros of generalized polynomials / 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: On the Convergence of Two Methods for the Simultaneous Finding of All Roots of Exponential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5723445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for simultaneous inclusion of polynomial zeros / rank
 
Normal rank

Latest revision as of 15:57, 22 May 2024

scientific article
Language Label Description Also known as
English
On a class of higher order methods for simultaneous rootfinding of generalized polynomials
scientific article

    Statements

    On a class of higher order methods for simultaneous rootfinding of generalized polynomials (English)
    0 references
    0 references
    0 references
    0 references
    11 December 1994
    0 references
    The paper is devoted to the study of a class of iterative methods for simultaneous computation of all zeros of generalized polynomials. It is proved that these methods are of convergence order \(N\), and also certain relations to other methods are discussed. Finally, a priori and a posteriori error estimates and some illustrating numerical examples are given.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    iterative methods
    0 references
    zeros of generalized polynomials
    0 references
    convergence
    0 references
    error estimates
    0 references
    numerical examples
    0 references