The computation of multiple roots of a polynomial (Q425345): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(11 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2012.02.018 / rank
Normal rank
 
Property / author
 
Property / author: Winkler, Joab R. / rank
Normal rank
 
Property / author
 
Property / author: Winkler, Joab R. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65H04 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 12Y05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 26C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6043617 / rank
 
Normal rank
Property / zbMATH Keywords
 
roots of polynomials
Property / zbMATH Keywords: roots of polynomials / rank
 
Normal rank
Property / zbMATH Keywords
 
computations on polynomials
Property / zbMATH Keywords: computations on polynomials / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical examples
Property / zbMATH Keywords: numerical examples / rank
 
Normal rank
Property / zbMATH Keywords
 
structured matrix method
Property / zbMATH Keywords: structured matrix method / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple roots
Property / zbMATH Keywords: multiple roots / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithms
Property / zbMATH Keywords: algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: MultRoot / 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: Q4358561 / 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: A root-finding algorithm based on Newton's method / 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: Numerical methods for roots of polynomials. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Runs / 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: Total Least Norm Formulation and Solution for Structured Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Total Least Norm for Nonlinear Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309525 / 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: 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: Polynomial Scaling / 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: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of approximate polynomial GCDs and an extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing certified approximate GCD of \(n\) univariate polynomials / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MultRoot / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: na20 / 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.1016/j.cam.2012.02.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017733277 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2012.02.018 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:11, 9 December 2024

scientific article
Language Label Description Also known as
English
The computation of multiple roots of a polynomial
scientific article

    Statements

    The computation of multiple roots of a polynomial (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2012
    0 references
    roots of polynomials
    0 references
    computations on polynomials
    0 references
    numerical examples
    0 references
    structured matrix method
    0 references
    multiple roots
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers