Past Event: CSEM Student Forum

Asynchronous Marching for Eikonal Equations

Ian Henriksen, Ph.D. Candidate, CSEM, Oden Institute, UT Austin

Abstract

Numerical solutions to the Eikonal equation are computed using variants of the fast marching method, the fast sweeping method, and the fast iterative method. These algorithms differ primarily in the ordering constraints imposed on the intermediate states of the algorithms. In this talk we will discuss why existing Eikonal solvers may produce different results despite using the same update scheme and demonstrate techniques to address these discrepancies. Once these numerical concerns are addressed, it becomes possible to apply modern concurrent priority scheduling techniques to Eikonal solvers and run the problem fully asynchronously. Doing so results in good parallel performance for a problem from seismology.

Biography

Ian Henriksen is a PhD candidate in the Oden Institute working with Keshav Pingali. Prior to coming to UT Austin he worked at Anaconda Inc. as an open source developer. He has bachelor's and master's degrees in mathematics from Brigham Young University and has served as a developer and maintainer for the SciPy, DyND, Galois, and Parla open source projects.