X__text__TEXT d__data__DATA {__cstring__TEXT S |__literal8__TEXTX__const__DATAP,__picsymbolstub2__TEXT`<D$__la_sym_ptr2__DATAyUt$__textcoal_nt__TEXT}Y @$$p P|$USd}t1EUf.ztE,EEEEE}8 D$ $ $$ED$D$=$}t>EUf.ztEݝxݝxݝx݅x]}t>EUf.ztEݝpݝpݝp݅p]ED$D$q$ED$$ED$D$$ED$Q$}t>EUf.ztEݝhݝhݝh݅h]Mf.wMf.w2Mf.w Eݝ`ݝ`ݝ`݅`]ED$D$$}t@E U f.ztE ,\Dž\ Dž\ \EEXX} DžXXEED$D$$}t@E(U(f.ztE(,TDžT DžTTE}x}EED$D$$p}u1$\A}u$F+}uQ$0E^$}t>E0U0f.ztE0ݝH ݝH ݝH݅H]MЍf.s#ED$D$q$\MЍAf(fW,EEDD} DžDDEED$D$$(}t@E8U8f.ztE8,@Dž@ Dž@@EE<<y Dž<E`U`f.ztE`ݝ0ݝ0ݝ0݅0]Mf.wMf.w2Mf.w Eݝ(ݝ(ݝ(݅(]ED$D$ 1$}t>EhUhf.ztEhݝ ݝ ݝ ݅ ]ED$D$ q$ Mf.w$5Mf.w$$}t>EpUpf.ztEpݝݝݝ݅]ED$D$$HMf.w$#ED$1$$}t>ExUxf.ztExݝ!ݝ!ݝ݅]M؍f.wM؍f.w2M؍f.w Eݝݝݝ݅]ED$D$$ }t@E耋Uf.ztE,Dž DžE}t }tEED$D$-$}uC$l*}uQ$V}u$@$2}tEEUˆf.ztEݝ)ݝ)ݝ݅]Mȍf.wݝ Eݝ݅]Mȍf.s#ED$D$$_\MȍAf(fW,EE} DžEED$D$$}tEEUf.ztEݝݝݝ݅]ED$D$K$~ }tEEU˜f.ztEݝݝݝ݅]ED$D$q$ Mf.uz$ $ $ D$$ 0$ D$ Q$| D$ $f D$ $P .D$Q$8 1D$,1D$$9D$9D$9D$ 9D$$ d[]UMFPACK V4.4 (Jan. 28, 2005) %s, Control: Matrix entry defined as: double Int (generic integer) defined as: long %ld: print level: %ld %ld: dense row parameter: %g "dense" rows have > max (16, (%g)*16*sqrt(n_col) entries) %ld: dense column parameter: %g "dense" columns have > max (16, (%g)*16*sqrt(n_row) entries) %ld: pivot tolerance: %g %ld: block size for dense matrix kernels: %ld %ld: strategy: %ld (symmetric) Q = AMD (A+A'), Q not refined during numerical factorization, and diagonal pivoting (P=Q') attempted. (unsymmetric) Q = COLAMD (A), Q refined during numerical factorization, and no attempt at diagonal pivoting. (symmetric, with 2-by-2 block pivoting) P2 = row permutation that tries to place large entries on the diagonal. Q = AMD (P2*A+(P2*A)'), Q not refined during numerical factorization, attempt to select pivots from the diagonal of P2*A. (auto) %ld: initial allocation ratio: %g %ld: initial allocation (in Units): %ld %ld: max iterative refinement steps: %ld %ld: 2-by-2 pivot tolerance: %g %ld: Q fixed during numerical factorization: %g (yes) (no) (auto) %ld: AMD dense row/col parameter: %g no "dense" rows/columns "dense" rows/columns have > max (16, (%g)*sqrt(n)) entries Only used if the AMD ordering is used. %ld: diagonal pivot tolerance: %g Only used if diagonal pivoting is attempted. %ld: scaling: %ld (no) (divide each row by sum of abs. values in each row) (divide each row by max. abs. value in each row) %ld: frontal matrix allocation ratio: %g %ld: initial frontal matrix size (# of Entry's): %ld %ld: drop tolerance: %g %ld: AMD and COLAMD aggressive absorption: %g (yes) (no) The following options can only be changed at compile-time: %ld: BLAS library used: none. UMFPACK will be slow. %ld: compiled for ANSI C (uses malloc, free, realloc, and printf) %ld: CPU timer is POSIX times ( ) routine. %ld: compiled for normal operation (debugging disabled) unknown computer/operating system: %s size of int: %g long: %g Int: %g pointer: %g double: %g Entry: %g (in bytes) ???ffffff?{Gz?$@MbP?? @@⍀Pm$Ë$  z Hj HZ HJ H: @* @$  ` =      `  ?  !      l a Y /    Z  [ S  P     { 8k 8* "     `  R  <S K !  00bZTL@91  ((naYG<4 @~aL5   4,P}C;m,$`@aYgR;` zP@L x rj `    yeye 4}eL_umfpack_dl_report_control___i686.get_pc_thunk.bx___i686.get_pc_thunk.axdyld_stub_binding_helper_printf