Attractors for nonautonomous 2D Navier-Stokes equations with normal external forces
By Songsong Lu, Hongqing Wu, Chengkui Zhong. 2005
170 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Control and Systems Engineering
View Paper: https://www.semanticscholar.org/paper/5749e18d04c3559ef6a67bbf121d6623c46e23f8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Alain Miranville
- Ciprian G. Gal
- Maurizio Grasselli
- Sergey Zelik
- Hao Wu
- Songsong Lu
- Laurence Cherfils
- Chunyou Sun
In Computer Networks and Communications
- Alain Miranville
- Ciprian G. Gal
- Sergey Zelik
- Songsong Lu
- Maurizio Grasselli
- Chunyou Sun
- Stefanie Sonner
- Alexandre Nolasco de Carvalho
In Control and Systems Engineering
- Ciprian G. Gal
- Alain Miranville
- Maurizio Grasselli
- Sergey Zelik
- Songsong Lu
- Hao Wu
- Chunyou Sun
- Laurence Cherfils
Citations in the corpus
- Attractors for nonautonomous 2D Navier–Stokes equations with less regular normal forces☆ (2006, methodology): “The purpose of this paper is to investigate, following the idea of [23], uniform attractor for the nonautonomous 2D Navier–Stokes equations with force even lying in the natural dual space L(2)loc(R;V ′).”
- Trajectory attractors for binary fluid mixtures in 3D (2010, methodology): “In the 2D case, thanks to uniqueness, the trajectories can be described through a family of processes {Ug,K(t, τ)} acting on the phase-space YK , with symbol g in the hull of some given g0 ∈ Lb(R+;V) (see [49, 50] for possible generalizations).”
- Chapter 3 Attractors for Dissipative Partial Differential Equations in Bounded and Unbounded Domains (2008, background): “, that Σ is compact in Θ (see however [147,149], and [151] in which the translation compactness is relaxed; more precisely, one considers classes of time dependences which are translation bounded (i.”