The Brent's Algorithm, Also Known as Brent's Method (or The Van Wijngaarden-Dekker-Brent method), is a Hybrid Root-Finding Algorithm used in Numerical Analysis. It is Designed to Find a Root (or Zero) of a Function, f(x), Within a Given Interval [a, b], Where the Function is Known to Change Sign, i.e., f(a)f(b) < 0.
-
Notifications
You must be signed in to change notification settings - Fork 0
The Brent's Algorithm, Also Known as Brent's Method (or The Van Wijngaarden-Dekker-Brent method), is a Hybrid Root-Finding Algorithm used in Numerical Analysis. It is Designed to Find a Root (or Zero) of a Function, f(x), Within a Given Interval [a, b], Where the Function is Known to Change Sign, i.e., f(a)f(b) < 0.
WillKirkmanM/brent
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The Brent's Algorithm, Also Known as Brent's Method (or The Van Wijngaarden-Dekker-Brent method), is a Hybrid Root-Finding Algorithm used in Numerical Analysis. It is Designed to Find a Root (or Zero) of a Function, f(x), Within a Given Interval [a, b], Where the Function is Known to Change Sign, i.e., f(a)f(b) < 0.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published