Numerical Analysis Seminar, University of Maryland, College Park
NUMERICAL ANALYSIS SEMINAR
The Numerical Analysis Seminar is held on
Tuesdays at 3:30 pm in the colloquium room of
the Mathematics Department (MTH3206 ) (unless noted
otherwise).

The seminar is sponsored by the Department of Mathematics ,
the Institute
for Physical Science and Technology and
the Institute for Advanced Computer Studies (UMIACS) .

Announcement: DelMar Numerics Day
This is a series of annual meetings which aim to display the research
diversity of computational mathematics in Maryland, Delaware and vicinity.
The

first meeting
will take place

on April 28, 2012 at the University of Delaware, Newark
with an invited talk by Claudio Canuto (Turin, Italy)
Current Talks
January 31:
An analysis of the practical DPG method
Dr. Weifeng (Frederick) Qiu (Institute for Mathematics and its Applications, University of Minnesota)
February 7:
Convergence and quasi optimality of adaptive hybridizable
discontinuous Galerkin methods
Wujun Zhang (School of Mathematics, University of Minnesota, Minneapolis)
February 14:
Finite element approximation of large bending isometries
Prof. Soeren Bartels (Institute for Numerical Simulation, University of Bonn), Germany
February 21:
Recent Advances in Fast Solvers for Variational Inequality Problems Appl. Math. Colloquium
Prof. Michael Hintermuller (Department of Mathematics, Humboldt-Universitat, Berlin, Germany)
February 22:
Semismooth Newton Methods: Theory, Numerics and Applications AZIZ LECTURE (3:15PM)
Prof. Michael Hintermuller (Department of Mathematics, Humboldt-Universitat, Berlin, Germany)
February 28:
FEM Approximation for Diffusion with Measure-Valued Source
Prof. Thomas Seidman (Department of Mathematics and Statistics, University of Maryland Baltimore County)
March 6:
No seminar
March 13:
Divide and Conquer: Using Spectral Methods on Partitioned Images
Prof. Dianne O'Leary (Computer Science Department, University of Maryland), College Park
March 20:
NO SEMINAR - Spring Break
March 30:
Collocation methods for PDEs with random input data Note special date (Friday) and Room (1313)
Prof. Fabio Nobile (EPFL Lausanne), Switzerland
April 10:
Lyapunov Inverse Iteration for Computing a Few Rightmost Eigenvalues of Large Generalized Eigenvalue Problems
Minghao Wu (Applied Mathematics & Statistics and Scientific Computation Program, University of Maryland)
April 17:
Constraint Reduction for Linear and Convex Optimization
Prof. Andre Tits (Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland)
April 24:
Multilevel Preconditioning of Discontinuous-Galerkin Spectral-Element Methods
Prof. Claudio Canuto (Politecnico di Torino)
May 1:
A Mimetic Discretization of Elliptic Obstacle Problems
Dr. Marco Verani (MOX-Department of Mathematics, Politecnico di Milano), Milan, Italy
May 8:
The Variational Approach to Fracture: Implementation, Validation and Verification
Prof. Blaise Bourdin (Department of Mathematics, Louisiana State University)
May 9:
Efficient Solution Algorithms for Partial Differential Equations
with Random Coefficients 3450 AV Williams (NOTE SPECIAL TIME AND PLACE)
Prof. Howard Elman (Computer Science Department, University of Maryland)

Logbook of Previous Talks
Fall 1993 , Spring 1994 ,
Fall 1994 , Spring 1995 ,
Fall 1995 , Spring 1996 ,
Fall 1996 , Spring 1997 ,
Fall 1997 , Spring 1998 ,
Fall 1998 , Spring 1999 ,
Fall 1999 , Spring 2000 ,
Fall 2000 , Spring 2001 ,
Fall 2001 , Spring 2002 ,
Fall 2002 , Spring 2003 ,
Fall 2003 , Spring 2004 ,
Fall 2004 , Spring 2005 ,
Fall 2005 , Spring 2006 ,
Fall 2006 , Spring 2007 ,
Fall 2007 , Spring 2008 ,
Fall 2008 , Spring 2009 ,
Fall 2009 , Spring 2010 ,
Fall 2010 , Spring 2011 ,
Fall 2011
Directions
How to reach the Math Department by car or by Metro or from Airports
Special accomodations for individuals with disabilities can be made by calling
in advance (301) 405-5048. It would be appreciated if we are notified at least
one week in advance.

For further information contact
Ricardo Nochetto at or Howard Elman at .