Mercurial > octave-nkf
comparison liboctave/UMFPACK/UMFPACK/Demo/umf4hb.out @ 5164:57077d0ddc8e
[project @ 2005-02-25 19:55:24 by jwe]
author | jwe |
---|---|
date | Fri, 25 Feb 2005 19:55:28 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
5163:9f3299378193 | 5164:57077d0ddc8e |
---|---|
1 Matrix key: WEST0067 | |
2 | |
3 UMFPACK V4.4 (Jan. 28, 2005), Control: | |
4 | |
5 Matrix entry defined as: double | |
6 Int (generic integer) defined as: int | |
7 | |
8 0: print level: 2 | |
9 1: dense row parameter: 0.2 | |
10 "dense" rows have > max (16, (0.2)*16*sqrt(n_col) entries) | |
11 2: dense column parameter: 0.2 | |
12 "dense" columns have > max (16, (0.2)*16*sqrt(n_row) entries) | |
13 3: pivot tolerance: 0.1 | |
14 4: block size for dense matrix kernels: 32 | |
15 5: strategy: 0 (auto) | |
16 6: initial allocation ratio: 0.7 | |
17 7: max iterative refinement steps: 2 | |
18 12: 2-by-2 pivot tolerance: 0.01 | |
19 13: Q fixed during numerical factorization: 0 (auto) | |
20 14: AMD dense row/col parameter: 10 | |
21 "dense" rows/columns have > max (16, (10)*sqrt(n)) entries | |
22 Only used if the AMD ordering is used. | |
23 15: diagonal pivot tolerance: 0.001 | |
24 Only used if diagonal pivoting is attempted. | |
25 16: scaling: 1 (divide each row by sum of abs. values in each row) | |
26 17: frontal matrix allocation ratio: 0.5 | |
27 18: drop tolerance: 0 | |
28 19: AMD and COLAMD aggressive absorption: 1 (yes) | |
29 | |
30 The following options can only be changed at compile-time: | |
31 8: BLAS library used: none. UMFPACK will be slow. | |
32 9: compiled for ANSI C (uses malloc, free, realloc, and printf) | |
33 10: CPU timer is POSIX times ( ) routine. | |
34 11: compiled for normal operation (debugging disabled) | |
35 computer/operating system: Linux | |
36 size of int: 4 long: 4 Int: 4 pointer: 4 double: 8 Entry: 8 (in bytes) | |
37 | |
38 symbolic analysis: | |
39 status: 0. | |
40 time: 0.00E+00 (sec) | |
41 estimates (upper bound) for numeric LU: | |
42 size of LU: 0.02 (MB) | |
43 memory needed: 0.06 (MB) | |
44 flop count: 0.14E+05 | |
45 nnz (L): 542. | |
46 nnz (U): 902. | |
47 numeric factorization: | |
48 status: 0. | |
49 time: 0.00E+00 | |
50 actual numeric LU statistics: | |
51 size of LU: 0.01 (MB) | |
52 memory needed: 0.04 (MB) | |
53 flop count: 0.26E+04 | |
54 nnz (L): 329. | |
55 nnz (U): 340. | |
56 | |
57 UMFPACK V4.4 (Jan. 28, 2005), Info: | |
58 matrix entry defined as: double | |
59 Int (generic integer) defined as: int | |
60 BLAS library used: none. UMFPACK will be slow. | |
61 MATLAB: no. | |
62 CPU timer: POSIX times ( ) routine. | |
63 number of rows in matrix A: 67 | |
64 number of columns in matrix A: 67 | |
65 entries in matrix A: 294 | |
66 memory usage reported in: 8-byte Units | |
67 size of int: 4 bytes | |
68 size of long: 4 bytes | |
69 size of pointer: 4 bytes | |
70 size of numerical entry: 8 bytes | |
71 | |
72 strategy used: unsymmetric | |
73 ordering used: colamd on A | |
74 modify Q during factorization: yes | |
75 prefer diagonal pivoting: no | |
76 pivots with zero Markowitz cost: 1 | |
77 submatrix S after removing zero-cost pivots: | |
78 number of "dense" rows: 0 | |
79 number of "dense" columns: 0 | |
80 number of empty rows: 0 | |
81 number of empty columns 0 | |
82 submatrix S not square or diagonal not preserved | |
83 symbolic factorization defragmentations: 1 | |
84 symbolic memory usage (Units): 1632 | |
85 symbolic memory usage (MBytes): 0.0 | |
86 Symbolic size (Units): 245 | |
87 Symbolic size (MBytes): 0 | |
88 symbolic factorization CPU time (sec): 0.00 | |
89 symbolic factorization wallclock time(sec): 0.00 | |
90 | |
91 matrix scaled: yes (divided each row by sum of abs values in each row) | |
92 minimum sum (abs (rows of A)): 1.00000e+00 | |
93 maximum sum (abs (rows of A)): 6.59006e+00 | |
94 | |
95 symbolic/numeric factorization: upper bound actual % | |
96 variable-sized part of Numeric object: | |
97 initial size (Units) 1643 1574 96% | |
98 peak size (Units) 6115 3581 59% | |
99 final size (Units) 1628 685 42% | |
100 Numeric final size (Units) 2101 1125 54% | |
101 Numeric final size (MBytes) 0.0 0.0 54% | |
102 peak memory usage (Units) 7462 4928 66% | |
103 peak memory usage (MBytes) 0.1 0.0 66% | |
104 numeric factorization flops 1.41920e+04 2.58700e+03 18% | |
105 nz in L (incl diagonal) 542 329 61% | |
106 nz in U (incl diagonal) 902 340 38% | |
107 nz in L+U (incl diagonal) 1377 602 44% | |
108 largest front (# entries) 483 80 17% | |
109 largest # rows in front 21 10 48% | |
110 largest # columns in front 23 11 48% | |
111 | |
112 initial allocation ratio used: 0.7 | |
113 # of forced updates due to frontal growth: 0 | |
114 nz in L (incl diagonal), if none dropped 329 | |
115 nz in U (incl diagonal), if none dropped 340 | |
116 number of small entries dropped 0 | |
117 nonzeros on diagonal of U: 67 | |
118 min abs. value on diagonal of U: 2.74e-02 | |
119 max abs. value on diagonal of U: 2.28e+00 | |
120 estimate of reciprocal of condition number: 1.20e-02 | |
121 indices in compressed pattern: 256 | |
122 numerical values stored in Numeric object: 605 | |
123 numeric factorization defragmentations: 1 | |
124 numeric factorization reallocations: 1 | |
125 costly numeric factorization reallocations: 0 | |
126 numeric factorization CPU time (sec): 0.00 | |
127 numeric factorization wallclock time (sec): 0.00 | |
128 symbolic + numeric CPU time (sec): 0.00 | |
129 symbolic + numeric wall clock time (sec): 0.00 | |
130 | |
131 solve flops: 1.20400e+03 | |
132 iterative refinement steps taken: 0 | |
133 iterative refinement steps attempted: 0 | |
134 solve CPU time (sec): 0.00 | |
135 solve wall clock time (sec): 0.00 | |
136 | |
137 total symbolic + numeric + solve flops: 3.79100e+03 | |
138 total symbolic + numeric + solve CPU time: 0.00 | |
139 total symbolic+numeric+solve wall clock time: 0.00 | |
140 | |
141 norm (A*x-b): 2.22044605E-15 | |
142 norm (A*x-b): 1.05076538E-14 | |
143 norm (A*x-b): 1.05076538E-14 |