Message length effects for solving polynomial systems on a hypercube

DOI10.1016/0167-8191(89)90015-XzbMATH Open0674.65025OpenAlexW2108833034MaRDI QIDQ1121641FDOQ1121641

Authors: Wolfgang Pelz, Layne T. Watson 

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(89)90015-x

Recommendations

• On the Communication Complexity of Solving a Polynomial Equation
• On the bit complexity of polynomial system solving
• Condition length and complexity for the solution of polynomial systems
• Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
• On the bit complexity of solving bilinear polynomial systems
• On the complexity exponent of polynomial system solving
• scientific article; zbMATH DE number 2151192
• An improvement of the complexity bound for solving systems of polynomial equations

zbMATH Keywords

global convergencepolynomial systemsdecomposition strategycommunication strategieshomotopy algorithmcommunication overheadparallel implementation on iPSC-32 hypercube

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical computation of solutions to systems of equations (65H10)

Cited In (1)

• PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems

Uses Software

• PITCON

This page was built for publication: Message length effects for solving polynomial systems on a hypercube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121641)