zbMATH — the first resource for mathematics

Metastable patterns in solutions of \(u_ t=\epsilon ^ 2u_{xx}-f(u)\). (English) Zbl 0685.35054
On étudie solutions de l’équation \(u_ t=\epsilon^ 2u_{xx}- f(u),\) pour \(0\leq x\leq 1\), \(t>0\), satisfaisantes les conditions aux limites de Neumann \(u_ x(0,t)=0\), \(u_ x(1,t)=0.\)
La fonction f est régulière et satisfait les conditions \(f(\pm 1)=0\), \(f'(\pm 1)>0\), \(\int^{1}_{-1}f(u)du=0.\)
On donne la définition d’états métastables (cfr. le mémoire); on étudie en détail l’existence et la persistance de telles états; on étudie aussi le temps de vie de ces solutions.

35K57 Reaction-diffusion equations
35B40 Asymptotic behavior of solutions to PDEs
35K20 Initial-boundary value problems for second-order parabolic equations
Full Text: DOI
[1] Carr, Arch. Rat. Mech. Anal. 86 pp 317– (1984)
[2] and , Very slow phase separation in one dimension, Proc. CNRS-NSF Conference on Phase Transitions, Nice Jan. 1988,
[3] and , Theory of Ordinary Differential Equations, McGraw-Hill, 1961.
[4] Friedlin, Ann. Prob. 13 pp 639– (1985)
[5] Asymptotic Behaviour and Dynamics in Infinite Dimensions, Research Notes in Mathematics vol. 132, Pitman, 1985. · Zbl 0653.35006
[6] and , Existence and stability of transition layers, LCDS preprint, Brown University, 1987.
[7] Geometric Theory of Semilinear Parabolic Equations, Lecture Notes in Math. vol. 840, Springer-Verlag, 1982.
[8] Jones, Trans. Amer. Math. Soc. 286 pp 431– (1984)
[9] Asymptotic behavior and stability of solutions of semilinear diffusion equations, Publ. Res. Inst. Math. Sci. 15, Kyoto Univ., 1979, pp. 401–454. · Zbl 0445.35063
[10] unpublished notes.
[11] Simon, Ann. Inst. H. Poincaré 38 pp 295– (1983)
[12] Weinberger, Rend. Accad. Naz. Lincei 77 pp 291– (1986)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.