984 resultados para coupled reaction diffusion equation
Resumo:
In this thesis, numerical methods aiming at determining the eigenfunctions, their adjoint and the corresponding eigenvalues of the two-group neutron diffusion equations representing any heterogeneous system are investigated. First, the classical power iteration method is modified so that the calculation of modes higher than the fundamental mode is possible. Thereafter, the Explicitly-Restarted Arnoldi method, belonging to the class of Krylov subspace methods, is touched upon. Although the modified power iteration method is a computationally-expensive algorithm, its main advantage is its robustness, i.e. the method always converges to the desired eigenfunctions without any need from the user to set up any parameter in the algorithm. On the other hand, the Arnoldi method, which requires some parameters to be defined by the user, is a very efficient method for calculating eigenfunctions of large sparse system of equations with a minimum computational effort. These methods are thereafter used for off-line analysis of the stability of Boiling Water Reactors. Since several oscillation modes are usually excited (global and regional oscillations) when unstable conditions are encountered, the characterization of the stability of the reactor using for instance the Decay Ratio as a stability indicator might be difficult if the contribution from each of the modes are not separated from each other. Such a modal decomposition is applied to a stability test performed at the Swedish Ringhals-1 unit in September 2002, after the use of the Arnoldi method for pre-calculating the different eigenmodes of the neutron flux throughout the reactor. The modal decomposition clearly demonstrates the excitation of both the global and regional oscillations. Furthermore, such oscillations are found to be intermittent with a time-varying phase shift between the first and second azimuthal modes.
Resumo:
With the observation that stochasticity is important in biological systems, chemical kinetics have begun to receive wider interest. While the use of Monte Carlo discrete event simulations most accurately capture the variability of molecular species, they become computationally costly for complex reaction-diffusion systems with large populations of molecules. On the other hand, continuous time models are computationally efficient but they fail to capture any variability in the molecular species. In this study a hybrid stochastic approach is introduced for simulating reaction-diffusion systems. We developed an adaptive partitioning strategy in which processes with high frequency are simulated with deterministic rate-based equations, and those with low frequency using the exact stochastic algorithm of Gillespie. Therefore the stochastic behavior of cellular pathways is preserved while being able to apply it to large populations of molecules. We describe our method and demonstrate its accuracy and efficiency compared with the Gillespie algorithm for two different systems. First, a model of intracellular viral kinetics with two steady states and second, a compartmental model of the postsynaptic spine head for studying the dynamics of Ca+2 and NMDA receptors.
Resumo:
We prove global existence and uniqueness of strong solutions to the logarithmic porous medium type equation with fractional diffusion ?tu + (?)1/2 log(1 + u) = 0, posed for x ? R, with nonnegative initial data in some function space of LlogL type. The solutions are shown to become bounded and C? smooth in (x, t) for all positive times. We also reformulate this equation as a transport equation with nonlocal velocity and critical viscosity, a topic of current relevance. Interesting functional inequalities are involved.
Resumo:
Evolutionary, pattern forming partial differential equations (PDEs) are often derived as limiting descriptions of microscopic, kinetic theory-based models of molecular processes (e.g., reaction and diffusion). The PDE dynamic behavior can be probed through direct simulation (time integration) or, more systematically, through stability/bifurcation calculations; time-stepper-based approaches, like the Recursive Projection Method [Shroff, G. M. & Keller, H. B. (1993) SIAM J. Numer. Anal. 30, 1099–1120] provide an attractive framework for the latter. We demonstrate an adaptation of this approach that allows for a direct, effective (“coarse”) bifurcation analysis of microscopic, kinetic-based models; this is illustrated through a comparative study of the FitzHugh-Nagumo PDE and of a corresponding Lattice–Boltzmann model.
Resumo:
In this article we present a computational framework for isolating spatial patterns arising in the steady states of reaction-diffusion systems. Such systems have been used to model many different phenomena in areas such as developmental and cancer biology, cell motility and material science. Often one is interested in identifying parameters which will lead to a particular pattern. To attempt to answer this, we compute eigenpairs of the Laplacian on a variety of domains and use linear stability analysis to determine parameter values for the system that will lead to spatially inhomogeneous steady states whose patterns correspond to particular eigenfunctions. This method has previously been used on domains and surfaces where the eigenvalues and eigenfunctions are found analytically in closed form. Our contribution to this methodology is that we numerically compute eigenpairs on arbitrary domains and surfaces. Here we present various examples and demonstrate that mode isolation is straightforward especially for low eigenvalues. Additionally we see that if two or more eigenvalues are in a permissible range then the inhomogeneous steady state can be a linear combination of the respective eigenfunctions. Finally we show an example which suggests that pattern formation is robust on similar surfaces in cases that the surface either has or does not have a boundary.
Resumo:
"Prepared for American Mathematical Society Meeting, Los Angeles, California, Nov. 27, 1954."
Resumo:
2000 Mathematics Subject Classification: 26A33 (primary), 35S15 (secondary)
Resumo:
2000 Mathematics Subject Classification: 26A33 (primary), 35S15
Resumo:
Mathematical Subject Classification 2010: 35R11, 42A38, 26A33, 33E12.
Resumo:
MSC 2010: 26A33, 33E12, 34K29, 34L15, 35K57, 35R30
Resumo:
We compare spot patterns generated by Turing mechanisms with those generated by replication cascades, in a model one-dimensional reaction-diffusion system. We determine the stability region of spot solutions in parameter space as a function of a natural control parameter (feed-rate) where degenerate patterns with different numbers of spots coexist for a fixed feed-rate. While it is possible to generate identical patterns via both mechanisms, we show that replication cascades lead to a wider choice of pattern profiles that can be selected through a tuning of the feed-rate, exploiting hysteresis and directionality effects of the different pattern pathways.
Resumo:
We propose a mathematically well-founded approach for locating the source (initial state) of density functions evolved within a nonlinear reaction-diffusion model. The reconstruction of the initial source is an ill-posed inverse problem since the solution is highly unstable with respect to measurement noise. To address this instability problem, we introduce a regularization procedure based on the nonlinear Landweber method for the stable determination of the source location. This amounts to solving a sequence of well-posed forward reaction-diffusion problems. The developed framework is general, and as a special instance we consider the problem of source localization of brain tumors. We show numerically that the source of the initial densities of tumor cells are reconstructed well on both imaging data consisting of simple and complex geometric structures.
Resumo:
We examine the evolution of a bistable reaction in a one-dimensional stretching flow, as a model for chaotic advection. We derive two reduced systems of ordinary differential equations (ODEs) for the dynamics of the governing advection-reaction-diffusion partial differential equations (PDE), for pulse-like and for plateau-like solutions, based on a non-perturbative approach. This reduction allows us to study the dynamics in two cases: first, close to a saddle-node bifurcation at which a pair of nontrivial steady states are born as the dimensionless reaction rate (Damkoehler number) is increased, and, second, for large Damkoehler number, far away from the bifurcation. The main aim is to investigate the initial-value problem and to determine when an initial condition subject to chaotic stirring will decay to zero and when it will give rise to a nonzero final state. Comparisons with full PDE simulations show that the reduced pulse model accurately predicts the threshold amplitude for a pulse initial condition to give rise to a nontrivial final steady state, and that the reduced plateau model gives an accurate picture of the dynamics of the system at large Damkoehler number. Published in Physica D (2006)
Resumo:
In this work, integro-differential reaction-diffusion models are presented for the description of the temporal and spatial evolution of the concentrations of Abeta and tau proteins involved in Alzheimer's disease. Initially, a local model is analysed: this is obtained by coupling with an interaction term two heterodimer models, modified by adding diffusion and Holling functional terms of the second type. We then move on to the presentation of three nonlocal models, which differ according to the type of the growth (exponential, logistic or Gompertzian) considered for healthy proteins. In these models integral terms are introduced to consider the interaction between proteins that are located at different spatial points possibly far apart. For each of the models introduced, the determination of equilibrium points with their stability and a study of the clearance inequalities are carried out. In addition, since the integrals introduced imply a spatial nonlocality in the models exhibited, some general features of nonlocal models are presented. Afterwards, with the aim of developing simulations, it is decided to transfer the nonlocal models to a brain graph called connectome. Therefore, after setting out the construction of such a graph, we move on to the description of Laplacian and convolution operations on a graph. Taking advantage of all these elements, we finally move on to the translation of the continuous models described above into discrete models on the connectome. To conclude, the results of some simulations concerning the discrete models just derived are presented.