Box-bisection for solving second-degree systems and the problem of clustering
From MaRDI portal
Publication:3776505
DOI10.1145/328512.328521zbMath0636.65049OpenAlexW1977057020MaRDI QIDQ3776505
No author found.
Publication date: 1987
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1987-13/
clusteringinterval arithmeticbranch and bound methodroot findingsystems of polynomialsreal-world problemsinterval Newton methodsgeneralized bisectionchemical equilibrium problemsinverse kinematics of manipulations
Related Items
Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations ⋮ Mixed-volume computation by dynamic lifting applied to polynomial system solving ⋮ Lower bound functions for polynomials ⋮ An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions