Content deleted Content added
Citation bot (talk | contribs) Add: s2cid, doi, issue. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 518/3848 |
→Variants and implementation: Noted that a link should be provided. This should be specifically for the advertised implementation of the “high-quality parallel” algorithm, not just the name of the overall package. Tags: Mobile edit Mobile web edit |
||
Line 73:
There exist specialized root-finding techniques for rational functions that may do better than the Newton-Raphson method in terms of both performance and stability. These can be used to improve the iterative part of the divide-and-conquer algorithm.
The divide-and-conquer algorithm is readily [[Parallel algorithm|parallelized]], and [[linear algebra]] computing packages such as [[LAPACK]] contain high-quality parallel implementations.{{Citation needed|date=September 2023}}
==References==
| |||