-
Notifications
You must be signed in to change notification settings - Fork 5
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
57: Add basic operators r=charleskawczynski a=charleskawczynski We'll use the CLIMACore operators when we're ready, but I think that these changes will help simplify this transition. Co-authored-by: Charles Kawczynski <[email protected]>
- Loading branch information
Showing
6 changed files
with
127 additions
and
11 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,111 @@ | ||
|
||
abstract type AbstractBCTag end | ||
struct BottomBCTag <: AbstractBCTag end | ||
struct TopBCTag <: AbstractBCTag end | ||
struct InteriorTag <: AbstractBCTag end | ||
|
||
struct NoBCGivenError end | ||
struct SetValue{FT} | ||
value::FT | ||
end | ||
struct SetGradient{FT} | ||
value::FT | ||
end | ||
|
||
function ∇f2c(f, grid::Grid, k::Int) | ||
return (f[k] - f[k - 1]) * grid.dzi | ||
end | ||
|
||
function ∇c2f(f, grid::Grid, k::Int) | ||
return (f[k + 1] - f[k]) * grid.dzi | ||
end | ||
|
||
function ∇_upwind(f, grid::Grid, k::Int) | ||
return (f[k + 1] - f[k]) * grid.dzi | ||
end | ||
|
||
function interpc2f(f, grid::Grid, k::Int) | ||
return 0.5 * (f[k + 1] + f[k]) | ||
end | ||
|
||
##### | ||
##### ∇(center data) | ||
##### | ||
|
||
c∇(f, grid::Grid, k::Int; bottom = NoBCGivenError(), top = NoBCGivenError()) = c∇(cut(f, k), grid, k; bottom, top) | ||
|
||
function c∇(f_cut::SVector, grid::Grid, k::Int; bottom = NoBCGivenError(), top = NoBCGivenError()) | ||
gw = grid.gw | ||
if k == gw # NOTE: 0-based indexing (k = 3 for 1-based indexing) bottom boundary | ||
return c∇(f_cut, grid, BottomBCTag(), bottom) | ||
elseif k == grid.nzg - gw - 1 # NOTE: 0-based indexing | ||
return c∇(f_cut, grid, TopBCTag(), top) | ||
else | ||
return c∇(f_cut, grid, InteriorTag()) | ||
end | ||
end | ||
c∇(f::SVector, grid::Grid, ::AbstractBCTag, ::NoBCGivenError) = error("No BC given") | ||
function c∇(f::SVector, grid::Grid, ::InteriorTag) | ||
@assert length(f) == 3 | ||
f_dual⁺ = SVector(f[2], f[3]) | ||
f_dual⁻ = SVector(f[1], f[2]) | ||
return (∇_staggered(f_dual⁺, grid) + ∇_staggered(f_dual⁻, grid)) / 2 | ||
end | ||
function c∇(f::SVector, grid::Grid, ::TopBCTag, bc::SetValue) | ||
@assert length(f) == 3 | ||
# 2fb = cg+ci => cg = 2fb-ci | ||
f_dual⁺ = SVector(f[2], 2 * bc.value - f[2]) | ||
f_dual⁻ = SVector(f[1], f[2]) | ||
return (∇_staggered(f_dual⁺, grid) + ∇_staggered(f_dual⁻, grid)) / 2 | ||
end | ||
function c∇(f::SVector, grid::Grid, ::BottomBCTag, bc::SetValue) | ||
@assert length(f) == 3 | ||
# 2fb = cg+ci => cg = 2fb-ci | ||
f_dual⁺ = SVector(f[2], f[3]) | ||
f_dual⁻ = SVector(2 * bc.value - f[2], f[2]) | ||
return (∇_staggered(f_dual⁺, grid) + ∇_staggered(f_dual⁻, grid)) / 2 | ||
end | ||
function c∇(f::SVector, grid::Grid, ::TopBCTag, bc::SetGradient) | ||
@assert length(f) == 3 | ||
f_dual⁺ = SVector(f[2], f[3]) | ||
f_dual⁻ = SVector(f[1], f[2]) | ||
return (bc.value + ∇_staggered(f_dual⁻, grid)) / 2 | ||
end | ||
function c∇(f::SVector, grid::Grid, ::BottomBCTag, bc::SetGradient) | ||
@assert length(f) == 3 | ||
f_dual⁺ = SVector(f[2], f[3]) | ||
f_dual⁻ = SVector(f[1], f[2]) | ||
return (∇_staggered(f_dual⁺, grid) + bc.value) / 2 | ||
end | ||
|
||
##### | ||
##### Generic functions | ||
##### | ||
|
||
function ∇_staggered(f::SVector, grid::Grid) | ||
@assert length(f) == 2 | ||
return (f[2] - f[1]) * grid.dzi | ||
end | ||
|
||
# A 3-point field stencil | ||
function cut(f::AbstractVector, k::Int) | ||
return SVector(f[k - 1], f[k], f[k + 1]) | ||
end | ||
|
||
# A 3-point field stencil for updraft variables | ||
function cut(f::AbstractMatrix, k::Int, i_up::Int) | ||
return SVector(f[i_up, k - 1], f[i_up, k], f[i_up, k + 1]) | ||
end | ||
|
||
function ∇_collocated(f::SVector, grid::Grid) | ||
@assert length(f) == 3 | ||
return (f[3] - f[1]) * 0.5 * grid.dzi | ||
end | ||
|
||
# TODO: use this implementation | ||
# function ∇_collocated(f::SVector, grid::Grid) | ||
# @assert length(f) == 3 | ||
# f_dual⁺ = SVector(f[2], f[3]) | ||
# f_dual⁻ = SVector(f[1], f[2]) | ||
# return (∇_staggered(f_dual⁺, grid) + ∇_staggered(f_dual⁻, grid)) / 2 | ||
# end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters