Eitan Tadmor

Eitan Tadmor

Auto-generated profile, based on publicly available information

Eitan Tadmor

Department of Mathematics and Institute for Physical Science & Technology, University of Maryland, College Park, MD, 20742

Research Focus & Metrics

Academic Career Length

52Years (1975-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2001 in SIAM Review
Verified
Journal Article
Closed access
SGSigal Gottlieb
Sigal Gottlieb
CSChi-Wang Shu
Chi-Wang Shu
ETEitan Tadmor
Eitan Tadmor
In this paper we review and further develop a class of strong stability-preserving (SSP) high-order time discretizations for semidiscrete method of lines approximations of partial differential equations. Previously termed TVD (total variation diminishing) time discretizations, these high-order time discretization methods preserve the strong stability properties of first-order Euler time stepping and have proved very useful, especially in solving hyperbolic partial differential equations. The new developments in this paper include the construction of optimal explicit SSP linear Runge--Kutta methods, their application to the strong stability of coercive approximations, a systematic study of explicit SSP multistep methods for nonlinear problems, and the study of the SSP property of implicit Runge--Kutta and multistep methods.

1 May 2000 in Journal of Computational Physics
Verified
Journal Article
Closed access
Alexander KurganovAlexander Kurganov
Alexander Kurganov
ETEitan Tadmor
Eitan Tadmor

1 April 1990 in Journal of Computational Physics
Verified
Journal Article
Closed access
HNHaim Nessyahu
Haim Nessyahu
ETEitan Tadmor
Eitan Tadmor

1 January 2008 in Kinetic and Related Models
Verified
Journal Article
Closed access
PDF file
SHSeung-Yeal Ha
Seung-Yeal Ha
ETEitan Tadmor
Eitan Tadmor
We discuss the Cucker-Smale's (C-S) particle model for flocking, deriving precise conditions for flocking to occur when pairwise interactions are sufficiently strong long range. We then derive a Vlasov-type kinetic model for the C-S particle model and prove it exhibits time-asymptotic flocking behavior for arbitrary compactly supported initial data. Finally, we introduce a hydrodynamic description of flocking based on the C-S Vlasov-type kinetic model and prove flocking behavior without closure of higher moments.

1 January 2014 in SIAM Review
Verified
Journal Article
Closed access
SMSebastien Motsch
Sebastien Motsch
ETEitan Tadmor
Eitan Tadmor
We review a general class of models for self-organized dynamics based on alignment. The dynamics of such systems is governed solely by interactions among individuals or “agents,” with the tendency to adjust to their “environmental averages.” This, in turn, leads to the formation of clusters, e.g., colonies of ants, flocks of birds, parties of people, rendezvous in mobile networks, etc. A natural question which arises in this context is to ask when and how clusters emerge through the self-alignment of agents, and what types of “rules of engagement” influence the formation of such clusters. Of particular interest to us are cases in which the self-organized behavior tends to concentrate into one cluster, reflecting a consensus of opinions, flocking of birds, fish, or cells, rendezvous of mobile agents, and, in general, concentration of other traits intrinsic to the dynamics. Many standard models for self-organized dynamics in social, biological, and physical sciences assume that the intensity of alignment increases as agents get closer, reflecting a common tendency to align with those who think or act alike. Moreover, “similarity breeds connection” reflects our intuition that increasing the intensity of alignment as the difference of positions decreases is more likely to lead to a consensus. We argue here that the converse is true: when the dynamics is driven by local interactions, it is more likely to approach a consensus when the interactions among agents increase as a function of their difference in position. Heterophily, the tendency to bond more with those who are different rather than with those who are similar, plays a decisive role in the process of clustering. We point out that the number of clusters in heterophilious dynamics decreases as the heterophily dependence among agents increases. In particular, sufficiently strong heterophilious interactions enhance consensus.

1 May 2003 in Acta Numerica
Verified
Journal Article
Closed access
PDF file
ETEitan Tadmor
Eitan Tadmor
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.