March 1, 1972

A theorem on the difficulty of numerical deconvolution

Key Points

Key points are not available for this paper at this time.

Abstract

The difficulty of numerical deconvolution is explained by examining the matrix of the linear equations generated by approximating the linear system superposition integral. It is shown that any row of the matrix is approximately a linear combination of other rows.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Cite this study

B.R. Hunt (Wed,) studied this question.

synapsesocial.com/papers/6a21e13b5f4976168edd8e7e — DOI: https://doi.org/10.1109/tau.1972.1162334

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

A Technique for the Numerical Solution of Certain Integral Equations of the First Kind· 1962 · 2,030 citations
Biased estimation for nonparametric identification of linear systems· 1971 · 68 citations
The inverse problem of radiography· 1970 · 86 citations
The application of numerical filtering to the solution of integral equations encountered in indirect sensing measurements· 1965 · 357 citations
Application of the fast Fourier transform to computation of Fourier integrals, Fourier series, and convolution integrals· 1967 · 203 citations

Authors

B.R. Hunt

United States Department of Commerce

Journals

IEEE Transactions on Audio and Electroacoustics

Actions

Institutions

Los Alamos National Laboratory

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

A theorem on the difficulty of numerical deconvolution

Key Points

Abstract

Citation Network

Connected Papers

Discussion

Cite this study

Also consider

Authors

Journals

Actions

Institutions

References and Citations

Citation Network

Connected Papers

Discussion

Also consider