Seminars and Colloquia by Series

Central-Upwind Schemes for Shallow Water Models

Series
Applied and Computational Mathematics Seminar
Time
Monday, April 15, 2013 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Alexander KurganovTulane University
I will first give a brief review on simple and robust central-upwind schemes for hyperbolic conservation laws. I will then discuss their application to the Saint-Venant system of shallow water equations. This can be done in a straightforward manner, but then the resulting scheme may suffer from the lack of balance between the fluxes and (possibly singular) geometric source term, which may lead to a so-called numerical storm, and from appearance of negative values of the water height, which may destroy the entire computed solution. To circumvent these difficulties, we have developed a special technique, which guarantees that the designed second-order central-upwind scheme is both well-balanced and positivity preserving. Finally, I will show how the scheme can be extended to the two-layer shallow water equations and to the Savage-Hutter type model of submarine landslides and generated tsunami waves, which, in addition to the geometric source term, contain nonconservative interlayer exchange terms. It is well-known that such terms, which arise in many different multiphase models, are extremely sensitive to a particular choice their numerical discretization. To circumvent this difficulty, we rewrite the studied systems in a different way so that the nonconservative terms are multiplied by a quantity, which is, in all practically meaningful cases, very small. We then apply the central-upwind scheme to the rewritten system and demonstrate robustness and superb performance of the proposed method on a number numerical examples.

Sparse numerical linear algebra and interpolation spaces

Series
Applied and Computational Mathematics Seminar
Time
Monday, March 25, 2013 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Mario ArioliRutherford Appleton Laboratory, United Kingdom
We derive discrete norm representations associated with projections of interpolation spaces onto finite dimensional subspaces. These norms are products of integer and non integer powers of the Gramian matrices associated with the generating pair of spaces for the interpolation space. We include a brief description of some of the algorithms which allow the efficient computation of matrix powers. We consider in some detail the case of fractional Sobolev spaces both for positive and negative indices together with applications arising in preconditioning techniques. Several other applications are described.

From Sea Waves off the Venice coast to Traveling Waves in Navier-Stokes Equations

Series
Applied and Computational Mathematics Seminar
Time
Monday, March 11, 2013 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Francesco G. FedeleGeorgia Tech, Civil & Environmental Engineering
I will present some results on the space-time stereo reconstruction of nonlinear sea waves off the Venice coast using a Variational Wave Acquisition Stereo System (VWASS). Energy wave spectra, wave dispersion and nonlinearities are then discussed. The delicate balance of dispersion and nonlinearities may yield the formation of solitons or traveling waves. These are introduced in the context of the Euler equations and the associatedthird order compact Zakharov equation. Traveling waves exist also in the axisymmetric Navier-Stokes equations. Indeed, it will be shown that the NS equations can be reduced to generalized Camassa-Holm equations that support smooth solitons and peakons.

Fokker-Planck Equation Method for Predicting Viral Signal Propagation in Social Networks

Series
Applied and Computational Mathematics Seminar
Time
Monday, March 4, 2013 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Xiaojing YeGeorgia Tech, School of Math
We consider the modeling and computations of random dynamical processes of viral signals propagating over time in social networks. The viral signals of interests can be popular tweets on trendy topics in social media, or computer malware on the Internet, or infectious diseases spreading between human or animal hosts. The viral signal propagations can be modeled as diffusion processes with various dynamical properties on graphs or networks, which are essentially different from the classical diffusions carried out in continuous spaces. We address a critical computational problem in predicting influences of such signal propagations, and develop a discrete Fokker-Planck equation method to solve this problem in an efficient and effective manner. We show that the solution can be integrated to search for the optimal source node set that maximizes the influences in any prescribed time period. This is a joint work with Profs. Shui-Nee Chow (GT-MATH), Hongyuan Zha (GT-CSE), and Haomin Zhou (GT-MATH).

The Mathematics of Dispersion for Optical Metamaterials

Series
Applied and Computational Mathematics Seminar
Time
Monday, February 4, 2013 - 14:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Robert LiptonLSU
Metamaterials are a new form of structured materials used to control electromagnetic waves through localized resonances. In this talk we introduce a rigorous mathematical framework for controlling localized resonances and predicting exotic behavior inside optical metamaterials. The theory is multiscale in nature and provides a rational basis for designing microstructure using multiphase nonmagnetic materials to create backward wave behavior across prescribed frequency ranges.

Coordinate Gradient Descent Method and Incremental Gradient Method for Nonsmooth Optimization

Series
Applied and Computational Mathematics Seminar
Time
Friday, January 25, 2013 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Sangwoon YunSung Kyun Kwan Univ. (Korea)
In this talk, we introduce coordinate gradient descent methods for nonsmooth separable minimization whose objective function is the sum of a smooth function and a convex separable function and for linearly constrained smooth minimization. We also introduce incremental gradient methods for nonsmooth minimization whose objective function is the sum of smooth functions and a convex function.

INVERSE PROBLEMS WITH EXPERIMENTAL DATA

Series
Applied and Computational Mathematics Seminar
Time
Friday, January 18, 2013 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Michael KlibanovUniversity of North Carolina, Charlotte
Coefficient Inverse Problems (CIPs) are the hardest ones to work with in the field of Inverse Problems. Indeed, they are both nonlinear and ill-posed. Conventional numerical methods for CIPs are based on the least squares minimization. Therefore, these methods suffer from the phenomenon of multiple local minima and ravines. This means in turn that those methods are locally convergent ones. In other words, their convergence is guaranteed only of their starting points of iterations are located in small neighborhoods of true solutions. In the past five years we have developed a new numerical method for CIPs for an important hyperbolic Partial Differential Equation, see, e.g. [1,2] and references cited there. This is a globally convergent method. In other words, there is a rigorous guarantee that this method delivers a good approximation for the exact solution without any advanced knowledge of a small neighborhood of this solution. In simple words, a good first guess is not necessary. This method is verified on many examples of computationally simulated data. In addition, it is verified on experimental data. In this talk we will outline this method and present many numerical examples with the focus on experimental data.REFERENCES [1] L. Beilina and M.V. Klibanov, Approximate Global Convergence and Adaptivity for Coefficient Inverse Problems, Springer, New York, 2012. [2] A.V. Kuzhuget, L. Beilina and M.V. Klibanov, A. Sullivan, L. Nguyen and M.A. Fiddy, Blind backscattering experimental data collected in the field and an approximately globally convergent inverse algorithm, Inverse Problems, 28, 095007, 2012.

A Fast Global Optimization-Based Approach to Evolving Contours with Generic Shape Prior

Series
Applied and Computational Mathematics Seminar
Time
Monday, January 14, 2013 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Xue-Cheng TaiUniversity of Bergen, Department of Mathematics, Norway
In this talk, we present a new global optimization based approach to contour evolution, with or without the novel variational shape constraint that imposes a generic star shape using a continuous max-flow framework. In theory, the proposed continuous max-flow model provides a dual perspective to the reduced continuous min-cut formulation of the contour evolution at each discrete time frame, which proves the global optimality of the discrete time contour propagation. The variational analysis of the flow conservation condition of the continuous max-flow model shows that the proposed approach does provide a fully time implicit solver to the contour convection PDE, which allows a large time-step size to significantly speed up the contour evolution. For the contour evolution with a star shape prior, a novel variational representation of the star shape is integrated to the continuous max-flow based scheme by introducing an additional spatial flow. In numerics, the proposed continuous max-flow formulations lead to efficient duality-based algorithms using modern convex optimization theories. Our approach is implemented in a GPU, which significantly improves computing efficiency. We show the high performance of our approach in terms of speed and reliability to both poor initialization and large evolution step-size, using numerous experiments on synthetic, real-world and 2D/3D medical images.This talk is based in a joint work by: J. Yuan, E. Ukwatta, X.C. Tai, A. Fenster, and C. Schnorr.

Multiscale image analysis with applications

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 26, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Prashant AthavaleFields Institute, Dep. of Math, University of Toronto,
Images consist of features of varying scales. Thus, multiscale image processing techniques are extremely valuable, especially for medical images. We will discuss multiscale image processing techniques based onvariational methods, specifically (BV, L^2) and (BV, L^1) decompositions. We will discuss the applications to real time denoising, deblurring and image registration.

Low-dose image reconstruction for 4D Cone Beam CT: sparsity, algorithm, and implementation

Series
Applied and Computational Mathematics Seminar
Time
Monday, November 19, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Hao GaoDep of Math and CS/ Dep of Radiology and Imaging Sciences, Emory University
I will talk about (1) a few sparsity models for 4DCBCT; (2) the split Bregman method as an efficient algorithm for solving L1-type minimization problem; (3) an efficient implementation through fast and highly parallelizable algorithms for computing the x-ray transform and its adjoint.

Pages