Algorithm 795
From MaRDI portal
Publication:4512818
DOI10.1145/317275.317286zbMath0961.65047DBLPjournals/toms/Verschelde99OpenAlexW2028576930WikidataQ56031069 ScholiaQ56031069MaRDI QIDQ4512818
Publication date: 6 June 2001
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/317275.317286
performanceSchubert calculusmixed volumepolynomial systemspolyhedral homotopyenumerative geometryhomotopy continuation methodsheat problemsBernshtein's theoremBézout numberstart systemroot countsoftware packing PHC
Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20) Packaged methods for numerical algorithms (65Y15)
Related Items (only showing first 100 items - show all)
Certified Numerical Homotopy Tracking ⋮ Random Points on an Algebraic Manifold ⋮ A Design and an Implementation of an Inverse Kinematics Computation in Robotics Using Gröbner Bases ⋮ Estimating the Attraction Domain for the Boost Inverter ⋮ A numerical elimination method for polynomial computations ⋮ An intrinsic homotopy for intersecting algebraic varieties ⋮ PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems ⋮ Cell decomposition of almost smooth real algebraic surfaces ⋮ Parametric estimation of affine deformations of planar shapes ⋮ Minimal determinantal representations of bivariate polynomials ⋮ A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations ⋮ On the statistical model of source localization based on range difference measurements ⋮ Affine Arithmetic and Applications to Real-Number Proving ⋮ Algebraic compressed sensing ⋮ The Maximum Likelihood Degree of Sparse Polynomial Systems ⋮ Numerical homotopies from Khovanskii bases ⋮ A polyhedral homotopy algorithm for real zeros ⋮ Uniform Determinantal Representations ⋮ Landau discriminants ⋮ Finding multiple solutions to elliptic systems with polynomial nonlinearity ⋮ Unmixing the mixed volume computation ⋮ Sampling Algebraic Varieties for Sum of Squares Programs ⋮ Early Ending in Homotopy Path-Tracking for Real Roots ⋮ Latency vs precision: stability preserving perception scheduling ⋮ Nonlinear algebra and applications ⋮ \(u\)-generation: solving systems of polynomials equation-by-equation ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials ⋮ Counting solutions of a polynomial system locally and exactly ⋮ Sampling algebraic sets in local intrinsic coordinates ⋮ Genus one Belyi maps by quadratic correspondences ⋮ Polyhedral homotopies in Cox coordinates ⋮ Segre-driven radicality testing ⋮ Identifying the number of components in Gaussian mixture models using numerical algebraic geometry ⋮ Counting and locating the solutions of polynomial systems of maximum likelihood equations. I. ⋮ Improving the efficiency of exclusion algorithms ⋮ A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation ⋮ Certifying zeros of polynomial systems using interval arithmetic ⋮ Mixed volumes of networks with binomial steady-states ⋮ On approximate triangular decompositions in dimension zero ⋮ Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro ⋮ Numerical Evidence for a Conjecture in Real Algebraic Geometry ⋮ Determining dimension of the solution component that contains a computed zero of a polynomial system ⋮ Toward a Salmon Conjecture ⋮ Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems ⋮ Robust game theory ⋮ Galois groups of Schubert problems via homotopy computation ⋮ Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling ⋮ Newton's method with deflation for isolated singularities of polynomial systems ⋮ Implementing real polyhedral homotopy ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ Roots of Bivariate Polynomial Systems via Determinantal Representations ⋮ Computing Tensor Eigenvalues via Homotopy Methods ⋮ BertiniLab: a MATLAB interface for solving systems of polynomial equations ⋮ Computing Tropical Curves via Homotopy Continuation ⋮ Finiteness of stationary configurations of the four-vortex problem ⋮ Numerical algebraic geometry and differential equations ⋮ Computing the distance to the stochastic part of phylogenetic varieties ⋮ Extrapolating solution paths of polynomial homotopies towards singularities with PHCpack and Phcpy ⋮ Absolute concentration robustness: algebra and geometry ⋮ Determination of small crystal structures from a minimum set of diffraction intensities by homotopy continuation ⋮ GPU accelerated Newton for Taylor series solutions of polynomial homotopies in multiple double precision ⋮ Regeneration homotopies for solving systems of polynomials ⋮ Harnessing elasticity to generate self-oscillation via an electrohydrodynamic instability ⋮ Computing Amoebas ⋮ Volume function and Mahler measure of exact polynomials ⋮ Computing All Space Curve Solutions of Polynomial Systems by Polyhedral Methods ⋮ Pruning Algorithms for Pretropisms of Newton Polytopes ⋮ Numerical algebraic geometry and algebraic kinematics ⋮ Segre class computation and practical applications ⋮ Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition ⋮ BÉZIER SUBDIVISION FOR INVERSE MOLECULAR KINEMATICS ⋮ Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations ⋮ Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm ⋮ On the number of equilibria balancing Newtonian point masses with a central force ⋮ Jacobi-Davidson methods for polynomial two-parameter eigenvalue problems ⋮ A numerical realization of the conditions of Max Nöther's residual intersection theorem ⋮ Polynomial homotopy continuation on GPUs ⋮ Polynomial homotopy continuation in Macaulay2 ⋮ Symmetric homotopy method for discretized elliptic equations with cubic and quintic nonlinearities ⋮ Epsilon local rigidity and numerical algebraic geometry ⋮ A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties ⋮ Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods ⋮ A new exclusion test. ⋮ A Gough-Stewart parallel manipulator with configurable platform and multiple end-effectors ⋮ Decomposable sparse polynomial systems ⋮ The steady-state degree and mixed volume of a chemical reaction network ⋮ Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Random sampling in computational algebra: Helly numbers and violator spaces ⋮ Perturbed homotopies for finding all isolated solutions of polynomial systems ⋮ Finding all flux vacua in an explicit example ⋮ Exploring the potential energy landscape over a large parameter-space ⋮ Moments and sums of squares for polynomial optimization and related problems ⋮ A stabilized normal form algorithm for generic systems of polynomial equations ⋮ Fast and stable polynomial equation solving and its application to computer vision ⋮ Finding all Nash equilibria of a finite game using polynomial algebra ⋮ Competitive equilibria in semi-algebraic economies ⋮ Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
Uses Software
This page was built for publication: Algorithm 795
