Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, January 18, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Tobias Christ

An Introduction to Homogenization Theory

The homogenization theory has been invented to study the behavior of composite materials, i.e. materials that contain two or more finely mixed components. The physical parameters of such a material oscillates very rapidly between the physical parameters of its components, thus numerical calculations become tedious or even impossible. But if the components are mixed finely enough, these materials may look homogeneous from a macroscopic point of view. Now the microscopically heterogeneous material is replaced by homogeneous fictious one, whose global characteristics are a good approximation of the initial ones. Mathematically this means the following: We are considering the solutions of a boundary value problem depending on a small parameter epsilon and try to give the (hopefully easier) boundary value problem that is solved by the limit of the initial solutions as epsilon goes to zero.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login