Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement a better zero-finding algorithm #6

Open
abelsiqueira opened this issue Jul 7, 2023 · 0 comments
Open

Implement a better zero-finding algorithm #6

abelsiqueira opened this issue Jul 7, 2023 · 0 comments
Assignees
Labels

Comments

@abelsiqueira
Copy link
Owner

Currently, we use the bisection method to compute the zero of the function f. Instead, we could implement regula falsi, which is very similar and easy to swap.
A full description is https://en.wikipedia.org/wiki/Regula_falsi but the only part that matters is that instead of

x = (a + b) / 2

we use

x = (a * fb - b * fa) / (fb - fa)
@datejada datejada self-assigned this Aug 9, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants