def get_problem(self, inp, tol, base=0): """Reads a problem from a file. @param fileName: file name @param tol: drop tolerance @param base: file index base @return: problem """ prob = Problem() T = cs.cs_load (inp, base) # load triplet matrix T from a file prob.A = A = cs.cs_compress (T) # A = compressed-column form of T if not cs.cs_dupl (A): return None # sum up duplicates prob.sym = sym = self.is_sym (A) # determine if A is symmetric m = A.m ; n = A.n mn = max (m, n) nz1 = A.p [n] if tol > 0: cs.cs_dropzeros (A) # drop zero entries nz2 = A.p [n] if tol > 0: cs.cs_droptol (A, tol) # drop tiny entries (just to test) prob.C = C = self.make_sym(A) if sym != 0 else A # C = A + triu(A,1)', or C=A if C == None: return None print ("\n--- Matrix: %d-by-%d, nnz: %d (sym: %d: nnz %d), norm: %8.2e\n" % (m, n, A.p [n], sym, C.p [n] if sym != 0 else 0, cs.cs_norm (C))) prob.dropped_zeros = nz1 - nz2 if nz1 != nz2: print "zero entries dropped: %d\n" % nz1 - nz2 prob.dropped_tiny = nz2 - A.p [n] if nz2 != A.p [n]: print "tiny entries dropped: %d\n" % nz2 - A.p [n] prob.b = [0.0]*mn prob.x = [0.0]*mn prob.resid = [0.0]*mn return prob
def get_problem(self, inp, tol, base=0): """Reads a problem from a file. @param fileName: file name @param tol: drop tolerance @param base: file index base @return: problem """ prob = Problem() T = cs.cs_load(inp, base) # load triplet matrix T from a file prob.A = A = cs.cs_compress(T) # A = compressed-column form of T if not cs.cs_dupl(A): return None # sum up duplicates prob.sym = sym = self.is_sym(A) # determine if A is symmetric m = A.m n = A.n mn = max(m, n) nz1 = A.p[n] if tol > 0: cs.cs_dropzeros(A) # drop zero entries nz2 = A.p[n] if tol > 0: cs.cs_droptol(A, tol) # drop tiny entries (just to test) prob.C = C = self.make_sym( A) if sym != 0 else A # C = A + triu(A,1)', or C=A if C == None: return None print( "\n--- Matrix: %d-by-%d, nnz: %d (sym: %d: nnz %d), norm: %8.2e\n" % (m, n, A.p[n], sym, C.p[n] if sym != 0 else 0, cs.cs_norm(C))) prob.dropped_zeros = nz1 - nz2 if nz1 != nz2: print "zero entries dropped: %d\n" % nz1 - nz2 prob.dropped_tiny = nz2 - A.p[n] if nz2 != A.p[n]: print "tiny entries dropped: %d\n" % nz2 - A.p[n] prob.b = [0.0] * mn prob.x = [0.0] * mn prob.resid = [0.0] * mn return prob
def load(self, inp): T = cs.cs_load (inp) # load triplet matrix T from file # print "T:" # cs.cs_print (T, False) # print T return T
def load(self, inp): T = cs.cs_load(inp) # load triplet matrix T from file # print "T:" # cs.cs_print (T, False) # print T return T