Publications
Sort:
Open Access Research Article Issue
On the numerical discretization of a tumor progression model driven by competing migration mechanisms
Mathematics in Engineering 2022, 4(6): 1-24
Published: 15 December 2022
Abstract PDF (903.4 KB) Collect
Downloads:1

In this work we explore a recently proposed biphasic cell-fluid chemotaxis-Stokes model which is able to represent two competing cancer cell migration mechanisms reported from experimental studies. Both mechanisms depend on the fluid flow but in a completely different way. One mechanism depends on chemical signaling and leads to migration in the downstream direction. The other depends on mechnical signaling and triggers cancer cells to go upstream. The primary objective of this paper is to explore an alternative numerical discretization of this model by borrowing ideas from [Qiao et al. (2020), M3AS 30]. Numerical investigations give insight into which parameters that are critical for the ability to generate aggressive cancer cell behavior in terms of detachment of cancer cells from the primary tumor and creation of isolated groups of cancer cells close to the lymphatic vessels. The secondary objective is to propose a reduced model by exploiting the fact that the fluid velocity field is largely dictated by the draining fluid from the leaky tumor vasculature and collecting peritumoral lymphatics and is more weakly coupled to the cell phase. This suggests that the fluid flow equations to a certain extent might be decoupled from the cell phase equations. The resulting model, which represents a counterpart of the much studied chemotaxis-Stokes model model proposed by [Tuval, et al. (2005), PNAS 102], is explored by numerical experiments in a one-dimensional tumor setting. We find that the model largely coincides with the original as assessed through numerical solutions computed by discrete schemes. This model might be more amenable for further explorations and analysis. We also investigate how to exploit the weaker coupling between cell phase dynamics and fluid dynamics to do more efficient calculations with fewer updates of the fluid pressure and velocity field.

Open Access Research Article Issue
Learning the nonlinear flux function of a hidden scalar conservation law from data
Networks and Heterogeneous Media 2023, 18(1): 48-79
Published: 15 March 2023
Abstract PDF (1.1 MB) Collect
Downloads:1

Nonlinear conservation laws are widely used in fluid mechanics, biology, physics, and chemical engineering. However, deriving such nonlinear conservation laws is a significant and challenging problem. A possible attractive approach is to extract conservation laws more directly from observation data by use of machine learning methods. We propose a framework that combines a symbolic multi-layer neural network and a discrete scheme to learn the nonlinear, unknown flux function f ( u ) of the scalar conservation law

u t + f ( u ) x = 0 ( )

with u as the main variable. This identification is based on using observation data u ( x j , t i ) on a spatial grid x j , j = 1 , , N x at specified times t i , i = 1 , , N o b s . A main challenge with Eq (*) is that the solution typically creates shocks, i.e., one or several jumps of the form ( u L , u R ) with u L u R moving in space and possibly changing over time such that information about f ( u ) in the interval associated with this jump is sparse or not at all present in the observation data. Secondly, the lack of regularity in the solution of (*) and the nonlinear form of f ( u ) hamper use of previous proposed physics informed neural network (PINN) methods where the underlying form of the sought differential equation is accounted for in the loss function. We circumvent this obstacle by approximating the unknown conservation law (*) by an entropy satisfying discrete scheme where f ( u ) is represented through a symbolic multi-layer neural network. Numerical experiments show that the proposed method has the ability to uncover the hidden conservation law for a wide variety of different nonlinear flux functions, ranging from pure concave/convex to highly non-convex shapes. This is achieved by relying on a relatively sparse amount of observation data obtained in combination with a selection of different initial data.

Total 2