Computational Algorithm for Some Problems with Variable Geometrical Structure
Abstract
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.
Domains
Analysis of PDEs [math.AP]
Origin : Files produced by the author(s)
Loading...