*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Committee Members:
Dr. Luca Dieci, Advisor
Professor, School of Mathematics
Georgia Institute of Technology
Dr. Sung Ha Kang
Associate Professor, School of Mathematics Georgia Institute of Technology
Dr. Michael Muskulus
Professor, Department of Civil and Environmental Engineering Norwegian University of Science and Technology
Dr. Anthony Yezzi
Professor, School of Electrical and Computer Engineering Julian T. Hightower Chair in Engineering, College of Engineering Georgia Institute of Technology
Dr. Hao-Min Zhou
Professor, School of Mathematics
Georgia Institute of Technology
Abstract:
Numerical optimal transport is an important area of research, but most problems are too large and complex for easy computation. Because continuous transport problems are generally solved by conversion to either discrete or semi-discrete forms, I focused on methods for those two.
I developed a discrete algorithm specifically for fast approximation with controlled error bounds: the general auction method. It works directly on real-valued transport problems, with guaranteed termination and \emph{a priori} error bounds.
I also developed the boundary method for semi-discrete transport. It works on unaltered ground cost functions, rapidly identifying locations in the continuous space where transport destinations change. Because the method computes over region boundaries, rather than the entire continuous space, it reduces the effective dimension of the discretization.
The general auction is the first relaxation method designed for compatibility with real-valued costs and weights. The boundary method is the first transport technique designed explicitly around the semi-discrete problem and the first to use the shift characterization to reduce dimensionality. No truly comparable methods exist.
The general auction and boundary method are able to solve many transport problems that are intractible using other approaches. Even where other solution methods exist, my tests indicate that the general auction and boundary method outperform them.
