You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Let's try to add some diagnostic functionality to AIBECS that generalizes the work done in Pasquier and Holzer, 2018.
Preliminary notes
Let's start from the generic equation
(∂ₜ + T) x = G(x).
x could represent a multitude of tracers and processes. Within x, there may be separate groups of tracers with a group per compound or element. E.g., one could be tracking many elements including, e.g., phosphorus, whose group could be composed of three pools, like PO4, DOP, and POP. For the diagnostics that I am interested in, we will assume for simplicity and without any loss of generality, that there is only one element (one group) here.
We can then express the group's system without loss of generality as a bunch of
source terms sp(x) that inject x into the system,
of "transfers" terms that exchange the element between tracers of our group Ji→j(x),
and of "death" processes dq(x), which ultimately remove x from the system.
Mathematically, that means we can write
G(x) = ∑psp(x) + ∑ijJi→j(x) + ∑qdq(x).
We construct the LEM by first creating linear-equivalent terms for Ji→j(x) and dq(x), evaluated at the steady-state solution x given by
Tx = G(x)
In other words, the LEM is built such that
G(x) = ∑psp + ∑ijLi→jx + ∑qLqx
when x is the steady-state, and where
Li→j is a block matrix where only 2 blocks are non-zero, (i,j) and (j,i), which have diagonals -(Ji→j(x))i / xi, and +(Ji→j(x))j / xi, respectively. (Note we use xi to "linearize" Ji→j so that the rate of transfer is specific to the removed tracer.)
and Lq is a diagonal matrix with diagonal dq(x) / x.
We then construct the LEM simply as
(∂ₜ + H) x = ∑psp
where
H = T - ∑ijLi→j - ∑qLq
and we can then exploit this for powerful diagnostics as in Pasquier and Holzer, 2018. Fractions that came from source sp, or fraction that will be removed via process dq, are available from a single backslash with H. One can also further partition according to each i→j passage by removing Ji→j from H into a F operator and iteratively reapplying the source term. Direct computations leveraging the classical identities ∑n xn and ∑nn xn also allow for direct computations of, e.g., the number of i→j passages.
The text was updated successfully, but these errors were encountered:
Maybe classify diagnostics in different groups (passages, age, and so on) and lay down a plan to implenent them. E.g., automate the extraction of the equivalent linear models and use dispatch to solve diagnostic equations of Solved and Unsolved problems (e.g., to solve the main problem and the diagnostic in one go).
Let's try to add some diagnostic functionality to AIBECS that generalizes the work done in Pasquier and Holzer, 2018.
Preliminary notes
Let's start from the generic equation
(∂ₜ + T) x = G(x).
x could represent a multitude of tracers and processes. Within x, there may be separate groups of tracers with a group per compound or element. E.g., one could be tracking many elements including, e.g., phosphorus, whose group could be composed of three pools, like PO4, DOP, and POP. For the diagnostics that I am interested in, we will assume for simplicity and without any loss of generality, that there is only one element (one group) here.
We can then express the group's system without loss of generality as a bunch of
Mathematically, that means we can write
G(x) = ∑p sp(x) + ∑ij Ji→j(x) + ∑q dq(x).
We construct the LEM by first creating linear-equivalent terms for Ji→j(x) and dq(x), evaluated at the steady-state solution x given by
T x = G(x)
In other words, the LEM is built such that
G(x) = ∑p sp + ∑ij Li→j x + ∑q Lq x
when x is the steady-state, and where
We then construct the LEM simply as
(∂ₜ + H) x = ∑p sp
where
H = T - ∑ij Li→j - ∑q Lq
and we can then exploit this for powerful diagnostics as in Pasquier and Holzer, 2018. Fractions that came from source sp, or fraction that will be removed via process dq, are available from a single backslash with H. One can also further partition according to each i→j passage by removing Ji→j from H into a F operator and iteratively reapplying the source term. Direct computations leveraging the classical identities ∑n xn and ∑n n xn also allow for direct computations of, e.g., the number of i→j passages.
The text was updated successfully, but these errors were encountered: