GCC Code Coverage Report

Directory:	./
File:	src/pep/tutorials/nlevp/loaded_string.c
Date:	2025-10-04 04:19:13

	Exec	Total	Coverage
Lines:	46	50	92.0%
Functions:	1	1	100.0%
Branches:	155	242	64.0%

  
      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).
    
         - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
      */
    
      /*
    
         This example implements one of the problems found at
    
             NLEVP: A Collection of Nonlinear Eigenvalue Problems,
    
             The University of Manchester.
    
         The details of the collection can be found at:
    
             [1] T. Betcke et al., "NLEVP: A Collection of Nonlinear Eigenvalue
    
                 Problems", ACM Trans. Math. Software 39(2), Article 7, 2013.
    
         The loaded_string problem is a rational eigenvalue problem for the
    
         finite element model of a loaded vibrating string.
    
         This example solves the loaded_string problem by first transforming
    
         it to a quadratic eigenvalue problem.
    
      */
    
      static char help[] = "Finite element model of a loaded vibrating string.\n\n"
    
        "The command line options are:\n"
    
        "  -n <n>, dimension of the matrices.\n"
    
        "  -kappa <kappa>, stiffness of elastic spring.\n"
    
        "  -mass <m>, mass of the attached load.\n\n";
    
      #include <slepcpep.h>
    
      #define NMAT 3
    
      10
      int main(int argc,char **argv)
    
      {
    
      10
        Mat            A[3],M;      /* problem matrices */
    
      10
        PEP            pep;         /* polynomial eigenproblem solver context */
    
      10
        PetscInt       n=100,Istart,Iend,i;
    
      10
        PetscBool      terse;
    
      10
        PetscReal      kappa=1.0,m=1.0;
    
      10
        PetscScalar    sigma;
    
        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(PetscOptionsGetReal(NULL,NULL,"-kappa",&kappa,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(PetscOptionsGetReal(NULL,NULL,"-mass",&m,NULL));
    
      10
        sigma = kappa/m;
    
        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,"Loaded vibrating string (QEP), n=%" PetscInt_FMT " kappa=%g m=%g\n\n",n,(double)kappa,(double)m));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
           Compute the matrices that define the eigensystem, (k^2*M+k*C+K)x=0
    
           - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
    
        /* initialize matrices */
    
        2/2✓ Branch 0 taken 10 times.
✓ Branch 1 taken 10 times.

      40
        for (i=0;i<NMAT;i++) {
    
        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.

      30
          PetscCall(MatCreate(PETSC_COMM_WORLD,&A[i]));
    
        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.

      30
          PetscCall(MatSetSizes(A[i],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.

      30
          PetscCall(MatSetFromOptions(A[i]));
    
        }
    
        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[0],&Istart,&Iend));
    
        /* A0 */
    
        2/2✓ Branch 0 taken 10 times.
✓ Branch 1 taken 10 times.

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

      1000
          PetscCall(MatSetValue(A[0],i,i,(i==n-1)?1.0*n:2.0*n,INSERT_VALUES));
    
        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.

      1000
          if (i>0) PetscCall(MatSetValue(A[0],i,i-1,-1.0*n,INSERT_VALUES));
    
        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.

      1000
          if (i<n-1) PetscCall(MatSetValue(A[0],i,i+1,-1.0*n,INSERT_VALUES));
    
        }
    
        /* A1 */
    
        2/2✓ Branch 0 taken 10 times.
✓ Branch 1 taken 10 times.

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

      1000
          PetscCall(MatSetValue(A[1],i,i,(i==n-1)?2.0/(6.0*n):4.0/(6.0*n),INSERT_VALUES));
    
        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.

      1000
          if (i>0) PetscCall(MatSetValue(A[1],i,i-1,1.0/(6.0*n),INSERT_VALUES));
    
        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.

      1000
          if (i<n-1) PetscCall(MatSetValue(A[1],i,i+1,1.0/(6.0*n),INSERT_VALUES));
    
        }
    
        /* A2 */
    
        5/10✓ Branch 0 taken 10 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 10 times.
✓ Branch 4 taken 10 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 2 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 2 times.
✗ Branch 9 not taken.

      10
        if (Istart<=n-1 && n-1<Iend) PetscCall(MatSetValue(A[2],n-1,n-1,kappa,INSERT_VALUES));
    
        /* assemble matrices */
    
        7/8✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 10 times.
✓ Branch 3 taken 8 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.
✓ Branch 6 taken 2 times.
✓ Branch 7 taken 2 times.

      40
        for (i=0;i<NMAT;i++) PetscCall(MatAssemblyBegin(A[i],MAT_FINAL_ASSEMBLY));
    
        7/8✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 10 times.
✓ Branch 3 taken 8 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.
✓ Branch 6 taken 2 times.
✓ Branch 7 taken 2 times.

      40
        for (i=0;i<NMAT;i++) PetscCall(MatAssemblyEnd(A[i],MAT_FINAL_ASSEMBLY));
    
        /* build matrices for the QEP */
    
        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(MatAXPY(A[2],1.0,A[0],DIFFERENT_NONZERO_PATTERN));
    
        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(MatAXPY(A[2],sigma,A[1],SAME_NONZERO_PATTERN));
    
        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(MatScale(A[2],-1.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(MatScale(A[0],sigma));
    
      10
        M = A[1];
    
      10
        A[1] = A[2];
    
      10
        A[2] = M;
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                      Create the eigensolver and solve the 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(PEPCreate(PETSC_COMM_WORLD,&pep));
    
        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(PEPSetOperators(pep,3,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(PEPSetFromOptions(pep));
    
        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(PEPSolve(pep));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                          Display solution and clean up
    
           - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
    
        /* show detailed info unless -terse option is given by user */
    
        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(PetscOptionsHasName(NULL,NULL,"-terse",&terse));
    
        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 (terse) PetscCall(PEPErrorView(pep,PEP_ERROR_BACKWARD,NULL));
    
        else {
    
      ✗
          PetscCall(PetscViewerPushFormat(PETSC_VIEWER_STDOUT_WORLD,PETSC_VIEWER_ASCII_INFO_DETAIL));
    
      ✗
          PetscCall(PEPConvergedReasonView(pep,PETSC_VIEWER_STDOUT_WORLD));
    
      ✗
          PetscCall(PEPErrorView(pep,PEP_ERROR_BACKWARD,PETSC_VIEWER_STDOUT_WORLD));
    
      ✗
          PetscCall(PetscViewerPopFormat(PETSC_VIEWER_STDOUT_WORLD));
    
        }
    
        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(PEPDestroy(&pep));
    
        7/8✓ Branch 0 taken 2 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 10 times.
✓ Branch 3 taken 8 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 2 times.
✓ Branch 6 taken 2 times.
✓ Branch 7 taken 2 times.

      40
        for (i=0;i<NMAT;i++) PetscCall(MatDestroy(&A[i]));
    
        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
    
            args: -pep_hyperbolic -pep_interval 4,900 -pep_type stoar -st_type sinvert -st_pc_type cholesky -terse
    
            requires: !single
    
      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			This example implements one of the problems found at
12			NLEVP: A Collection of Nonlinear Eigenvalue Problems,
13			The University of Manchester.
14			The details of the collection can be found at:
15			[1] T. Betcke et al., "NLEVP: A Collection of Nonlinear Eigenvalue
16			Problems", ACM Trans. Math. Software 39(2), Article 7, 2013.
17
18			The loaded_string problem is a rational eigenvalue problem for the
19			finite element model of a loaded vibrating string.
20			This example solves the loaded_string problem by first transforming
21			it to a quadratic eigenvalue problem.
22			*/
23
24			static char help[] = "Finite element model of a loaded vibrating string.\n\n"
25			"The command line options are:\n"
26			" -n <n>, dimension of the matrices.\n"
27			" -kappa <kappa>, stiffness of elastic spring.\n"
28			" -mass <m>, mass of the attached load.\n\n";
29
30			#include <slepcpep.h>
31
32			#define NMAT 3
33
34		10	int main(int argc,char **argv)
35			{
36		10	Mat A[3],M; /* problem matrices */
37		10	PEP pep; /* polynomial eigenproblem solver context */
38		10	PetscInt n=100,Istart,Iend,i;
39		10	PetscBool terse;
40		10	PetscReal kappa=1.0,m=1.0;
41		10	PetscScalar sigma;
42
43	1/2 ✓ Branch 0 taken 2 times. ✗ Branch 1 not taken.	10	PetscFunctionBeginUser;
44	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));
45
46	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));
47	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(PetscOptionsGetReal(NULL,NULL,"-kappa",&kappa,NULL));
48	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(PetscOptionsGetReal(NULL,NULL,"-mass",&m,NULL));
49		10	sigma = kappa/m;
50	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,"Loaded vibrating string (QEP), n=%" PetscInt_FMT " kappa=%g m=%g\n\n",n,(double)kappa,(double)m));
51
52			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
53			Compute the matrices that define the eigensystem, (k^2M+kC+K)x=0
54			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
55			/* initialize matrices */
56	2/2 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times.	40	for (i=0;i<NMAT;i++) {
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.	30	PetscCall(MatCreate(PETSC_COMM_WORLD,&A[i]));
58	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.	30	PetscCall(MatSetSizes(A[i],PETSC_DECIDE,PETSC_DECIDE,n,n));
59	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.	30	PetscCall(MatSetFromOptions(A[i]));
60			}
61	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[0],&Istart,&Iend));
62
63			/* A0 */
64	2/2 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times.	1010	for (i=Istart;i<Iend;i++) {
65	7/8 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✓ Branch 3 taken 8 times. ✓ Branch 4 taken 2 times. ✓ Branch 5 taken 2 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 2 times.	1000	PetscCall(MatSetValue(A[0],i,i,(i==n-1)?1.0n:2.0n,INSERT_VALUES));
66	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.	1000	if (i>0) PetscCall(MatSetValue(A[0],i,i-1,-1.0*n,INSERT_VALUES));
67	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.	1000	if (i<n-1) PetscCall(MatSetValue(A[0],i,i+1,-1.0*n,INSERT_VALUES));
68			}
69
70			/* A1 */
71	2/2 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times.	1010	for (i=Istart;i<Iend;i++) {
72	7/8 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 2 times. ✓ Branch 3 taken 8 times. ✓ Branch 4 taken 2 times. ✓ Branch 5 taken 2 times. ✗ Branch 6 not taken. ✓ Branch 7 taken 2 times.	1000	PetscCall(MatSetValue(A[1],i,i,(i==n-1)?2.0/(6.0n):4.0/(6.0n),INSERT_VALUES));
73	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.	1000	if (i>0) PetscCall(MatSetValue(A[1],i,i-1,1.0/(6.0*n),INSERT_VALUES));
74	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.	1000	if (i<n-1) PetscCall(MatSetValue(A[1],i,i+1,1.0/(6.0*n),INSERT_VALUES));
75			}
76
77			/* A2 */
78	5/10 ✓ Branch 0 taken 10 times. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✓ Branch 3 taken 10 times. ✓ Branch 4 taken 10 times. ✗ Branch 5 not taken. ✓ Branch 6 taken 2 times. ✗ Branch 7 not taken. ✓ Branch 8 taken 2 times. ✗ Branch 9 not taken.	10	if (Istart<=n-1 && n-1<Iend) PetscCall(MatSetValue(A[2],n-1,n-1,kappa,INSERT_VALUES));
79
80			/* assemble matrices */
81	7/8 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 10 times. ✓ Branch 3 taken 8 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times. ✓ Branch 6 taken 2 times. ✓ Branch 7 taken 2 times.	40	for (i=0;i<NMAT;i++) PetscCall(MatAssemblyBegin(A[i],MAT_FINAL_ASSEMBLY));
82	7/8 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 10 times. ✓ Branch 3 taken 8 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times. ✓ Branch 6 taken 2 times. ✓ Branch 7 taken 2 times.	40	for (i=0;i<NMAT;i++) PetscCall(MatAssemblyEnd(A[i],MAT_FINAL_ASSEMBLY));
83
84			/* build matrices for the QEP */
85	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(MatAXPY(A[2],1.0,A[0],DIFFERENT_NONZERO_PATTERN));
86	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(MatAXPY(A[2],sigma,A[1],SAME_NONZERO_PATTERN));
87	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(MatScale(A[2],-1.0));
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(MatScale(A[0],sigma));
89		10	M = A[1];
90		10	A[1] = A[2];
91		10	A[2] = M;
92
93			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
94			Create the eigensolver and solve the problem
95			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
96
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(PEPCreate(PETSC_COMM_WORLD,&pep));
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(PEPSetOperators(pep,3,A));
99	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(PEPSetFromOptions(pep));
100	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(PEPSolve(pep));
101
102			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
103			Display solution and clean up
104			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
105
106			/* show detailed info unless -terse option is given by user */
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(PetscOptionsHasName(NULL,NULL,"-terse",&terse));
108	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 (terse) PetscCall(PEPErrorView(pep,PEP_ERROR_BACKWARD,NULL));
109			else {
110		✗	PetscCall(PetscViewerPushFormat(PETSC_VIEWER_STDOUT_WORLD,PETSC_VIEWER_ASCII_INFO_DETAIL));
111		✗	PetscCall(PEPConvergedReasonView(pep,PETSC_VIEWER_STDOUT_WORLD));
112		✗	PetscCall(PEPErrorView(pep,PEP_ERROR_BACKWARD,PETSC_VIEWER_STDOUT_WORLD));
113		✗	PetscCall(PetscViewerPopFormat(PETSC_VIEWER_STDOUT_WORLD));
114			}
115	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(PEPDestroy(&pep));
116	7/8 ✓ Branch 0 taken 2 times. ✓ Branch 1 taken 8 times. ✓ Branch 2 taken 10 times. ✓ Branch 3 taken 8 times. ✗ Branch 4 not taken. ✓ Branch 5 taken 2 times. ✓ Branch 6 taken 2 times. ✓ Branch 7 taken 2 times.	40	for (i=0;i<NMAT;i++) PetscCall(MatDestroy(&A[i]));
117	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());
118			return 0;
119			}
120
121			/*TEST
122
123			test:
124			suffix: 1
125			args: -pep_hyperbolic -pep_interval 4,900 -pep_type stoar -st_type sinvert -st_pc_type cholesky -terse
126			requires: !single
127
128			TEST*/
129