Computational Algorithm for Some Problems with Variable Geometrical Structure

Nikolai Bessonov (1) , Vitaly Volpert (2, 3)

1 IPME - Institute of Mechanical Engineering Problems [St. Petersburg]
2 ICJ - Institut Camille Jordan
3 DRACULA - Multi-scale modelling of cell dynamics : application to hematopoiesis

The work is devoted to the computational algorithm for a problem of plant growth. The plant is represented as a system of connected intervals corresponding to branches. We compute the concentration distributions inside the branches. The originality of the problem is that the geometry of the plant is not a priori given. It evolves in time depending on the concentrations of plant hormones found as a solution of the problem. New branches appear in the process of plant growth. The algorithm is adapted to an arbitrary plant structure and an arbitrary number of branches.

Domaines: Equations aux dérivées partielles [math.AP]

Nikolai Bessonov, Vitaly Volpert. Computational Algorithm for Some Problems with Variable Geometrical Structure. Lecture Notes in Computer Science, 2011, 6260/2011, pp.87-102. ⟨10.1007/978-3-642-16236-7_6⟩. ⟨hal-00653652⟩