A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial (Q4652860): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/0020716042000272511 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051092695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A root-finding algorithm based on Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point estimation and some applications to iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072022 / 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: Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion of the roots of a polynomial based on Gerschgorin's theorem / 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: Enclosing clusters of zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ten methods to bound multiple roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem / rank
 
Normal rank

Latest revision as of 19:10, 7 June 2024

scientific article; zbMATH DE number 2139505
Language Label Description Also known as
English
A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial
scientific article; zbMATH DE number 2139505

    Statements

    A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial (English)
    0 references
    28 February 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    error bounds
    0 references
    Rouché's theorem
    0 references
    A posteriori error analysis
    0 references
    approximate zeros
    0 references
    high precision computation
    0 references
    0 references