On the public citation graph

The $GBQ$-Algorithm for Constructing Start Systems of Homotopies for Polynomial Systems

0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118032527openalex-snapshot
Principles of Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-642-57956-1openalex-snapshot
Basic Algebraic Geometry 2
inferredcites →https://doi.org/10.1007/978-3-642-61257-2openalex-snapshot
Numerical Continuation Methods
inferredcites →https://doi.org/10.1007/978-3-642-61833-8openalex-snapshot
Algebraic Geometry I Complex Projective Varieties
inferredcites →https://doi.org/10.1007/978-3-642-96200-4openalex-snapshot
Basic Algebraic Geometry
inferredcites →https://doi.org/10.1007/bf01390182openalex-snapshot
Solving systems of polynomial equations by bounded and real homotopy
inferredcites →https://doi.org/10.1007/bf01396764openalex-snapshot
On the solutions to polynomial systems obtained by homotopy methods
inferredcites →https://doi.org/10.1007/bf01400351openalex-snapshot
The random product homotopy and deficient polynomial systems
inferredcites →https://doi.org/10.1007/bf03167887openalex-snapshot
A simple homotopy for solving deficient polynomial systems
inferredcites →https://doi.org/10.1007/bfb0080338openalex-snapshot
Complex Analytic Geometry
inferredcites →https://doi.org/10.1016/0096-3003(87)90063-4openalex-snapshot
A homotopy for solving general polynomial systems that respects m-homogeneous structures
inferredcites →https://doi.org/10.1016/0096-3003(87)90064-6openalex-snapshot
Computing all solutions to polynomial systems using homotopy continuation
inferredcites →https://doi.org/10.1016/0096-3003(91)90059-vopenalex-snapshot
A new start system for solving deficient polynomial systems using continuation
inferredcites →https://doi.org/10.1016/0167-2789(84)90272-0openalex-snapshot
The local structure of a chaotic attractor in four dimensions
inferredcites →https://doi.org/10.1090/s0025-5718-1988-0917824-7openalex-snapshot
A Simple Homotopy Method for Determining all Isolated Solutions to Polynomial Systems
inferredcites →https://doi.org/10.1115/1.2912579openalex-snapshot
Numerical Continuation Methods for Solving Polynomial Systems Arising in Kinematics
inferredcites →https://doi.org/10.1115/1.3258708openalex-snapshot
Solving the Kinematics of the Most General Six- and Five-Degree-of-Freedom Manipulators by Continuation Methods
inferredcites →https://doi.org/10.1137/0149109openalex-snapshot
A Neural Network Modeled by an Adaptive Lotka-Volterra System
inferredcites →https://doi.org/10.1137/0724032openalex-snapshot
Numerical Solution of a Class of Deficient Polynomial Systems
inferredcites →https://doi.org/10.1145/29380.214343openalex-snapshot
Algorithm 652
inferredcites →https://doi.org/10.1145/328512.328521openalex-snapshot
Box-bisection for solving second-degree systems and the problem of clustering
inferredcites →https://doi.org/10.2307/2008602openalex-snapshot
Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-27357-3_8openalex-snapshot
Introduction to numerical algebraic geometry
inferred← citeshttps://doi.org/10.1007/3-540-28247-5_22openalex-snapshot
The Computation of Reachable Surfaces for a Specified Set of Spatial Displacements
inferred← citeshttps://doi.org/10.1007/978-1-4471-4510-3_1openalex-snapshot
Polynomials, Computers, and Kinematics for the 21st Century
inferred← citeshttps://doi.org/10.1007/978-3-319-99957-9_12openalex-snapshot
Early Ending in Homotopy Path-Tracking for Real Roots
inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_6openalex-snapshot
Numerical Irreducible Decomposition Using PHCpack
inferred← citeshttps://doi.org/10.1007/s11424-017-5214-9openalex-snapshot
Efficiently counting affine roots of mixed trigonometric polynomial systems
inferred← citeshttps://doi.org/10.1016/0304-3975(93)00062-aopenalex-snapshot
A convex geometric approach to counting the roots of a polynomial system
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00064-6openalex-snapshot
Homotopies for solving polynomial systems within a bounded domain
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90329-8openalex-snapshot
Symmetric homotopy construction
inferred← citeshttps://doi.org/10.1016/j.mechmachtheory.2005.01.007openalex-snapshot
The synthesis of an RPS serial chain to reach a given set of task positions
inferred← citeshttps://doi.org/10.1016/j.mechmachtheory.2007.10.006openalex-snapshot
The algebraic synthesis of a spatial TS chain for a prescribed acceleration task
inferred← citeshttps://doi.org/10.1016/s1570-8659(02)11004-0openalex-snapshot
Numerical Solution of Polynomial Systems by Homotopy Continuation Methods
inferred← citeshttps://doi.org/10.1016/s1570-8659(97)80002-6openalex-snapshot
Numerical path following
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02763-9openalex-snapshot
A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
inferred← citeshttps://doi.org/10.1109/2945.489384openalex-snapshot
Solving geometric constraints by homotopy
inferred← citeshttps://doi.org/10.1109/icmt.2011.6002458openalex-snapshot
A subtree searching method with pruning for computing minimal m-Bézout number
inferred← citeshttps://doi.org/10.1115/1.1667965openalex-snapshot
Geometric Design of Cylindric PRS Serial Chains
inferred← citeshttps://doi.org/10.1115/1.1760550openalex-snapshot
Generalized Linear Product Homotopy Algorithms and the Computation of Reachable Surfaces
inferred← citeshttps://doi.org/10.1115/1.4003181openalex-snapshot
21st Century Kinematics: Synthesis, Compliance, and Tensegrity
inferred← citeshttps://doi.org/10.1137/070681740openalex-snapshot
A Hybrid Polynomial System Solving Method for Mixed Trigonometric Polynomial Systems
inferred← citeshttps://doi.org/10.1137/0731049openalex-snapshot
Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
inferred← citeshttps://doi.org/10.1137/140986025openalex-snapshot
Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling
inferred← citeshttps://doi.org/10.1145/1186785.1186789openalex-snapshot
Algorithm 857
inferred← citeshttps://doi.org/10.1145/317275.317286openalex-snapshot
Algorithm 795
inferred← citeshttps://doi.org/10.1145/347837.347885openalex-snapshot
Algorithm 801: POLSYS_PLP
inferred← citeshttps://doi.org/10.4310/cis.2015.v15.n2.a1openalex-snapshot
Homotopy continuation method for solving systems of nonlinear and polynomial equations
inferred← citeshttps://doi.org/10.48550/arxiv.math/9907060openalex-snapshot
Polynomial Homotopies for Dense, Sparse and Determinantal Systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.