Java for Scientific Computing: Root Finding Algorithms -- Part 4

In this tutorial, I discuss how to add improvements to the bi-section method to make it faster. In particular, I discuss how to implement the tri-section method with the ternary search that can significantly speed up the root finding.