66 resultados para Delay equations
Resumo:
We prove global well-posedness in the strong sense for stochastic generalized porous media equations driven by locally square integrable martingales with stationary independent increments.
Resumo:
We present a new a-priori estimate for discrete coagulation fragmentation systems with size-dependent diffusion within a bounded, regular domain confined by homogeneous Neumann boundary conditions. Following from a duality argument, this a-priori estimate provides a global L2 bound on the mass density and was previously used, for instance, in the context of reaction-diffusion equations. In this paper we demonstrate two lines of applications for such an estimate: On the one hand, it enables to simplify parts of the known existence theory and allows to show existence of solutions for generalised models involving collision-induced, quadratic fragmentation terms for which the previous existence theory seems difficult to apply. On the other hand and most prominently, it proves mass conservation (and thus the absence of gelation) for almost all the coagulation coefficients for which mass conservation is known to hold true in the space homogeneous case.
Resumo:
We propose a mixed finite element method for a class of nonlinear diffusion equations, which is based on their interpretation as gradient flows in optimal transportation metrics. We introduce an appropriate linearization of the optimal transport problem, which leads to a mixed symmetric formulation. This formulation preserves the maximum principle in case of the semi-discrete scheme as well as the fully discrete scheme for a certain class of problems. In addition solutions of the mixed formulation maintain exponential convergence in the relative entropy towards the steady state in case of a nonlinear Fokker-Planck equation with uniformly convex potential. We demonstrate the behavior of the proposed scheme with 2D simulations of the porous medium equations and blow-up questions in the Patlak-Keller-Segel model.
Resumo:
"Vegeu el resum a l'inici del document del fitxer adjunt."
Resumo:
We describe an algorithm that computes explicit models of hyperelliptic Shimura curves attached to an indefinite quaternion algebra over Q and Atkin-Lehner quotients of them. It exploits Cerednik-Drinfeld’s nonarchimedean uniformisation of Shimura curves, a formula of Gross and Zagier for the endomorphism ring of Heegner points over Artinian rings and the connection between Ribet’s bimodules and the specialization of Heegner points, as introduced in [21]. As an application, we provide a list of equations of Shimura curves and quotients of them obtained by our algorithm that had been conjectured by Kurihara.
Stabilized Petrov-Galerkin methods for the convection-diffusion-reaction and the Helmholtz equations
Resumo:
We present two new stabilized high-resolution numerical methods for the convection–diffusion–reaction (CDR) and the Helmholtz equations respectively. The work embarks upon a priori analysis of some consistency recovery procedures for some stabilization methods belonging to the Petrov–Galerkin framework. It was found that the use of some standard practices (e.g. M-Matrices theory) for the design of essentially non-oscillatory numerical methods is not feasible when consistency recovery methods are employed. Hence, with respect to convective stabilization, such recovery methods are not preferred. Next, we present the design of a high-resolution Petrov–Galerkin (HRPG) method for the 1D CDR problem. The problem is studied from a fresh point of view, including practical implications on the formulation of the maximum principle, M-Matrices theory, monotonicity and total variation diminishing (TVD) finite volume schemes. The current method is next in line to earlier methods that may be viewed as an upwinding plus a discontinuity-capturing operator. Finally, some remarks are made on the extension of the HRPG method to multidimensions. Next, we present a new numerical scheme for the Helmholtz equation resulting in quasi-exact solutions. The focus is on the approximation of the solution to the Helmholtz equation in the interior of the domain using compact stencils. Piecewise linear/bilinear polynomial interpolation are considered on a structured mesh/grid. The only a priori requirement is to provide a mesh/grid resolution of at least eight elements per wavelength. No stabilization parameters are involved in the definition of the scheme. The scheme consists of taking the average of the equation stencils obtained by the standard Galerkin finite element method and the classical finite difference method. Dispersion analysis in 1D and 2D illustrate the quasi-exact properties of this scheme. Finally, some remarks are made on the extension of the scheme to unstructured meshes by designing a method within the Petrov–Galerkin framework.
Resumo:
We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued piecewise linear discontinuous finite element space, that are optimal with respect to the mesh size and the Lamé parameters. The pure displacement, the mixed and the traction free problems are discussed in detail. We present a convergence analysis of the proposed preconditioners and include numerical examples that validate the theory and assess the performance of the preconditioners.
Resumo:
The problem of stability analysis for a class of neutral systems with mixed time-varying neutral, discrete and distributed delays and nonlinear parameter perturbations is addressed. By introducing a novel Lyapunov-Krasovskii functional and combining the descriptor model transformation, the Leibniz-Newton formula, some free-weighting matrices, and a suitable change of variables, new sufficient conditions are established for the stability of the considered system, which are neutral-delay-dependent, discrete-delay-range dependent, and distributeddelay-dependent. The conditions are presented in terms of linear matrix inequalities (LMIs) and can be efficiently solved using convex programming techniques. Two numerical examples are given to illustrate the efficiency of the proposed method
Resumo:
Forest fire models have been widely studied from the context of self-organized criticality and from the ecological properties of the forest and combustion. On the other hand, reaction-diffusion equations have interesting applications in biology and physics. We propose here a model for fire propagation in a forest by using hyperbolic reaction-diffusion equations. The dynamical and thermodynamical aspects of the model are analyzed in detail
Resumo:
The asymptotic speed problem of front solutions to hyperbolic reaction-diffusion (HRD) equations is studied in detail. We perform linear and variational analyses to obtain bounds for the speed. In contrast to what has been done in previous work, here we derive upper bounds in addition to lower ones in such a way that we can obtain improved bounds. For some functions it is possible to determine the speed without any uncertainty. This is also achieved for some systems of HRD (i.e., time-delayed Lotka-Volterra) equations that take into account the interaction among different species. An analytical analysis is performed for several systems of biological interest, and we find good agreement with the results of numerical simulations as well as with available observations for a system discussed recently
Resumo:
A time-delayed second-order approximation for the front speed in reaction-dispersion systems was obtained by Fort and Méndez [Phys. Rev. Lett. 82, 867 (1999)]. Here we show that taking proper care of the effect of the time delay on the reactive process yields a different evolution equation and, therefore, an alternate equation for the front speed. We apply the new equation to the Neolithic transition. For this application the new equation yields speeds about 10% slower than the previous one
Resumo:
We investigate the problem of finding minimum-distortion policies for streaming delay-sensitive but distortion-tolerant data. We consider cross-layer approaches which exploit the coupling between presentation and transport layers. We make the natural assumption that the distortion function is convex and decreasing. We focus on a single source-destination pair and analytically find the optimum transmission policy when the transmission is done over an error-free channel. This optimum policy turns out to be independent of the exact form of the convex and decreasing distortion function. Then, for a packet-erasure channel, we analytically find the optimum open-loop transmission policy, which is also independent of the form of the convex distortion function. We then find computationally efficient closed-loop heuristic policies and show, through numerical evaluation, that they outperform the open-loop policy and have near optimal performance.
Resumo:
We consider adaptive sequential lossy coding of bounded individual sequences when the performance is measured by the sequentially accumulated mean squared distortion. Theencoder and the decoder are connected via a noiseless channel of capacity $R$ and both are assumed to have zero delay. No probabilistic assumptions are made on how the sequence to be encoded is generated. For any bounded sequence of length $n$, the distortion redundancy is defined as the normalized cumulative distortion of the sequential scheme minus the normalized cumulative distortion of the best scalarquantizer of rate $R$ which is matched to this particular sequence. We demonstrate the existence of a zero-delay sequential scheme which uses common randomization in the encoder and the decoder such that the normalized maximum distortion redundancy converges to zero at a rate $n^{-1/5}\log n$ as the length of the encoded sequence $n$ increases without bound.