1UMFPACK V5.6.0 (Jun 1, 2012), Control: 2 Matrix entry defined as: double 3 Int (generic integer) defined as: int 4 5 0: print level: 2 6 1: dense row parameter: 0.2 7 "dense" rows have > max (16, (0.2)*16*sqrt(n_col) entries) 8 2: dense column parameter: 0.2 9 "dense" columns have > max (16, (0.2)*16*sqrt(n_row) entries) 10 3: pivot tolerance: 0.1 11 4: block size for dense matrix kernels: 32 12 5: strategy: 0 (auto) 13 10: ordering: 1 AMD/COLAMD 14 11: singleton filter: enabled 15 6: initial allocation ratio: 0.7 16 7: max iterative refinement steps: 2 17 13: Q fixed during numerical factorization: 0 (auto) 18 14: AMD dense row/col parameter: 10 19 "dense" rows/columns have > max (16, (10)*sqrt(n)) entries 20 Only used if the AMD ordering is used. 21 15: diagonal pivot tolerance: 0.001 22 Only used if diagonal pivoting is attempted. 23 16: scaling: 1 (divide each row by sum of abs. values in each row) 24 17: frontal matrix allocation ratio: 0.5 25 18: drop tolerance: 0 26 19: AMD and COLAMD aggressive absorption: 1 (yes) 27 28 The following options can only be changed at compile-time: 29 8: BLAS library used: Fortran BLAS. size of BLAS integer: 4 30 compiled for ANSI C 31 POSIX C clock_getttime. 32 computer/operating system: Linux 33 size of int: 4 SuiteSparse_long: 8 Int: 4 pointer: 8 double: 8 Entry: 8 (in bytes) 34 35UMFPACK V5.6.0 (Jun 1, 2012), Info: 36 matrix entry defined as: double 37 Int (generic integer) defined as: int 38 BLAS library used: Fortran BLAS. size of BLAS integer: 4 39 MATLAB: no. 40 CPU timer: POSIX C clock_getttime ( ) routine. 41 number of rows in matrix A: 67 42 number of columns in matrix A: 67 43 entries in matrix A: 294 44 memory usage reported in: 8-byte Units 45 size of int: 4 bytes 46 size of SuiteSparse_long: 8 bytes 47 size of pointer: 8 bytes 48 size of numerical entry: 8 bytes 49 50 strategy used: unsymmetric 51 ordering used: colamd on A 52 modify Q during factorization: yes 53 prefer diagonal pivoting: no 54 pivots with zero Markowitz cost: 1 55 submatrix S after removing zero-cost pivots: 56 number of "dense" rows: 0 57 number of "dense" columns: 0 58 number of empty rows: 0 59 number of empty columns 0 60 submatrix S not square or diagonal not preserved 61 symbolic factorization defragmentations: 1 62 symbolic memory usage (Units): 1639 63 symbolic memory usage (MBytes): 0.0 64 Symbolic size (Units): 252 65 Symbolic size (MBytes): 0 66 symbolic factorization wallclock time(sec): 0.00 67 68 matrix scaled: yes (divided each row by sum of abs values in each row) 69 minimum sum (abs (rows of A)): 1.00000e+00 70 maximum sum (abs (rows of A)): 6.59006e+00 71 72 symbolic/numeric factorization: upper bound actual % 73 variable-sized part of Numeric object: 74 initial size (Units) 1711 1577 92% 75 peak size (Units) 6115 3581 59% 76 final size (Units) 1628 681 42% 77 Numeric final size (Units) 2108 1128 54% 78 Numeric final size (MBytes) 0.0 0.0 54% 79 peak memory usage (Units) 7476 4942 66% 80 peak memory usage (MBytes) 0.1 0.0 66% 81 numeric factorization flops 1.41920e+04 2.51700e+03 18% 82 nz in L (incl diagonal) 542 325 60% 83 nz in U (incl diagonal) 902 339 38% 84 nz in L+U (incl diagonal) 1377 597 43% 85 largest front (# entries) 483 80 17% 86 largest # rows in front 21 10 48% 87 largest # columns in front 23 11 48% 88 89 initial allocation ratio used: 0.7 90 # of forced updates due to frontal growth: 0 91 nz in L (incl diagonal), if none dropped 325 92 nz in U (incl diagonal), if none dropped 339 93 number of small entries dropped 0 94 nonzeros on diagonal of U: 67 95 min abs. value on diagonal of U: 2.74e-02 96 max abs. value on diagonal of U: 2.28e+00 97 estimate of reciprocal of condition number: 1.20e-02 98 indices in compressed pattern: 259 99 numerical values stored in Numeric object: 600 100 numeric factorization defragmentations: 1 101 numeric factorization reallocations: 1 102 costly numeric factorization reallocations: 0 103 numeric factorization wallclock time (sec): 0.00 104 105 solve flops: 1.19400e+03 106 iterative refinement steps taken: 0 107 iterative refinement steps attempted: 0 108 solve wall clock time (sec): 0.00 109 110 total symbolic + numeric + solve flops: 3.71100e+03 111 112 Matrix key: WEST0067 113symbolic analysis: 114 status: 0. 115 time: 0.17E-03 (sec) 116 estimates (upper bound) for numeric LU: 117 size of LU: 0.02 (MB) 118 memory needed: 0.06 (MB) 119 flop count: 0.14E+05 120 nnz (L): 542. 121 nnz (U): 902. 122numeric factorization: 123 status: 0. 124 time: 0.46E-03 125 actual numeric LU statistics: 126 size of LU: 0.01 (MB) 127 memory needed: 0.04 (MB) 128 flop count: 0.25E+04 129 nnz (L): 325. 130 nnz (U): 339. 131 norm (A*x-b): 2.44249065417534439E-015 132 norm (A*x-b): 2.13162820728030056E-014 133 norm (A*x-b): 2.13162820728030056E-014 134