Using monodromy to recover symmetries of polynomial systems (Q6060377): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Add wikidata reference.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Robust certified numerical homotopy tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Julia: A Fresh Approach to Numerical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: HomotopyContinuation.jl: a package for homotopy continuation in Julia / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving decomposable sparse systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Null Space Problem I. Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse interpolation of multivariate rational functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Riemann matrices of algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial systems via homotopy continuation and monodromy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of generic multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuations and monodromy on random riemann surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>a posteriori</i> certification algorithm for Newton homotopies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of Galois groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using monodromy to statistically estimate the number of solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical points via monodromy and local methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse interpolation of rational functions and gcds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3156433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach for Certifying Homotopy Continuation Paths / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q131124333 / rank
 
Normal rank

Latest revision as of 11:42, 16 December 2024

scientific article; zbMATH DE number 7760769
Language Label Description Also known as
English
Using monodromy to recover symmetries of polynomial systems
scientific article; zbMATH DE number 7760769

    Statements

    Using monodromy to recover symmetries of polynomial systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 November 2023
    0 references
    Galois group
    0 references
    interpolation
    0 references
    monodromy
    0 references
    polynomial system
    0 references

    Identifiers