-
Notifications
You must be signed in to change notification settings - Fork 913
Implementation of Implicit for viscous NEMO problems #1422
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
Conversation
|
This pull request introduces 1 alert and fixes 16 when merging 2ebda7e into 262f439 - view on LGTM.com new alerts:
fixed alerts:
|
|
This pull request introduces 2 alerts and fixes 16 when merging 6b97520 into 262f439 - view on LGTM.com new alerts:
fixed alerts:
|
pcarruscag
left a comment
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.
Thanks for the extra cleanup. Just a couple minor suggestions below and then LGTM.
|
This pull request introduces 2 alerts and fixes 16 when merging b70962c into 147dfac - view on LGTM.com new alerts:
fixed alerts:
|
|
This pull request introduces 2 alerts and fixes 16 when merging 01103cb into 641d254 - view on LGTM.com new alerts:
fixed alerts:
|
Proposed Changes
This PR introduces the implicit time-stepping capability for viscous problems using NEMO.
The is a "clean" of PR #1356 (which should be closed by the time you read this). Most of the implementation discussion can be found there. Thanks to @pcarruscag for helping modernize the approach taken!
There are also several small fixes throughout addressing some LGTM.com and codefactor issues.
Future work will include extracting Jacobians from the Mutation++ to be used with NEMO. As of right now, only the native library can be used with the implementation.
Related Work
Related PRs include #1356, #1343, and #1347.
PR Checklist
Put an X by all that apply. You can fill this out after submitting the PR. If you have any questions, don't hesitate to ask! We want to help. These are a guide for you to know what the reviewers will be looking for in your contribution.