https://github.com/astrobarker/root_finders_comp
comparison of some root finders in C++
https://github.com/astrobarker/root_finders_comp
Last synced: over 1 year ago
JSON representation
comparison of some root finders in C++
- Host: GitHub
- URL: https://github.com/astrobarker/root_finders_comp
- Owner: AstroBarker
- License: gpl-3.0
- Created: 2023-03-14T01:33:59.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2024-07-27T02:34:42.000Z (almost 2 years ago)
- Last Synced: 2025-02-04T10:56:39.748Z (over 1 year ago)
- Language: C++
- Size: 36.1 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# root_finders_comp
comparison of some root finders in C++
Purpose is to compare some root finders, in C++, on non-linear problems.
Standard Newton seems to outperform Anderson accelerated Newton in my tests (although literature shows there are cases where it wins, e.g., [Polllock and Schwartz 2019](https://arxiv.org/abs/1911.05238))
Implemented Anderson accelerated fixed point iteration shines.
## Root finders implemented
- Fixed Point
- Fixed Point (Anderson accelerated)
- Newton
- Newton (Anderson accelerated)
## Root Finders To Implement
- Bisection
- Regula Falsi