Find a root (zero) of a scalar function f(x) in the interval [a, b] where f(a) and f(b) have opposite signs. Methods: bisect (reliable, slow convergence), brent (optimal hybrid method, recommended), ridder (exponential convergence), secant (fast but requires good initial bracket). Essential for implied volatility calculation, yield-to-maturity solving, break-even analysis, and finding zeros in pricing equations.
API key for authentication. Get your key at https://finceptbackend.share.zrok.io/auth/register
Built-in function or 'custom_poly' for polynomial
sin, cos, exp_minus_2, x2_minus_4, custom_poly "x2_minus_4"
Lower bound of search interval
1
Upper bound of search interval (f(a) and f(b) should have opposite signs)
3
Root-finding method
bisect, brent, ridder, secant "brent"
Convergence tolerance (smaller = more accurate)
1e-12
Polynomial coefficients [a0, a1, a2, ...] for a0 + a1x + a2x^2 + ... (only for custom_poly)
[-4, 0, 1]