refactor: Inline Method, as it has no clients.

Author: hemalvarambhia

src/Math-Polynomials/PMPolynomial.class.st

@@ -239,11 +239,6 @@ PMPolynomial >> reciprocal [
 	^ (PMPolynomial coefficients: #(1)) / self
 ]
 
-{ #category : #information }
-PMPolynomial >> rootFindingAlgorithmWith: precision [ 
-	^ PMNewtonZeroFinder rootFindingAlgorithmWith: precision 
-]
-
 { #category : #information }
 PMPolynomial >> roots [
 
@@ -254,7 +249,7 @@ PMPolynomial >> roots [
 PMPolynomial >> roots: aNumber [
 
 	| pol roots x rootFinder |
-	rootFinder := self rootFindingAlgorithmWith: aNumber.
+	rootFinder := PMNewtonZeroFinder rootFindingAlgorithmWith: aNumber.
 	pol := self class coefficients:
 		       (coefficients reverse collect: [ :each | each asFloat ]).
 	roots := OrderedCollection new: self degree.