Campus Event Calendar: Michael Kerber (05/26/2009 in E1 4/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Reliable Root Approximation

Michael Kerber

Max-Planck-Institut für Informatik - D1

AG1 Mittagsseminar (own work)

AG 1, AG 4, RG1, MMCI, AG 3, AG 5, SWS

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Tuesday, 26 May 2009

13:00

30 Minutes

E1 4

024

Saarbrücken

Abstract

This work addresses the problem of computing a certified $\epsilon$-approximation of all real roots of a integer polynomial with simple roots.A simple refinement method for isolating intervals, called Quadratic Interval Refinement is introduced which has guaranteed correctness and quadratic convergence speed. Then, a root approximation algorithm based on this method is introduced, and its bit complexity is analyzed.

Contact

Michael Kerber

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Michael Kerber, 05/25/2009 16:29 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis