FaIMS: a fast algorithm for the inverse medium problem with multiple frequencies and multiple sources for the scalar Helmholtz equation

DOI10.1016/j.jcp.2012.02.006zbMath1250.78023MaRDI QIDQ441933

Stéphanie Chaillat, George Biros

Publication date: 8 August 2012

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2012.02.006

zbMATH Keywords

Lippmann-Schwinger integral equation; inverse acoustic scattering; Born approximation; full-waveform inversion; multiple sources; randomized singular value decomposition; recursive singular value decomposition

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

78A45: Diffraction, scattering

35J05: Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation

68W20: Randomized algorithms

78A46: Inverse problems (including inverse scattering) in optics and electromagnetic theory

45Q05: Inverse problems for integral equations

Related Items

Inverse scattering reconstruction of a three dimensional sound-soft axis-symmetric impenetrable object ^*, A domain decomposition preconditioning for an inverse volume scattering problem, High Resolution Inverse Scattering in Two Dimensions Using Recursive Linearization, On the robustness of inverse scattering for penetrable, homogeneous objects with complicated boundary, Learning physics-based models from data: perspectives from inverse problems and model reduction, A neural network warm-start approach for the inverse acoustic obstacle scattering problem, FaIMS, A model reduction approach for inverse problems with operator valued data, Multifrequency inverse obstacle scattering with unknown impedance boundary conditions using recursive linearization, Computational inverse problems for partial differential equations. Abstracts from the workshop held December 6--12, 2020 (hybrid meeting), Fast Algorithms for Hyperspectral Diffuse Optical Tomography

Uses Software

• LSQR
• CRAIG

Cites Work

• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Tensor Decompositions and Applications
• CUR matrix decompositions for improved data analysis
• A kernel-independent adaptive fast multipole algorithm in two and three dimensions
• A fast algorithm for the inversion of general Toeplitz matrices
• A weighted-GCV method for Lanczos-hybrid regularization
• High-order discretization and multigrid solution of elliptic nonlinear constrained optimal control problems
• Inverse acoustic and electromagnetic scattering theory.
• A multigrid method for distributed parameter estimation problems
• A fast adaptive multipole algorithm in three dimensions
• On the numerical solution of a three-dimensional inverse medium scattering problem
• Preconditioned all-at-once methods for large, sparse parameter estimation problems
• Communication-optimal Parallel and Sequential QR and LU Factorizations
• Randomized algorithms for the low-rank approximation of matrices
• Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian Approximations
• A multilevel algorithm for inverse problems with elliptic PDE constraints
• Fast Directional Multilevel Algorithms for Oscillatory Kernels
• A Framework for the Adaptive Finite Element Solution of Large-Scale Inverse Problems
• On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
• Automatic Preconditioning by Limited Memory Quasi-Newton Updating
• Inverse Problem Theory and Methods for Model Parameter Estimation
• Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
• Sparsity and incoherence in compressive sampling
• Adaptive finite volume method for distributed non-smooth parameter identification