Our recent work "Higher-Order Root-Finding Algorithm and its Applications" (https://arxiv.org/abs/2509.20897, and its published version https://www.tandfonline.com/doi/full/10.1080/00207160.2025.2561050) proposes a root finding algorithm which implements Householder's method in polynomial time. This allows implementation up to very high orders. The sage source code is given in this repository.
-
Notifications
You must be signed in to change notification settings - Fork 0
Based on our recent pre-print https://arxiv.org/abs/2509.20897 and published version in International Journal of Computer Mathematics.
fooweiguo/Root-Finding
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Based on our recent pre-print https://arxiv.org/abs/2509.20897 and published version in International Journal of Computer Mathematics.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published