26 04 im alumniV8
22 11 im fatiado face
22 11 im fatiado twitter
22 11 im fatiado youtube
22 11 im fatiado gmail
22 11 im fatiado brazil
22 11 im fatiado england
22 11 im fatiado spain

08 07 IM Noticia ColóquioTítulo: Finding real zeros a lot faster through an adaptive grid

Palestrante: Josué Tonelli Cueto (INRIA)
Data: 09/07/2021
Horário: 09:00h
Local: Transmissão via RNP e Youtube

Confira AQUI a transmissão pelo RNP.

Confira AQUI a transmissão pelo Youtube.

Resumo: An algorithm by Cucker, Krick, Malajovich and Wschebor finds all the real zeros of a dense real polynomial system. This algorithm has three very important properties for a numerical algorithm in algebraic geometry: 1) numerically stable, 2) parallelizable, and 3) good probabilistic run-time. Unfortunately, the algorithm does not have a finite expected run-time, a fact that has been inherited by all algorithms in real numerical algebraic geometry. In this talk, we show how by making this algorithm adaptive, we can obtain finite expected run-time while preserving all the nice features of the original algorithm.