The granularity of parallel homotopy algorithms for polynomial systems of equations

DOI10.1080/00207168908803746zbMath0683.65038OpenAlexW1981465026WikidataQ126245760 ScholiaQ126245760MaRDI QIDQ4733310

S. Harimoto, D. C. S. Allison, Layne T. Watson

Publication date: 1989

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://eprints.cs.vt.edu/archive/00000089/

zbMATH Keywords

parallel computingpolynomial systemscontinuation methodshomotopy methods

Mathematics Subject Classification ID

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

Uses Software

• PITCON
• HOMPACK

Cites Work

• Unnamed Item
• Unnamed Item
• A parallel algorithm for simple roots of polynomials
• A transformation to avoid solutions at infinity for polynomial systems
• A homotopy for solving polynomial systems
• A globally convergent algorithm for computing fixed points of \(C^2\) maps
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Algorithm 652
• Parallel Algorithms for Nonlinear Problems
• A Nonlinear Parallel Algorithm with Application to the Stefan Problem
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C ² Maps [C5]
• Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5]
• A Survey of Parallel Algorithms in Numerical Linear Algebra