Seminars and Colloquiums
for the week of March 6, 2017
Vy Nguyen, UTK, Monday
Ray Bai, University of Georgia, Tuesday
Remus Nicoara, UTK, Wednesday
Professor Guido Kanschat, University of Heidelberg, Germany, Wednesday
Lina Ma, Penn State, Friday
TEA TIME -
3:00 pm – 3:30 pm
Monday & Tuesday Room: Ayres 401
Tuesday & Wednesday; Room: Ayres 4th Floor Common Area
Hosted by: Delong Li & Pawel Grzegrzolka
Monday, March 6th
ORAL SPECIALTY EXAMINATION
SPEAKER: Ms. Vy Nguyen
ROOM: Ayres 114
Her committee consist of Professors: Rosinski (chair), Y-T Chen, X. Chen.
Tuesday, March 7th
STOCHASTIC AND PROBABILITY SEMINAR
TITLE: Resampling under long memory
SPEAKER: Ray Bai (University of Georgia)
TIME: 2:30pm – 3:20pm
ROOM: Ayres 111
For time series with long memory, inference through resampling is of particular importance, since the asymptotic distributions are often difficult to determine statistically. To establish the asymptotic validity of certain resampling procedures, it requires a fine understanding of the dependence between two finite blocks of the time series. We shall introduce some recent progress on this direction.
Wednesday, March 8th
TITLE: Analytic deformations of commuting squares, Part 3
SPEAKER: Dr. Remus Nicoara, UTK
ROOM: Ayres 113
Finite groups, and more generally finite dimensional Hopf C*-algebras, can be encoded in S.Popa’s commuting squares and thus used as construction data for V.Jones’ subfactors. We construct analytic deformations of such commuting squares, and present consequences to the theory of complex Hadamard matrices and the theory of subfactors.
COMPUTATIONAL AND APPLIED MATHEMATICS SEMINAR (CAM)
TITLE: Multilevel Schwarz methods with constraints
SPEAKER: Professor Guido Kanschat, University of Heidelberg, Germany
TIME: 3:35pm – 4:35pm
ROOM: Ayres 113
Schwarz methods provide a basic tool for the efficient solution of partial differential equations on modern computer architectures. In the context of domain decomposition they are used to partition large problems such that cache memory and offloading can be used effectively. In the context of multigrid smoothers for higher order finite element methods they generate the high computational intensity needed to utilize vectorizing multicore processors efficiently. Additionally, they have the capacity of obeying subspace constraints locally, leading to fast convergence for constrained problems. In this talk, we begin by reviewing cell-based nonoverlapping smoothing for elliptic problems. Then, we focus on incompressible flow problems of Stokes-, Darcy-, and Brinkman type. By employing finite elements based on cochain complexes, we prove uniform convergence and we show the efficiency of the methods with numerical results. In the final part we investigate the application of such methods to reaction-diffusion problems arising in neutron diffusion. These are singularly perturbed problems with a dominant, nonsymmetric reaction operator with nontrivial nullspace. We discuss approaches to the analysis and show computational results.
Friday, March 10th
TITLE: Efficient Numerical Methods for Several Challenging Mathematical Models in Multiple Scales
SPEAKER: Lina Ma, Penn State
ROOM: Ayres 405
There are many important problems arising from applied sciences that involves multiple temporal and physical scales. It is extremely important to develop efficient numerical methods that preserve essential physical properties, and provide numerical analysis of such matters. In this talk, we will view three examples in different scales. We will discuss coarse-graining method of stochastic dynamic for biomolecule, electromagnetic scattering problem, and an interface dynamo model for solar activity.
If you are interested in giving or arranging a talk for one of our seminars or colloquiums, please review our calendar.
If you have questions, or a date you would like to confirm, please contact colloquium AT math DOT utk DOT edu