.png){kind=icon}
.png){kind=icon}
Return
An improved two-step method for inverse singular value problems
.png){kind=icon}
PRE
AI
DOI：10.21136/AM.2026.0096-25.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Based on the technique of T. Ogita and K. Aishima (2020) and J. A. Ezquerro and M. A. Hern & aacute;ndez (2012), we designed an improved two-step method for solving the inverse singular value problems. Compared with other existing two-step methods, the proposed method has comparable computational cost. However, computing the product of matrices is simpler than solving linear equations and has no instability problem caused by ill-conditioning in solving linear equations, and thus it seems more stable and greatly reducing computational costs. Under appropriate assumptions, the proposed method is proved to be convergent with the cubic root-convergence rate. The proposed method is applied to the noise reduction for modal parameters estimation and indicates that it can significantly remove noise from measured signals and accurately estimate the modal frequencies and damping ratios. The numerical results demonstrate the effectiveness of the improved method.
Keywords:
inverse singular value problem
inverse eigenvalue problem
Ulm-Chebyshev-like method
improved two-step method
cubic convergence
Journal
A
IF:
0.7
Papers:
28
Citations:
551