Start to remove the users of defaultNumericalPrecision to use Float defaultComparisonPrecision

Author: jecisc

src/Math-Numerical/Number.extension.st

@@ -62,16 +62,6 @@ Number >> logGamma [
 					]
 ]
 
-{ #category : #'*Math-Numerical' }
-Number >> relativelyEqualsTo: aNumber upTo: aSmallNumber [
-		"compare to Float>>closeTo:
-		generally called from Number>>equalsTo:"
-	| norm |
-	norm := self abs max: aNumber abs.
-	^norm <= PMFloatingPointMachine new defaultNumericalPrecision
-		or: [ (self - aNumber) abs < ( aSmallNumber * norm)]
-]
-
 { #category : #'*Math-Numerical' }
 Number >> subtractToPolynomial: aPolynomial [
 	^aPolynomial addNumber: self negated

src/Math-Polynomials/PMPolynomial.class.st

@@ -234,7 +234,7 @@ PMPolynomial >> reciprocal [
 { #category : #information }
 PMPolynomial >> roots [
 
-	^self roots: PMFloatingPointMachine new defaultNumericalPrecision
+	^ self roots: Float defaultComparisonPrecision
 ]
 
 { #category : #information }

src/Math-Tests-Numerical/PMNumericalMethodsTestCase.class.st

@@ -454,15 +454,20 @@ PMNumericalMethodsTestCase >> testLineSearch3 [
 
 	This case does not require line search, should return 1.
 	"
+
 	| xOld eps p functionBlock g0 g1 dg0 lineSearch xAnswer |
-	eps := PMFloatingPointMachine new defaultNumericalPrecision.
+	eps := Float defaultComparisonPrecision.
 	xOld := -1.0 + eps.
 	p := eps.
-	functionBlock := [  :t | 0.5 * ((t * p + xOld) + 1) squared ].
+	functionBlock := [ :t | 0.5 * (t * p + xOld + 1) squared ].
 	g0 := functionBlock value: 0.
 	g1 := functionBlock value: 1.
 	dg0 := 2.0 * g0 negated.
-	lineSearch := PMLineSearch function: functionBlock valueAtZero: g0 derivativeAtZero: dg0 valueAtOne: g1.
+	lineSearch := PMLineSearch
+		              function: functionBlock
+		              valueAtZero: g0
+		              derivativeAtZero: dg0
+		              valueAtOne: g1.
 	lineSearch desiredPrecision: eps.
 	xAnswer := lineSearch evaluate.
 	self assert: xAnswer equals: 1.0

src/Math-Tests-Polynomials/PMPolynomialTest.class.st

@@ -234,21 +234,12 @@ PMPolynomialTest >> testPolynomialRoots [
 	"Code Example 5.5"
 
 	| polynomial roots |
-	polynomial := PMPolynomial coefficients: #(-10 -13 -2 1).
+	polynomial := PMPolynomial coefficients: #( -10 -13 -2 1 ).
 	roots := polynomial roots asSortedCollection asArray.
 	self assert: roots size equals: 3.
-	self
-		assert:
-			((roots at: 1) + 2) abs
-				< PMFloatingPointMachine new defaultNumericalPrecision.
-	self
-		assert:
-			((roots at: 2) + 1) abs
-				< PMFloatingPointMachine new defaultNumericalPrecision.
-	self
-		assert:
-			((roots at: 3) - 5) abs
-				< PMFloatingPointMachine new defaultNumericalPrecision
+	self assert: (roots at: 1) + 2 closeTo: 0.
+	self assert: (roots at: 2) + 1 closeTo: 0.
+	self assert: (roots at: 3) - 5 closeTo: 0
 ]
 
 { #category : #'function evaluation' }