Seminars and Colloquia by Series

Monday, November 28, 2011 - 14:00 , Location: Skiles 006 , Christel Hohenegger , Mathematics, Univ. of Utah , Organizer:
One of the challenges in modeling the transport properties of complex fluids (e.g. many biofluids, polymer solutions, particle suspensions) is describing the interaction between the suspended micro-structure with the fluid itself. Here I will focus on understanding the dynamics of semi-dilute active suspensions, like swimming bacteria or artificial micro-swimmers modeled via a simple kinetic model neglecting chemical gradients and particle collisions. I will then present recent results on the linearized structure of such an active system near a state of uniformity and isotropy and on the onset of the instability as a function of the volume concentration of swimmers, both for a periodic domain. Finally, I will discuss the role of the domain geometry in driving the flow and the large-scale flow instabilities, as well as the appropriate boundary conditions.
Monday, November 14, 2011 - 14:00 , Location: Skiles 006 , Olof Widlund , Courant Institute,New York University, Mathematics and Computer Science , Organizer: Haomin Zhou
The domain decomposition methods considered are preconditioned conjugate gradient methods designed for the very large algebraic systems of equations which often arise in finite element practice. They are designed for massively parallel computer systems and the preconditioners are built from solvers on the substructures into whichthe domain of the given problem is partitioned. In addition, to obtain scalability, there must be a coarse problem, with a small number of degrees of freedom for each substructure. The design of this coarse problem is crucial for obtaining rapidly convergent iterations and poses the most interesting challenge in the analysis.Our work will be illustrated by overlapping Schwarz methods for almost incompressible elasticity approximated by mixed finite element and mixed spectral element methods. These algorithms is now used extensively at the SANDIA, Albuquerque laboratories and were developed in close collaboration with Dr. Clark R. Dohrmann. These results illustrate two roles of the coarse component of the preconditioner.Currently, these algorithms are being actively developed for problems posed in H(curl) and H(div). This work requires the development of new coarse spaces. We will also comment on recent work on extending domain decomposition theory to subdomains with quite irregular boundaries.  This work is relevant because of the use of mesh partitioners in the decomposition of large finite element matrices. 
Monday, November 7, 2011 - 14:00 , Location: Skiles 006 , Jingfang Liu , GT Math , Organizer: Sung Ha Kang
The empirical mode decomposition (EMD) was a method developed by Huang et al as an alternative approach to the traditional Fourier and wavelet techniques for studying signals. It decomposes  signals into finite numbers of components which have well behaved intataneous frequency via Hilbert transform. These components are called intrinstic mode function (IMF).  Recently, alternative algorithms for EMD have been developed, such as iterative filtering method or sparse time-frequency representation by optimization. In this talk we present our recent progress on iterative filtering method. We develop a new local filter based on a partial differential equation (PDE) model as well as a new  approach to compute the instantaneous frequency, which generate similar or  better results than the traditional EMD algorithm.
Monday, October 31, 2011 - 14:00 , Location: Skiles 006 , Jie Shen , Purdue University, Department of Mathematics , Organizer: Haomin Zhou
Many scientific, engineering and financial applications require solving high-dimensional PDEs. However, traditional tensor product based algorithms suffer from the so called "curse of dimensionality".We shall construct a new sparse spectral method for high-dimensional problems, and present, in particular,  rigorous error estimates as well as efficient numerical algorithms for  elliptic equations in both bounded and unbounded domains.As an application, we shall use the proposed sparse spectral method to solve the N-particle electronic  Schrodinger equation.
Monday, October 24, 2011 - 14:00 , Location: Skiles 006 , Jun Lu , GT Math , Organizer: Sung Ha Kang
We propose a new fast algorithm for finding the global shortest path connecting two points while avoiding obstacles in a region by solving an initial value problem of ordinary differential equations (ODE's). The idea is based on the factthat the global shortest path possesses a simple geometric structure. This enables us to restrict the search in a set of feasible paths that share the same structure. The resulting search space is reduced to a finite dimensional set. We use a gradient descent strategy based on the intermittent diffusion (ID) in conjunction with  the level set framework to obtain the global shortest path by solving a randomly perturbed ODE's with initial conditions.Compared to the existing methods, such as the combinatorial methods or partial differential equation(PDE) methods, our algorithm is faster and easier to implement. We can also handle cases in which obstacles shape are arbitrary and/or the dimension of the base space is three or higher.
Monday, October 10, 2011 - 14:00 , Location: Skiles 006 , Bradley Lucier , Purdue University, Department of Mathematics , Organizer: Sung Ha Kang
We consider a variant of Rudin--Osher--Fatemi variational image smoothing that replaces the BV semi-norm in the penalty term with the B^1_\infty(L_1) Besov space semi-norm.  The space B^1_\infty(L_1$ differs from BV  in a number of ways:  It is somewhat larger than BV, so functions inB^1_\infty(L_1) can exhibit more general singularities than exhibited  by functions in BV, and, in contrast to BV, affine functions are assigned no penalty in B^1_\infty(L_1).   We provide a discrete model that uses a result of Ditzian and Ivanov to compute reliably with moduli of smoothness; we also incorporate some ``geometrical'' considerations into this model. We then present a convergent iterative method for solving the discrete variational problem.  The resulting algorithms are multiscale, in that  as the amount of smoothing increases, the results are computed using differences over increasingly large pixel distances.  Some computational results will be presented.  This is joint work with Greg Buzzard, Antonin Chambolle, and Stacey Levine. 
Monday, October 3, 2011 - 14:00 , Location: Skiles 006 , Zhimin Zhang , Wayne State University , Organizer: Yingjie Liu
Finite element approximations for the eigenvalue problem of the Laplace  operator are discussed. A gradient recovery scheme is proposed to enhance  the finite element solutions of the eigenvalues. By reconstructing the  numerical solution and its gradient, it is possible to produce more accurate  numerical eigenvalues. Furthermore, the recovered gradient can be used to  form an a posteriori error estimator to guide an adaptive mesh refinement.  Therefore, this method works not only for structured meshes, but also for  unstructured and adaptive meshes. Additional computational cost for this  post-processing technique is only O(N) (N is the total degrees of freedom),   comparing with O(N^2) cost for the original problem.
Monday, September 26, 2011 - 14:00 , Location: Skiles 006 , Xiaojing Ye , School of Mathematics, Georgia Tech , Organizer: Haomin Zhou
 We will discuss the recent developments of fast image reconstrcution with total variation (TV) regularization whose robustness has been justfied by the theory of compressed sensing. However, the solution of TV based reconstruction encounters two main difficulties on the computational aspect of many applications: the inversion matrix can be large, irregular, and severely ill-conditioned, and the objective is nonsmooth. We introduce two algorithms that tackle the problem using variable splitting and optimized step size selection. The algorithms also provide a general framework for solving large and ill-conditioned linear inversion problem with TV regularization. An important and successful application of TV based image reconstruction in magnetic resonance imaging (MRI) known as paratially parallel imaging (PPI) will be discussed. The numerical results demonstrate significantly improved  efficiency and accuracy over the state-of-the-arts. 
Monday, September 19, 2011 - 14:05 , Location: Skiles 006 , Jeff Geronimo , School of Mathematics, Georgia Tech , Organizer:
Using the technique of intertwining multiresolution analysis piecewise linear, continuous, orthogonal, wavelets on a regular hexagon are constructed. We will review the technique of intertwining multiresolution analysis in the one variable case then indicate the modifications necessary for the two variable construction. This is work with George Donovan and Doug Hardin.
Monday, September 12, 2011 - 14:00 , Location: Skiles 006 , Rick Chartrand , Los Alamos National Laboratory, Theoretical Division , Organizer: Haomin Zhou
 There has been much recent work applying splitting algorithms to  optimization problems designed to produce sparse solutions. In this talk,  we'll look at extensions of these methods to the nonconvex case, motivated  by results in compressive sensing showing that nonconvex optimization can recover signals from many fewer measurements than convex optimization. Our examples of the application of these methods will include image reconstruction from few measurements, and the decomposition of high-dimensional datasets, most notably video, into low-dimensional and sparse components.  

Pages