2000
DOI: 10.1137/s0895479898345813
|View full text |Cite
|
Sign up to set email alerts
|

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

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, 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
65
0

Year Published

2001
2001
2013
2013

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 68 publications
(65 citation statements)
references
References 22 publications
0
65
0
Order By: Relevance
“…Intuitively, it consists in finding the correction terms e and f with minimal Euclidean norm that allow (4) to be fulfilled for some r. An iterative solution to the above deconvolution problem was proposed in [8].…”
Section: Relative Calibrationmentioning
confidence: 99%
See 1 more Smart Citation
“…Intuitively, it consists in finding the correction terms e and f with minimal Euclidean norm that allow (4) to be fulfilled for some r. An iterative solution to the above deconvolution problem was proposed in [8].…”
Section: Relative Calibrationmentioning
confidence: 99%
“…Similarly to the original Structured TLS algorithm [8], no proof of convergence nor optimality of the above algorithm could be established. Simulations presented in the next sections however demonstrate adequate performance.…”
Section: Proposed Iterative Solutionmentioning
confidence: 99%
“…Thus, from the study presented in [5], we selected a less computationally intensive multi-input multi-output (MIMO) calibration method consisting in dividing the MIMO channel into a single channel, then the calibration is finally performed for each subdividing channel, by total leastsquares (TLS) techniques [6,7,8].…”
Section: Introductionmentioning
confidence: 99%
“…An overview of algorithms for STLS computation is given in Lemmerling (1999, Section 4), and numerically efficient algorithms based on the Generalized Schur Algorithm are developed in Mastronardi et al (2000), Lemmerling et al (2000) and Mastronardi (2001).…”
Section: Introductionmentioning
confidence: 99%