About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
On the stability of transform-based circular deconvolution
Abstract
The solution of a set of linear equations involving a circulant matrix is easily accomplished with an algorithm based on fast Fourier transforms. The numerical stability of this algorithm is studied. It is shown that the algorithm is weakly stable; i.e., if the circulant matrix is well conditioned, then the computed solution is close to the exact solution. On the other hand, it is shown that the algorithm is not strongly stable - the computed solution is not necessarily the solution of a nearby circular deconvolution problem.