17 resultados para Global analysis (Mathematics)


Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this article we provide homotopy solutions of a cancer nonlinear model describing the dynamics of tumor cells in interaction with healthy and effector immune cells. We apply a semi-analytic technique for solving strongly nonlinear systems – the Step Homotopy Analysis Method (SHAM). This algorithm, based on a modification of the standard homotopy analysis method (HAM), allows to obtain a one-parameter family of explicit series solutions. By using the homotopy solutions, we first investigate the dynamical effect of the activation of the effector immune cells in the deterministic dynamics, showing that an increased activation makes the system to enter into chaotic dynamics via a period-doubling bifurcation scenario. Then, by adding demographic stochasticity into the homotopy solutions, we show, as a difference from the deterministic dynamics, that an increased activation of the immune cells facilitates cancer clearance involving tumor cells extinction and healthy cells persistence. Our results highlight the importance of therapies activating the effector immune cells at early stages of cancer progression.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Locating and identifying points as global minimizers is, in general, a hard and time-consuming task. Difficulties increase in the impossibility of using the derivatives of the functions defining the problem. In this work, we propose a new class of methods suited for global derivative-free constrained optimization. Using direct search of directional type, the algorithm alternates between a search step, where potentially good regions are located, and a poll step where the previously located promising regions are explored. This exploitation is made through the launching of several instances of directional direct searches, one in each of the regions of interest. Differently from a simple multistart strategy, direct searches will merge when sufficiently close. The goal is to end with as many direct searches as the number of local minimizers, which would easily allow locating the global extreme value. We describe the algorithmic structure considered, present the corresponding convergence analysis and report numerical results, showing that the proposed method is competitive with currently commonly used global derivative-free optimization solvers.