On the public citation graph
Granularity issues for solving polynomial systems via globally convergent algorithms on a hypercube
0 signed · 45 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-16042-6_26openalex-snapshot
Parallel algorithms for solving certain classes of linear recurrences
inferredcites →https://doi.org/10.1007/bf01436084openalex-snapshot
Linear least squares solutions by householder transformations
inferredcites →https://doi.org/10.1016/0010-4655(85)90156-0openalex-snapshot
Newton-like interval methods for large nonlinear systems of equations on vector computers
inferredcites →https://doi.org/10.1016/0045-7825(87)90055-7openalex-snapshot
Concurrent function evaluations in local and global optimization
inferredcites →https://doi.org/10.1016/0096-3003(79)90020-1openalex-snapshot
A globally convergent algorithm for computing fixed points of C2 maps
inferredcites →https://doi.org/10.1016/0096-3003(86)90029-9openalex-snapshot
A transformation to avoid solutions at infinity for polynomial systems
inferredcites →https://doi.org/10.1016/0096-3003(86)90030-5openalex-snapshot
A homotopy for solving polynomial systems
inferredcites →https://doi.org/10.1016/0167-8191(89)90015-xopenalex-snapshot
Message length effects for solving polynomial systems on a hypercube
inferredcites →https://doi.org/10.1016/0362-546x(89)90017-5openalex-snapshot
A globally convergent parallel algorithm for zeros of polynomial systems
inferredcites →https://doi.org/10.1016/0898-1221(79)90090-7openalex-snapshot
Evaluation of integrals for a ten-node isoparametric tetrahedral finite element
inferredcites →https://doi.org/10.1016/0898-1221(84)90042-7openalex-snapshot
A parallel algorithm for simple roots for polynomials
inferredcites →https://doi.org/10.1080/00207168908803746openalex-snapshot
The granularity of parallel homotopy algorithms for polynomial systems of equations
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0492046-9openalex-snapshot
Finding zeroes of maps: homotopy methods that are constructive with probability one
inferredcites →https://doi.org/10.1137/0607017openalex-snapshot
Parallel Algorithms for Nonlinear Problems
inferredcites →https://doi.org/10.1137/0723040openalex-snapshot
A Nonlinear Parallel Algorithm with Application to the Stefan Problem
inferredcites →https://doi.org/10.1137/1.9780898719031openalex-snapshot
Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
inferredcites →https://doi.org/10.1137/1020096openalex-snapshot
A Survey of Parallel Algorithms in Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/1022003openalex-snapshot
Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
inferredcites →https://doi.org/10.1137/1028157openalex-snapshot
Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
inferredcites →https://doi.org/10.1145/355666.355675openalex-snapshot
Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5]
inferredcites →https://doi.org/10.1145/355887.355899openalex-snapshot
Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C 2 Maps [C5]
inferredcites →https://doi.org/10.21236/ada169927openalex-snapshot
Solving Systems of Nonlinear Equations by Tensor Methods.
inferredcites →https://doi.org/10.21236/ada188327openalex-snapshot
A View of Unconstrained Optimization.
inferredcites →https://doi.org/10.2307/2008602openalex-snapshot
Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems.
inferredcites →https://doi.org/10.2307/2008642openalex-snapshot
The Characteristics of Parallel Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11832225_22openalex-snapshot
Parallel Homotopy Algorithms to Solve Polynomial Systems
inferred← citeshttps://doi.org/10.1007/s00607-006-0166-2openalex-snapshot
PHoMpara – Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems
inferred← citeshttps://doi.org/10.1016/j.nonrwa.2004.02.002openalex-snapshot
Finding all steady state solutions of chemical kinetic models
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80005-5openalex-snapshot
Note on unit tangent vector computation for homotopy curve tracking on a hypercube
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.1017/s0962492900002749openalex-snapshot
Numerical solution of multivariate polynomial systems by homotopy continuation methods
inferred← citeshttps://doi.org/10.1109/71.219760openalex-snapshot
The parallel complexity of embedding algorithms for the solution of systems of nonlinear equations
inferred← citeshttps://doi.org/10.1109/icppw.2004.1328021openalex-snapshot
Computing feedback laws for linear systems with a parallel pieri homotopy
inferred← citeshttps://doi.org/10.1109/icppw.2004.34openalex-snapshot
Computing feedback laws for linear systems with a parallel pieri homotopy
inferred← citeshttps://doi.org/10.1109/icppw.2005.31openalex-snapshot
Factoring Solution Sets of Polynomial Systems in Parallel
inferred← citeshttps://doi.org/10.1109/icppw.2006.61openalex-snapshot
Parallel Implementation of the Polyhedral Homotopy Method
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.177openalex-snapshot
Evaluating Polynomials in Several Variables and their Derivatives on a GPU Computing Processor
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.1137/s1052623497329671openalex-snapshot
Parallel Adaptive GMRES Implementations for Homotopy Methods
inferred← citeshttps://doi.org/10.1145/1837210.1837230openalex-snapshot
Polynomial homotopies on multicore workstations
inferred← citeshttps://doi.org/10.1145/2790282.2790294openalex-snapshot
Accelerating polynomial homotopy continuation on a graphics processing unit with double double and quad double arithmetic
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.