Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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: MultRoot / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ERES / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W59802204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Version of the Euclidean Algorith / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greatest common divisors from generalized sylvester resultant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4433611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resultant properties of gcd of many polynomials and a factorization representation of gcd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4067388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance properties, and characterization of the greatest common divisor of a set of polynomials / 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: A matrix pencil based numerical method for the computation of the GCD 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: 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: 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: Q4227320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new source of structured singular value decomposition problems / 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: Q2785714 / 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
Property / cites work
 
Property / cites work: A subspace method for the computation of the GCD of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659396 / 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: Numerical Analysis and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multivariable control. A geometric approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate GCD of inexact polynomials / rank
 
Normal rank

Latest revision as of 17:00, 5 July 2024

scientific article
Language Label Description Also known as
English
Numerical and Symbolical Methods for the GCD of Several Polynomials
scientific article

    Statements

    Numerical and Symbolical Methods for the GCD of Several Polynomials (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2012
    0 references
    greatest common divisor
    0 references
    Gaussian elimination
    0 references
    resultant
    0 references
    matrix-pencil
    0 references
    singular value decomposition
    0 references
    symbolic-numeric computations
    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
    0 references
    0 references

    Identifiers