Skip to Main Content

The University of Tennessee

Mathematics Department

Frequently Used Tools:




Seminar & Colloquium Schedule

Seminars and Colloquiums for the week of
November 28, 2005

SPEAKERS:
Dr. Valeriy Berestovskiy, Monday
Dr. Stephen Lucas, Monday
Dr. Valeriy Berestovskiy, Wednesday
Mr. John LaGrange, Wednesday
Dr. Stephen Lucas, Wednesday
Dr. Nikolay Brodskiy, Friday - cancelled



MONDAY, November 28, 2005

GEOMETRY/TOPOLOGY SEMINAR 667

TIME: 12:20 p.m. – 1:20 p.m.
ROOM: 209A Ayres Hall
SPEAKER: Dr. Valeriy Berestovskiy, Visiting Faculty
TITLES: Geodesics in Riemannian manifolds

DIFFERENTIAL EQUATIONS/APPLIED MATH AND COMPUTATIONAL SCIENCE SEMINAR

TIME: 3:35 p.m. – 4:25 p.m.
ROOM: 104 Ayres Hall
SPEAKER: Dr. Stephen Lucas, Visiting Faculty
TITLE: Numerically evaluating oscillating infinite integrals and a failed (of course) approach to the
Riemann Hypothesis
ABSTRACT: There many practical problems that require the evaluation of infinite oscillatory integrals, sometimes where the oscillation is the product of simple oscillatory terms. We show how these integrals can be calculated efficiently, particularly in the case of Bessel function oscillation.

We then outline an alternative way of approaching the Riemann hypothesis which leads to a condition depending on oscillatory integrals. Unfortunately, we show how current integration
techniques are not capable of solving the problem.

No knowledge of numerical integration theory or number theory beyond the undergraduate will be required to follow this presentation.

WEDNESDAY, NOVEMBER 30, 2005

GEOMETRY/TOPOLOGY SEMINAR 667

TIME: 12:20 p.m. – 1:20 p.m.
ROOM: 209A Ayres Hall
SPEAKER: Dr. Valeriy Berestovskiy, Visiting Faculty
TITLE: Normal coordinates in Riemannian manifolds

ALGEBRA SEMINAR

TIME: 3:30 p.m.
ROOM: 214 Ayres Hall
SPEAKER: John LaGrange
TITLE: Kaplansky’s Theorem on Projective Modules II

APPLIED MATH/COMPUTATIONAL SCIENCE SEMINAR

TIME: 3:35 – 4:25 p.m.
ROOM: 102 Ayres Hall
SPEAKER: Dr. Stephen Lucas, Visiting Faculty
TITLE: Extrapolation methods for slowly converging sequences
ABSTRACT: There are many problems where one has a slowly converging sequence whose limit
needs to be found. Extrapolation methods attempt to find this limit using a much shorter piece of the sequence. Richardson’s extrapolation for numerical differentiation is an example of this approach. The aim of this talk is to informally discuss the formulation and use of extrapolation methods, particularly the epsilon algorithm, probably the best general purpose extrapolation algorithm currently available.

FRIDAY, DECEMBER 2, 2005

TOPOLOGY SEMINAR -- CANCELLED

TIME: 12:20p.m. – 1:20 p.m.
ROOM: 209B Ayres Hall
SPEAKER: Dr. Nikolay Brodskiy
TITLE: Coarse Geometry III


Previous Announcements:

Week of:

8_29_05.htm

9_5_05.htm

9_12_05.htm

9_19_05.htm

9_26_05.htm

10_3_05.htm

10_10_05.htm

10_17_05.htm

10_24_05.htm

10_31_05.htm

11_7_05.htm

11_14_05.htm

11_21_05.htm