Split a large test case with many assertions and moved part of it to Math-Numerical

Author: olekscode

src/Math-Tests-Matrix/PMMatrixTest.class.st

@@ -215,6 +215,30 @@ PMMatrixTest >> testIdentityMatrix [
 	self assert: identityMatrix equals: expectedIdentityMatrix.
 ]
 
+{ #category : #'linear algebra' }
+PMMatrixTest >> testInversePureCRLSingularMatrixError [
+
+	self
+		should: [ (PMSymmetricMatrix rows: #((1 2 3)(2 2 2)(3 2 1))) inversePureCRL ]
+		raise: PMSingularMatrixError.
+]
+
+{ #category : #'linear algebra' }
+PMMatrixTest >> testInversePureLUPSingularMatrixError [
+
+	self
+		should: [ (PMSymmetricMatrix rows: #((1 2 3)(2 2 2)(3 2 1))) inversePureLUP ]
+		raise: PMSingularMatrixError.
+]
+
+{ #category : #'linear algebra' }
+PMMatrixTest >> testInverseSingularMatrixError [
+
+	self
+		should: [ (PMMatrix rows: #((1 2 3)(3 4 6))) inverse ]
+		raise: PMSingularMatrixError.
+]
+
 { #category : #tests }
 PMMatrixTest >> testIsRealOnComplexMatrix [
 	| matrix |
@@ -757,22 +781,6 @@ PMMatrixTest >> testSimpleMatrixOperations [
 	self assert: m transpose * m equals: m squared
 ]
 
-{ #category : #'linear algebra' }
-PMMatrixTest >> testSingularMatrixError [
-|h f|
-h:=PMHistogram new.
-h freeExtent: true.
-1 to: 3 do:  [:i| h accumulate: i ].
-f:=PMLeastSquareFit histogram: h distributionClass: PMTriangularDistribution.
-self should: [ f evaluate ] raise: PMSingularMatrixError .
-"and not something completely incomprehensible"
-"also here:"
-self should: [ f errorMatrix ] raise: PMSingularMatrixError .
-self should: [(PMMatrix rows: #((1 2 3)(3 4 6)))inverse] raise: PMSingularMatrixError .
-self should: [(PMSymmetricMatrix rows: #((1 2 3)(2 2 2)(3 2 1)))inversePureLUP] raise: PMSingularMatrixError.
-self should: [(PMSymmetricMatrix rows: #((1 2 3)(2 2 2)(3 2 1)))inversePureCRL] raise: PMSingularMatrixError.
-]
-
 { #category : #tests }
 PMMatrixTest >> testSkalarMultiplication [
 	| a r |

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

@@ -391,6 +391,24 @@ PMNumericalMethodsTestCase >> testLeastSquarePolynomial [
 				< (estimation error: 7.15)
 ]
 
+{ #category : #'iterative algorithms' }
+PMNumericalMethodsTestCase >> testLeastSquaresSingularMatrixError [
+	| histogram leastSquares |
+	
+	histogram := PMHistogram new
+		freeExtent: true;
+		yourself.
+		
+	1 to: 3 do: [:i| histogram accumulate: i ].
+	
+	leastSquares := PMLeastSquareFit
+		histogram: histogram
+		distributionClass: PMTriangularDistribution.
+		
+	self should: [ leastSquares evaluate ] raise: PMSingularMatrixError.
+	self should: [ leastSquares errorMatrix ] raise: PMSingularMatrixError .
+]
+
 { #category : #'iterative algorithms' }
 PMNumericalMethodsTestCase >> testLineSearch1 [
 	"Test line searh for an initial step of Newton solver for equation
@@ -852,22 +870,6 @@ PMNumericalMethodsTestCase >> testOptimizeSimplex [
 	self assert: (result at: 3) abs < 1.0e-6
 ]
 
-{ #category : #'linear algebra' }
-PMNumericalMethodsTestCase >> testSingularMatrixError [
-|h f|
-h:=PMHistogram new.
-h freeExtent: true.
-1 to: 3 do:  [:i| h accumulate: i ].
-f:=PMLeastSquareFit histogram: h distributionClass: PMTriangularDistribution.
-self should: [ f evaluate ] raise: PMSingularMatrixError .
-"and not something completely incomprehensible"
-"also here:"
-self should: [ f errorMatrix ] raise: PMSingularMatrixError .
-self should: [(PMMatrix rows: #((1 2 3)(3 4 6)))inverse] raise: PMSingularMatrixError .
-self should: [(PMSymmetricMatrix rows: #((1 2 3)(2 2 2)(3 2 1)))inversePureLUP] raise: PMSingularMatrixError.
-self should: [(PMSymmetricMatrix rows: #((1 2 3)(2 2 2)(3 2 1)))inversePureCRL] raise: PMSingularMatrixError.
-]
-
 { #category : #statistics }
 PMNumericalMethodsTestCase >> testStatisticalMoments [
 	"comment"