### TBA by Changyou Chen (tentative date)

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, August 24, 2020 - 13:55 for 1 hour (actually 50 minutes)
- Location
- Bluejeans (online)
- Speaker
- Prof. Changyou Chen – University at Buffalo

- You are here:
- GT Home
- Home
- News & Events

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, August 24, 2020 - 13:55 for 1 hour (actually 50 minutes)
- Location
- Bluejeans (online)
- Speaker
- Prof. Changyou Chen – University at Buffalo

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, June 22, 2020 - 13:55 for 1 hour (actually 50 minutes)
- Location
- https://bluejeans.com/963540401
- Speaker
- Dr. Yuan Gao – Duke University – yg86@duke.edu

**Please Note:** virtual (online) seminar

We work on Langevin dynamics with collected dataset that distributed on a manifold M in a high dimensional Euclidean space.
Through the diffusion map, we learn the reaction coordinates for N which is a manifold isometrically embedded into a low dimensional Euclidean space. This enables us to efficiently approximate the dynamics described by a Fokker-Planck equation on the manifold N. Based on this, we propose an implementable, unconditionally stable, data-driven upwind scheme which automatically incorporates the manifold structure of N and enjoys the weighted l^2 convergence to the Fokker-Planck equation. The proposed upwind scheme leads to a Markov chain with transition probability between the nearest neighbor points, which enables us to directly conduct manifold-related computations such as finding the optimal coarse-grained network and the minimal energy path that represents chemical reactions or conformational changes.
To acquire information about the equilibrium potential on manifold N, we apply a Gaussian Process regression algorithm to generate equilibrium potentials for a new physical system with new parameters. Combining with the proposed upwind scheme, we can calculate the trajectory of the Fokker-Planck equation on N based on the generated equilibrium potential. Finally, we develop an algorithm to pullback the trajectory to the original high dimensional space as a generative data for the new physical system. This is a joint work with Nan Wu and Jian-Guo Liu.

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, May 11, 2020 - 13:55 for 1 hour (actually 50 minutes)
- Location
- https://bluejeans.com/614972446/
- Speaker
- Prof. Michael Malisoff – Louisiana State University – malisoff@lsu.edu

**Please Note:** Virtual seminar held on BlueJeans

Adaptive control problems arise in many engineering applications in which one needs to design feedback controllers that ensure tracking of desired reference trajectories while at the same time identify unknown parameters such as control gains. This talk will summarize the speaker's work on adaptive tracking and parameter identification, including an application to curve tracking problems in robotics. The talk will be understandable to those familiar with the basic theory of ordinary differential equations. No prerequisite background in systems and control will be needed to understand and appreciate this talk.

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, April 6, 2020 - 13:55 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Giulio Trigila – CUNY Baruch College – giulio.trigila@baruch.cuny.edu

TBA

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, March 23, 2020 - 13:55 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Michael Malisoff – LSU

Adaptive control problems arise in many engineering applications in which one needs to design feedback controllers that ensure tracking of desired reference trajectories while at the same time identify unknown parameters such as control gains. This talk will summarize the speaker's work on adaptive tracking and parameter identification, including an application to curve tracking problems in robotics. The talk will be understandable to those familiar with the basic theory of ordinary differential equations. No prerequisite background in systems and control will be needed to understand and appreciate this talk.

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, March 9, 2020 - 13:55 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Guillermo Goldsztein – Georgia Tech – ggold@math.gatech.edu

On June 10, 2000, the Millennium Bridge in London opened to the public. As people crossed the bridge, it wobbled. The sway of the bridge was large enough that prompted many on the bridge to hold on to the rails. Three days later, the bridge closed. It reopened only after modifications to prevent the wobbling were made, eighteen months later. We develop and study a model motivated by this event

- Series
- Applied and Computational Mathematics Seminar
- Time
- Wednesday, March 4, 2020 - 13:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Dr. Darshan Bryner – Naval Surface Warfare Center, Panama City Division

**Please Note:** This is a part of IEEE Signal Processing Society Lecture Series, organized by Dr. Alessio Medda (alessiomedda@ieee.org). PLEASE RSVP to https://events.vtools.ieee.org/m/222947

The set of diffeomorphisms of the unit interval, or “warping functions,” plays an important role in many in functional data analysis applications. Most prominently, the problem of registering, or aligning, pairs of functions depends on solving for an element of the diffeomorphism group that, when applied to one function, optimally aligns it to the other.

The registration problem is posed as the unconstrained minimization of a cost function over the infinite dimensional diffeomorphism function space. We make use of its well-known Riemannian geometry to implement an efficient, limited memory Riemannian BFGS optimization scheme. We compare performance and results to the benchmark algorithm, Dynamic Programming, on several functional datasets. Additionally, we apply our methodology to the problem of non-parametric density estimation and compare to the benchmark performance of MATLAB’s built-in kernel density estimator ‘ksdensity’.

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, February 24, 2020 - 13:55 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Dr. Difeng Cai – Emory University, Department of Mathematics

The past few years have seen the advent of big data, which brings unprecedented convenience to our daily life. Meanwhile, from a computational point of view, a central question arises amid the exploding amount of data: how to tame big data in an economic and efficient way. In the context of matrix computations, the question consists in the ability to handle large dense matrices. In this talk, I will first introduce data-sparse hierarchical representations for dense matrices. Then I will present recent development of a new data-driven algorithm called SMASH to operate dense matrices efficiently in the most general setting. The new method not only outperforms existing algorithms but also works in high dimensions. Various experiments will be provided to justify the advantages of the new method.

- Series
- Applied and Computational Mathematics Seminar
- Time
- Friday, February 21, 2020 - 14:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Roland Glowinski – University of Houston, Hong Kong Baptist University – roland@math.uh.edu

The most popular model for Image Denoising is without any doubt the ROF (for Rudin-OsherFatemi) model. However, since the ROF approach has some drawbacks (the stair-case effect being one of them) practitioners have been looking for alternatives. One of them is the Elastica model, relying on the minimization in an appropriate functional space of the energy functional *$J$* defined by

$$ J(v)=\varepsilon \int_{\Omega} \left[ a+b\left| \nabla\cdot \frac{\nabla v}{|\nabla v|}\right|^2 \right]|\nabla v| d\mathbf{x} + \frac{1}{2}\int_{\Omega} |f-v|^2d\mathbf{x} $$

where in *$J(v)$*: (i) $\Omega$ is typically a rectangular region of $R^2$ and $d\mathbf{x}=dx_1dx_2$. (ii) $\varepsilon, a$ and $b$ are positive parameters. (iii) function $f$ represents the image one intends to denoise.

Minimizing functional *$J$* is a non-smooth, non-convex bi-harmonic problem from Calculus of Variations. Its numerical solution is a relatively complicated issue. However, one can achieve this task rather easily by combining operator-splitting and finite element approximations. The main goal of this lecture is to describe such a methodology and to present the results of numerical experiments which validate it.

- Series
- Applied and Computational Mathematics Seminar
- Time
- Monday, February 17, 2020 - 13:50 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Cui, Jianbo – Georgia Tech math – jcui82@gatech.edu

It's know that when discretizing stochastic ordinary equation with non-globally Lipschitz coefficient, the traditional numerical method, like

Euler method, may be divergent and not converge in strong or weak sense. For stochastic partial different equation with non-globally Lipschitz

coefficient, there exists fewer result on the strong and weak convergence results of numerical methods. In this talk, we will discuss several numerical schemes approximating stochastic Schrodinger Equation. Under certain condition, we show that the exponential integrability preserving schemes are strongly and weakly convergent with positive orders.

- Offices & Departments
- News Center
- Campus Calendar
- Special Events
- GreenBuzz
- Institute Communications
- Visitor Resources
- Campus Visits
- Directions to Campus
- Visitor Parking Information
- GTvisitor Wireless Network Information
- Georgia Tech Global Learning Center
- Georgia Tech Hotel & Conference Center
- Barnes & Noble at Georgia Tech
- Ferst Center for the Arts
- Robert C. Williams Paper Museum