General
Iterative Truncated SVD for Inverse Scattering Problems
arXiv cs.NA0 views
arXiv:2610.25726v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2610.25726PreviousMixed Unfitted finite element approximation of band structures in photonic crystalsNextConvergence of alternating score-system iterations for regularized Landau particle dynamics
Related posts
The Trump Administration Is Wreaking Havoc on the Electoral System Before the Midterms
0Wired

YouTuber Druski is going to make exclusive content for Netflix
0The Verge
Why are Soviet math textbooks so hardcore in comparison to US textbooks? (2017)
0Hacker News
Technofeudalism
0Hacker News
The Linkerd Story: The people Behind The Service Mesh — A new documentary premieres at KubeCon + CloudNativeCon North America 2026
0CNCF Blog
Londres en otoño: barrios, mercados y museos a tu ritmo
0dev.to Watercooler