A globally convergent parallel algorithm for zeros of polynomial systems
From MaRDI portal
Publication:3484271
DOI10.1016/0362-546X(89)90017-5zbMath0704.65037MaRDI QIDQ3484271
Layne T. Watson, Alexander P. Morgan
Publication date: 1989
Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)
65H10: Numerical computation of solutions to systems of equations
65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations
65Y05: Parallel numerical computation
Related Items
Finding all steady state solutions of chemical kinetic models, PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 2 Maps [C5]
- Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5]
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- A Survey of Parallel Algorithms in Numerical Linear Algebra
