Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10092-012-0053-5 / 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.1007/s10092-012-0053-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065576924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifications to the Garside, Jarratt & Mack Method for Solving Ill-conditioned Polynomial Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorization of multivariate polynomials via differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Polynomials with Small Leading Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common factor detection and estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001758 / 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: The calculation of the degree of an approximate greatest common divisor of two polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate GCD of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multiple roots of inexact polynomials / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10092-012-0053-5 / rank
 
Normal rank

Latest revision as of 01:00, 10 December 2024

scientific article
Language Label Description Also known as
English
Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
scientific article

    Statements

    Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 December 2012
    0 references
    greatest common divisor
    0 references
    polynomials
    0 references
    Sylvester resultant matrix
    0 references

    Identifiers