|Sep 10, 2015||I'm co-organizer of a NIPS Workshop this December in Montreal, send in your abstracts!|
Most of my research incorporates the development of fast high-order analysis-based algorithms into problems in computational physics, integral equations, singular quadrature, statistics, and in general, computational science. Almost all problems are rooted in engineering and real-world applications. For more information, check out my research page.
Integral equations, computational physics, fast algorithms, and numerical analysis
Almost all partial differential equation occurring in classical mathematical physics can be reformulated as integral equations with an appropriate Green's function. Proper integral formulations are usually very stable, but result in large dense systems which require fast algorithms to solve. Over the last couple decades, the development of analysis-based algorithms such as fast multipole methods, butterfly algorithms, etc. has enabled these systems to be solved rapidly, usually in near-linear time. I have recently been working on particular problems in electromagnetics, acoustics, and magnetohydrodynamics.
The numerical solution of any of these problems via an integral method requires solving problems in mathematical analysis, numerical analysis (e.g. quadrature for singular integrals), geometry (e.g. well-conditioned triangulations and meshes), fast computational algorithms, and other niches of applied mathematics. The resulting codes are often long and complicated but very efficient.
Complementary to solving PDEs or integral equations, algorithms which stably and rapidly compute special functions, invert matrices, apply operators, etc. must be developed. These schemes fall broadly under numerical analysis, and constitute the components that go into necessary software toolboxes for applied mathematics.
Recently it has been observed that many of the fast analysis-based algorithms used throughout engineering physics have direct applications in statistics, machine learning, and data analysis. In particular, methods for rapidly inverting structured dense covariance matrices have immediately found applications in Gaussian processes.
Sunli Tang (NYU)
Please contact me if you are a graduate student interested in computational science and looking for an advisor or a post-doc position.
|2016||An integral equation-based numerical
solver for Taylor states in toroidal
(with A. Cerfon), submitted.
|A new hybrid integral representation for
frequency domain scattering in layered media
(with J. Lai and L. Greengard), to appear Appl. Comput. Harm. Anal.
|Accurate and efficient numerical calculation of stable densities via optimized quadrature and asymptotics (with S. Ament), submitted.||arXiv:1607.04247|
|Robust integral formulations for electromagnetic scattering from three-dimensional cavities (with J. Lai and L. Greengard), submitted.||arXiv:1606.03599|
|Fast algorithms for Quadrature by
Expansion I: Globally valid expansions
(with M. Rachh and A. Klöckner), submitted.
|Smoothed corners and scattered
(with C. L. Epstein), SIAM J. Sci. Comput., 38(5):A2665-A2698, 2016.
|Fast Direct Methods for Gaussian
(with S. Ambikasaran, D. Foreman-Mackey, L. Greengard, and D. W. Hogg),
IEEE Trans. Pattern Anal. Mach. Intell., 38(2):252-265, 2016.
|2015||Debye Sources, Beltrami Fields, and a Complex
Structure on Maxwell Fields
(with C. L. Epstein and L. Greengard), Comm. Pure Appl. Math. 68(12):2237-2280, 2015.
|Fast symmetric factorization of
hierarchical matrices with
(with S. Ambikasaran).
|2014||Exact axisymmetric Taylor states for
(with A. Cerfon), Phys. Plasmas 21, 064501, 2014.
|A generalized Debye source approach to electromagnetic
scattering in layered
J. Math. Phys. 55, 012901, 2014.
|On the efficient representation of the
impedance Green's function for the Helmholtz
(with L. Greengard and A. Pataki), Wave Motion 51(1):1-13, 2014.
|2013||Quadrature by Expansion: A New Method for
the Evaluation of Layer
(with A. Klöckner, A. Barnett, and L. Greengard), J. Comput. Phys. 252:332-349, 2013.
|A fast, high-order solver for the
(with A. Pataki, A. J. Cerfon, J. P. Freidberg, and L. Greengard), J. Comput. Phys. 243:28-45, 2013.
|A consistency condition for the vector potential in
(with C. L. Epstein, Z. Gimbutas, L. Greengard, and A. Klöckner),
IEEE Trans. Magn. 49(3):1072-1076, 2013.
|Debye sources and the numerical solution of the time
harmonic Maxwell equations, II
(with C. L. Epstein and L. Greengard), Comm. Pure Appl. Math. 66(5):753-789, 2013.
|2010||An algorithm for the rapid evaluation of special
(with F. Woolfe and V. Rokhlin), Appl. Comput. Harmon. Anal. 28(2):203-226, 2010.
|2003||Slow passage through resonance in Mathieu's
(with L. Ng and R. Rand), J. Vib. Control 9(6):685-707, 2003.
Elliptic PDEs in singular
geometries are often computaitonally more expensive to
solve than those in nearby regularized geometries. We
have released preliminary Matlab code for
regularizing polygons in 2D and polyhedra in
3D. See Smoothed corners and scattered waves
above for more info.
three-dimensional fast multipole codes developed by
Leslie Greengard and Zydrunas Gimbutas for Laplace,
Helmholtz, elastostatic, and Maxwell potentials can be
downloaded on the CMCL webpage.
The largest computational task encountered when modeling
using Gaussian processes is the inversion of a (dense)
covariance matrix. Often, these matrices have a systematic
structure that can be exploited. george is a Python
interface for a C++ implementation of the HODLR
factorization. An optimized Fortran version is
currently in development.
george - HODLR
Combination linear algebra and ordinary differential equations course.
Introductory numerical analysis intended for undergraduate and graduate students
covering fundamental topics such as floating-point arithmetic, numerical integration,
interpolation, linear algebra, solution of ODEs, etc.
A projects mentoring course for students concentrating on a data science track
within the computational science masters program at the Courant Institute.
Introductory linear algebra.
An introduction to several numerical methods known
as fast analysis-based algorithms, including fast
multiple methods, butterfly algorithms, hierarchical matrix
compression and fast direct solvers.
This is the crowning project course for students enrolled
in the Data Science masters program at NYU through the
Center for Data Science. Working with industry and/or
faculty mentors, students complete and present a thorough
treatment of a real-world data science problem.
This course is a junior/senior level
introduction to the mathematical theory of statistics to be
taken after a similarly focused course on the theory of
probability has been taken.