Perhaps we can split the test up and we can discover where the erratic failure happens more precisely.

Author: hemalvarambhia

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

@@ -28,14 +28,6 @@ PMQRTest >> assert: inverse isMoorePenroseInverseOf: aMatrix [
 PMQRTest >> testMoorePenroseInverse [
 
 	| a inverse |
-	a := PMMatrix new initializeRows:
-		     #( #( 5 40 1 ) #( 0 0 1 ) #( 0 0 1 ) ).
-	inverse := a mpInverse .
-	self assert: inverse isMoorePenroseInverseOf: a.
-	
-	a := a * (PMMatrix rows: 3 columns: 3 random: 5.0).
-	inverse := a mpInverse .
-	self assert: inverse isMoorePenroseInverseOf: a.
 
 	a := PMMatrix new initializeRows:
 		     #( #( 5 40 1 2.5 ) #( 0 0 1 2.5 ) #( 0 0 1 2.5 ) ).
@@ -53,6 +45,26 @@ PMQRTest >> testMoorePenroseInverse [
 		self assert: (a mpInverse closeTo: a inverse) ]
 ]
 
+{ #category : #tests }
+PMQRTest >> testMoorePenroseInverseOfNonRandomMatrix [
+	| a inverse |
+	a := PMMatrix new initializeRows:
+		     #( #( 5 40 1 ) #( 0 0 1 ) #( 0 0 1 ) ).
+	inverse := a mpInverse .
+	self assert: inverse isMoorePenroseInverseOf: a.
+]
+
+{ #category : #tests }
+PMQRTest >> testMoorePenroseInverseOfProductOfMatrices [
+	| a inverse |
+	a := PMMatrix new initializeRows:
+		     #( #( 5 40 1 ) #( 0 0 1 ) #( 0 0 1 ) ).
+	
+	a := a * (PMMatrix rows: 3 columns: 3 random: 5.0).
+	inverse := a mpInverse .
+	self assert: inverse isMoorePenroseInverseOf: a.
+]
+
 { #category : #tests }
 PMQRTest >> testOrthogonalize [