Loading...
Please wait, while we are loading the content...
Similar Documents
A globally convergent parallel algorithm for zeros of polynomial systems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Morgan, Alexander P. Watson, Layne T. |
| Copyright Year | 1989 |
| Abstract | Certain classes of nonlinear systems of equations, such as polynomial systems, have properties that make them particularly amenable to solution on distributed computing systems. Some algorithms, considered unfavorably on a single processor serial computer, may be excellent on a distributed system. This paper considers the solution of polynomial systems of equations via a globally convergent homotopy algorithm on a hypercube. Some computational results are reported. |
| Starting Page | 1339 |
| Ending Page | 1352 |
| Page Count | 14 |
| File Format | PDF HTM / HTML |
| DOI | 10.1016/0362-546X(89)90017-5 |
| Volume Number | 13 |
| Alternate Webpage(s) | https://deepblue.lib.umich.edu/bitstream/handle/2027.42/28243/0000696.pdf;sequence=1 |
| Alternate Webpage(s) | https://doi.org/10.1016/0362-546X%2889%2990017-5 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
