http://www.usf.edu

| Prospective Students | Our Students | Visitors | Faculty & Staff | Alumni & Parents | Business & Community | Campuses |

USF Home > College of Arts and Sciences > Department of Mathematics & Statistics

Mathematics and Statistics Website College of Arts and Sciences Home

Approximation Theory
(Leader: Prof. E. B. Saff)

Thursday, April 20, 2000

Title Sampling on a String
Speaker Professor Ahmed I. Zayed
University of Central Florida
Time 4:00-5:00 p.m.
Place CHE 102

Abstract

A connection between the Whitaker-Shannon-Kotel'nikov sampling (interpolation) theorem and Sturm-Liouville boundary-value problems was discovered about 8 years ago. String theory as developed by Kac and Krein is a generalization of the Sturm-Liouville-Titchmarsh theory. In this talk we discuss sampling theorems associated with strings and show how they differ from those associated with the Sturm-Liouville-Titchmarsh theory.

Thursday, April 13, 2000

Title Iterative Methods for Systems of Linear Equations — A Complex Analysis Approach
Speaker Nikos Stylianopoulos
Time 4:00-5:00 p.m.
Place CHE 102

Thursday, March 30, 2000

Our seminar will be held on Friday, March 31, 2000, in conjunction with this week's colloquium.

Thursday, March 24, 2000

Title Gaussian versus optimal integration of analytic functions
Speaker Dr. Mario Goetz
Katholische Univ. Eichstaett
Time 4:00-5:00 p.m.
Place CHE 102

Thursday, March 9, 2000

Title Divergence of Interpolating Polynomials
Speaker Professor Boris Shekhtman
Time 4:00-5:00 p.m.
Place CHE 102

Thursday, March 2, 2000

Title Semidefinite Programming
Speaker Professor Florian Potra
University of Maryland Baltimore County
Time 4:00-5:00 p.m.
Place CHE 102

Abstract

According to a recent survey paper, semidefinite programming (SDP) is “the most exciting development in mathematical programming in the 1990's”. SDP has many applications in robust optimal control, robust structural optimization, statistics, etc. Also SDP relaxation of several NP-hard problems such as Max-Cut or the Quadratic Assignment Problem provide efficient approximation algorithms for those problems. Interior-point methods are the only methods capable of effectively solving general SDP problems. Several research groups are presently carrying out intensive theoretical and experimental investigation of different classes of interior-point methods for SDP. In our talk we give and overview of this field and present some numerical results obtained with the code SDPHA. Also we present some applications of SDP in approximation theory.

Thursday, February 24, 2000

Title On inverse polynomial images of intervals, II
Speaker Professor E. A. Rakhmanov
Time 4:00-5:00 p.m.
Place CHE 102

Thursday, February 17, 2000

Title On inverse polynomial images of intervals
Speaker Professor E. A. Rakhmanov
Time 4:00-5:00 p.m.
Place CHE 102

Thursday, February 10, 2000

Title Entropy considerations for orthogonal polynomials
Speaker Dr. Andrei Martinez-Finkelshtein
Time 4:00-5:00 p.m.
Place CHE 102

Thursday, February 3, 2000

Title Divergence of Hermite-Fejer interpolants
Speaker Dr. Mario Goetz
Katholische Univ Eichstaett
Time 4:00-5:00 p.m.
Place CHE 102

Thursday, January 27, 2000

Title Zero distribution for classical polynomials with non-classical parameters
Speaker Dr. Andrei Martinez-Finkelshtein
Time 4:00-5:00 p.m.
Place CHE 102