|   __text__TEXTzx__data__DATAz__cstring__TEXT9__literal8__TEXT (X__picsymbolstub2__TEXT h__la_sym_ptr2__DATA __textcoal_nt__TEXT  @\ PUSt}u]EEEPEEXEE`E؋EHEM f.s(MЍ f.sEXEE ]E]ȍt$( E f.zt$ dE f.zt$ 9E f.zt$ $ M f.sED$$i E f.sED$4$/ E f.sED$t$ E  f.sE D$$ E( f.sE(D$$ E0 f.sE0D$4$G E8 f.sE8D$t$ E@ f.sE@D$$$MЍ f.sED$$Mȍ f.sED$4 $eM荃 f.sED$t $5M f.sED$ $M؍ f.sED$ $Eh f.sEhD$4 $M f.s M荃 f.sM f.sM؍ f.sM荃 f(YM؍ YXD$$EXXED$M荃 f(YM YXD$EXXED$ Ef(XMEXXD$t $tt[] amd: approximate minimum degree ordering, results: status: OK out of memory invalid matrix unknown n, dimension of A: %.20g nz, number of nonzeros in A: %.20g symmetry of A: %.4f number of nonzeros on diagonal: %.20g nonzeros in pattern of A+A' (excl. diagonal): %.20g # dense rows/columns of A+A': %.20g memory used, in bytes: %.20g # of memory compactions: %.20g The following approximate statistics are for a subsequent factorization of A(P,P) + A(P,P)'. They are slight upper bounds if there are no dense rows/columns in A+A', and become looser if dense rows/columns exist. nonzeros in L (excluding diagonal): %.20g nonzeros in L (including diagonal): %.20g # divide operations for LDL' or LU: %.20g # multiply-subtract operations for LDL': %.20g # multiply-subtract operations for LU: %.20g max nz. in any column of L (incl. diagonal): %.20g chol flop count for real A, sqrt counted as 1 flop: %.20g LDL' flop count for real A: %.20g LDL' flop count for complex A: %.20g LU flop count for real A (with no pivoting): %.20g LU flop count for complex A (with no pivoting): %.20g "@ @⍀P $Ë$ph       n T IA@        w@ Z OG *       @ s c[ 9 )!    @  {s V KC ;3     i      #  T;_amd_info___i686.get_pc_thunk.bx___i686.get_pc_thunk.axdyld_stub_binding_helper_printf