Wednesday, January 18 2017

All day
All times

For most problems perturbation theory (PT) is not currently  computable. This is because PT has a combinatorics explosion problem: the coefficients become increasingly large and difficult to compute as the perturbation order is incresased. In this talk I will present a brand new algorithm to sum divergent perturbation expansions with unprecedented accuracy and ease. Our algorithm transforms the available perturbation coefficients into tables of Meijer-G functions which serve as approximants.