scientific article; zbMATH DE number 1069614

Publication date: 20 April 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

numerical examples homotopy continuation methods multivariate polynomial systems

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Real polynomials: location of zeros (26C10)

Related Items (62)

Pseudozeros of multivariate polynomials ⋮ Proof of the Feldman-Karlin conjecture on the maximum number of equilibria in an evolutionary system ⋮ High-quality topological structure extraction of volumetric data on \(C^2\)-continuous framework ⋮ On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors ⋮ Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study ⋮ An intrinsic homotopy for intersecting algebraic varieties ⋮ Accurate solution of polynomial equations using Macaulay resultant matrices ⋮ The localization of solutions to systems of algebraic equations and inequalities: the Hermite method ⋮ Numerical root finding via Cox rings ⋮ A Geometric Approach for Analyzing Parametric Biological Systems by Exploiting Block Triangular Structure ⋮ Chern numbers of smooth varieties via homotopy continuation and intersection theory ⋮ A Levenberg-Marquardt method for solving semi-symmetric tensor equations ⋮ High-order upwind schemes for the wave equation on overlapping grids: Maxwell's equations in second-order form ⋮ Complexity of path-following methods for the eigenvalue problem ⋮ Computing isolated roots of sparse polynomial systems in affine space ⋮ Revealing Bistability in Neurological Disorder Models By Solving Parametric Polynomial Systems Geometrically ⋮ Early Ending in Homotopy Path-Tracking for Real Roots ⋮ A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ On the equivalence of two post-quantum cryptographic families ⋮ Steady state bifurcation of a periodically excited system under delayed feedback controls ⋮ Heuristic methods for computing the minimal multi-homogeneous Bézout number. ⋮ Equilibrium locus of the flow on circular networks of cells ⋮ General equilibrium models and homotopy methods ⋮ Computing curve intersection by homotopy methods ⋮ A hybrid procedure for finding real points on a real algebraic set ⋮ A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation ⋮ Global optimality conditions and optimization methods for polynomial programming problems ⋮ Foreword. What is numerical algebraic geometry? ⋮ Decoupling highly structured polynomial systems ⋮ Mixed volume computation in parallel ⋮ Determining dimension of the solution component that contains a computed zero of a polynomial system ⋮ A systematic framework for solving geometric constraints analytically ⋮ Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods ⋮ Interval tensors and their application in solving multi-linear systems of equations ⋮ Relations between roots and coefficients, interpolation and application to system solving ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems ⋮ Newton's method with deflation for isolated singularities of polynomial systems ⋮ Modeling three-dimensional surface-to-surface rigid contact and impact ⋮ Exact line and plane search for tensor optimization ⋮ Counting \(\mathcal{N} = 8\) black holes as algebraic varieties ⋮ HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method ⋮ Incomplete Gröbner basis as a preconditioner for polynomial systems ⋮ Fiber product homotopy method for multiparameter eigenvalue problems ⋮ Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes ⋮ Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach ⋮ Runge-Kutta methods for quadratic ordinary differential equations ⋮ Solution of the least squares method problem of pairwise comparison matrices ⋮ Computing zeros of analytic mappings: A logarithmic residue approach ⋮ A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications ⋮ Deformation techniques for sparse systems ⋮ Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations ⋮ Computing parametric geometric resolutions ⋮ Toric Newton method for polynomial homotopies ⋮ Central configurations of the five-body problem with equal masses ⋮ How to count efficiently all affine roots of a polynomial system ⋮ A continuation method for motion-planning problems ⋮ A Global Approach for Solving Edge-Matching Puzzles ⋮ Solving tensor E-eigenvalue problem faster ⋮ Solving systems of polynomial equations by bounded and real homotopy ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets ⋮ Solving sparse non-negative tensor equations: algorithms and applications

This page was built for publication: