GCC Code Coverage Report

Directory:	./
File:	src/nep/tests/test9.c
Date:	2025-11-19 04:19:03

	Exec	Total	Coverage
Lines:	61	65	93.8%
Functions:	1	1	100.0%
Branches:	202	314	64.3%

  
      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.
    
      */
    
      static char help[] = "Test the NLEIGS solver with FNCOMBINE.\n\n"
    
        "This is based on loaded_string from the NLEVP collection.\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 <slepcnep.h>
    
      #define NMAT 3
    
      10
      int main(int argc,char **argv)
    
      {
    
      10
        Mat            A[NMAT];         /* problem matrices */
    
      10
        FN             f[NMAT],g;       /* functions to define the nonlinear operator */
    
      10
        NEP            nep;             /* nonlinear eigensolver context */
    
      10
        PetscInt       n=100,Istart,Iend,i;
    
      10
        PetscReal      kappa=1.0,m=1.0;
    
      10
        PetscScalar    sigma,numer[2],denom[2];
    
      10
        PetscBool      terse;
    
        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, n=%" PetscInt_FMT " kappa=%g m=%g\n\n",n,(double)kappa,(double)m));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                             Build the problem matrices
    
           - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
    
        /* 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));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                             Create the problem functions
    
           - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
    
        /* f1=1 */
    
        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(FNCreate(PETSC_COMM_WORLD,&f[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(FNSetType(f[0],FNRATIONAL));
    
      10
        numer[0] = 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(FNRationalSetNumerator(f[0],1,numer));
    
        /* f2=-lambda */
    
        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(FNCreate(PETSC_COMM_WORLD,&f[1]));
    
        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(FNSetType(f[1],FNRATIONAL));
    
      10
        numer[0] = -1.0; numer[1] = 0.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(FNRationalSetNumerator(f[1],2,numer));
    
        /* f3=lambda/(lambda-sigma)=1+sigma/(lambda-sigma) */
    
        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(FNCreate(PETSC_COMM_WORLD,&g));
    
        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(FNSetType(g,FNRATIONAL));
    
      10
        numer[0] = sigma;
    
      10
        denom[0] = 1.0; denom[1] = -sigma;
    
        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(FNRationalSetNumerator(g,1,numer));
    
        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(FNRationalSetDenominator(g,2,denom));
    
        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(FNCreate(PETSC_COMM_WORLD,&f[2]));
    
        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(FNSetType(f[2],FNCOMBINE));
    
        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(FNCombineSetChildren(f[2],FN_COMBINE_ADD,f[0],g));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                      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(NEPCreate(PETSC_COMM_WORLD,&nep));
    
        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(NEPSetSplitOperator(nep,3,A,f,SUBSET_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(NEPSetProblemType(nep,NEP_RATIONAL));
    
        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(NEPSetFromOptions(nep));
    
        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(NEPSolve(nep));
    
        /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    
                          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(NEPErrorView(nep,NEP_ERROR_RELATIVE,NULL));
    
        else {
    
      ✗
          PetscCall(PetscViewerPushFormat(PETSC_VIEWER_STDOUT_WORLD,PETSC_VIEWER_ASCII_INFO_DETAIL));
    
      ✗
          PetscCall(NEPConvergedReasonView(nep,PETSC_VIEWER_STDOUT_WORLD));
    
      ✗
          PetscCall(NEPErrorView(nep,NEP_ERROR_RELATIVE,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(NEPDestroy(&nep));
    
        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(MatDestroy(&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(FNDestroy(&f[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(FNDestroy(&g));
    
        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: -nep_type nleigs -rg_type interval -rg_interval_endpoints 4,700,-.1,.1 -nep_nev 8 -nep_target 5 -terse
    
            filter: sed -e "s/[+-]0\.0*i//g"
    
            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			*/
21
22			static char help[] = "Test the NLEIGS solver with FNCOMBINE.\n\n"
23			"This is based on loaded_string from the NLEVP collection.\n"
24			"The command line options are:\n"
25			" -n <n>, dimension of the matrices.\n"
26			" -kappa <kappa>, stiffness of elastic spring.\n"
27			" -mass <m>, mass of the attached load.\n\n";
28
29			#include <slepcnep.h>
30
31			#define NMAT 3
32
33		10	int main(int argc,char **argv)
34			{
35		10	Mat A[NMAT]; /* problem matrices */
36		10	FN f[NMAT],g; /* functions to define the nonlinear operator */
37		10	NEP nep; /* nonlinear eigensolver context */
38		10	PetscInt n=100,Istart,Iend,i;
39		10	PetscReal kappa=1.0,m=1.0;
40		10	PetscScalar sigma,numer[2],denom[2];
41		10	PetscBool terse;
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, n=%" PetscInt_FMT " kappa=%g m=%g\n\n",n,(double)kappa,(double)m));
51
52			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
53			Build the problem matrices
54			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
55
56			/* initialize matrices */
57	2/2 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times.	40	for (i=0;i<NMAT;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(MatCreate(PETSC_COMM_WORLD,&A[i]));
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(MatSetSizes(A[i],PETSC_DECIDE,PETSC_DECIDE,n,n));
60	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]));
61			}
62	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));
63
64			/* A0 */
65	2/2 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times.	1010	for (i=Istart;i<Iend;i++) {
66	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));
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>0) PetscCall(MatSetValue(A[0],i,i-1,-1.0*n,INSERT_VALUES));
68	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));
69			}
70
71			/* A1 */
72	2/2 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times.	1010	for (i=Istart;i<Iend;i++) {
73	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));
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>0) PetscCall(MatSetValue(A[1],i,i-1,1.0/(6.0*n),INSERT_VALUES));
75	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));
76			}
77
78			/* A2 */
79	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));
80
81			/* assemble matrices */
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(MatAssemblyBegin(A[i],MAT_FINAL_ASSEMBLY));
83	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));
84
85			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
86			Create the problem functions
87			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
88
89			/* f1=1 */
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(FNCreate(PETSC_COMM_WORLD,&f[0]));
91	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(FNSetType(f[0],FNRATIONAL));
92		10	numer[0] = 1.0;
93	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(FNRationalSetNumerator(f[0],1,numer));
94
95			/* f2=-lambda */
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(FNCreate(PETSC_COMM_WORLD,&f[1]));
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(FNSetType(f[1],FNRATIONAL));
98		10	numer[0] = -1.0; numer[1] = 0.0;
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(FNRationalSetNumerator(f[1],2,numer));
100
101			/* f3=lambda/(lambda-sigma)=1+sigma/(lambda-sigma) */
102	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(FNCreate(PETSC_COMM_WORLD,&g));
103	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(FNSetType(g,FNRATIONAL));
104		10	numer[0] = sigma;
105		10	denom[0] = 1.0; denom[1] = -sigma;
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(FNRationalSetNumerator(g,1,numer));
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(FNRationalSetDenominator(g,2,denom));
108	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(FNCreate(PETSC_COMM_WORLD,&f[2]));
109	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(FNSetType(f[2],FNCOMBINE));
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(FNCombineSetChildren(f[2],FN_COMBINE_ADD,f[0],g));
111
112			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
113			Create the eigensolver and solve the problem
114			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
115
116	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(NEPCreate(PETSC_COMM_WORLD,&nep));
117	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(NEPSetSplitOperator(nep,3,A,f,SUBSET_NONZERO_PATTERN));
118	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(NEPSetProblemType(nep,NEP_RATIONAL));
119	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(NEPSetFromOptions(nep));
120	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(NEPSolve(nep));
121
122			/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
123			Display solution and clean up
124			- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
125
126			/* show detailed info unless -terse option is given by user */
127	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));
128	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(NEPErrorView(nep,NEP_ERROR_RELATIVE,NULL));
129			else {
130		✗	PetscCall(PetscViewerPushFormat(PETSC_VIEWER_STDOUT_WORLD,PETSC_VIEWER_ASCII_INFO_DETAIL));
131		✗	PetscCall(NEPConvergedReasonView(nep,PETSC_VIEWER_STDOUT_WORLD));
132		✗	PetscCall(NEPErrorView(nep,NEP_ERROR_RELATIVE,PETSC_VIEWER_STDOUT_WORLD));
133		✗	PetscCall(PetscViewerPopFormat(PETSC_VIEWER_STDOUT_WORLD));
134			}
135	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(NEPDestroy(&nep));
136	2/2 ✓ Branch 0 taken 10 times. ✓ Branch 1 taken 10 times.	40	for (i=0;i<NMAT;i++) {
137	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(MatDestroy(&A[i]));
138	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(FNDestroy(&f[i]));
139			}
140	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(FNDestroy(&g));
141	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());
142			return 0;
143			}
144
145			/*TEST
146
147			test:
148			suffix: 1
149			args: -nep_type nleigs -rg_type interval -rg_interval_endpoints 4,700,-.1,.1 -nep_nev 8 -nep_target 5 -terse
150			filter: sed -e "s/[+-]0\.0*i//g"
151			requires: !single
152
153			TEST*/
154