A globally convergent parallel algorithm for zeros of polynomial systems
- 31 December 1989
- journal article
- Published by Elsevier in Nonlinear Analysis
- Vol. 13 (11) , 1339-1350
- https://doi.org/10.1016/0362-546x(89)90017-5
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The Performance of Multicomputer Interconnection NetworksComputer, 1987
- A homotopy for solving polynomial systemsApplied Mathematics and Computation, 1986
- A transformation to avoid solutions at infinity for polynomial systemsApplied Mathematics and Computation, 1986
- A parallel algorithm for simple roots for polynomialsComputers & Mathematics with Applications, 1984
- Algorithm 596ACM Transactions on Mathematical Software, 1983
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of EquationsSIAM Review, 1980
- A Survey of Parallel Algorithms in Numerical Linear AlgebraSIAM Review, 1978
- Finding zeroes of maps: homotopy methods that are constructive with probability oneMathematics of Computation, 1978
- Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5]ACM Transactions on Mathematical Software, 1976
- Linear least squares solutions by householder transformationsNumerische Mathematik, 1965