Fast Structured Total Least Squares Algorithm for Solving the Basic Deconvolution Problem
Nicola Mastronardi, Philippe Lemmerling, Sabine Van Huffel · SIAM Journal on Matrix Analysis and Applications · 2000
In this paper we develop a fast algorithm for the basic deconvolution problem. First we show that the kernel problem to be solved in the basic deconvolution problem is a so-called structured total least squares problem. Due to the low displacement rank of the involved matrices and the sparsity of the generators, we are able to develop a fast algorithm. We apply the new algorithm on a deconvolution problem arising in a medical application in renography. By means of this example, we show the increased computational performance of our algorithm as compared to other algorithms for solving this type of structured total least squares problem. In addition, Monte-Carlo simulations indicate the superior statistical performance of the structured total least squares estimator compared to other estimators such as the ordinary total least squares estimator.
Cited by 79 works. doi:10.1137/s0895479898345813
Authors
References
- Matrix Computations
- Matrix computations (3rd ed.)
- The Total Least Squares Problem: Computational Aspects and Analysis.
- State-space and singular-value decomposition-based approximation methods for the harmonic retrieval problem
- Displacement ranks of matrices and linear equations
- Maximum likelihood estimation of the parameters of multiple sinusoids from noisy measurements
- The Total Least Squares Problem
- The constrained total least squares technique and its applications to harmonic superresolution
- Displacement Structure: Theory and Applications
- Algorithm for Time-Domain NMR Data Fitting Based on Total Least Squares