GCC Code Coverage Report

Directory:	./
File:	src/svd/tests/test11.c
Date:	2025-11-19 04:19:03

	Exec	Total	Coverage
Lines:	44	46	95.7%
Functions:	2	2	100.0%
Branches:	131	214	61.2%

  
      Line
      Branch
      Exec
      Source
    
      /*
    
         - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
         SLEPc - Scalable Library for Eigenvalue Problem Computations
    
         Copyright (c) 2002-, Universitat Politecnica de Valencia, Spain
    
         This file is part of SLEPc.
    
         SLEPc is distributed under a 2-clause BSD license (see LICENSE).
    
         - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
      */
    
      static char help[] = "Tests a user-defined convergence test (based on ex8.c).\n\n"
    
        "The command line options are:\n"
    
        "  -n <n>, where <n> = matrix dimension.\n\n";
    
      #include <slepcsvd.h>
    
      /*
    
         This example computes the singular values of an nxn Grcar matrix,
    
         which is a nonsymmetric Toeplitz matrix:
    
                    |  1  1  1  1               |
    
                    | -1  1  1  1  1            |
    
                    |    -1  1  1  1  1         |
    
                    |       .  .  .  .  .       |
    
                A = |          .  .  .  .  .    |
    
                    |            -1  1  1  1  1 |
    
                    |               -1  1  1  1 |
    
                    |                  -1  1  1 |
    
                    |                     -1  1 |
    
       */
    
      /*
    
        MyConvergedRel - Convergence test relative to the norm of A (given in ctx).
    
      */
    
      140
      PetscErrorCode MyConvergedRel(SVD svd,PetscReal sigma,PetscReal res,PetscReal *errest,void *ctx)
    
      {
    
      140
        PetscReal norm = *(PetscReal*)ctx;
    
        1/2✓ Branch 0 taken 2 times.
✗ Branch 1 not taken.

      140
        PetscFunctionBegin;
    
      140
        *errest = res/norm;
    
        6/12✓ Branch 0 taken 2 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 2 times.
✓ Branch 4 taken 2 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 2 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 2 times.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
✓ Branch 11 taken 2 times.

      140
        PetscFunctionReturn(PETSC_SUCCESS);
    
      }
    
      10
      int main(int argc,char **argv)
    
      {
    
      10
        Mat            A;               /* Grcar matrix */
    
      10
        SVD            svd;             /* singular value solver context */
    
      10
        PetscInt       N=30,Istart,Iend,i,col[5],nconv1,nconv2;
    
      10
        PetscScalar    value[] = { -1, 1, 1, 1, 1 };
    
      10
        PetscReal      sigma_1,sigma_n;
    
        1/2✓ Branch 0 taken 2 times.
✗ Branch 1 not taken.

      10
        PetscFunctionBeginUser;
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SlepcInitialize(&argc,&argv,NULL,help));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(PetscOptionsGetInt(NULL,NULL,"-n",&N,NULL));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(PetscPrintf(PETSC_COMM_WORLD,"\nEstimate the condition number of a Grcar matrix, n=%" PetscInt_FMT "\n\n",N));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
              Generate the matrix
    
           - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(MatCreate(PETSC_COMM_WORLD,&A));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(MatSetSizes(A,PETSC_DECIDE,PETSC_DECIDE,N,N));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(MatSetFromOptions(A));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(MatGetOwnershipRange(A,&Istart,&Iend));
    
        2/2✓ Branch 0 taken 10 times.
✓ Branch 1 taken 10 times.

      310
        for (i=Istart;i<Iend;i++) {
    
      300
          col[0]=i-1; col[1]=i; col[2]=i+1; col[3]=i+2; col[4]=i+3;
    
        6/8✓ Branch 0 taken 10 times.
✓ Branch 1 taken 10 times.
✓ Branch 2 taken 2 times.
✓ Branch 3 taken 8 times.
✓ Branch 4 taken 2 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 2 times.

      300
          if (i==0) PetscCall(MatSetValues(A,1,&i,PetscMin(4,N-i),col+1,value+1,INSERT_VALUES));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      300
          else PetscCall(MatSetValues(A,1,&i,PetscMin(5,N-i+1),col,value,INSERT_VALUES));
    
        }
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(MatAssemblyBegin(A,MAT_FINAL_ASSEMBLY));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(MatAssemblyEnd(A,MAT_FINAL_ASSEMBLY));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                   Create the SVD solver and set the solution method
    
           - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDCreate(PETSC_COMM_WORLD,&svd));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDSetOperators(svd,A,NULL));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDSetType(svd,SVDTRLANCZOS));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDSetFromOptions(svd));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                            Solve the singular value problem
    
           - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDSetWhichSingularTriplets(svd,SVD_LARGEST));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDSolve(svd));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDGetConverged(svd,&nconv1));
    
        5/8✓ Branch 0 taken 10 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2 times.
✓ Branch 3 taken 8 times.
✓ Branch 4 taken 2 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 2 times.

      10
        if (nconv1 > 0) PetscCall(SVDGetSingularTriplet(svd,0,&sigma_1,NULL,NULL));
    
      ✗
        else PetscCall(PetscPrintf(PETSC_COMM_WORLD," Unable to compute large singular value!\n\n"));
    
        /* compute smallest singular value relative to the matrix norm */
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDSetConvergenceTestFunction(svd,MyConvergedRel,&sigma_1,NULL));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDSetWhichSingularTriplets(svd,SVD_SMALLEST));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDSolve(svd));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDGetConverged(svd,&nconv2));
    
        5/8✓ Branch 0 taken 10 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2 times.
✓ Branch 3 taken 8 times.
✓ Branch 4 taken 2 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 2 times.

      10
        if (nconv2 > 0) PetscCall(SVDGetSingularTriplet(svd,0,&sigma_n,NULL,NULL));
    
      ✗
        else PetscCall(PetscPrintf(PETSC_COMM_WORLD," Unable to compute small singular value!\n\n"));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                          Display solution and clean up
    
           - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
    
        2/4✓ Branch 0 taken 10 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 10 times.
✗ Branch 3 not taken.

      10
        if (nconv1 > 0 && nconv2 > 0) {
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
          PetscCall(PetscPrintf(PETSC_COMM_WORLD," Computed singular values: sigma_1=%.4f, sigma_n=%.4f\n",(double)sigma_1,(double)sigma_n));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
          PetscCall(PetscPrintf(PETSC_COMM_WORLD," Estimated condition number: sigma_1/sigma_n=%.4f\n\n",(double)(sigma_1/sigma_n)));
    
        }
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(SVDDestroy(&svd));
    
        4/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.

      10
        PetscCall(MatDestroy(&A));
    
        3/6✓ Branch 0 taken 2 times.
✓ Branch 1 taken 2 times.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.

      10
        PetscCall(SlepcFinalize());
    
        return 0;
    
      }
    
      /*TEST
    
         test:
    
            suffix: 1
    
      TEST*/

Line	Branch	Exec	Source
1			/*
2			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
3			SLEPc - Scalable Library for Eigenvalue Problem Computations
4			Copyright (c) 2002-, Universitat Politecnica de Valencia, Spain
5
6			This file is part of SLEPc.
7			SLEPc is distributed under a 2-clause BSD license (see LICENSE).
8			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
9			*/
10
11			static char help[] = "Tests a user-defined convergence test (based on ex8.c).\n\n"
12			"The command line options are:\n"
13			" -n <n>, where <n> = matrix dimension.\n\n";
14
15			#include <slepcsvd.h>
16
17			/*
18			This example computes the singular values of an nxn Grcar matrix,
19			which is a nonsymmetric Toeplitz matrix:
20
21			\| 1 1 1 1 \|
22			\| -1 1 1 1 1 \|
23			\| -1 1 1 1 1 \|
24			\| . . . . . \|
25			A = \| . . . . . \|
26			\| -1 1 1 1 1 \|
27			\| -1 1 1 1 \|
28			\| -1 1 1 \|
29			\| -1 1 \|
30
31			*/
32
33			/*
34			MyConvergedRel - Convergence test relative to the norm of A (given in ctx).
35			*/
36		140	PetscErrorCode MyConvergedRel(SVD svd,PetscReal sigma,PetscReal res,PetscReal errest,void ctx)
37			{
38		140	PetscReal norm = (PetscReal)ctx;
39
40	1/2 ✓ Branch 0 taken 2 times. ✗ Branch 1 not taken.	140	PetscFunctionBegin;
41		140	*errest = res/norm;
42	6/12 ✓ Branch 0 taken 2 times. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✓ Branch 3 taken 2 times. ✓ Branch 4 taken 2 times. ✗ Branch 5 not taken. ✓ Branch 6 taken 2 times. ✗ Branch 7 not taken. ✓ Branch 8 taken 2 times. ✗ Branch 9 not taken. ✗ Branch 10 not taken. ✓ Branch 11 taken 2 times.	140	PetscFunctionReturn(PETSC_SUCCESS);
43			}
44
45		10	int main(int argc,char **argv)
46			{
47		10	Mat A; /* Grcar matrix */
48		10	SVD svd; /* singular value solver context */
49		10	PetscInt N=30,Istart,Iend,i,col[5],nconv1,nconv2;
50		10	PetscScalar value[] = { -1, 1, 1, 1, 1 };
51		10	PetscReal sigma_1,sigma_n;
52
53	1/2 ✓ Branch 0 taken 2 times. ✗ Branch 1 not taken.	10	PetscFunctionBeginUser;
54	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SlepcInitialize(&argc,&argv,NULL,help));
55
56	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(PetscOptionsGetInt(NULL,NULL,"-n",&N,NULL));
57	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(PetscPrintf(PETSC_COMM_WORLD,"\nEstimate the condition number of a Grcar matrix, n=%" PetscInt_FMT "\n\n",N));
58
59			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
60			Generate the matrix
61			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
62
63	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(MatCreate(PETSC_COMM_WORLD,&A));
64	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(MatSetSizes(A,PETSC_DECIDE,PETSC_DECIDE,N,N));
65	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(MatSetFromOptions(A));
66	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(MatGetOwnershipRange(A,&Istart,&Iend));
67	2/2 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times.	310	for (i=Istart;i<Iend;i++) {
68		300	col[0]=i-1; col[1]=i; col[2]=i+1; col[3]=i+2; col[4]=i+3;
69	6/8 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times. ✓ Branch 2 taken 2 times. ✓ Branch 3 taken 8 times. ✓ Branch 4 taken 2 times. ✗ Branch 5 not taken. ✗ Branch 6 not taken. ✓ Branch 7 taken 2 times.	300	if (i==0) PetscCall(MatSetValues(A,1,&i,PetscMin(4,N-i),col+1,value+1,INSERT_VALUES));
70	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	300	else PetscCall(MatSetValues(A,1,&i,PetscMin(5,N-i+1),col,value,INSERT_VALUES));
71			}
72	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(MatAssemblyBegin(A,MAT_FINAL_ASSEMBLY));
73	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(MatAssemblyEnd(A,MAT_FINAL_ASSEMBLY));
74
75			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
76			Create the SVD solver and set the solution method
77			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
78
79	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDCreate(PETSC_COMM_WORLD,&svd));
80	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDSetOperators(svd,A,NULL));
81	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDSetType(svd,SVDTRLANCZOS));
82	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDSetFromOptions(svd));
83
84			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
85			Solve the singular value problem
86			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
87
88	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDSetWhichSingularTriplets(svd,SVD_LARGEST));
89	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDSolve(svd));
90	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDGetConverged(svd,&nconv1));
91	5/8 ✓ Branch 0 taken 10 times. ✗ Branch 1 not taken. ✓ Branch 2 taken 2 times. ✓ Branch 3 taken 8 times. ✓ Branch 4 taken 2 times. ✗ Branch 5 not taken. ✗ Branch 6 not taken. ✓ Branch 7 taken 2 times.	10	if (nconv1 > 0) PetscCall(SVDGetSingularTriplet(svd,0,&sigma_1,NULL,NULL));
92		✗	else PetscCall(PetscPrintf(PETSC_COMM_WORLD," Unable to compute large singular value!\n\n"));
93
94			/* compute smallest singular value relative to the matrix norm */
95	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDSetConvergenceTestFunction(svd,MyConvergedRel,&sigma_1,NULL));
96	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDSetWhichSingularTriplets(svd,SVD_SMALLEST));
97	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDSolve(svd));
98	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDGetConverged(svd,&nconv2));
99	5/8 ✓ Branch 0 taken 10 times. ✗ Branch 1 not taken. ✓ Branch 2 taken 2 times. ✓ Branch 3 taken 8 times. ✓ Branch 4 taken 2 times. ✗ Branch 5 not taken. ✗ Branch 6 not taken. ✓ Branch 7 taken 2 times.	10	if (nconv2 > 0) PetscCall(SVDGetSingularTriplet(svd,0,&sigma_n,NULL,NULL));
100		✗	else PetscCall(PetscPrintf(PETSC_COMM_WORLD," Unable to compute small singular value!\n\n"));
101
102			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
103			Display solution and clean up
104			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
105	2/4 ✓ Branch 0 taken 10 times. ✗ Branch 1 not taken. ✓ Branch 2 taken 10 times. ✗ Branch 3 not taken.	10	if (nconv1 > 0 && nconv2 > 0) {
106	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(PetscPrintf(PETSC_COMM_WORLD," Computed singular values: sigma_1=%.4f, sigma_n=%.4f\n",(double)sigma_1,(double)sigma_n));
107	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(PetscPrintf(PETSC_COMM_WORLD," Estimated condition number: sigma_1/sigma_n=%.4f\n\n",(double)(sigma_1/sigma_n)));
108			}
109
110	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(SVDDestroy(&svd));
111	4/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times.	10	PetscCall(MatDestroy(&A));
112	3/6 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 2 times. ✓ Branch 2 taken 2 times. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✗ Branch 5 not taken.	10	PetscCall(SlepcFinalize());
113			return 0;
114			}
115
116			/*TEST
117
118			test:
119			suffix: 1
120
121			TEST*/
122

Function (Line)	Call count	Block coverage
MyConvergedRel (line 36)	called 140 times	100.0%
main (line 45)	called 10 times	79.0%