title: Finding more than one root with root finding algorithms
body: <p>What is the best way to find the roots of an equation with more than one root. I understand that no one method which can solve every equation, and that you have to use more than one, but I can't find a root finding algorithm that can solve for more than one root in even the simplest instance.</p>
  
  <p>For example: <code>y = x^2</code></p>
  
  <p>Although a root solving algorithm to solve a basic equation like this is helpful, it would need to be something I could adapt to solve an equation with more than two roots.</p>
  
  <p>One more thing to note is that the equations wouldn't be your typical polynomials, but could be something such as <code>ln(x^2) + x - 15 = 0</code></p>
  
  <p>What is a root finding algorithm that could solve for this, or how could you edit a root finding algorithm such as the Bisection/Newton/Brent method to solve this problem, (Assuming I'm correct in that Newton and Brent's method can only solve for one root).</p>