Iterative Truncated SVD for Inverse Scattering Problems
Abstract
We propose an iterative truncated SVD (iTSVD) algorithm based on a nonlinear least squares formulation for Newton's method for inverse scattering problems. The key idea is to estimate the effective rank of the corresponding linearized operator (or the Jacobian matrix after discretization), which defines the dimension of the signal space of the associated forward operator. Once the effective rank is estimated, truncated SVD (TSVD) reconstruction in the signal space can be computed efficiently based on fast random SVD (RSVD) -- only requiring matrix-vector multiplication which can be implemented in a matrix-free formulation by solving multiple forward and adjoint problems of the same type. Our analysis and numerical experiments show that iTSVD can markedly improve computational efficiency by reducing the number of iterations and enhance stability by physics/information based inversion. Moreover, the effective rank estimate is naturally model- and data-based. Extensive experiments, including far- or near-field, limited aperture, and random measurement data without or with noise, are presented.
Related
- A highly efficient iterative approach for inverse acoustic obstacle scattering problems in three dimensions
- Reconstruction methods for inverse scattering problems with phaseless data
- A higher order family of iterative methods for approximating inverse and generalized inverse matrices
- An Inverse-Selection-Probability Weighted Approach for Real-World Progression-Free Survival With Left-Truncated Clinico-Genomic Data.
- Truncation bands, unitality, and homomorphisms in truncated Riesz spaces: Boulabiar's problems and beyond
BibTeX
@misc{han2026iterative,
title = {{Iterative Truncated SVD for Inverse Scattering Problems}},
author = {Zhinan Han and Ying Liang and Hongkai Zhao},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.25726},
eprint = {2610.25726},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.25726},
}
RIS
TY - UNPB
TI - Iterative Truncated SVD for Inverse Scattering Problems
AU - Zhinan Han
AU - Ying Liang
AU - Hongkai Zhao
PY - 2026
DA - 2026/10/19
PB - arXiv
DO - 10.48550/arxiv.2610.25726
UR - https://arxiv.org/abs/2610.25726
AB - We propose an iterative truncated SVD (iTSVD) algorithm based on a nonlinear least squares formulation for Newton's method for inverse scattering problems. The key idea is to estimate the effective rank of the corresponding linearized operator (or the Jacobian matrix after discretization), which defines the dimension of the signal space of the associated forward operator. Once the effective rank is estimated, truncated SVD (TSVD) reconstruction in the signal space can be computed efficiently based on fast random SVD (RSVD) -- only requiring matrix-vector multiplication which can be implemented in a matrix-free formulation by solving multiple forward and adjoint problems of the same type. Our analysis and numerical experiments show that iTSVD can markedly improve computational efficiency by reducing the number of iterations and enhance stability by physics/information based inversion. Moreover, the effective rank estimate is naturally model- and data-based. Extensive experiments, including far- or near-field, limited aperture, and random measurement data without or with noise, are presented.
ER -