On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots (Q2672185): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MPC / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1553/etna_vol55s401 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3207518756 / 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: Numerical computation of polynomial zeros by means of Aberth's method / 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: Lectures on Finite Precision Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A floating-point technique for extending the available precision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate and Efficient Floating Point Summation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Newton method for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: MPFR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5803623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate simple zeros of polynomials in floating point arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for accurate, validated and fast polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate evaluation of the \(k\)-th derivative of a polynomial and its application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate evaluation of a polynomial and its derivative in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi double-precision in floating point addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalar fused multiply-add instructions produce floating-point matrix arithmetic provably accurate to the penultimate digit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate Sum and Dot Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimately Fast Accurate Summation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate Floating-Point Summation Part I: Faithful Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's Method in Floating Point Arithmetic and Iterative Refinement of Generalized Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342463 / rank
 
Normal rank

Latest revision as of 06:50, 29 July 2024

scientific article
Language Label Description Also known as
English
On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
scientific article

    Statements

    On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots (English)
    0 references
    0 references
    0 references
    8 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial evaluation
    0 references
    error-free transformations
    0 references
    polynomial roots
    0 references
    backward error
    0 references
    forward error
    0 references
    rounding error analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references