Computing Reduced Order Models via Inner-Outer Krylov Recycling in Diffuse Optical Tomography
Meghan O'Connell, Misha E. Kilmer, Eric de Sturler, and Serkan, Gugercin

TL;DR
This paper introduces an efficient method for constructing reduced order models in diffuse optical tomography by using inner-outer Krylov recycling, significantly reducing computational costs in solving large-scale PDEs during nonlinear imaging.
Contribution
It presents a novel inner-outer Krylov recycling approach for dynamic global basis approximation, improving efficiency in model order reduction for diffuse optical tomography.
Findings
The new method reduces computational costs in PDE-based inverse problems.
It effectively updates the global basis incrementally during PDE solves.
Demonstrated on two absorption imaging problems, showing improved efficiency.
Abstract
In nonlinear imaging problems whose forward model is described by a partial differential equation (PDE), the main computational bottleneck in solving the inverse problem is the need to solve many large-scale discretized PDEs at each step of the optimization process. In the context of absorption imaging in diffuse optical tomography, one approach to addressing this bottleneck proposed recently (de Sturler, et al, 2015) reformulates the viewing of the forward problem as a differential algebraic system, and then employs model order reduction (MOR). However, the construction of the reduced model requires the solution of several full order problems (i.e. the full discretized PDE for multiple right-hand sides) to generate a candidate global basis. This step is then followed by a rank-revealing factorization of the matrix containing the candidate basis in order to compress the basis to a size…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
