Repository navigation
Add Brent’s Method for root finding (Numerical Analysis) #13047
Description
Feature description
Algorithm to Add
Brent’s Method for root finding (Numerical Analysis)
Description
Brent’s Method is a robust, efficient algorithm for finding zeros of functions, combining bisection, secant, and inverse quadratic interpolation. It is widely used in scientific computing.
Motivation
Adding Brent’s Method would enhance the set of numerical root-finding algorithms in this repository, as it is often considered the gold standard for reliability and speed.
I would like to implement and contribute this algorithm.
This issue is created as part of Hacktoberfest 2025.
Activity
Dibbu-cell commentedon Oct 1, 2025
sir,assign me this issue.
sarbojitrana commentedon Oct 1, 2025
Hello sir, could you please assign me this issue?
debesh00800 commentedon Oct 1, 2025
Hi @harshgupta2125 , I have attached the PR for the implementation and the required tests have been passed, please have a look at it.
#13063
debesh00800 commentedon Oct 1, 2025
Hi @mindaugl , are there any more approvals required to be merged?
Also, can you please add hacktoberfest tag to it.
Dibbu-cell commentedon Oct 2, 2025
Sir,all tests are passed kindly merge my PR.
debesh00800 commentedon Oct 2, 2025
Hi, can the PR #13063 be reviewed and merged
abhilashj06 commentedon Oct 18, 2025
I want to contribute to this issue please allow me to contribute