The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common factor detection and estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multiple roots of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / 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: Q5301644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Analysis and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical analysis of effective singular values in matrix rank determination / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing certified approximate GCD of \(n\) univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured total least norm and approximate GCDs of 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: <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Scaling / 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: High Order Terms for Condition Estimation of Univariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical condition of polynomials in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001758 / rank
 
Normal rank

Revision as of 13:27, 3 July 2024

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

    Statements

    The calculation of the degree of an approximate greatest common divisor of two polynomials (English)
    0 references
    0 references
    0 references
    14 December 2010
    0 references
    greatest common divisor
    0 references
    Sylvester matrix
    0 references
    polynomials
    0 references

    Identifiers