SDEint.py
def oneStepper(self,simNum, reducedTime = None):
        """For solving SDEprob by using solver as a generator until the number
        of steps reaches n."""
        yield self.p.X0
        Xs = self.p.X0
        counter = 0
        if reducedTime is None:
            while counter < self.p.n:
                Xs = self.solver(self.p, Xs, self.p.t[counter],self.p.h,
                    self.p.dW[counter+1,:,simNum])
                counter += 1
                yield Xs
        else:
            new_n = len(reducedTime)-1
            while counter < new_n:
                Xs = self.solver(self.p, Xs, reducedTime[counter],self.p.h,
                    self.p.dW[counter+1,:,simNum])
                counter += 1
                yield Xs
For solving SDEprob by using solver as a generator until the number
        of steps reaches n.
For solving SDEprob by using solver as a generator until the number
of steps reaches n.
For solving SDEprob by using solver as a generator until the number of steps reaches n .
def oneStepper(self,simNum, reducedTime = None):
        yield self.p.X0
        Xs = self.p.X0
        counter = 0
        if reducedTime is None:
            while counter < self.p.n:
                Xs = self.solver(self.p, Xs, self.p.t[counter],self.p.h,
                    self.p.dW[counter+1,:,simNum])
                counter += 1
                yield Xs
        else:
            new_n = len(reducedTime)-1
            while counter < new_n:
                Xs = self.solver(self.p, Xs, reducedTime[counter],self.p.h,
                    self.p.dW[counter+1,:,simNum])
                counter += 1
                yield Xs
def oneStepper ( self , simNum , reducedTime = None ) : yield self . p . X0 Xs = self . p . X0 counter = 0 if reducedTime is None : while counter < self . p . n : Xs = self . solver ( self . p , Xs , self . p . t [ counter ] , self . p . h , self . p . dW [ counter + 1 , : , simNum ] ) counter += 1 yield Xs else : new_n = len ( reducedTime ) - 1 while counter < new_n : Xs = self . solver ( self . p , Xs , reducedTime [ counter ] , self . p . h , self . p . dW [ counter + 1 , : , simNum ] ) counter += 1 yield Xs
For solving SDEprob by using solver as a generator until the number
of steps reaches n.
For solving SDEprob by using solver as a generator until the number of steps reaches n .
"""For solving SDEprob by using solver as a generator until the number
        of steps reaches n."""
self
simNum
reducedTime