• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 7
  • 2
  • 1
  • Tagged with
  • 12
  • 12
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Model-based Comparison of Cell Density-dependent Cell Migration Strategies

Hatzikirou, H., Böttger, K., Deutsch, A. 17 April 2020 (has links)
Here, we investigate different cell density-dependent migration strategies. In particular, we consider strategies which differ in the precise regulation of transitions between resting and motile phenotypes. We develop a lattice-gas cellular automaton (LGCA) model for each migration strategy. Using a mean-field approximation we quantify the corresponding spreading dynamics at the cell population level. Our results allow for the prediction of cell population spreading based on experimentally accessible single cell migration parameters.
12

A posteriorní odhady chyby pro řešení konvektivně-difusních úloh / A posteriori error estimates for numerical solution of convection-difusion problems

Šebestová, Ivana January 2014 (has links)
This thesis is concerned with several issues of a posteriori error estimates for linear problems. In its first part error estimates for the heat conduction equation discretized by the backward Euler method in time and discontinuous Galerkin method in space are derived. In the second part guaranteed and locally efficient error estimates involving algebraic error for Poisson equation discretized by the discontinuous Galerkin method are derived. The technique is based on the flux reconstruction where meshes with hanging nodes and variable polynomial degree are allowed. An adaptive strategy combining both adaptive mesh refinement and stopping criteria for iterative algebraic solvers is proposed. In the last part a numerical method for computing guaranteed lower and upper bounds of principal eigenvalues of symmetric linear elliptic differential operators is presented. 1

Page generated in 0.1137 seconds