def improveVerification(no, solIList, x=None, y=None): """ higher numerical verification """ if x is None or y is None: x, y = fdFunc(no) # number counting improved-solI countImprovedSolI = 0 # max-loop of improve soilI maxLoop = 100 if len(solIList) == 0: msg = 'Assigned equation has no-solution in the interval-list.' print msg print "============================ END ==============================" return None improvedSolIList = [] for i in range(maxLoop): countImprovedSolI += 1 if len(solIList) != 0: solI = solIList.pop(0) if evaluateImproveVerification(solI) == True: improvedSolIList.append(solI) else: # 区間反復法 solIList.append(kraw.krawczyk(no, solI, x, y)) else: break print "The number of improving verification: "+str(countImprovedSolI) print "============================ END ==============================" return improvedSolIList
def improveVerification(no, solI, x=None, y=None): """ higher numerical verification """ if x is None or y is None: x, y = fdFunc(no) # number counting improved-solI countImprovedSolI = 0 # max-loop of improve soilI maxLoop = 100 #if len(solIList) == 0: if len(solI) == 0: msg = 'Assigned equation has no-solution in the interval-list.' print "============================ END ==============================" return msg #improvedSolIList = [] #countImprovedSolI += 1 #solI = solIList.pop(0) # 区間反復法 #solIList.append(kraw.krawczyk(no, solI)) flag = None if evaluateImproveVerification(solI) == True: flag = True else: flag = False return (no, flag, [kraw.krawczyk(no, solI, x, y)])