Rigid continuation paths II. structured polynomial systems (Q6103341): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Condition length and complexity for the solution of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuation method to solve polynomial systems and its complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Numerical Homotopy Tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust certified numerical homotopy tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Smale's 17th problem: a probabilistic positive solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smale’s 17th problem: Average polynomial time to compute affine and projective solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear homotopy to find approximate zeros of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. VII: Distance estimates in the condition metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4907706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition of Intersecting a Projective Variety with a Varying Linear Subspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem posed by Steve Smale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points, zeros and Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multihomogeneous Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On condition numbers and the distance to the nearest ill-posed problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvature Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2873072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gröbner free alternative for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified predictor-corrector tracking for Newton homotopies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kinematic formula in Riemannian homogeneous spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Lojasiewicz Inequality for Algebraic Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verified error bounds for multiple roots of systems of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. III: Condition number and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. V: Polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4356579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical problems for the next century / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed precision path tracking for polynomial homotopy continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929052 / rank
 
Normal rank

Latest revision as of 06:19, 1 August 2024

scientific article; zbMATH DE number 7691682
Language Label Description Also known as
English
Rigid continuation paths II. structured polynomial systems
scientific article; zbMATH DE number 7691682

    Statements

    Rigid continuation paths II. structured polynomial systems (English)
    0 references
    0 references
    0 references
    0 references
    2 June 2023
    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

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