Numerical Methods Using Kotlin: For Data Science, Analysis, and Engineering

© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2023

H. Li, PhDNumerical Methods Using Kotlinhttps://doi.org/10.1007/978-1-4842-8826-9_3

3. Finding Roots of Equations

Haksun Li, PhD¹  

(1)

Hong Kong, China

 

A root-finding algorithm is a numerical algorithm that finds a value x such that f (x) = 0 for a given function f. This procedure is also called finding zeros. As a result, you can get no solution, one solution, or multiple solutions. NM Dev provides a few methods to find such roots. They is the Jenkins-Traub algorithm, the bisection method, Brent’s method, the Newton-Raphson method, and Halley’s method. With the exception of polynomials, you have the Jenkins-Traub algorithm, which calculates all the roots ...