unittest: Reduced computation time of tests

Author: Lucas-Haubert

unittest/python/test_ComplexEigenSolver.py

@@ -6,17 +6,9 @@
 rng = np.random.default_rng()
 A = rng.random((dim, dim))
 
-ces = eigenpy.ComplexEigenSolver()
-es = eigenpy.ComplexEigenSolver(dim)
 es = eigenpy.ComplexEigenSolver(A)
 assert es.info() == eigenpy.ComputationInfo.Success
 
-es_with_vectors = eigenpy.ComplexEigenSolver(A, True)
-assert es_with_vectors.info() == eigenpy.ComputationInfo.Success
-
-es_without_vectors = eigenpy.ComplexEigenSolver(A, False)
-assert es_without_vectors.info() == eigenpy.ComputationInfo.Success
-
 V = es.eigenvectors()
 D = es.eigenvalues()
 assert V.shape == (dim, dim)
@@ -27,68 +19,10 @@
 assert eigenpy.is_approx(AV.real, VD.real)
 assert eigenpy.is_approx(AV.imag, VD.imag)
 
-es_compute = eigenpy.ComplexEigenSolver()
-result = es_compute.compute(A, False)
-assert result.info() == eigenpy.ComputationInfo.Success
-D_only = es_compute.eigenvalues()
-assert D_only.shape == (dim,)
-
-result_with_vectors = es_compute.compute(A, True)
-assert result_with_vectors.info() == eigenpy.ComputationInfo.Success
-V_computed = es_compute.eigenvectors()
-D_computed = es_compute.eigenvalues()
-assert V_computed.shape == (dim, dim)
-assert D_computed.shape == (dim,)
-
-trace_A = np.trace(A)
-trace_D = np.sum(D)
-assert abs(trace_A - trace_D.real) < 1e-10
-assert abs(trace_D.imag) < 1e-10
-
-es_default = eigenpy.ComplexEigenSolver()
-result_default = es_default.compute(A)
-assert result_default.info() == eigenpy.ComputationInfo.Success
-V_default = es_default.eigenvectors()
-D_default = es_default.eigenvalues()
-
-es_iter = eigenpy.ComplexEigenSolver(A)
-default_iter = es_iter.getMaxIterations()
-es_iter.setMaxIterations(100)
-assert es_iter.getMaxIterations() == 100
-es_iter.setMaxIterations(200)
-assert es_iter.getMaxIterations() == 200
-
-assert es.info() == eigenpy.ComputationInfo.Success
-
-ces1 = eigenpy.ComplexEigenSolver()
-ces2 = eigenpy.ComplexEigenSolver()
-id1 = ces1.id()
-id2 = ces2.id()
-assert id1 != id2
-assert id1 == ces1.id()
-assert id2 == ces2.id()
-
-dim_constructor = 3
-ces3 = eigenpy.ComplexEigenSolver(dim_constructor)
-ces4 = eigenpy.ComplexEigenSolver(dim_constructor)
-id3 = ces3.id()
-id4 = ces4.id()
-assert id3 != id4
-assert id3 == ces3.id()
-assert id4 == ces4.id()
-
 ces5 = eigenpy.ComplexEigenSolver(A)
 ces6 = eigenpy.ComplexEigenSolver(A)
 id5 = ces5.id()
 id6 = ces6.id()
 assert id5 != id6
 assert id5 == ces5.id()
 assert id6 == ces6.id()
-
-ces7 = eigenpy.ComplexEigenSolver(A, True)
-ces8 = eigenpy.ComplexEigenSolver(A, False)
-id7 = ces7.id()
-id8 = ces8.id()
-assert id7 != id8
-assert id7 == ces7.id()
-assert id8 == ces8.id()

unittest/python/test_ComplexSchur.py

@@ -20,50 +20,6 @@
     for col in range(row):
         assert abs(T[row, col]) < 1e-12
 
-A_test = rng.random((dim, dim))
-cs1 = eigenpy.ComplexSchur(dim)
-cs1.compute(A_test)
-cs2 = eigenpy.ComplexSchur(A_test)
-
-assert cs1.info() == eigenpy.ComputationInfo.Success
-assert cs2.info() == eigenpy.ComputationInfo.Success
-
-T1 = cs1.matrixT()
-U1 = cs1.matrixU()
-T2 = cs2.matrixT()
-U2 = cs2.matrixU()
-
-assert eigenpy.is_approx(T1, T2)
-assert eigenpy.is_approx(U1, U2)
-
-cs_no_u = eigenpy.ComplexSchur(A, False)
-assert cs_no_u.info() == eigenpy.ComputationInfo.Success
-T_no_u = cs_no_u.matrixT()
-
-assert eigenpy.is_approx(T, T_no_u)
-
-cs_compute_no_u = eigenpy.ComplexSchur(dim)
-result_no_u = cs_compute_no_u.compute(A, False)
-assert result_no_u.info() == eigenpy.ComputationInfo.Success
-T_compute_no_u = cs_compute_no_u.matrixT()
-assert eigenpy.is_approx(T, T_compute_no_u)
-
-cs_iter = eigenpy.ComplexSchur(dim)
-cs_iter.setMaxIterations(30 * dim)  # m_maxIterationsPerRow * size
-result_iter = cs_iter.compute(A)
-assert result_iter.info() == eigenpy.ComputationInfo.Success
-assert cs_iter.getMaxIterations() == 30 * dim
-
-T_iter = cs_iter.matrixT()
-U_iter = cs_iter.matrixU()
-assert eigenpy.is_approx(T, T_iter)
-assert eigenpy.is_approx(U, U_iter)
-
-cs_few_iter = eigenpy.ComplexSchur(dim)
-cs_few_iter.setMaxIterations(1)
-result_few = cs_few_iter.compute(A)
-assert cs_few_iter.getMaxIterations() == 1
-
 A_triangular = np.triu(A)
 cs_triangular = eigenpy.ComplexSchur(dim)
 cs_triangular.setMaxIterations(1)
@@ -90,27 +46,3 @@
 
 A_complex = A.astype(complex)
 assert eigenpy.is_approx(A_complex, U_from_hess @ T_from_hess @ U_from_hess.conj().T)
-
-cs1_id = eigenpy.ComplexSchur(dim)
-cs2_id = eigenpy.ComplexSchur(dim)
-id1 = cs1_id.id()
-id2 = cs2_id.id()
-assert id1 != id2
-assert id1 == cs1_id.id()
-assert id2 == cs2_id.id()
-
-cs3_id = eigenpy.ComplexSchur(A)
-cs4_id = eigenpy.ComplexSchur(A)
-id3 = cs3_id.id()
-id4 = cs4_id.id()
-assert id3 != id4
-assert id3 == cs3_id.id()
-assert id4 == cs4_id.id()
-
-cs5_id = eigenpy.ComplexSchur(A, True)
-cs6_id = eigenpy.ComplexSchur(A, False)
-id5 = cs5_id.id()
-id6 = cs6_id.id()
-assert id5 != id6
-assert id5 == cs5_id.id()
-assert id6 == cs6_id.id()

unittest/python/test_GeneralizedSelfAdjointEigenSolver.py

@@ -74,42 +74,6 @@ def test_generalized_selfadjoint_eigensolver(options):
     rank = len([d for d in D if abs(d) > 1e-12])
     assert rank <= dim
 
-    decomp1 = eigenpy.GeneralizedSelfAdjointEigenSolver()
-    decomp2 = eigenpy.GeneralizedSelfAdjointEigenSolver()
-    id1 = decomp1.id()
-    id2 = decomp2.id()
-    assert id1 != id2
-    assert id1 == decomp1.id()
-    assert id2 == decomp2.id()
-
-    decomp3 = eigenpy.GeneralizedSelfAdjointEigenSolver(dim)
-    decomp4 = eigenpy.GeneralizedSelfAdjointEigenSolver(dim)
-    id3 = decomp3.id()
-    id4 = decomp4.id()
-    assert id3 != id4
-    assert id3 == decomp3.id()
-    assert id4 == decomp4.id()
-
-    decomp5 = eigenpy.GeneralizedSelfAdjointEigenSolver(A, B, options)
-    decomp6 = eigenpy.GeneralizedSelfAdjointEigenSolver(A, B, options)
-    id5 = decomp5.id()
-    id6 = decomp6.id()
-    assert id5 != id6
-    assert id5 == decomp5.id()
-    assert id6 == decomp6.id()
-
-    if compute_eigenvectors and (options & eigenpy.DecompositionOptions.Ax_lBx):
-        A_pos = A @ A.T + np.eye(dim)
-        gsaes_pos = eigenpy.GeneralizedSelfAdjointEigenSolver(A_pos, B, options)
-        assert gsaes_pos.info() == eigenpy.ComputationInfo.Success
-
-        D_pos = gsaes_pos.eigenvalues()
-        if all(D_pos[i] > 1e-12 for i in range(dim)):
-            sqrt_matrix = gsaes_pos.operatorSqrt()
-            inv_sqrt_matrix = gsaes_pos.operatorInverseSqrt()
-            assert sqrt_matrix.shape == (dim, dim)
-            assert inv_sqrt_matrix.shape == (dim, dim)
-
 
 for opt in _options:
     test_generalized_selfadjoint_eigensolver(opt)

unittest/python/test_JacobiSVD.py

@@ -9,23 +9,26 @@
 
 _options = [
     0,
-    THIN_U,
-    THIN_V,
-    FULL_U,
-    FULL_V,
+    # THIN_U,
+    # THIN_V,
+    # FULL_U,
+    # FULL_V,
     THIN_U | THIN_V,
     FULL_U | FULL_V,
-    THIN_U | FULL_V,
-    FULL_U | THIN_V,
+    # THIN_U | FULL_V,
+    # FULL_U | THIN_V,
 ]
 
 _classes = [
     eigenpy.ColPivHhJacobiSVD,
-    eigenpy.FullPivHhJacobiSVD,
-    eigenpy.HhJacobiSVD,
-    eigenpy.NoPrecondJacobiSVD,
+    # eigenpy.FullPivHhJacobiSVD,
+    # eigenpy.HhJacobiSVD,
+    # eigenpy.NoPrecondJacobiSVD,
 ]
 
+# Rationale: Tets only few cases to gain computation time
+# User can test all of them by uncommenting the corresponding lines
+
 
 def is_valid_combination(cls, opt):
     if cls == eigenpy.FullPivHhJacobiSVD:
@@ -104,27 +107,6 @@ def test_jacobi(cls, opt):
         A_reconstructed = U @ S_matrix @ V.T
         assert eigenpy.is_approx(A, A_reconstructed)
 
-    jacobisvd.setThreshold()
-    _default_threshold = jacobisvd.threshold()
-    jacobisvd.setThreshold(1e-8)
-    assert jacobisvd.threshold() == 1e-8
-
-    decomp1 = cls()
-    decomp2 = cls()
-    id1 = decomp1.id()
-    id2 = decomp2.id()
-    assert id1 != id2
-    assert id1 == decomp1.id()
-    assert id2 == decomp2.id()
-
-    decomp3 = cls(dim, dim, opt)
-    decomp4 = cls(dim, dim, opt)
-    id3 = decomp3.id()
-    id4 = decomp4.id()
-    assert id3 != id4
-    assert id3 == decomp3.id()
-    assert id4 == decomp4.id()
-
 
 for cls in _classes:
     for opt in _options:

unittest/python/test_RealQZ.py

@@ -29,71 +29,10 @@
     for j in range(i - 1):
         assert abs(S[i, j]) < 1e-12
 
-realqz_no_qz = eigenpy.RealQZ(A, B, False)
-assert realqz_no_qz.info() == eigenpy.ComputationInfo.Success
-S_no_qz = realqz_no_qz.matrixS()
-T_no_qz = realqz_no_qz.matrixT()
-
-for i in range(dim):
-    for j in range(i):
-        assert abs(T_no_qz[i, j]) < 1e-12
-
-for i in range(dim):
-    for j in range(i - 1):
-        assert abs(S_no_qz[i, j]) < 1e-12
-
-realqz_compute_no_qz = eigenpy.RealQZ(dim)
-result_no_qz = realqz_compute_no_qz.compute(A, B, False)
-assert result_no_qz.info() == eigenpy.ComputationInfo.Success
-S_compute_no_qz = realqz_compute_no_qz.matrixS()
-T_compute_no_qz = realqz_compute_no_qz.matrixT()
-
-realqz_with_qz = eigenpy.RealQZ(dim)
-realqz_without_qz = eigenpy.RealQZ(dim)
-
-result_with = realqz_with_qz.compute(A, B, True)
-result_without = realqz_without_qz.compute(A, B, False)
-
-assert result_with.info() == eigenpy.ComputationInfo.Success
-assert result_without.info() == eigenpy.ComputationInfo.Success
-
-S_with = realqz_with_qz.matrixS()
-T_with = realqz_with_qz.matrixT()
-S_without = realqz_without_qz.matrixS()
-T_without = realqz_without_qz.matrixT()
-
-assert eigenpy.is_approx(S_with, S_without)
-assert eigenpy.is_approx(T_with, T_without)
-
-iterations = realqz.iterations()
-assert iterations >= 0
-
-realqz_iter = eigenpy.RealQZ(dim)
-realqz_iter.setMaxIterations(100)
-realqz_iter.setMaxIterations(500)
-result_iter = realqz_iter.compute(A, B)
-assert result_iter.info() == eigenpy.ComputationInfo.Success
-
-realqz1_id = eigenpy.RealQZ(dim)
-realqz2_id = eigenpy.RealQZ(dim)
-id1 = realqz1_id.id()
-id2 = realqz2_id.id()
-assert id1 != id2
-assert id1 == realqz1_id.id()
-assert id2 == realqz2_id.id()
-
 realqz3_id = eigenpy.RealQZ(A, B)
 realqz4_id = eigenpy.RealQZ(A, B)
 id3 = realqz3_id.id()
 id4 = realqz4_id.id()
 assert id3 != id4
 assert id3 == realqz3_id.id()
 assert id4 == realqz4_id.id()
-
-realqz5_id = eigenpy.RealQZ(A, B, True)
-realqz6_id = eigenpy.RealQZ(A, B, False)
-id5 = realqz5_id.id()
-id6 = realqz6_id.id()
-assert id5 != id6
-assert id5 == realqz5_id.id()
-assert id6 == realqz6_id.id()