Search

We study the limiting dynamics of the Euler Alignment system with a smooth, heavy-tailed interaction kernel $\phi$ and unidirectional velocity $\mathbf{u} = (u, 0, \ldots, 0)$. We demonstrate a striking correspondence between the entropy function $e_0 = \partial_1 u_0 + \phi*\rho_0$ and the limiting 'concentration set', i.e., the support of the singular part of the limiting density measure. In a typical scenario, a flock experiences aggregation toward a union of $C^1$ hypersurfaces: the image of the zero set of $e_0$ under the limiting flow map. This correspondence also allows us to make statements about the fine properties associated to the limiting dynamics, including a sharp upper bound on the dimension of the concentration set, depending only on the smoothness of $e_0$. In order to facilitate and contextualize our analysis of the limiting density measure, we also include an expository discussion of the wellposedness, flocking, and stability of the Euler Alignment system, most of which is new., Comment: 20 pages, 1 figure

We continue our study of hydrodynamic models of self-organized evolution of agents with singular interaction kernel ϕ ( x ) = | x | − ( 1 + α ) . Following our works Shvydkoy and Tadmor (2017) [1] , [2] which focused on the range 1 ≤ α 2 , and Do et al. (2017) which covered the range 0 α 1 , in this paper we revisit the latter case and give a short(-er) proof of global in time existence of smooth solutions, together with a full description of their long time dynamics. Specifically, we prove that starting from any initial condition in ( ρ 0 , u 0 ) ∈ H 2 + α × H 3 , the solution approaches exponentially fast to a flocking state solution consisting of a wave ρ = ρ ∞ ( x − t u ) traveling with a constant velocity determined by the conserved average velocity u . The convergence is accompanied by exponential decay of all higher order derivatives of u .

Regularity estimates in time and space for solutions to the porous medium equation are shown in the scale of Sobolev spaces. In addition, higher spatial regularity for powers of the solutions is obtained. Scaling arguments indicate that these estimates are optimal. In the linear limit, the proven regularity estimates are consistent with the optimal regularity of the linear case., 36 pages

In this work, the space of admissible entropy functions for the compressible multicomponent Euler equations is explored, following up on Harten (J. Comput. Phys. 49 (1983) 151–164). This effort allows us to prove a minimum entropy principle on entropy solutions, whether smooth or discrete, in the same way it was originally demonstrated for the compressible Euler equations by Tadmor (Appl. Numer. Math. 49 (1986) 211–219).

We continue our study of one-dimensional class of Euler equations, introduced in [ 11 ], driven by a forcing with a commutator structure of the form \begin{document} $[{\mathcal L}_φ, u](ρ)$ \end{document} , where \begin{document} $u$ \end{document} is the velocity field and \begin{document} ${\mathcal L}_φ$ \end{document} belongs to a rather general class of convolution operators depending on interaction kernels \begin{document} $φ$ \end{document} . In this paper we quantify the large-time behavior of such systems in terms of fast flocking, for two prototypical sub-classes of kernels: bounded positive \begin{document} $φ$ \end{document} 's, and singular \begin{document} $φ(r) = r^{-(1+α)}$ \end{document} of order \begin{document} $α∈ [1, 2)$ \end{document} associated with the action of the fractional Laplacian \begin{document} ${\mathcal L}_φ=-(-\partial_{xx})^{α/2}$ \end{document} . Specifically, we prove fast velocity alignment as the velocity \begin{document} $u(·, t)$ \end{document} approaches a constant state, \begin{document} $u \to \bar{u}$ \end{document} , with exponentially decaying slope and curvature bounds \begin{document} $|{u_x}( \cdot ,t){|_\infty } + |{u_{xx}}( \cdot ,t){|_\infty }\lesssim{e^{ - \delta t}}$ \end{document} . The alignment is accompanied by exponentially fast flocking of the density towards a fixed traveling state \begin{document} $ρ(·, t) -{ρ_{∞}}(x -\bar{u} t) \to 0$ \end{document} .

We investigate the large time behavior of \begin{document}$ N $\end{document} particles restricted to a smooth closed curve in \begin{document}$ \mathbb{R}^d $\end{document} and subject to a gradient flow with respect to Euclidean hyper-singular repulsive Riesz \begin{document}$ s $\end{document}-energy with \begin{document}$ s>1. $\end{document} We show that regardless of their initial positions, for all \begin{document}$ N $\end{document} and time \begin{document}$ t $\end{document} large, their normalized Riesz \begin{document}$ s $\end{document}-energy will be close to the \begin{document}$ N $\end{document}-point minimal possible energy. Furthermore, the distribution of such particles will be close to uniform with respect to arclength measure along the curve.

We study the regularity and large-time behavior of a crowd of species driven by chemo-tactic interactions. What distinguishes the different species is the way they interact with the rest of the crowd: the collective motion is driven by different chemical reactions which end up in a coupled system of parabolic Patlak-Keller-Segel equations. We show that the densities of the different species diffuse to zero provided the chemical interactions between the different species satisfy certain sub-critical condition; the latter is intimately related to a log-Hardy-Littlewood-Sobolev inequality for systems due to Shafrir & Wolansky. Thus for example, when two species interact, one of which has mass less than $4��$, then the 2-system stays smooth for all time independent of the total mass of the system, in sharp contrast with the well-known breakdown of one specie with initial mass$> 8��$.

We study the large-time behavior of systems driven by radial potentials, which react to anticipated positions, $$\mathbf{x}^\tau (t)=\mathbf{x}(t)+\tau \mathbf{v}(t)$$ , with anticipation increment $$\tau >0$$ . As a special case, such systems yield the celebrated Cucker–Smale model for alignment, coupled with pairwise interactions. Viewed from this perspective, such anticipation-driven systems are expected to emerge into flocking due to alignment of velocities, and spatial concentration due to confining potentials. We treat both the discrete dynamics and large crowd hydrodynamics, proving the decisive role of anticipation in driving such systems with attractive potentials into velocity alignment and spatial concentration. We also study the concentration effect near equilibrium for anticipated-based dynamics of pair of agents governed by attractive–repulsive potentials.

We study the large-time behavior of a hydrodynamic model which describes the collective behavior of continuum of agents, driven by pairwise alignment interactions with additional external potential forcing. The external force tends to compete with the alignment which makes the large time behavior very different from the original Cucker–Smale (CS) alignment model, and far more interesting. Here we focus on uniformly convex potentials. In the particular case of quadratic potentials, we are able to treat a large class of admissible interaction kernels, $$\phi (r) > rsim (1+r^2)^{-\beta }$$ with ‘thin’ tails $$\beta \leqslant 1$$ —thinner than the usual ‘fat-tail’ kernels encountered in CS flocking $$\beta \leqslant \nicefrac {1}{2}$$ ; we discover unconditional flocking with exponential convergence of velocities and positions towards a Dirac mass traveling as harmonic oscillator. For general convex potentials, we impose a stability condition, requiring a large enough alignment kernel to avoid crowd scattering. We then prove, by hypocoercivity arguments, that both the velocities and positions of a smooth solution must flock. We also prove the existence of global smooth solutions for one and two space dimensions, subject to critical thresholds in initial configuration space. It is interesting to observe that global smoothness can be guaranteed for sub-critical initial data, independently of the apriori knowledge of large time flocking behavior.

Entropy stability plays an important role in the dynamics of nonlinear systems of hyperbolic conservation laws and related convection-diffusion equations. Here we are concerned with the corresponding question of numerical entropy stability --- we review a general framework for designing entropy stable approximations of such systems. The framework, developed in [28,29] and in an ongoing series of works [30,6,7], is based on comparing numerical viscosities to certain entropy-conservative schemes. It yields precise characterizations of entropy stability which is enforced in rarefactions while keeping sharp resolution of shocks. &nbsp We demonstrate this approach with a host of second-- and higher--order accurate schemes, ranging from scalar examples to the systems of shallow-water, Euler and Navier-Stokes equations. We present a family of energy conservative schemes for the shallow-water equations with a well-balanced description of their steady-states. Numerical experiments provide a remarkable evidence for the different roles of viscosity and heat conduction in forming sharp monotone profiles in Euler equations, and we conclude with the computation of entropic measure-valued solutions based on the class of so-called TeCNO schemes --- arbitrarily high-order accurate, non-oscillatory and entropy stable schemes for systems of conservation laws.

We study the large-time behavior of continuum alignment dynamics based on Cucker-Smale (CS)-type interactions which involve short-range kernels, that is, communication kernels with support much smaller than the diameter of the crowd. We show that if the amplitude of the interactions is larger than a finite threshold, then unconditional hydrodynamic flocking follows. Since we do not impose any regularity nor do we require the kernels to be bounded, the result covers both regular and singular interaction kernels. Moreover, we treat initial densities in the general class of compactly supported measures which are required to have positive mass on average (over balls at small enough scale), but otherwise vacuum is allowed at smaller scales. Consequently, our arguments of hydrodynamic flocking apply, mutatis mutandis, to the agent-based CS model with finitely many Dirac masses. In particular, discrete flocking threshold is shown to depend on the number of dense clusters of communication but otherwise does not grow with the number of agents.

We develop a second-order well-balanced central-upwind scheme for the compressible Euler equations with gravitational source term. Here, we advocate a new paradigm based on a purely conservative reformulation of the equations using global fluxes. The proposed scheme is capable of exactly preserving steady-state solutions expressed in terms of a nonlocal equilibrium variable. A crucial step in the construction of the second-order scheme is a well-balanced piecewise linear reconstruction of equilibrium variables combined with a well-balanced central-upwind evolution in time, which is adapted to reduce the amount of numerical viscosity when the flow is at (near) steady-state regime. We show the performance of our newly developed central-upwind scheme and demonstrate importance of perfect balance between the fluxes and gravitational forces in a series of one- and two-dimensional examples.

We study the systems of Euler equations which arise from agent-based dynamics driven by velocity \emph{alignment}. It is known that smooth solutions of such systems must flock, namely -- the large time behavior of the velocity field approaches a limiting "flocking" velocity. To address the question of global regularity, we derive sharp critical thresholds in the phase space of initial configuration which characterize the global regularity and hence flocking behavior of such \emph{two-dimensional} systems. Specifically, we prove for that a large class of \emph{sub-critical} initial conditions such that the initial divergence is "not too negative" and the initial spectral gap is "not too large", global regularity persists for all time.

In this paper, we establish analyticity of the Navier–Stokes equations with small data in critical Besov spaces \({\dot{B}^{\frac{3}{p}-1}_{p,q}}\) . The main method is Gevrey estimates, the choice of which is motivated by the work of Foias and Temam (Contemp Math 208:151–180, 1997). We show that mild solutions are Gevrey regular, that is, the energy bound \({\|e^{\sqrt{t}\Lambda}v(t)\|_{E_p}>\infty}\) holds in \({E_p:=\tilde{L}^{\infty}(0,T;\dot{B}^{\frac{3}{p}-1}_{p,q})\cap \tilde{L}^{1}(0,T;\dot{B}^{\frac{3}{p}+1}_{p,q})}\) , globally in time for p < ∞. We extend these results for the intricate limiting case p = ∞ in a suitably designed E∞ space. As a consequence of analyticity, we obtain decay estimates of weak solutions in Besov spaces. Finally, we provide a regularity criterion in Besov spaces.

We design efficient numerical schemes for approximating the MHD equations in multi-dimensions. Numerical approximations must be able to deal with the complex wave structure of the MHD equations and the divergence constraint. We propose schemes based on the genuinely multi-dimensional (GMD) framework of [S. Mishra and E. Tadmor, Commun. Comput. Phys. 9 (2010) 688–710; S. Mishra and E. Tadmor, SIAM J. Numer. Anal. 49 (2011) 1023–1045]. The schemes are formulated in terms of vertex-centered potentials . A suitable choice of the potential results in GMD schemes that preserve a discrete version of divergence. First- and second-order divergence preserving GMD schemes are tested on a series of benchmark numerical experiments. They demonstrate the computational efficiency and robustness of the GMD schemes.

In this paper we present two versions of the central local discontinuous Galerkin (LDG) method on overlapping cells for solving diffusion equations, and provide their stability analysis and error estimates for the linear heat equation. A comparison between the traditional LDG method on a single mesh and the two versions of the central LDG method on overlapping cells is also made. Numerical experiments are provided to validate the quantitative conclusions from the analysis and to support conclusions for general polynomial degrees.

We consider constraint preserving multidimensional evolution equations. A prototypical example is provided by the magnetic induction equation of plasma physics. The constraint of interest is the divergence of the magnetic field. We design finite volume schemes which approximate these equations in a stable manner and preserve a discrete version of the constraint. The schemes are based on reformulating standard edge centered finite volume fluxes in terms of vertex centered potentials. The potential-based approach provides a general framework for faithful discretizations of constraint transport and we apply it to both divergence preserving as well as curl preserving equations. We present benchmark numerical tests which confirm that our potential-based schemes achieve high resolution, while being constraint preserving.

We improve the recent result of Chae and Tadmor (2008) [10] proving a one-sided threshold condition which leads to a finite-time breakdown of the Euler–Poisson equations in arbitrary dimension n .

Motivated by the hierarchical multiscale image representation of Tadmor et. al., (25), we propose a novel integro-differential equation (IDE) for a multiscale image representation. To this end, one integrates in inverse scale space a succession of refined, recursive 'slices' of the image, which are balanced by a typical curvature term at the finer scale. Although the original moti- vation came from a variational approach, the resulting IDE can be extended using standard techniques from PDE-based image processing. We use filtering, edge preserving and tangential smoothing to yield a family of modified IDE models with applications to image denoising and image deblurring problems. The IDE models depend on a user scaling function which is shown to dictate the BV ∗ properties of the residual error. Numerical experiments demonstrate application of the IDE approach to denoising and deblurring.

We propose three novel methods for recovering edges in piecewise smooth functions from their possibly incomplete and noisy spectral information. The proposed methods utilize three different approaches: #1. The randomly-based sparse Inverse Fast Fourier Transform (sIFT); #2. The Total Variation-based (TV) compressed sensing; and #3. The modified zero crossing. The different approaches share a common feature: edges are identified through separation of scales. To this end, we advocate here the use of concentration kernels (Tadmor, Acta Numer. 16:305–378, 2007), to convert the global spectral data into an approximate jump function which is localized in the immediate neighborhoods of the edges. Building on these concentration kernels, we show that the sIFT method, the TV-based compressed sensing and the zero crossing yield effective edge detectors, where finitely many jump discontinuities are accurately recovered. One- and two-dimensional numerical results are presented.

We prove stability and derive error estimates for the recently introduced central discontinuous Galerkin method, in the context of linear hyperbolic equations with possibly discontinuous solutions. A comparison between the central discontinuous Galerkin method and the regular discontinuous Galerkin method in this context is also made. Numerical experiments are provided to validate the quantitative conclusions from the analysis.

We prove that the one-dimensional Euler�Poisson system driven by the Poisson forcing together with the usual $\gamma$-law pressure, $\gamma \geq 1$, admits global solutions for a large class of initial data. Thus, the Poisson forcing regularizes the generic finite-time breakdown in the 2x2 p-system. Global regularity is shown to depend on whether or not the initial configuration of the Riemann invariants and density crosses an intrinsic critical threshold.

We prove the finite time blow-up for $C^1$ solutions of the attractive Euler-Poisson equations in $\Bbb R^{2}$, $n\geq1$, with and without background state, for a large set of ’generic’ initial data. We characterize this supercritical set by tracing the spectral dynamics of the deformation and vorticity tensors.

We are concerned here with processing discontinuous functions from their spectral information. We focus on two main aspects of processing such piecewise smooth data: detecting the edges of a piecewise smooth f, namely, the location and amplitudes of its discontinuities; and recovering with high accuracy the underlying function in between those edges. If f is a smooth function, say analytic, then classical Fourier projections recover f with exponential accuracy. However, if f contains one or more discontinuities, its global Fourier projections produce spurious Gibbs oscillations which spread throughout the smooth regions, enforcing local loss of resolution and global loss of accuracy. Our aim in the computation of the Gibbs phenomenon is to detect edges and to reconstruct piecewise smooth functions, while regaining the high accuracy encoded in the spectral data.To detect edges, we utilize a general family of edge detectors based on concentration kernels. Each kernel forms an approximate derivative of the delta function, which detects edges by separation of scales. We show how such kernels can be adapted to detect edges with one- and two-dimensional discrete data, with noisy data, and with incomplete spectral information. The main feature is concentration kernels which enable us to convert global spectral moments into local information in physical space. To reconstruct f with high accuracy we discuss novel families of mollifiers and filters. The main feature here is making these mollifiers and filters adapted to the local region of smoothness while increasing their accuracy together with the dimension of the data. These mollifiers and filters form approximate delta functions which are properly parametrized to recover f with (root-) exponential accuracy.

We prove in this paper new velocity-averaging results for second-order multidimensional equations of the general form L(∇x ,v )f (x ,v ) = g(x ,v )where L(∇x ,v ):= a(v) ·∇ x −∇ � ·b(v)∇x. These results quantify the Sobolev regularity of the averages, � v f (x, v)φ(v)dv, in terms of the nondegeneracy of the set

We prove the existence of a weak solution to a two-dimensional resonant 3x3 system of conservation laws with BV initial data. Due to possible resonance (coinciding eigenvalues), spatial BV estimates are in general not available. Instead, we use an entropy dissipation bound combined with the time translation invariance property of the system to prove existence based on a two-dimensional compensated compactness argument adapted from the paper of Tadmor, Rascle and Bagnerini, "Compensated compactness for 2D conservation laws", [JHDEs 2(3):697--712, 2005]. Existence is proved under the assumption that the flux functions in the two directions are linearly independent.

We study the critical thresholds for the compressible pressureless Euler equations with pairwise attractive or repulsive interaction forces and non-local alignment forces in velocity in one dimension. We provide a complete description for the critical threshold to the system without interaction forces leading to a sharp dichotomy condition between global-in-time existence or finite-time blowup of strong solutions. When the interaction forces are considered, we also give a classification of the critical thresholds according to the different type of interaction forces. We also remark on global-in-time existence when the repulsion is modeled by the isothermal pressure law.

We construct a new family of entropy stable difference schemes which retain the precise entropy decay of the Navier–Stokes equations, [Formula: see text] To this end we employ the entropy conservative differences of [24] to discretize Euler convective fluxes, and centered differences to discretize the dissipative fluxes of viscosity and heat conduction. The resulting difference schemes contain no artificial numerical viscosity in the sense that their entropy dissipation is dictated solely by viscous and heat fluxes. Numerical experiments provide a remarkable evidence for the different roles of viscosity and heat conduction in forming sharp monotone profiles in the immediate neighborhoods of shocks and contacts.

We introduce a new class of exponentially accurate filters for processing piecewise smooth spectral data. Our study is based on careful error decompositions, focusing on a rather precise balance between physical space localization and the usual moments condition. Exponential convergence is recovered by optimizing the order of the filter as an adaptive function of both the projection order and the distance to the nearest discontinuity. Combined with the automated edge detection methods, e.g. Gelb & Tadmor (2002, Math. Model. Numer. Anal., 36, 155–175), adaptive filters provide a robust, computationally efficient, black box procedure for the exponentially accurate reconstruction of a piecewise smooth function from its spectral information.

The computations reported in this paper demonstrate the remarkable versatility of central schemes as black-box, Jacobian-free solvers for ideal magnetohydrodynamics (MHD) equations. Here we utilize a family of high-resolution, non-oscillatory central schemes for the approximate solution of the one- and two-dimensional MHD equations. We present simulations based on staggered grids of several MHD prototype problems. Solution of one-dimensional shock-tube problems is carried out using second- and third-order central schemes [Numer. Math. 79 (1998) 397; J. Comput. Phys. 87 (2) (1990) 408], and we use the second-order central scheme [SIAM J. Sci Comput. 19 (6) (1998) 1892] which is adapted for the solution of the two-dimensional Kelvin-Helmholtz and Orszag-Tang problems. A qualitative comparison reveals an excellent agreement with previous results based on upwind schemes. Central schemes, however, require little knowledge about the eigenstructure of the problem in fact, we even avoid an explicit evaluation of the corresponding Jacobians, while at the same time they eliminate the need for dimensional splitting.

We prove that bounded solutions of the vanishing hyper-viscosity equation, ut + f(u)x +( 1) s "@ 2s x u = 0 converge to the entropy solution of the corresponding convex conservation law ut+f(u)x =0 ,f 00 > 0. The hyper-viscosity case, s> 1, lacks the monotonicity which underlines the Krushkov BV theory in the viscous case s = 1. Instead we show how to adapt the Tartar-Murat compensated compactness theory together with a weaker entropy dissipation bound to conclude the convergence of the vanishing hyper-viscosity.

We study the entropy stability of difference approximations to nonlinear hyperbolic conservation laws, and related time-dependent problems governed by additional dissipative and dispersive forcing terms. We employ a comparison principle as the main tool for entropy stability analysis, comparing the entropy production of a given scheme against properly chosen entropy-conservative schemes.To this end, we introduce general families of entropy-conservative schemes, interesting in their own right. The present treatment of such schemes extends our earlier recipe for construction of entropy-conservative schemes, introduced in Tadmor (1987b). The new families of entropy-conservative schemes offer two main advantages, namely, (i) their numerical fluxes admit an explicit, closed-form expression, and (ii) by a proper choice of their path of integration in phase space, we can distinguish between different families of waves within the same computational cell; in particular, entropy stability can be enforced on rarefactions while keeping the sharp resolution of shock discontinuities.A comparison with the numerical viscosities associated with entropy-conservative schemes provides a useful framework for the construction and analysis of entropy-stable schemes. We employ this framework for a detailed study of entropy stability for a host of first- and second-order accurate schemes. The comparison approach yields a precise characterization of the entropy stability of semi-discrete schemes for both scalar problems and systems of equations.We extend these results to fully discrete schemes. Here, spatial entropy dissipation is balanced by the entropy production due to time discretization with a suffciently small time-step, satisfying a suitable CFL condition. Finally, we revisit the question of entropy stability for fully discrete schemes using a different approach based on homotopy arguments. We prove entropy stability under optimal CFL conditions.

We report here on our numerical study of the two-dimensional Riemann problem for the com- pressible Euler equations. Compared with the relatively simple 1-D congurations, the 2-D case consists of a plethora of geometric wave patterns which pose a computational challenge for high- resolution methods. The main feature in the present computations of these 2-D waves is the use of the Riemann-solvers-free central schemes presented in (11). This family of central schemes avoids the intricate and time-consuming computation of the eigensystem of the problem, and hence oers a considerably simpler alternative to upwind methods. The numerical results illustrate that despite their simplicity, the central schemes are able to recover with comparable high-resolution, the various features observed in the earlier, more expensive computations. AMS subject classication: Primary 65M10; Secondary 65M05

This paper addresses the recovery of piecewise smooth functions from their discrete data. Reconstruction methods using both pseudo-spectral coecients and physical space interpolants have been discussed extensively in the literature, and it is clear that an ap rioriknowledge of the jump discontinuity location is essential for any reconstruction technique to yield spectrally accurate results with high resolution near the discontinuities. Hence detection of the jump discontinuities is critical for all methods. Here we formulate a new localized reconstruction method adapted from the method developed in Gottlieb and Tadmor (1985) and recently revisited in Tadmor and Tanner (in press). Our procedure incorporates the detection of edges into the reconstruction technique. The method is robust and highly accurate, yielding spectral accuracy up to a small neighborhood of the jump discontinuities. Results are shown in one and two dimensions.

We study the semi-classical limit of the nonlinear Schrodinger-Poisson (NLSP) equa- tion for initial data of the WKB type. The semi-classical limit in this case is realized in terms of a density-velocity pair governed by the Euler-Poisson equations. Recently we have shown in (ELT, Indiana Univ. Math. J., 50 (2001), 109-157), that the isotropic Euler-Poisson equations admit a critical threshold phenomena, where initial data in the sub-critical regime give rise to globally smooth solutions. Consequently, we justify the semi-classical limit for sub-critical NLSP initial data and confirm the validity of the WKB method.

We introduce a new ladder of function spaces which is shown to fill in the gap between the weak $L^{p\infty}$ spaces and the larger Morrey spaces, $M^p$. Our motivation for introducing these new spaces, denoted $\V^{pq}$, is to gain a more accurate information on (compact) embeddings of Morrey spaces in appropriate Sobolev spaces. It is here that the secondary parameter q (-- and a further logarithmic refinement parameter $\alpha$, denoted $\V^{pq}(\log \V)^{\alpha}$) gives a finer scaling, which allows us to make the subtle distinctions necessary for embedding in spaces with a fixed order of smoothness. We utilize an $H^{-1}$-stability criterion which we have recently introduced in {Lopes Filho M C, Nussenzveig Lopes H J and Tadmor E 2001 Approximate solution of the incompressible Euler equations with no concentrations Ann. Institut H Poincare C 17 371-412}, in order to study the strong convergence of approximate Euler solutions. We show how the new refined scale of spaces, $\V^{pq}(\log \V)^{\alpha}$, enables us approach the borderline cases which separate between $H^{-1}$-compactness and the phenomena of concentration-cancelation. Expressed in terms of their $\V^{pq}(\log \V)^{\alpha}$ bounds, these borderline cases are shown to be intimately related to uniform bounds of the total (Coulomb) energy and the related vorticity configuration.

We present a preliminary study of a new phenom- ena associated with the Euler-Poisson equations — the so called critical threshold phenomena, where the answer to questions of global smoothness vs. finite time breakdown depends on whether the initial configuration crosses an intrinsic,ON1O critical thresh- old. We investigate a class of Euler-Poisson equations, ranging from one-dimensional problems with or without various forcing mech- anisms to multi-dimensional isotropic models with geometrical symmetry. These models are shown to admit a critical thresh- old which is reminiscent of the conditional breakdown of waves on the beach; only waves above certain initial critical threshold experience finite-time breakdown, but otherwise they propagate smoothly. At the same time, the asymptotic long time behavior of the solutions remains the same, independent of crossing these initial thresholds. A case in point is the simple one-dimensional problem where the unforced inviscid Burgers' solution always forms a shock dis- continuity, except for the non-generic case of increasing initial profile,u 0 0. In contrast, we show that the corresponding one- dimensional Euler-Poisson equation with zero background has global smooth solutions as long as its initialN0;u 0O-configuration satisfiesu 0 p 2k0 - see (2.11) below, allowing a finite, crit- ical negative velocity gradient. As is typical for such nonlinear convection problems, one is led to a Ricatti equation which is balanced here by a forcing acting as a 'nonlinear resonance', and which in turn is responsible for this critical threshold phenom- ena.

We present a sharp local condition for the lack of concentrations in (and hence the L 2 convergence of) sequences of approximate solutions to the incompressible Euler equations. We apply this characterization to greatly simplify known existence results for 2D flows in the full plane (with special emphasis on rearrangement invariant regularity spaces), and obtain new existence results of solutions without energy concentrations in any number of spatial dimensions. Our results identify the 'critical' regularity which prevents concentra- tions, regularity which is quantified in terms of Lebesgue, Lorentz, Orlicz and Morrey spaces. Thus, for example, the strong convergence criterion cast in terms of circulation logarithmic decay rates due to DiPerna and Majda is simplified (removing the weak control of the vorticity at infin- ity) and extended (to any number of space dimensions). Our approach relies on using a generalized div-curl lemma (interesting for its own sake) to replace the role that elliptic regularity theory has

In this paper we construct, analyze and implement a new procedure for the spectral approximations of nonlinear conservation laws. It is well known that using spectral methods for nonlinear conservation laws will result in the formation of the Gibbs phenomenon once spontaneous shock discontinuities appear in the solution. These spurious oscillations will in turn lead to loss of resolution and render the standard spectral approximations unstable. The Spectral Viscosity (SV-) method (Tadmor, 1989) was developed to stabilize the spectral method by adding a spectrally small amount of high-frequencies diffusion carried out in the dual space. The resulting SV-approximation is stable without sacrificing spectral accuracy. The SV-method recovers a spectrally accurate approximation to the projection of the entropy solution; the exact projection, however, is at best a first order approximation to the exact solution as a result of the formation of the shock discontinuities. The issue of spectral resolution is addressed by post-processing the SV-solution to remove the spurious oscillations at the discontinuities, as well as increase the first-order—O.1=N/ accuracy away from the shock discontinuities. Successful post-processing methods have been developed to eliminate the Gibbs phenomenon and recover spectral accuracy for the SV-approximation. However, such reconstruction methods require a priori knowledge of the locations of the shock discontinuities. Therefore, the detection of these discontinuities is essential to obtain an overall spectrally accurate solution. To this end, we employ the recently constructed enhanced edge detectorsbased on appropriate concentration factors (Gelb and Tadmor, 1999). Once the edges of these discontinuities are identified, we can utilize a post-processing reconstruction method, and show that the post-processed SV-solution recovers the exact entropy solution with remarkably high-resolution. We apply our new numerical method, the Enhanced SV-method, to two numerical examples, the scalar periodic Burgers’ equation and the one-dimensional system of Euler equations of gas dynamics. Both approximations exhibit high accuracy and resolution to the exact entropy solution. © 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.

We introduce a new high-resolution central scheme for multidimensional Hamilton?Jacobi equations. The scheme retains the simplicity of the non-oscillatory central schemes developed by C.-T. Lin and E. Tadmor (in press, SIAM J. Sci. Comput.), yet it enjoys a smaller amount of numerical viscosity, independent of 1/?t. By letting ?t?0 we obtain a new second-order central scheme in the particularly simple semi-discrete form, along the lines of the new semi-discrete central schemes recently introduced by the authors in the context of hyperbolic conservation laws. Fully discrete versions are obtained with appropriate Runge?Kutta solvers. The smaller amount of dissipation enables efficient integration of convection-diffusion equations, where the accumulated error is independent of a small time step dictated by the CFL limitation. The scheme is non-oscillatory thanks to the use of nonlinear limiters. Here we advocate the use of such limiters on second discrete derivatives, which is shown to yield an improved high resolution when compared to the usual limitation of first derivatives. Numerical experiments demonstrate the remarkable resolution obtained by the proposed new central scheme.