En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Documents 35S05 1 résultats

Filtrer
Sélectionner : Tous / Aucun
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
We are concerned with deriving sharp exponential decay estimates (i.e. with maximum rate and minimum multiplicative constant) for linear, hypocoercive evolution equations. Using a modal decomposition of the model allows to assemble a Lyapunov functional using Lyapunov matrix inequalities for each Fourier mode.
We shall illustrate the approach on the 1D Goldstein-Taylor model, a2-velocity transport-relaxation equation. On the torus the lowest Fourier modes determine the spectral gap of the whole equation in $L^{2}$. By contrast, on the whole real line the Goldstein-Taylor model does not have a spectral gap, since the decay rate of the Fourier modes approaches zero in the small mode limit. Hence, the decay is reduced to algebraic.
In the final part of the talk we consider the Goldstein-Taylor model with non-constant relaxation rate, which is hence not amenable to a modal decomposition. In this case we construct a Lyapunov functional of pseudodifferential nature, one that is motivated by the modal analysis in the constant case.The robustness of this approach is illustrated on a multi-velocity GoldsteinTaylor model, yielding explicit rates of convergence to the equilibrium.
This is joint work with J. Dolbeault, A. Einav, C. Schmeiser, B. Signorello, and T. Wöhrer.[-]
We are concerned with deriving sharp exponential decay estimates (i.e. with maximum rate and minimum multiplicative constant) for linear, hypocoercive evolution equations. Using a modal decomposition of the model allows to assemble a Lyapunov functional using Lyapunov matrix inequalities for each Fourier mode.
We shall illustrate the approach on the 1D Goldstein-Taylor model, a2-velocity transport-relaxation equation. On the torus the lowest ...[+]

Sélection Signaler une erreur