Structured matrix methods for the computation of multiple roots of a polynomial (Q2253088): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5508799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Laguerre’s Method: Higher Order Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some modifications of Laguerre's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358561 / 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: A root-finding algorithm based on Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method for finding multiple roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multiple roots of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of multiple roots of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Order Terms for Condition Estimation of Univariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial GCD derived through monic polynomial subtractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculation of the degree of an approximate greatest common divisor of two polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder / rank
 
Normal rank

Revision as of 18:45, 8 July 2024

scientific article
Language Label Description Also known as
English
Structured matrix methods for the computation of multiple roots of a polynomial
scientific article

    Statements

    Structured matrix methods for the computation of multiple roots of a polynomial (English)
    0 references
    25 July 2014
    0 references
    roots of polynomials
    0 references
    structured matrix methods
    0 references
    numerical examples
    0 references
    multiple roots
    0 references
    algorithm
    0 references
    polynomial deconvolution
    0 references
    0 references
    0 references
    0 references

    Identifiers