Method for finding multiple roots of polynomials (Q2507024): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mathematica / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / 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.camwa.2005.07.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023155928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Computer Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5594878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126370 / 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: The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial root finding using iterated Eigenvalue computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial zerofinding iterative matrix algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite polynomial zerofinding matrix algorithm / 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: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles for Testing Polynomial Zerofinding Programs / rank
 
Normal rank

Latest revision as of 20:34, 24 June 2024

scientific article
Language Label Description Also known as
English
Method for finding multiple roots of polynomials
scientific article

    Statements

    Method for finding multiple roots of polynomials (English)
    0 references
    0 references
    0 references
    10 October 2006
    0 references
    multiple root
    0 references
    root finding
    0 references
    zero finding
    0 references
    polynomial GCD
    0 references
    approximate divisibility
    0 references
    approximate GCD
    0 references
    numerical examples
    0 references
    Euclidean algorithm
    0 references
    greatest common divisor (GCD)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references