Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4282480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intervals, Syzygies, Numerical Gröbner Bases: A Mixed Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Cancellations in Computing Floating-Point Gröbner Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floating point Gröbner bases. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivoting in extended rings for computing approximate Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Artificial discontinuities of single-parametric Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized normal forms and polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise numerical computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection and validation of clusters of polynomial zeros / 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: Q4227320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudofactors of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toric Newton method for polynomial homotopies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving parametric polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate GCD of inexact polynomials / rank
 
Normal rank

Latest revision as of 15:43, 6 July 2024

scientific article
Language Label Description Also known as
English
Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
scientific article

    Statements

    Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (English)
    0 references
    25 July 2013
    0 references
    The author deals with approximate Gröbner bases and approximate GCD's (univariate and multivariate cases) computation. In this direction, he provides several examples to show that how certain considerations of tolerance allow us to obtain good approximate results. For this purpose, he uses his implementations in \textsc{Mathematica}.
    0 references
    0 references
    approximate Gröbner bases
    0 references
    approximate GCD's
    0 references

    Identifiers