default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEitan Tadmor
Person information
- affiliation: University of Maryland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Zhiyan Ding, Martin Guerra
, Qin Li, Eitan Tadmor:
Swarm-Based Gradient Descent Meets Simulated Annealing. SIAM J. Numer. Anal. 62(6): 2745-2781 (2024)- [i6]Zhiyan Ding, Martin Guerra, Qin Li, Eitan Tadmor:
Swarm-based gradient descent meets simulated annealing. CoRR abs/2404.18015 (2024) - 2023
- [i5]Jingcheng Lu, Eitan Tadmor:
Revisting high-resolution schemes with van-Albada slope limiter. CoRR abs/2304.00437 (2023) - [i4]Eitan Tadmor, Anil Zenginoglu:
Swarm-Based Optimization with Random Descent. CoRR abs/2307.12441 (2023) - [i3]Eitan Tadmor:
Runge-Kutta methods are stable. CoRR abs/2312.15546 (2023) - 2022
- [j33]Eitan Tadmor, Changhui Tan:
Critical Threshold for Global Regularity of the Euler-Monge-Ampère System with Radial Symmetry. SIAM J. Math. Anal. 54(4): 4277-4296 (2022) - [i2]Jingcheng Lu, Eitan Tadmor, Anil Zenginoglu:
Swarm-Based Gradient Descent Method for Non-Convex Optimization. CoRR abs/2211.17157 (2022) - 2021
- [j32]Roman Shvydkoy, Eitan Tadmor:
Multiflocks: Emergent Dynamics in Systems with Multiscale Collective Behavior. Multiscale Model. Simul. 19(2): 1115-1141 (2021) - 2020
- [j31]Roman Shvydkoy, Eitan Tadmor:
Topologically Based Fractional Diffusion and Emergent Dynamics with Short-Range Interactions. SIAM J. Math. Anal. 52(6): 5792-5839 (2020) - [i1]Eitan Tadmor, Ming Zhong:
Sparse recovery of noisy data using the Lasso method. CoRR abs/2004.04348 (2020)
2010 – 2019
- 2018
- [j30]Alina Chertock, Shumo Cui, Alexander Kurganov, Seyma Nur Ozcan, Eitan Tadmor:
Well-balanced schemes for the Euler equations with gravitation: Conservative formulation using global fluxes. J. Comput. Phys. 358: 36-52 (2018) - 2017
- [j29]Ulrik S. Fjordholm, Roger Käppeli, Siddhartha Mishra, Eitan Tadmor:
Construction of Approximate Entropy Measure-Valued Solutions for Hyperbolic Systems of Conservation Laws. Found. Comput. Math. 17(3): 763-827 (2017) - 2016
- [j28]Ulrik S. Fjordholm, Siddhartha Mishra, Eitan Tadmor:
On the computation of measure-valued solutions. Acta Numer. 25: 567-679 (2016) - 2015
- [j27]Pierre Degond, Gadi Fibich, Benedetto Piccoli, Eitan Tadmor:
Special issue on Modeling and Control in Social Dynamics. Networks Heterog. Media 10(3): i-ii (2015) - [j26]Claude Bardos, Eitan Tadmor:
Stability and spectral convergence of Fourier method for nonlinear problems: on the shortcomings of the \(2/3\) de-aliasing method. Numerische Mathematik 129(4): 749-782 (2015) - 2014
- [j25]Sébastien Motsch, Eitan Tadmor:
Heterophilious Dynamics Enhances Consensus. SIAM Rev. 56(4): 577-621 (2014) - 2013
- [j24]Ulrik S. Fjordholm, Siddhartha Mishra, Eitan Tadmor:
ENO Reconstruction and ENO Interpolation Are Stable. Found. Comput. Math. 13(2): 139-159 (2013) - 2012
- [j23]Ulrik S. Fjordholm, Siddhartha Mishra, Eitan Tadmor:
Arbitrarily High-order Accurate Entropy Stable Essentially Nonoscillatory Schemes for Systems of Conservation Laws. SIAM J. Numer. Anal. 50(2): 544-573 (2012) - [j22]Eitan Tadmor, Knut Waagan:
Adaptive Spectral Viscosity for Hyperbolic Conservation Laws. SIAM J. Sci. Comput. 34(2) (2012) - 2011
- [j21]Ulrik S. Fjordholm, Siddhartha Mishra, Eitan Tadmor:
Well-balanced and energy stable schemes for the shallow water equations with discontinuous topography. J. Comput. Phys. 230(14): 5587-5609 (2011) - [j20]Prashant Athavale, Eitan Tadmor:
Integro-Differential Equations Based on (BV, L1) Image Decomposition. SIAM J. Imaging Sci. 4(1): 300-312 (2011) - [j19]Siddhartha Mishra, Eitan Tadmor:
Constraint Preserving Schemes Using Potential-Based Fluxes. II. Genuinely Multidimensional Systems of Conservation Laws. SIAM J. Numer. Anal. 49(3): 1023-1045 (2011) - 2010
- [c1]Prashant Athavale, Eitan Tadmor:
Novel integro-differential equations in image processing and its applications. Computational Imaging 2010: 75330
2000 – 2009
- 2008
- [j18]Bin Cheng, Eitan Tadmor:
Long-Time Existence of Smooth Solutions for the Rapidly Rotating Shallow-Water and Euler Equations. SIAM J. Math. Anal. 39(5): 1668-1685 (2008) - [j17]Shlomo Engelberg, Eitan Tadmor:
Recovery of Edges from Spectral Data with Noise - A New Perspective. SIAM J. Numer. Anal. 46(5): 2620-2635 (2008) - 2007
- [j16]Yingjie Liu, Chi-Wang Shu, Eitan Tadmor, Mengping Zhang:
Central Discontinuous Galerkin Methods on Overlapping Cells with a Nonoscillatory Hierarchical Reconstruction. SIAM J. Numer. Anal. 45(6): 2442-2467 (2007) - 2006
- [j15]Anne Gelb, Eitan Tadmor:
Adaptive Edge Detectors for Piecewise Smooth Data Based on the minmod Limiter. J. Sci. Comput. 28(2-3): 279-306 (2006) - [j14]Jorge Balbas, Eitan Tadmor:
Nonoscillatory Central Schemes for One- and Two-Dimensional Magnetohydrodynamics Equations. II: High-Order SemiDiscrete Schemes. SIAM J. Sci. Comput. 28(2): 533-560 (2006) - 2004
- [j13]Eitan Tadmor, Suzanne Nezzar, Luminita A. Vese:
A Multiscale Image Representation Using Hierarchical (BV, L2 ) Decompositions. Multiscale Model. Simul. 2(4): 554-579 (2004) - 2003
- [j12]Eitan Tadmor, Hailiang Liu:
Critical Thresholds in 2D Restricted Euler-Poisson Equations. SIAM J. Appl. Math. 63(6): 1889-1910 (2003) - 2002
- [j11]Eitan Tadmor, Jared Tanner:
Adaptive Mollifiers for High Resolution Recovery of Piecewise Smooth Data from its Spectral Information. Found. Comput. Math. 2(2): 155-189 (2002) - 2001
- [j10]Chi-Tien Lin, Eitan Tadmor:
L1-Stability and error estimates for approximate Hamilton-Jacobi solutions. Numerische Mathematik 87(4): 701-735 (2001) - [j9]Hailiang Liu, Eitan Tadmor:
Critical Thresholds in a Convolution Model for Nonlinear Conservation Laws. SIAM J. Math. Anal. 33(4): 930-945 (2001) - [j8]Ben-yu Guo, He-ping Ma, Eitan Tadmor:
Spectral Vanishing Viscosity Method For Nonlinear Conservation Laws. SIAM J. Numer. Anal. 39(4): 1254-1268 (2001) - [j7]Sigal Gottlieb, Chi-Wang Shu, Eitan Tadmor:
Strong Stability-Preserving High-Order Time Discretization Methods. SIAM Rev. 43(1): 89-112 (2001) - 2000
- [j6]Eitan Tadmor, Tao Tang:
Pointwise Error Estimates for Relaxation Approximations to Conservation Laws. SIAM J. Math. Anal. 32(4): 870-886 (2000) - [j5]Anne Gelb, Eitan Tadmor:
Detection of Edges in Spectral Data II. Nonlinear Enhancement. SIAM J. Numer. Anal. 38(4): 1389-1408 (2000) - [j4]Chi-Tien Lin, Eitan Tadmor:
High-Resolution Nonoscillatory Central Schemes for Hamilton-Jacobi Equations. SIAM J. Sci. Comput. 21(6): 2163-2186 (2000)
1990 – 1999
- 1998
- [j3]Doron Levy, Eitan Tadmor:
From Semidiscrete to Fully Discrete: Stability of Runge-Kutta Schemes by The Energy Method. SIAM Rev. 40(1): 40-73 (1998) - [j2]Guang-Shan Jiang, Eitan Tadmor:
Nonoscillatory Central Schemes for Multidimensional Hyperbolic Conservation Laws. SIAM J. Sci. Comput. 19(6): 1892-1917 (1998) - 1990
- [j1]Doron Gill, Eitan Tadmor:
An O(N2 ) Method for Computing the Eigensystem of N ˟ N Symmetric Tridiagonal Matrices by the Divide and Conquer Approach. SIAM J. Sci. Comput. 11(1): 161-173 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
