Fast Structured Total Least Squares Algorithm for Solving the Basic Deconvolution Problem

Authors:
Nicola Mastronardi;Philippe Lemmerling;Sabine Van Huffel
Affiliations:
-;-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2000

Citing 0
Cited 10

On the Stability of the Generalized Schur Algorithm

NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Overview of total least-squares methods

Signal Processing
The matrix-restricted total least-squares problem

Signal Processing
Fast robust regression algorithms for problems with Toeplitz structure

Computational Statistics & Data Analysis
High-performance numerical algorithms and software for structured total least squares

Journal of Computational and Applied Mathematics
Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares

SIAM Journal on Matrix Analysis and Applications
Reciprocity calibration techniques, implementation on the OpenAirInterface platform

Proceedings of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management
Fast deconvolution with approximated PSF by RSTLS with antireflective boundary conditions

Journal of Computational and Applied Mathematics
Review: Recent progress on variable projection methods for structured low-rank approximation

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.