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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Wednesday, May 14, 2014, 12:15 pm

**Duration**: 30 minutes

**Location**: CAB G51

**Speaker**: Hemant Tyagi

Consider an unknown function f: [a,b] -> R and say we are given values f(x_0),...f(x_n) on a mesh: x_0 (= a) < x_1 < ... < x_n ( = b). The interpolation problem involves finding an interpolant Q of f on the mesh such that Q(x_i) = f(x_i) for all points on the mesh. The aim is to find an interpolant that approximates the unknown f well, in the sense that as the maximum distance between any two points on the mesh goes to 0, then the approximation error between Q and f (in the infinity norm) also goes to zero. We will review this problem and analyze a popular class of interpolants namely cubic splines which are piece-wise cubic polynomials and are also smooth.

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

Previous talks by year: 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