-
Notifications
You must be signed in to change notification settings - Fork 6
Add Blocked timestepping support to PyRevolve #55
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: master
Are you sure you want to change the base?
Conversation
|
Can you please clean up the commit history on this a bit? e.g. I see some commits undoing things done by previous commits. |
90c0b7f to
58fd043
Compare
Done. |
|
This is showing a merge conflict after merging the previous PR. Could you please do a rebase on current master? |
58fd043 to
6844553
Compare
Done. |
|
Help me to remember... there is something missing @navjotk? |
| assert(t_start <= t_end) | ||
| if self.direction == 1: | ||
| self.u[:] = self.u[:] + self.direction * abs(t_start - t_end) | ||
| for t in range(t_start, t_end): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What is happening here?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
We added a new dimension to the u array. This dimension is responsible to save the block_size time steps. That before are not saved because isn't necessary. This loop is responsible to write each time step in the right position.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There is a misunderstanding of how the IncOperator works - please fix that.
| if self.direction == 1: | ||
| self.u[:] = self.u[:] + self.direction * abs(t_start - t_end) | ||
| for t in range(t_start, t_end): | ||
| idx = t % np.shape(self.u)[0] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
There must be a better way of getting block_size
| self.u[:] = self.u[:] + self.direction * abs(t_start - t_end) | ||
| for t in range(t_start, t_end): | ||
| idx = t % np.shape(self.u)[0] | ||
| past_idx = (t-1) % np.shape(self.u)[0] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You're assuming that the operator moves one time step at a time, when this has is supposed to go from t_start to t_end.
| for t in range(t_start, t_end): | ||
| idx = t % np.shape(self.u)[0] | ||
| past_idx = (t-1) % np.shape(self.u)[0] | ||
| self.u[idx][:] = self.u[past_idx][:] + self.direction * 1 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Again, assuming one time step at a time. Not true.
| self.u[idx][:] = self.u[past_idx][:] + self.direction * 1 | ||
| else: | ||
| self.v[:] = (self.u[:]*(-1) + 1) | ||
| idx = (t_start) % np.shape(self.u)[0] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You have to fill in all elements from t_start to t_end.
|
@speglich any progress here? |
6844553 to
573ae8e
Compare
Closes #54