Collaborative Research: Randomized algorithms for dynamic and hierarchical Bayesian inverse problems

Information

  • NSF Award
  • 2411197
Owner
  • Award Id
    2411197
  • Award Effective Date
    8/1/2024 - a year ago
  • Award Expiration Date
    7/31/2027 - a year from now
  • Award Amount
    $ 170,000.00
  • Award Instrument
    Standard Grant

Collaborative Research: Randomized algorithms for dynamic and hierarchical Bayesian inverse problems

Inverse problems appear in a diverse array of applications - in medical imaging, for X-ray computerized tomography, ultrasound, and magnetic resonance imaging; in geophysics, for atmospheric tomography, electrical resistivity tomography, seismic tomography, and weather prediction; in material sciences, for X-ray ptychography; in homeland security applications, for luggage scanning; in astrophysics, to image black holes and cosmic background estimation. The main goal of solving inverse problems is to use measurements to estimate the parameters of physical models. Being able to solve inverse problems efficiently, accurately, and with quantifiable certainty remains an open challenge. Randomized algorithms have made several advances in numerical linear algebra due to their ability to dramatically reduce computational costs without significantly compromising the accuracy of the computations. However, there is a rich and relatively unexplored field of research that lies between randomized numerical linear algebra and inverse problems, in particular for dynamic and hierarchical problems, where randomization can and should be exploited in unique ways. This project will address fundamental issues in the development of computationally efficient solvers for inverse problems and uncertainty quantification. The project will also train graduate students on start-of-the-art randomized algorithms. <br/><br/>The project will develop new and efficient randomized algorithms for mitigating the computational burdens of two types of inverse problems: hierarchical Bayesian inverse problems and dynamical inverse problems. The two main thrusts of this project are (i) to develop efficient algorithms to quantify the uncertainty of the hyperparameters that govern Bayesian inverse problems, and (ii) to develop new iterative methods that leverage randomization to efficiently approximate solutions and enable uncertainty quantification for large-scale inverse problems. This project will advance knowledge in the field of randomized algorithms for computational inverse problems and uncertainty quantification. It will also create numerical methods that are expected to be broadly applicable to many areas of science and engineering.<br/><br/>This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

  • Program Officer
    Troy D. Butlertdbutler@nsf.gov7032922084
  • Min Amd Letter Date
    5/30/2024 - a year ago
  • Max Amd Letter Date
    5/30/2024 - a year ago
  • ARRA Amount

Institutions

  • Name
    Emory University
  • City
    ATLANTA
  • State
    GA
  • Country
    United States
  • Address
    201 DOWMAN DR NE
  • Postal Code
    303221061
  • Phone Number
    4047272503

Investigators

  • First Name
    Julianne
  • Last Name
    Chung
  • Email Address
    jmchung@emory.edu
  • Start Date
    5/30/2024 12:00:00 AM

Program Element

  • Text
    COMPUTATIONAL MATHEMATICS
  • Code
    127100

Program Reference

  • Text
    COMPUTATIONAL SCIENCE & ENGING
  • Code
    9263