On the Computation of the GCD of 2-D Polynomials (Q3089756): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3395748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: System theoretic based characterisation and computation of the least common multiple of a set of polynomials. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of the least common multiple of a set of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix pencil based numerical method for the computation of the GCD of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the GCD of polynomials using gaussian transformations and shifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate GCD and its application to ill-conditioned algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of algorithms for calculation of g.c.d. of polynomials / rank
 
Normal rank

Revision as of 09:43, 4 July 2024

scientific article
Language Label Description Also known as
English
On the Computation of the GCD of 2-D Polynomials
scientific article

    Statements

    Identifiers