Eitan Tadmor is a Distinguished University Professor ...

Research accomplishments
Eitan Tadmor is well known for ...

Professional profile (selected items) ...

Key words (with selected references) ...

Career narrative including ten principal publications
and significant contributions listed below (other lists by [subject] and [chronological] order)

    High-resolution approximations of nonlinear conservation laws

    1 Non-oscillatory central differencing for hyperbolic conservation laws
    H. Nessyahu and E. Tadmor, J. of Computational Physics 87 (1990) 408–463.

    This paper introduced the Nessyahu-Tadmor scheme --- the forerunner for the class of high-resolution "central schemes", which offer black-box solvers for a wide variety of problems governed by multi-dimensional systems of non-linear conservation laws and related PDEs, consult CentPack. Related follow-up work can be found in the 1990 JCP work with A. Kurganov on New high resolution central schemes for nonlinear conservation laws and convection-diffusion equations.

    2 Local error estimates for discontinuous solutions of nonlinear hyperbolic equations
    E. Tadmor, SIAM J. Numerical Analysis 28 (1991) 891-906.

    This paper introduced a novel L1-convergence rate theory for nonlinear conservation laws and related Hamilton-Jacobi equations. The theory, based on one-sided stability estimates, provides an alternative to the standard Krushkov-Kuznetzov theory and led to optimal L1-convergence rates. A large body of related works, including the 2001 work (with C.-T Lin) on L1-stability and error estimates for approximate Hamilton-Jacobi solutions can be found here.

    3 ENO reconstruction and ENO interpolation are stable (+errata)
    U. Fjordholm, S. Mishra and E. Tadmor, Foundations of Computational Math. 13(2) (2012), 139-159.

    The ENO reconstruction procedure was introduced in 1987 by Harten et. al. in the context of accurate simulations for piecewise smooth solutions of nonlinear conservation laws. Despite the extensive literature on the construction and implementation of ENO method and its variants, the question of its stability remained open during the last 25 years. Here we prove that the ENO reconstruction and ENO interpolation procedures are stable in the sense that the size of the of the jumps after ENO reconstruction relative to the jump of the underlying cell averages is bounded. These estimates, which are shown to hold for ENO reconstruction and interpolation of arbitrary order of accuracy and on non-uniform meshes, indicate a remarkable rigidity of the piecewise-polynomial ENO procedure.

    Kinetic formulation and regularizing effects in
       nonlinear conservation laws and related problems

    4 A kinetic formulation of multidimensional scalar conservation laws and related equations
    P.-L. Lions, B. Perthame and E. Tadmor, J. American Math. Society 7 (1994) 169–191.

    This paper provides a systematic treatment of kinetic formulation of entropic solutions for nonlinear conservation laws and related convection-diffusion equations and the first derivation of regularizing effects using the averaging lemma. It was followed by a large body of works which utilized the kinetic formulation and their new regularizing effects for conservation laws, related degenerate equations and their numerical approximations. In particular, a follow-up 1994 CMP work with P.-L. Lions and B. Perthame on Kinetic formulation of the isentropic gas dynamics and p-systems.

    5 Velocity averaging, kinetic formulations and regularizing effects in quasi-linear PDEs
    E. Tadmor and Terence Tao, Communications Pure & Applied Mathematics 60 (2007), 1488–1521.

    The present paper provides the first quantitative velocity averaging result for second order equations, thus paving the way for a full family of new results for regularizing effects in second-order degenerate nonlinear parabolic equations, in particular in the anisotropic cases where relatively little was known prior to this contribution. The method of proof is based on a delicate multipliers techniques, dyadic decomposition and refined estimates on Littlewood-Paley blocks to verify the so-called "truncation property".

    The spectral viscosity method —
       computation of the Gibbs phenomenon

    6 Recovering pointwise values of discontinuous data within spectral accuracy
    D. Gottlieb and E. Tadmor, in “Progress and Supercomputing in Computational Fluid Dynamics”, Proc. 1984 U.S.-Israel Workshop on Progress in Scientific Computing, Vol. 6 (E. M. Murman and S. S. Abarbanel, eds.), Birkhauser, Boston (1985) 357-375 [SIAM Rev 28(4) 1986].

    Here we show how the pointvalues of a piecewise smooth function can be recovered from its spectral content, so that the accuracy depend solely on the local smoothness. This paper was the forerunner for large body of work which followed on the 90s and 00s, on computation of the Gibbs phenomenon (Gottlieb, Shu, Gelb, Tanner and others). In particular, these Gottlieb--Tadmor mollifiers were subsequently improved to (root-) exponential accuracy (with J. Tanner) and motivated the development of effective spectral edge detectors (with A. Gelb).

    7 Convergence of spectral methods for nonlinear conservation laws
    E. Tadmor, SIAM J. Numerical Analysis 26 (1989) 30–44.

    The Spectral Viscosity (SV) method was developed in 1989 as a systematic approach for treating shock discontinuities in spectral calculations, by adding a spectrally small amount of high-frequencies diffusion. The resulting SV-approximation is stable without sacrificing spectral accuracy, recovering a spectrally accurate approximation of (the projection of the) entropy solution. Subsequently, the SV method was implemented by many practitioners in highly accurate spectral computations of nonlinear equations; consult here.

    8 Filters, mollifiers and the computation of the Gibbs phenomenon
    E. Tadmor, Acta Numerica 16 (2007) 305-378.

    This 2007 Acta Numerica review contains a summary of the developments during 1985-2007 on detection of edges in pieciewise smooth spectral data and the high resolution reconstriction of the data between those edges.

    Critical thresholds in Eulerian dynamics

    9 Spectral dynamics of the velocity gradient field in restricted flows
    H. Liu and E. Tadmor, Communications in Mathematical Physics 228 (2002), 435–466.

    In this paper we initiate a systematic study of global regularity vs. finite time blow-up gradients of the fundamental Eulerian equation, ut+ u·∇xu= F, which shows up in different contexts dictated by the different modeling of F's. The analysis is based on the spectral dynamics tracing the eigenvalues of the velocity gradient which determine the boundaries of the critical threshold surfaces in configuration space. It led to a large body of work which demonstrated \emph{a generic scenario of critical threshold phenomena}, where global regularity depends on the initial configurations of density, velocity divergence and the spectral gap of the 2×2 velocity gradient. This includes showing that rotational forcing prolongs the life-span of sub-critical 2D shallow-water solutions, global regularity results for sub-critical 2D restricted Euler-Poisson and for 3D radial Euler-Poisson equations, and a surprising global existence result for a large set of sub-critical initial data in the 4D restricted Euler eqs. Additional refrences can be found here

    Entropy stability —
       difference approximations of nonlinear conservation laws

    10 Entropy stability theory for difference approximations of nonlinear conservation laws and related time dependent problems
    E. Tadmor, Acta Numerica 12 (2003), 451-512.

    Entropy stability plays an important role in the dynamics of nonlinear systems of conservation laws and related convection-diffusion equations. The paper provides a state-of-the-art summary for the a body of works during 1987-2007 on the topic of entropy stability (beginning with the 1987 Math. Comp. work The numerical viscosity of entropy stable schemes for systems of conservation laws. I. Here, we developed a general theory of entropy stability for difference approximations for nonlinear equations, which provides precise characterization of entropy stability using comparison principles. In particular, we construct a new family of entropy stable schemes which retain the precise entropy decay of the Navier-Stokes equations. They contain no artificial numerical viscosity. The theory can be found in the follow-up developments here.

    11 Construction of approximate entropy measure-valued solutions for hyperbolic systems of conservation laws
    U. Fjordholm, R. Kappeli S. Mishra and E. Tadmor, Foundations of Computational Mathematics 17 (2017) 763-827.

    We present the first detailed numerical procedure which constructs stable approximations to entropy measure valued solutions and provide sufficient conditions that guarantee these approximations converge to an entropy measure valued solution as the mesh is refined, thus providing a viable numerical framework for systems of conservation laws in several space dimensions. A large number of numerical experiments that illustrate the proposed schemes are presented and are utilized to examine several interesting properties of the computed entropy measure valued solutions.
    A broader view of our paradigm for the computation of measure-valued solutions of both --- compressible and incompressible Euler equations, is surveyed in this 2016 Acta Numerica article.

    Numerical methods for PDEs —
       translatory boundary conditions, SSP time-discretizations, ...

    12 Scheme-independent stability criteria for difference approximations of hyperbolic initial-boundary value problems. II
    M. Goldberg and E. Tadmor, Mathematics of Computation 36 (1981) 603–626.

    The development of easily checkable stability criteria for finite-difference approximations of initial boundary value systems with translatory boundary conditions. This led a series of works in the eighties, and it became a standard tool in the stability theory for approximations of initial-boundary value problem of hyperbolic type.

    13 High order time discretization methods with the strong stability property
    S. Gottlieb, C.-W. Shu and E. Tadmor, SIAM Review 43 (2001) 89–112.

    We construct, analyze and implement the class of strong stability-preserving (SSP) high-order time discretizations for semi-discrete method of lines approximations of PDEs. These high-order methods preserve the strong stability properties of first-order Euler time stepping and have proved very useful, especially in solving hyperbolic PDEs. Since its publication in 2001, this work has become a standard reference on SSP solvers.

    Hierarchical decompositions —
       applications to image processing and PDEs

    14a A multiscale image representation using hierarchical (BV, L2) decompositions
    E. Tadmor, S. Nezzar and L. Vese, Multiscale Modeling & Simulation 2 (2004) 554–579.

    The paper introduces a novel hierarchical decomposition of images, the forerunner of recently developed iteration methods in image processing. Questions of convergence, energy decomposition, localization and adaptivity are discussed. Subsequently, our approach was used in applications to synthetic and real images. The approach developed here was pursued in a series of works, including the 2011 SIAM J. Imaging Sciences paper with P. Athavale on Integro-differential equations based on (BV, L1) image decomposition. Additional refrences can be found here.

    14b Hierarchical construction of bounded solutions in critical regularity spaces
    Communications in Pure & Applied Mathematics 69(6) (2016) 1087-1109.

    We use a multi-scale approach to construct uniformly bounded solutions of div(U)=f for general f's in the critical regularity space Ld(Td). The study of this equation and related problems was motivated by results of Bourgain & Brezis. The intriguing critical aspect here is that although the problems are linear, construction of their solution is not. These constructions are special cases of a rather general framework for solving linear equations LU=f in critical regularity spaces (U,f)∈ (X,Lp(Td)). The solutions are realized in terms of nonlinear hierarchical representations U=∑j uj which we introduced earlier in the context of image processing. The uj's are constructed recursively as proper minimizers, yielding the hierarchical decomposition of “images” U.

    Self-organized dynamics — flocking and opinion dynamics

    15 Heterophilious dynamics enhances consensus
    S. Motsch and E. Tadmor, SIAM Review 56(4) (2014) 577–621 (with Introduction by D. J. Higham).

    Nature and human societies offer many examples of self-organized behavior. Ants form colonies, birds fly in flocks, mobile networks coordinate a rendezvous, and human opinions evolve into parties. These are simple examples of collective dynamics that tend to self-organize into large-scale clusters of colonies, flocks, parties, etc. We review a general class of models for self-organized dynamics based on alignment. Prototypical examples are the local Hegselmann-Krause model for opinion dynamics, and the Vicsek model for flocking, the global Cucker-Smale model for flocking, and its local version version advocated in A new model for self-organized dynamics and its flocking behavior (with S. Motsch). 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.
    Standard models for self-organized dynamics assume that the intensity of alignment increases as agents get closer, reflecting a common tendency to align with those who think or act alike. “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.
    What is the qualitative behavior of self-organized dynamics for very large groups (N → ∞)? Agent-based models lend themselves to standard kinetic and hydrodynamics descriptions originated in the 2008 KRM paper From particle to kinetic and hydrodynamic descriptions of flocking (with S.-Y. Ha). The latter govern``social hydrodynamics" and their critical threshold phenomena are studied the 2016 M3AS paper Critical thresholds in 1D Euler equations with nonlocal forces (with J. A. Carrillo, Y.-P. Choi and C. Tan) and the recent series works on Eulerian dynamics with a commutator forcing (with Shvydkoy and He).

    16 Topologically-based fractional diffusion and emergent dynamics with short-range interactions
    R. Shvydkoy & E. Tadmor, SIAM J. Math. Anal. 52(6) (2020) 5792-5839.

    We introduce a new class of models for emergent dynamics. It is based on a new communication protocol which incorporates two main features: short-range kernels which restrict the communication to local geometric balls, and anisotropic communication kernels, adapted to the local density in these balls, which form \emph{topological neighborhoods}. We prove flocking behavior --- the emergence of global alignment for regular, non-vacuous solutions of such models. The (global) regularity and hence unconditional flocking of the one-dimensional model is proved via an application of a De Giorgi-type method. To handle the singular kernels used for geometric and topological communication, we develop a new analysis for \emph{local} fractional elliptic operators, interesting for its own sake, encountered in the construction of our class of models.