Replies: 1 comment 1 reply
-
Hi Sophie, I'm sorry I can't answer this right away. Also, since your at UW maybe we should just meet in person? I can say that we have update the transient algorithms quite a bit in the upcoming V3 release, including a explicit solvers and the use of scipy's ivp_solve module. |
Beta Was this translation helpful? Give feedback.
1 reply
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
-
Hello,
I'm an MME student at UW doing research at the MPI lab. I've been working on modifying OpenPNM for simulations of the porous flow in transpiration cooling (the repository is here if you're interested). The work is specifically looking at the impact of surface pressure fluctuations, so I've been building on the TransientReactiveTransport algorithm to implement what is effectively a Stokes flow algorithm with changing boundary conditions.
I noticed that both the implicit and Crank-Nicholson time schemes introduce a capacitance to the problem due to the way the A and b matrices are updated:
I was hoping someone would be able to explain or point me to a paper that explains what equations the modifications to A and b correspond to, as it's clear the transient algorithm builds further on steady state algorithms than just implementing basic time stepping. Any insight you could provide would be greatly appreciated.
Thank you,
Sophie
Beta Was this translation helpful? Give feedback.
All reactions