A parallel algorithm for simple roots of polynomials
A method for finding simple roots of arbitrary polynomials based on divided differences is discussed. Theoretical background is presented for the case of simple roots. Numerical results are presented which show the algorithm finds simple and (usually) multiple zeros to an accuracy limited by the acc...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Virginia Polytechnic Institute and State University
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/87255 |