Skip to content
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.

Sign up for GitHub

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

Jump to bottom

implement the CMA method #1607

Open
wants to merge 8 commits into
base: development
Choose a base branch
from
Open

implement the CMA method #1607

Changes from all commits
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
228a006
implement the CMA method
zingale Mar 26, 2021
4f4a5cf
fix indexing
zingale Mar 26, 2021
0cf54eb
Merge branch 'development' into riemann_state_cma
zingale Apr 8, 2021
c67d70b
Merge branch 'development' into riemann_state_cma
zingale Jun 9, 2021
5c723af
update CMA
zingale Jun 9, 2021
71b6332
Merge branch 'development' into riemann_state_cma
zingale Oct 9, 2023
22a3396
Merge branch 'development' into riemann_state_cma
zingale Jul 26, 2024
df45ed9
Merge branch 'development' into riemann_state_cma
zingale Jul 30, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 17 additions & 0 deletions Source/hydro/riemann.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -107,12 +107,29 @@ Castro::cmpflx_plus_godunov(const Box& bx,
Real fp = 0.5_rt*(1.0_rt + sgnm);
Real fm = 0.5_rt*(1.0_rt - sgnm);

// we don't want to store all the values of X, so we are going
// to reconstruct in 2 steps to implement the CMA method

Real sum_X = 0.0_rt;

for (int n = 0; n < NumSpec; n++) {
sum_X += amrex::max(0.0_rt,
amrex::min(1.0_rt,
fp * qm(i,j,k,QFS+n) + fm * qp(i,j,k,QFS+n)));
}

for (int ipassive = 0; ipassive < npassive; ipassive++) {
int nqp = qpassmap(ipassive);
int n = upassmap(ipassive);

Real X_int = fp * qm(i,j,k,nqp) + fm * qp(i,j,k,nqp);

if (nqp >= QFS && nqp < QFS+NumSpec) {
// normalize
X_int = amrex::max(0.0_rt, amrex::min(1.0_rt, X_int));
X_int = X_int / sum_X;
}

flx(i,j,k,n) = flx(i,j,k,URHO) * X_int;

if (store_full_state) {
Expand Down
Loading