Approximate polynomial GCD by approximate syzygies (Q2009224): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q128198355, #quickstatements; #temporary_batch_1722437626092
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Macaulay2 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CoCoALib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mathematica / 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/s11786-019-00392-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2922789258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometrical approach to finding multivariate approximate LCMs and GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232489 / 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: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of strong Grobner bases over Euclidean domains / 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: Computation of approximate polynomial GCDs and an extension / 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: Q3447169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multivariate approximate GCD based on Barnett's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate multivariate polynomial factorization based on zero-sum relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4008406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floating point Gröbner bases. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Polynomial Algebra / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128198355 / rank
 
Normal rank

Latest revision as of 16:59, 31 July 2024

scientific article
Language Label Description Also known as
English
Approximate polynomial GCD by approximate syzygies
scientific article

    Statements

    Approximate polynomial GCD by approximate syzygies (English)
    0 references
    27 November 2019
    0 references
    approximate polynomial GCD
    0 references
    numeric Gröbner basis
    0 references
    syzygies
    0 references
    hybrid symbolic-numeric algorithms
    0 references
    linear programming
    0 references
    quadratic programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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